Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
338,000
| 16,799,636
| 3,793
|
A method and apparatus of a UE in a wireless communication system supporting a shared spectrum channel access is provided. The method comprises: receiving, from a BS, a set of higher layer parameters; identifying, from the received set of higher layer parameters, a set of SS/PBCH blocks assumed to be transmitted by the BS; identifying, from the received set of higher layer parameters, a PRACH slot including at least one random access RO; determining the at least one RO as at least one valid RO; and transmitting, to the BS, a PRACH preamble in the at least one valid RO.
|
1. A user equipment (UE) in a wireless communication system, the UE comprising:
at least one transceiver configured to receive, from a base station (BS), a set of higher layer parameters, and at least one processor operably connected to the at least one transceiver, the at least one processor configured to:
identify, from the received set of higher layer parameters, a set of synchronization signal/physical broadcast channel (SS/PBCH) blocks assumed to be transmitted by the BS,
identify, from the received set of higher layer parameters, a physical random access channel (PRACH) slot including at least one random access channel occasion (RO), and
determine the at least one RO as at least one valid RO based on:
the at least one RO not preceding an SS/PBCH block in the PRACH slot,
the at least one RO starting on at least N1 symbols after a last downlink symbol in the PRACH slot, and
the at least one RO starting on at least N2 symbols after a last symbol of the SS/PBCH block in the PRACH slot,
wherein the SS/PBCH block is included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS, and wherein the at least one transceiver is further configured to transmit, to the BS, a PRACH preamble in the at least one valid RO. 2. The UE of claim 1, wherein the identified set of SS/PBCH blocks assumed to be transmitted by the BS is determined as a set of SS/PBCH blocks with a position belonging to a union of SS/PBCH blocks assumed to be transmitted within a transmission window based on a result of channel sensing. 3. The UE of claim 2, wherein the processor is further configured to determine the union of transmitted SS/PBCH blocks based on a shift granularity and a bitmap indicating the transmitted SS/PBCH blocks. 4. The UE of claim 1, wherein a value of the at least N1 symbols is identical to a value of the at least N2 symbols. 5. The UE of claim 1, wherein the at least one processor is further configured to determine an association between the at least one valid RO and at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS. 6. The UE of claim 5, wherein the association between the at least one valid RO and the at least one SS/PBCH block is applied across PRACH configuration periods. 7. The UE of claim 5, wherein:
the association includes a mapping order between the at least one valid RO and the at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and the mapping order is determined first in increasing order of ROs in a frequency domain and second in increasing order of ROs in a time domain. 8. A base station (BS) in a wireless communication system, the BS comprising:
at least one processor configured to:
identify a set of synchronization signal/physical broadcast channel (SS/PBCH) blocks, and
identify a physical random access channel (PRACH) slot including at least one random access channel occasion (RO), wherein the at least one RO is indicated as at least one valid RO based on:
the at least one RO not preceding an SS/PBCH block in the PRACH slot,
the at least one RO starting on at least N1 symbols after a last downlink symbol in the PRACH slot, and
the at least one RO starting on at least N2 symbols after a last symbol of the SS/PBCH block in the PRACH slot; and
at least one transceiver operably connected to the at least one processor, the at least one transceiver configured to:
transmit, to the UE, a set of higher layer parameters including the PRACH slot and the SS/PBCH block; and
receive, from the UE, a PRACH preamble in the at least one valid RO,
wherein the SS/PBCH block is included in the set of SS/PBCH blocks that is assumed, at the UE, to be transmitted by the BS. 9. The BS of claim 8, wherein the identified set of SS/PBCH blocks assumed to be transmitted by the BS is determined as a set of SS/PBCH blocks with a position belonging to a union of SS/PBCH blocks assumed to be transmitted within a transmission window based on a result of channel sensing. 10. The BS of claim 9, wherein the processor is further configured to determine the union of transmitted SS/PBCH blocks based on a shift granularity and a bitmap indicating the transmitted SS/PBCH blocks. 11. The BS of claim 8, wherein a value of the at least N1 symbols is identical to a value of the at least N2 symbols. 12. The BS of claim 8, wherein the at least one processor is further configured to determine an association between the at least one valid RO and at least one SS/PBCH block included in the set of SS/PBCH blocks assumed to be transmitted by the BS. 13. The BS of claim 12, wherein the association between the at least one valid RO and the at least one SS/PBCH block is applied across PRACH configuration periods. 14. The BS of claim 12, wherein:
the association includes a mapping order between the at least one valid RO and the at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and the mapping order is determined first in increasing order of ROs in a frequency domain and second in increasing order of ROs in a time domain. 15. A method of operating a user equipment (UE) in a wireless communication system, the method comprising:
receiving, from a base station (BS), a set of higher layer parameters; identifying, from the received set of higher layer parameters, a set of synchronization signal/physical broadcast channel (SS/PBCH) blocks assumed to be transmitted by the BS; identifying, from the received set of higher layer parameters, a physical random access channel (PRACH) slot including at least one random access channel occasion (RO); determining the at least one RO as at least one valid RO based on:
the at least one RO not preceding an SS/PBCH block in the PRACH slot,
the at least one RO starting on at least N1 symbols after a last downlink symbol in the PRACH slot, and
the at least one RO starting on at least N2 symbols after a last symbol of the SS/PBCH block in the PRACH slot, wherein the SS/PBCH block is included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and
transmitting, to the BS, a PRACH preamble in the at least one valid RO. 16. The method of claim 15, wherein the identified set of SS/PBCH blocks assumed to be transmitted by the BS is determined as a set of SS/PBCH blocks with a position belonging to a union of SS/PBCH blocks assumed to be transmitted within a transmission window based on a result of channel sensing. 17. The method of claim 16, further comprising determining the union of transmitted SS/PBCH blocks based on a shift granularity and a bitmap indicating the transmitted SS/PBCH blocks. 18. The method of claim 15, wherein a value of the at least N1 symbols is identical to a value of the at least N2 symbols. 19. The method of claim 15, further comprising determining an association between the at least one valid RO and at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS, and wherein the association between the at least one valid RO and the at least one SS/PBCH block is applied across PRACH configuration periods. 20. The method of claim 19, wherein:
the association includes a mapping order between the at least one valid RO and the at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and the mapping order is determined first in increasing order of ROs in a frequency domain and second in increasing order of ROs in a time domain.
|
A method and apparatus of a UE in a wireless communication system supporting a shared spectrum channel access is provided. The method comprises: receiving, from a BS, a set of higher layer parameters; identifying, from the received set of higher layer parameters, a set of SS/PBCH blocks assumed to be transmitted by the BS; identifying, from the received set of higher layer parameters, a PRACH slot including at least one random access RO; determining the at least one RO as at least one valid RO; and transmitting, to the BS, a PRACH preamble in the at least one valid RO.1. A user equipment (UE) in a wireless communication system, the UE comprising:
at least one transceiver configured to receive, from a base station (BS), a set of higher layer parameters, and at least one processor operably connected to the at least one transceiver, the at least one processor configured to:
identify, from the received set of higher layer parameters, a set of synchronization signal/physical broadcast channel (SS/PBCH) blocks assumed to be transmitted by the BS,
identify, from the received set of higher layer parameters, a physical random access channel (PRACH) slot including at least one random access channel occasion (RO), and
determine the at least one RO as at least one valid RO based on:
the at least one RO not preceding an SS/PBCH block in the PRACH slot,
the at least one RO starting on at least N1 symbols after a last downlink symbol in the PRACH slot, and
the at least one RO starting on at least N2 symbols after a last symbol of the SS/PBCH block in the PRACH slot,
wherein the SS/PBCH block is included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS, and wherein the at least one transceiver is further configured to transmit, to the BS, a PRACH preamble in the at least one valid RO. 2. The UE of claim 1, wherein the identified set of SS/PBCH blocks assumed to be transmitted by the BS is determined as a set of SS/PBCH blocks with a position belonging to a union of SS/PBCH blocks assumed to be transmitted within a transmission window based on a result of channel sensing. 3. The UE of claim 2, wherein the processor is further configured to determine the union of transmitted SS/PBCH blocks based on a shift granularity and a bitmap indicating the transmitted SS/PBCH blocks. 4. The UE of claim 1, wherein a value of the at least N1 symbols is identical to a value of the at least N2 symbols. 5. The UE of claim 1, wherein the at least one processor is further configured to determine an association between the at least one valid RO and at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS. 6. The UE of claim 5, wherein the association between the at least one valid RO and the at least one SS/PBCH block is applied across PRACH configuration periods. 7. The UE of claim 5, wherein:
the association includes a mapping order between the at least one valid RO and the at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and the mapping order is determined first in increasing order of ROs in a frequency domain and second in increasing order of ROs in a time domain. 8. A base station (BS) in a wireless communication system, the BS comprising:
at least one processor configured to:
identify a set of synchronization signal/physical broadcast channel (SS/PBCH) blocks, and
identify a physical random access channel (PRACH) slot including at least one random access channel occasion (RO), wherein the at least one RO is indicated as at least one valid RO based on:
the at least one RO not preceding an SS/PBCH block in the PRACH slot,
the at least one RO starting on at least N1 symbols after a last downlink symbol in the PRACH slot, and
the at least one RO starting on at least N2 symbols after a last symbol of the SS/PBCH block in the PRACH slot; and
at least one transceiver operably connected to the at least one processor, the at least one transceiver configured to:
transmit, to the UE, a set of higher layer parameters including the PRACH slot and the SS/PBCH block; and
receive, from the UE, a PRACH preamble in the at least one valid RO,
wherein the SS/PBCH block is included in the set of SS/PBCH blocks that is assumed, at the UE, to be transmitted by the BS. 9. The BS of claim 8, wherein the identified set of SS/PBCH blocks assumed to be transmitted by the BS is determined as a set of SS/PBCH blocks with a position belonging to a union of SS/PBCH blocks assumed to be transmitted within a transmission window based on a result of channel sensing. 10. The BS of claim 9, wherein the processor is further configured to determine the union of transmitted SS/PBCH blocks based on a shift granularity and a bitmap indicating the transmitted SS/PBCH blocks. 11. The BS of claim 8, wherein a value of the at least N1 symbols is identical to a value of the at least N2 symbols. 12. The BS of claim 8, wherein the at least one processor is further configured to determine an association between the at least one valid RO and at least one SS/PBCH block included in the set of SS/PBCH blocks assumed to be transmitted by the BS. 13. The BS of claim 12, wherein the association between the at least one valid RO and the at least one SS/PBCH block is applied across PRACH configuration periods. 14. The BS of claim 12, wherein:
the association includes a mapping order between the at least one valid RO and the at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and the mapping order is determined first in increasing order of ROs in a frequency domain and second in increasing order of ROs in a time domain. 15. A method of operating a user equipment (UE) in a wireless communication system, the method comprising:
receiving, from a base station (BS), a set of higher layer parameters; identifying, from the received set of higher layer parameters, a set of synchronization signal/physical broadcast channel (SS/PBCH) blocks assumed to be transmitted by the BS; identifying, from the received set of higher layer parameters, a physical random access channel (PRACH) slot including at least one random access channel occasion (RO); determining the at least one RO as at least one valid RO based on:
the at least one RO not preceding an SS/PBCH block in the PRACH slot,
the at least one RO starting on at least N1 symbols after a last downlink symbol in the PRACH slot, and
the at least one RO starting on at least N2 symbols after a last symbol of the SS/PBCH block in the PRACH slot, wherein the SS/PBCH block is included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and
transmitting, to the BS, a PRACH preamble in the at least one valid RO. 16. The method of claim 15, wherein the identified set of SS/PBCH blocks assumed to be transmitted by the BS is determined as a set of SS/PBCH blocks with a position belonging to a union of SS/PBCH blocks assumed to be transmitted within a transmission window based on a result of channel sensing. 17. The method of claim 16, further comprising determining the union of transmitted SS/PBCH blocks based on a shift granularity and a bitmap indicating the transmitted SS/PBCH blocks. 18. The method of claim 15, wherein a value of the at least N1 symbols is identical to a value of the at least N2 symbols. 19. The method of claim 15, further comprising determining an association between the at least one valid RO and at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS, and wherein the association between the at least one valid RO and the at least one SS/PBCH block is applied across PRACH configuration periods. 20. The method of claim 19, wherein:
the association includes a mapping order between the at least one valid RO and the at least one SS/PBCH block included in the identified set of SS/PBCH blocks assumed to be transmitted by the BS; and the mapping order is determined first in increasing order of ROs in a frequency domain and second in increasing order of ROs in a time domain.
| 3,700
|
338,001
| 16,799,657
| 3,793
|
According to an aspect of an embodiment, operations may include obtaining multiple electronic documents and obtaining a theme text. The method may also include selecting a seed text based on a semantic similarity between the seed text and the theme text. The method may also include changing a seed weight included in a weight vector that is used in identification of topics of the multiple electronic documents. The changed seed weight may bias the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the weight vector. The method may also include generating, a representation of a topic model for display to a user, the topic model may be based on the multiple electronic documents and the weight vector.
|
1. A method comprising:
obtaining a plurality of electronic documents; obtaining a theme text indicative of a theme of interest to a user; determining a semantic similarity between the theme text and each of a plurality of text strings included in a dictionary; selecting a seed text from the plurality of text strings in response to a particular semantic similarity between the seed text and the theme text satisfying a semantic similarity threshold; changing a seed weight included in a weight vector that is used in identification of topics of the plurality of electronic documents, the weight vector including a plurality of weights that each correspond to a different one of the plurality of text strings in which the seed weight corresponds to the seed text, the changing of the seed weight being in response to selection of the seed text and biasing the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the plurality of text strings; and generating a representation of a topic model for display to the user, the topic model based on the plurality of electronic documents and the weight vector, the topic model identifying one or more topics of the plurality of electronic documents. 2. The method of claim 1, wherein each of the plurality of text strings includes a word or a phrase. 3. The method of claim 1, wherein determining the semantic similarity is based on a vector distance between a first word embedding of the theme text and each of a plurality of second word embeddings corresponding to a respective one of the plurality of text strings. 4. The method of claim 1, further comprising generating the topic model comprises using a Bayesian inference technique wherein the weight vector is used as a prior knowledge vector in the Bayesian inference technique. 5. The method of claim 1, further comprising:
displaying to the user the representation of the topic model, wherein the representation of the topic model includes a plurality of topic terms that are each related to a respective topic of one or more of the plurality of electronic documents; obtaining an input from the user indicating a change to a topic term of the plurality of topic terms; based on the input, identifying refined topic terms reflecting the change to the topic term; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the identification of the refined topic terms and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined topic terms; and generating, as a refined topic model, a refined representation of the topic model for display to the user, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 6. The method of claim 1, wherein the topic model includes a topic term, the topic term related to a topic of one or more electronic documents of the plurality of electronic documents, the method further comprising:
determining a semantic similarity between the topic term and a refined seed text; selecting the refined seed text in response to the semantic similarity between the topic term and the refined seed text satisfying a refined semantic similarity threshold; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the selection of the refined seed text and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined seed text; and wherein the generation of the representation of the topic model comprises refining the topic model to generate a refined topic model, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 7. The method of claim 1, wherein the topic model includes a plurality of topic terms, the plurality of topic terms related to a particular topic of one or more electronic documents of the plurality of electronic documents, the method further comprising:
obtaining a topic inconsistency of a particular topic term of the plurality of topic terms based on a semantic similarity between the particular topic term and the seed text; based on the topic inconsistency satisfying an inconsistency threshold, identifying a refined plurality of topics terms related to the particular topic, the refined plurality of topic terms excluding the particular topic term; based on the refined plurality of topic terms, changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined plurality of topic terms; and wherein the generation of the representation of the topic model comprises refining the topic model to generate a refined topic model, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 8. The method of claim 7, further comprising:
in response to the identification of the refined plurality of topic terms excluding the particular topic term, generating a new topic of the electronic documents, the new topic related to the particular topic term; in response to the generation of the new topic, generating a new refined weight vector that is used in identification of the refined topics of the plurality of electronic documents, the new refined weight vector biasing identification of the refined topics of the plurality of electronic documents in favor of the particular topic term; and wherein the refined topic model is further based on the new refined weight vector. 9. The method of claim 7, wherein obtaining the topic inconsistency comprises:
obtaining a topic centroid of the particular topic, the topic centroid based on a word embedding of the seed text; and obtaining a vector distance between a word embedding of the particular topic term and the topic centroid. 10. The method of claim 1, wherein the topic model includes a plurality of topic terms, the plurality of topic terms related to a particular topic of one or more electronic documents of the plurality of electronic documents, and wherein the generation of the representation of the topic model further comprises:
identifying a plurality of sentences from the one or more electronic documents, each of the plurality of sentences including one or more of the plurality of topic terms; obtaining a plurality of sentence embeddings of the plurality of sentences; obtaining a topic centroid of the topic, the topic centroid based on a plurality of word embeddings of the seed text; determining a sentence semantic similarity between the topic centroid and each of the plurality of sentence embeddings; selecting a sentence from the plurality of sentences in response to a particular sentence semantic similarity between the topic centroid and a sentence embedding of the sentence satisfying a sentence semantic similarity threshold; and including in the representation of the topic model the sentence in response to the selection of the sentence. 11. The method of claim 10, further comprising:
obtaining a second topic centroid of a second topic of one or more other electronic documents of the plurality of electronic documents; and determining a semantic distinction between the second topic centroid and the sentence embedding of the sentence; and wherein the selection of the sentence is further in based on the semantic distinction satisfying the sentence semantic similarity threshold. 12. The method of claim 1, wherein the representation of the topic model includes a representation of how many electronic documents of the plurality of electronic documents relate to the theme of interest. 13. The method of claim 12, the method further comprising obtaining a plurality of theme texts indicative of a plurality of themes of interest to the user wherein the representation of the topic model includes a representation of how many electronic documents of the plurality of electronic documents relate to each of the plurality of themes. 14. The method of claim 12, wherein the representation of the topic model includes a visual representation of a proportion of the plurality of electronic documents that relate to the theme of interest. 15. At least one non-transitory computer-readable media configured to store one or more instructions that when executed by at least one processor cause or direct a system to perform operations, the operations comprising:
obtaining a plurality of electronic documents; obtaining theme text indicative of a theme of interest to a user; determining a semantic similarity between the theme text and each of a plurality of text strings included in a weight vector that is used in identification of topics of the plurality of electronic documents, the weight vector including a plurality of weights that each correspond to a different one of the plurality of text strings; selecting a seed text from the plurality of text strings in response to a particular semantic similarity between the seed text and the theme text satisfying a semantic similarity threshold; changing a seed weight included in the weight vector electronic document in which the seed weight corresponds to the seed text, the changing of the seed weight being in response to selection of the seed text and biasing the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the plurality of text strings; generating a representation of a topic model for display to the user, the topic model based on the plurality of electronic documents and the weight vector, the topic model identifying one or more topics of the plurality of electronic documents. 16. The at least one non-transitory computer-readable media of claim 15, wherein the operations further comprise:
displaying to the user the representation of the topic model, wherein the representation of the topic model includes a plurality of topic terms that are each related to a respective topic of one or more of the plurality of electronic documents; obtaining an input from the user indicating a change to a topic term of the plurality of topic terms; based on the input, identifying refined topic terms reflecting the change to the topic term; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the identification of the refined topic terms and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined topic terms; generating, as a refined topic model, a refined representation of the topic model for display to the user, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 17. The at least one non-transitory computer-readable media of claim 15, wherein the topic model includes a topic term, the topic term related to a topic of one or more electronic documents of the plurality of electronic documents and wherein the operations further comprise:
determining a semantic similarity between the topic term and a refined seed text; selecting the refined seed text in response to the semantic similarity between the topic term and the refined seed text satisfying a refined semantic similarity threshold; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the selection of the refined seed text and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined seed text; and generating, with the machine-learning technique, a refined topic model with respect to the plurality of electronic documents based on the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents; and wherein the generation of the representation comprises the generating of the refined topic model. 18. A system including one or more processors and one or more computer-readable media, the system configured to perform operations comprising:
obtaining a plurality of electronic documents; obtaining theme text indicative of a theme of interest to a user; determining a semantic similarity between the theme text and each of a plurality of text strings; selecting a seed text from the plurality of text strings in response to a particular semantic similarity between the seed text and the theme text satisfying a semantic similarity threshold; changing a seed weight included in a weight vector that is used in identification of topics of the plurality of electronic documents, the weight vector including a plurality of weights that each correspond to a different one of the plurality of text strings in which the seed weight corresponds to the seed text, the changing of the seed weight being in response to selection of the seed text and biasing the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the plurality of text strings; generating a representation of a topic model for display to the user, the topic model based on the plurality of electronic documents and the weight vector, the topic model identifying one or more topics of the plurality of electronic documents. 19. The system of claim 18, wherein the operations further comprise:
displaying to the user the representation of the topic model, wherein the representation of the topic model includes a plurality of topic terms that are each related to a respective topic of one or more of the plurality of electronic documents; obtaining an input from the user indicating a change to a topic term of the plurality of topic terms; based on the input, identifying refined topic terms reflecting the change to the topic term; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the identification of the refined topic terms and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined topic terms; generating, as a refined topic model, a refined representation of the topic model for display to the user, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 20. The system of claim 18, wherein the topic model includes a topic term, the topic term related to a topic of one or more electronic documents of the plurality of electronic documents and wherein the operations further comprise:
determining a semantic similarity between the topic term and a refined seed text; selecting the refined seed text in response to the semantic similarity between the topic term and the refined seed text satisfying a refined semantic similarity threshold; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the selection of the refined seed text and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined seed text; and generating, with the machine-learning technique, a refined topic model with respect to the plurality of electronic documents based on the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents; and wherein the generation of the representation comprises the generating of the refined topic model.
|
According to an aspect of an embodiment, operations may include obtaining multiple electronic documents and obtaining a theme text. The method may also include selecting a seed text based on a semantic similarity between the seed text and the theme text. The method may also include changing a seed weight included in a weight vector that is used in identification of topics of the multiple electronic documents. The changed seed weight may bias the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the weight vector. The method may also include generating, a representation of a topic model for display to a user, the topic model may be based on the multiple electronic documents and the weight vector.1. A method comprising:
obtaining a plurality of electronic documents; obtaining a theme text indicative of a theme of interest to a user; determining a semantic similarity between the theme text and each of a plurality of text strings included in a dictionary; selecting a seed text from the plurality of text strings in response to a particular semantic similarity between the seed text and the theme text satisfying a semantic similarity threshold; changing a seed weight included in a weight vector that is used in identification of topics of the plurality of electronic documents, the weight vector including a plurality of weights that each correspond to a different one of the plurality of text strings in which the seed weight corresponds to the seed text, the changing of the seed weight being in response to selection of the seed text and biasing the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the plurality of text strings; and generating a representation of a topic model for display to the user, the topic model based on the plurality of electronic documents and the weight vector, the topic model identifying one or more topics of the plurality of electronic documents. 2. The method of claim 1, wherein each of the plurality of text strings includes a word or a phrase. 3. The method of claim 1, wherein determining the semantic similarity is based on a vector distance between a first word embedding of the theme text and each of a plurality of second word embeddings corresponding to a respective one of the plurality of text strings. 4. The method of claim 1, further comprising generating the topic model comprises using a Bayesian inference technique wherein the weight vector is used as a prior knowledge vector in the Bayesian inference technique. 5. The method of claim 1, further comprising:
displaying to the user the representation of the topic model, wherein the representation of the topic model includes a plurality of topic terms that are each related to a respective topic of one or more of the plurality of electronic documents; obtaining an input from the user indicating a change to a topic term of the plurality of topic terms; based on the input, identifying refined topic terms reflecting the change to the topic term; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the identification of the refined topic terms and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined topic terms; and generating, as a refined topic model, a refined representation of the topic model for display to the user, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 6. The method of claim 1, wherein the topic model includes a topic term, the topic term related to a topic of one or more electronic documents of the plurality of electronic documents, the method further comprising:
determining a semantic similarity between the topic term and a refined seed text; selecting the refined seed text in response to the semantic similarity between the topic term and the refined seed text satisfying a refined semantic similarity threshold; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the selection of the refined seed text and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined seed text; and wherein the generation of the representation of the topic model comprises refining the topic model to generate a refined topic model, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 7. The method of claim 1, wherein the topic model includes a plurality of topic terms, the plurality of topic terms related to a particular topic of one or more electronic documents of the plurality of electronic documents, the method further comprising:
obtaining a topic inconsistency of a particular topic term of the plurality of topic terms based on a semantic similarity between the particular topic term and the seed text; based on the topic inconsistency satisfying an inconsistency threshold, identifying a refined plurality of topics terms related to the particular topic, the refined plurality of topic terms excluding the particular topic term; based on the refined plurality of topic terms, changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined plurality of topic terms; and wherein the generation of the representation of the topic model comprises refining the topic model to generate a refined topic model, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 8. The method of claim 7, further comprising:
in response to the identification of the refined plurality of topic terms excluding the particular topic term, generating a new topic of the electronic documents, the new topic related to the particular topic term; in response to the generation of the new topic, generating a new refined weight vector that is used in identification of the refined topics of the plurality of electronic documents, the new refined weight vector biasing identification of the refined topics of the plurality of electronic documents in favor of the particular topic term; and wherein the refined topic model is further based on the new refined weight vector. 9. The method of claim 7, wherein obtaining the topic inconsistency comprises:
obtaining a topic centroid of the particular topic, the topic centroid based on a word embedding of the seed text; and obtaining a vector distance between a word embedding of the particular topic term and the topic centroid. 10. The method of claim 1, wherein the topic model includes a plurality of topic terms, the plurality of topic terms related to a particular topic of one or more electronic documents of the plurality of electronic documents, and wherein the generation of the representation of the topic model further comprises:
identifying a plurality of sentences from the one or more electronic documents, each of the plurality of sentences including one or more of the plurality of topic terms; obtaining a plurality of sentence embeddings of the plurality of sentences; obtaining a topic centroid of the topic, the topic centroid based on a plurality of word embeddings of the seed text; determining a sentence semantic similarity between the topic centroid and each of the plurality of sentence embeddings; selecting a sentence from the plurality of sentences in response to a particular sentence semantic similarity between the topic centroid and a sentence embedding of the sentence satisfying a sentence semantic similarity threshold; and including in the representation of the topic model the sentence in response to the selection of the sentence. 11. The method of claim 10, further comprising:
obtaining a second topic centroid of a second topic of one or more other electronic documents of the plurality of electronic documents; and determining a semantic distinction between the second topic centroid and the sentence embedding of the sentence; and wherein the selection of the sentence is further in based on the semantic distinction satisfying the sentence semantic similarity threshold. 12. The method of claim 1, wherein the representation of the topic model includes a representation of how many electronic documents of the plurality of electronic documents relate to the theme of interest. 13. The method of claim 12, the method further comprising obtaining a plurality of theme texts indicative of a plurality of themes of interest to the user wherein the representation of the topic model includes a representation of how many electronic documents of the plurality of electronic documents relate to each of the plurality of themes. 14. The method of claim 12, wherein the representation of the topic model includes a visual representation of a proportion of the plurality of electronic documents that relate to the theme of interest. 15. At least one non-transitory computer-readable media configured to store one or more instructions that when executed by at least one processor cause or direct a system to perform operations, the operations comprising:
obtaining a plurality of electronic documents; obtaining theme text indicative of a theme of interest to a user; determining a semantic similarity between the theme text and each of a plurality of text strings included in a weight vector that is used in identification of topics of the plurality of electronic documents, the weight vector including a plurality of weights that each correspond to a different one of the plurality of text strings; selecting a seed text from the plurality of text strings in response to a particular semantic similarity between the seed text and the theme text satisfying a semantic similarity threshold; changing a seed weight included in the weight vector electronic document in which the seed weight corresponds to the seed text, the changing of the seed weight being in response to selection of the seed text and biasing the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the plurality of text strings; generating a representation of a topic model for display to the user, the topic model based on the plurality of electronic documents and the weight vector, the topic model identifying one or more topics of the plurality of electronic documents. 16. The at least one non-transitory computer-readable media of claim 15, wherein the operations further comprise:
displaying to the user the representation of the topic model, wherein the representation of the topic model includes a plurality of topic terms that are each related to a respective topic of one or more of the plurality of electronic documents; obtaining an input from the user indicating a change to a topic term of the plurality of topic terms; based on the input, identifying refined topic terms reflecting the change to the topic term; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the identification of the refined topic terms and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined topic terms; generating, as a refined topic model, a refined representation of the topic model for display to the user, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 17. The at least one non-transitory computer-readable media of claim 15, wherein the topic model includes a topic term, the topic term related to a topic of one or more electronic documents of the plurality of electronic documents and wherein the operations further comprise:
determining a semantic similarity between the topic term and a refined seed text; selecting the refined seed text in response to the semantic similarity between the topic term and the refined seed text satisfying a refined semantic similarity threshold; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the selection of the refined seed text and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined seed text; and generating, with the machine-learning technique, a refined topic model with respect to the plurality of electronic documents based on the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents; and wherein the generation of the representation comprises the generating of the refined topic model. 18. A system including one or more processors and one or more computer-readable media, the system configured to perform operations comprising:
obtaining a plurality of electronic documents; obtaining theme text indicative of a theme of interest to a user; determining a semantic similarity between the theme text and each of a plurality of text strings; selecting a seed text from the plurality of text strings in response to a particular semantic similarity between the seed text and the theme text satisfying a semantic similarity threshold; changing a seed weight included in a weight vector that is used in identification of topics of the plurality of electronic documents, the weight vector including a plurality of weights that each correspond to a different one of the plurality of text strings in which the seed weight corresponds to the seed text, the changing of the seed weight being in response to selection of the seed text and biasing the identification of topics of the plurality of electronic documents in favor of the seed text as compared to one or more other text strings of the plurality of text strings; generating a representation of a topic model for display to the user, the topic model based on the plurality of electronic documents and the weight vector, the topic model identifying one or more topics of the plurality of electronic documents. 19. The system of claim 18, wherein the operations further comprise:
displaying to the user the representation of the topic model, wherein the representation of the topic model includes a plurality of topic terms that are each related to a respective topic of one or more of the plurality of electronic documents; obtaining an input from the user indicating a change to a topic term of the plurality of topic terms; based on the input, identifying refined topic terms reflecting the change to the topic term; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the identification of the refined topic terms and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined topic terms; generating, as a refined topic model, a refined representation of the topic model for display to the user, the refined topic model based on the plurality of electronic documents and the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents. 20. The system of claim 18, wherein the topic model includes a topic term, the topic term related to a topic of one or more electronic documents of the plurality of electronic documents and wherein the operations further comprise:
determining a semantic similarity between the topic term and a refined seed text; selecting the refined seed text in response to the semantic similarity between the topic term and the refined seed text satisfying a refined semantic similarity threshold; changing a refining weight included in a refined weight vector that is used in identification of refined topics of the plurality of electronic documents, the changing the refining weight being in response to the selection of the refined seed text and biasing the identification of the refined topics of the plurality of electronic documents in favor of the refined seed text; and generating, with the machine-learning technique, a refined topic model with respect to the plurality of electronic documents based on the refined weight vector, the refined topic model identifying the refined topics of the plurality of electronic documents; and wherein the generation of the representation comprises the generating of the refined topic model.
| 3,700
|
338,002
| 16,799,633
| 3,793
|
Methods, systems, and devices for multi-option swipe gesture selection are described. The method includes displaying a user interface element on a screen of a device, sensing a swipe gesture on the screen that is associated with the user interface element, displaying a first option when a distance of the swipe gesture is determined to be within a first span, displaying a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span, sensing a selection gesture while displaying the first option or the second option, and executing either a first process based on sensing the selection gesture while displaying the first option or a second process based on sensing the selection gesture while displaying the second option.
|
1. A method for interacting with a user interface element at a device, comprising:
displaying the user interface element on a screen of the device; sensing a swipe gesture on the screen that is associated with the user interface element; displaying a first option when a distance of the swipe gesture is determined to be within a first span; providing a first feedback to indicate the first option is being displayed and is selected for execution, wherein the first feedback comprises at least a first haptic feedback and a first graphical feedback; displaying a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span; providing a second feedback to indicate the second option is being displayed and is selected for execution, wherein the second feedback comprises at least a second haptic feedback different from the first haptic feedback and a second graphical feedback different from the first graphical feedback; sensing a selection gesture while displaying the first option or the second option; and executing either a first process based at least in part on sensing the selection gesture while displaying the first option or a second process based at least in part on sensing the selection gesture while displaying the second option. 2. (canceled) 3. The method of claim 2, wherein the first feedback comprises an audio feedback, and wherein the second feedback comprises a second audio feedback. 4. The method of claim 1, wherein the selection gesture comprises at least one of a release of the swipe gesture, or a second swipe gesture in a direction different than a direction of the swipe gesture, or sensing an increase in pressure applied to the screen, or any combination thereof. 5. The method of claim 4, wherein the release of the swipe gesture comprises a lifting of a finger from the screen, a releasing of a mouse button, or a second swipe gesture by a hand in the air in an augmented reality associated with the screen. 6. The method of claim 1, wherein the user interface element comprises at least one of a calendar reminder notification, or a link to open a calendar reminder, or an email notification, or a link to open an email, or a message notification, or a link to open a message, or a travel notification, or a paging notification, or a location notification, or a mapping route notification, or a link to open a mobile application, or any combination thereof. 7. The method of claim 1, wherein the first span comprises a distance from a first point on the screen to a second point on the screen, and wherein the second span comprises a distance from the first point on the screen to a third point on the screen. 8. The method of claim 1, wherein the device comprises a mobile computing device, a personal computing device, a wearable computing device, a screen projector, or a virtual reality headset. 9. An apparatus for interacting with a user interface element at a device, comprising:
a processor, memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
display the user interface element on a screen of the device;
sense a swipe gesture on the screen that is associated with the user interface element;
display a first option when a distance of the swipe gesture is determined to be within a first span;
provide a first feedback to indicate the first option is being displayed and is selected for execution, wherein the first feedback comprises at least a first haptic feedback and a first graphical feedback;
display a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span;
provide a second feedback to indicate the second option is being displayed and is selected for execution, wherein the second feedback comprises at least a second haptic feedback different from the first haptic feedback and a second graphical feedback different from the first graphical feedback;
sense a selection gesture while displaying the first option or the second option; and
execute either a first process based at least in part on sensing the selection gesture while displaying the first option or a second process based at least in part on sensing the selection gesture while displaying the second option. 10. (canceled) 11. The apparatus of claim 10, wherein the first feedback comprises an audio feedback, and wherein the second feedback comprises a second audio feedback. 12. The apparatus of claim 9, wherein the selection gesture comprises at least one of a release of the swipe gesture, or a second swipe gesture in a direction different than a direction of the swipe gesture, or sensing an increase in pressure applied to the screen, or any combination thereof. 13. The apparatus of claim 12, wherein the release of the swipe gesture comprises a lifting of a finger from the screen, a releasing of a mouse button, or a second swipe gesture by a hand in the air in an augmented reality associated with the screen. 14. The apparatus of claim 9, wherein the user interface element comprises at least one of a calendar reminder notification, or a link to open a calendar reminder, or an email notification, or a link to open an email, or a message notification, or a link to open a message, or a travel notification, or a paging notification, or a location notification, or a mapping route notification, or a link to open a mobile application, or any combination thereof. 15. The apparatus of claim 9, wherein the first span comprises a distance from a first point on the screen to a second point on the screen, and wherein the second span comprises a distance from the first point on the screen to a third point on the screen. 16. The apparatus of claim 9, wherein the device comprises a mobile computing device, a personal computing device, a wearable computing device, a screen projector, or a virtual reality headset. 17. A non-transitory computer-readable medium storing code for interacting with a user interface element at a device, the code comprising instructions executable by a processor to:
display the user interface element on a screen of the device; sense a swipe gesture on the screen that is associated with the user interface element; display a first option when a distance of the swipe gesture is determined to be within a first span; provide a first feedback to indicate the first option is being displayed and is selected for execution, wherein the first feedback comprises at least a first haptic feedback and a first graphical feedback; display a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span; provide a second feedback to indicate the second option is being displayed and is selected for execution, wherein the second feedback comprises at least a second haptic feedback different from the first haptic feedback and a second graphical feedback different from the first graphical feedback; sense a selection gesture while displaying the first option or the second option; and execute either a first process based at least in part on sensing the selection gesture while displaying the first option or a second process based at least in part on sensing the selection gesture while displaying the second option. 18. (canceled) 19. The non-transitory computer-readable medium of claim 18, wherein the first feedback comprises an audio feedback, and wherein the second feedback comprises a second audio feedback. 20. The non-transitory computer-readable medium of claim 17, wherein the selection gesture comprises at least one of a release of the swipe gesture, or a second swipe gesture in a direction different than a direction of the swipe gesture, or sensing an increase in pressure applied to the screen, or any combination thereof.
|
Methods, systems, and devices for multi-option swipe gesture selection are described. The method includes displaying a user interface element on a screen of a device, sensing a swipe gesture on the screen that is associated with the user interface element, displaying a first option when a distance of the swipe gesture is determined to be within a first span, displaying a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span, sensing a selection gesture while displaying the first option or the second option, and executing either a first process based on sensing the selection gesture while displaying the first option or a second process based on sensing the selection gesture while displaying the second option.1. A method for interacting with a user interface element at a device, comprising:
displaying the user interface element on a screen of the device; sensing a swipe gesture on the screen that is associated with the user interface element; displaying a first option when a distance of the swipe gesture is determined to be within a first span; providing a first feedback to indicate the first option is being displayed and is selected for execution, wherein the first feedback comprises at least a first haptic feedback and a first graphical feedback; displaying a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span; providing a second feedback to indicate the second option is being displayed and is selected for execution, wherein the second feedback comprises at least a second haptic feedback different from the first haptic feedback and a second graphical feedback different from the first graphical feedback; sensing a selection gesture while displaying the first option or the second option; and executing either a first process based at least in part on sensing the selection gesture while displaying the first option or a second process based at least in part on sensing the selection gesture while displaying the second option. 2. (canceled) 3. The method of claim 2, wherein the first feedback comprises an audio feedback, and wherein the second feedback comprises a second audio feedback. 4. The method of claim 1, wherein the selection gesture comprises at least one of a release of the swipe gesture, or a second swipe gesture in a direction different than a direction of the swipe gesture, or sensing an increase in pressure applied to the screen, or any combination thereof. 5. The method of claim 4, wherein the release of the swipe gesture comprises a lifting of a finger from the screen, a releasing of a mouse button, or a second swipe gesture by a hand in the air in an augmented reality associated with the screen. 6. The method of claim 1, wherein the user interface element comprises at least one of a calendar reminder notification, or a link to open a calendar reminder, or an email notification, or a link to open an email, or a message notification, or a link to open a message, or a travel notification, or a paging notification, or a location notification, or a mapping route notification, or a link to open a mobile application, or any combination thereof. 7. The method of claim 1, wherein the first span comprises a distance from a first point on the screen to a second point on the screen, and wherein the second span comprises a distance from the first point on the screen to a third point on the screen. 8. The method of claim 1, wherein the device comprises a mobile computing device, a personal computing device, a wearable computing device, a screen projector, or a virtual reality headset. 9. An apparatus for interacting with a user interface element at a device, comprising:
a processor, memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
display the user interface element on a screen of the device;
sense a swipe gesture on the screen that is associated with the user interface element;
display a first option when a distance of the swipe gesture is determined to be within a first span;
provide a first feedback to indicate the first option is being displayed and is selected for execution, wherein the first feedback comprises at least a first haptic feedback and a first graphical feedback;
display a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span;
provide a second feedback to indicate the second option is being displayed and is selected for execution, wherein the second feedback comprises at least a second haptic feedback different from the first haptic feedback and a second graphical feedback different from the first graphical feedback;
sense a selection gesture while displaying the first option or the second option; and
execute either a first process based at least in part on sensing the selection gesture while displaying the first option or a second process based at least in part on sensing the selection gesture while displaying the second option. 10. (canceled) 11. The apparatus of claim 10, wherein the first feedback comprises an audio feedback, and wherein the second feedback comprises a second audio feedback. 12. The apparatus of claim 9, wherein the selection gesture comprises at least one of a release of the swipe gesture, or a second swipe gesture in a direction different than a direction of the swipe gesture, or sensing an increase in pressure applied to the screen, or any combination thereof. 13. The apparatus of claim 12, wherein the release of the swipe gesture comprises a lifting of a finger from the screen, a releasing of a mouse button, or a second swipe gesture by a hand in the air in an augmented reality associated with the screen. 14. The apparatus of claim 9, wherein the user interface element comprises at least one of a calendar reminder notification, or a link to open a calendar reminder, or an email notification, or a link to open an email, or a message notification, or a link to open a message, or a travel notification, or a paging notification, or a location notification, or a mapping route notification, or a link to open a mobile application, or any combination thereof. 15. The apparatus of claim 9, wherein the first span comprises a distance from a first point on the screen to a second point on the screen, and wherein the second span comprises a distance from the first point on the screen to a third point on the screen. 16. The apparatus of claim 9, wherein the device comprises a mobile computing device, a personal computing device, a wearable computing device, a screen projector, or a virtual reality headset. 17. A non-transitory computer-readable medium storing code for interacting with a user interface element at a device, the code comprising instructions executable by a processor to:
display the user interface element on a screen of the device; sense a swipe gesture on the screen that is associated with the user interface element; display a first option when a distance of the swipe gesture is determined to be within a first span; provide a first feedback to indicate the first option is being displayed and is selected for execution, wherein the first feedback comprises at least a first haptic feedback and a first graphical feedback; display a second option when the distance of the swipe gesture is beyond the first span and within a second span that is greater than the first span; provide a second feedback to indicate the second option is being displayed and is selected for execution, wherein the second feedback comprises at least a second haptic feedback different from the first haptic feedback and a second graphical feedback different from the first graphical feedback; sense a selection gesture while displaying the first option or the second option; and execute either a first process based at least in part on sensing the selection gesture while displaying the first option or a second process based at least in part on sensing the selection gesture while displaying the second option. 18. (canceled) 19. The non-transitory computer-readable medium of claim 18, wherein the first feedback comprises an audio feedback, and wherein the second feedback comprises a second audio feedback. 20. The non-transitory computer-readable medium of claim 17, wherein the selection gesture comprises at least one of a release of the swipe gesture, or a second swipe gesture in a direction different than a direction of the swipe gesture, or sensing an increase in pressure applied to the screen, or any combination thereof.
| 3,700
|
338,003
| 16,799,650
| 3,793
|
A semiconductor device includes a semiconductor substrate having a fin structure, a gate stack across the fin structure, a spacer structure on a sidewall of the gate stack, an epitaxial structure on the semiconductor substrate, and a dielectric structure in the spacer structure. The dielectric structure extends along a lower portion of the spacer structure and across the fin structure.
|
1. A semiconductor device, comprising:
a semiconductor substrate having a fin structure; a gate stack across the fin structure; a spacer structure on a sidewall of the gate stack; an epitaxial structure on the semiconductor substrate; and a dielectric structure in the spacer structure and extending along a lower portion of the spacer structure and across the fin structure. 2. The semiconductor device according to claim 1, wherein the dielectric structure is between the gate stack and the epitaxial structure. 3. The semiconductor device according to claim 1, wherein the dielectric structure is in contact with the epitaxial structure. 4. The semiconductor device according to claim 1, wherein the spacer structure comprises a first spacer layer, a second spacer layer, and a third spacer layer, and the second spacer layer is between the first spacer layer and the third spacer layer, and the second spacer layer has a lower dielectric constant than the first spacer layer and the third spacer layer. 5. The semiconductor device according to claim 4, wherein the second spacer layer is spaced apart from the epitaxial structure. 6. The semiconductor device according to claim 4, wherein the third spacer layer has a sidewall substantially aligned with a sidewall of the dielectric structure. 7. The semiconductor device according to claim 1, further comprising an etch stop layer and an interlayer dielectric over the epitaxial structure, wherein the etch stop layer is between the dielectric structure and the interlayer dielectric. 8. A semiconductor device, comprising:
a semiconductor substrate having a fin structure; a gate stack over the fin structure; a spacer structure over the fin structure and on a sidewall of the gate stack, and having a recessed face with a curved shape at a position proximal to the fin structure; and a dielectric structure in the spacer structure and having an inner face conformal to the recessed face of the spacer structure. 9. The semiconductor device according to claim 8, wherein the recessed face faces away from the stack. 10. The semiconductor device according to claim 8, wherein the inner face of the dielectric structure is in contact with the recessed face of the spacer structure. 11. The semiconductor device according to claim 8, wherein the dielectric structure extends in an extension direction along the recessed face of the spacer structure. 12. The semiconductor device according to claim 11, wherein the dielectric structure has non-uniform thicknesses in a direction substantially perpendicular to the extension direction of the dielectric structure. 13. The semiconductor device according to claim 12, wherein a thickness of the dielectric structure at a center of the dielectric structure is greater than a thickness of the dielectric structure at a side of the dielectric structure. 14. The semiconductor device according to claim 8, further comprising a first dielectric feature and a second dielectric feature over the semiconductor substrate, wherein a top surface of the first dielectric feature is lower than a top surface of the second dielectric feature. 15. The semiconductor device according to claim 14, wherein the dielectric structure is above the top surface of the first dielectric feature. 16. A method, comprising:
forming a gate stack over a fin structure of a semiconductor substrate; forming a spacer structure on a sidewall of the gate stack; removing a portion of the spacer structure to form a recessed face on the spacer structure, such that the spacer structure has a trench defined by the recessed face; depositing a dielectric layer on the gate stack and the spacer structure; and removing a portion of the dielectric layer outside the trench of the spacer structure to form a dielectric structure. 17. The method according to claim 15, wherein depositing the dielectric layer on the spacer structure is such that the dielectric layer is deposited on the recessed face of the spacer structure. 18. The method according to claim 15, further comprising:
forming a fin recess in the fin structure; forming an epitaxial structure protruding from the fin recess such that the epitaxial structure in contact with the dielectric structure. 19. The method according to claim 18, further comprising:
forming an etch stop layer over the epitaxial structure; and forming an interlayer dielectric over the etch stop layer. 20. The method according to claim 15, wherein forming the spacer structure on the sidewall of the gate stack comprises:
forming a first spacer layer on the gate stack; forming a second spacer layer on the first spacer layer; and forming a third spacer layer on the second spacer layer, wherein the first spacer layer, the second spacer layer, and the third spacer layer are made of different materials.
|
A semiconductor device includes a semiconductor substrate having a fin structure, a gate stack across the fin structure, a spacer structure on a sidewall of the gate stack, an epitaxial structure on the semiconductor substrate, and a dielectric structure in the spacer structure. The dielectric structure extends along a lower portion of the spacer structure and across the fin structure.1. A semiconductor device, comprising:
a semiconductor substrate having a fin structure; a gate stack across the fin structure; a spacer structure on a sidewall of the gate stack; an epitaxial structure on the semiconductor substrate; and a dielectric structure in the spacer structure and extending along a lower portion of the spacer structure and across the fin structure. 2. The semiconductor device according to claim 1, wherein the dielectric structure is between the gate stack and the epitaxial structure. 3. The semiconductor device according to claim 1, wherein the dielectric structure is in contact with the epitaxial structure. 4. The semiconductor device according to claim 1, wherein the spacer structure comprises a first spacer layer, a second spacer layer, and a third spacer layer, and the second spacer layer is between the first spacer layer and the third spacer layer, and the second spacer layer has a lower dielectric constant than the first spacer layer and the third spacer layer. 5. The semiconductor device according to claim 4, wherein the second spacer layer is spaced apart from the epitaxial structure. 6. The semiconductor device according to claim 4, wherein the third spacer layer has a sidewall substantially aligned with a sidewall of the dielectric structure. 7. The semiconductor device according to claim 1, further comprising an etch stop layer and an interlayer dielectric over the epitaxial structure, wherein the etch stop layer is between the dielectric structure and the interlayer dielectric. 8. A semiconductor device, comprising:
a semiconductor substrate having a fin structure; a gate stack over the fin structure; a spacer structure over the fin structure and on a sidewall of the gate stack, and having a recessed face with a curved shape at a position proximal to the fin structure; and a dielectric structure in the spacer structure and having an inner face conformal to the recessed face of the spacer structure. 9. The semiconductor device according to claim 8, wherein the recessed face faces away from the stack. 10. The semiconductor device according to claim 8, wherein the inner face of the dielectric structure is in contact with the recessed face of the spacer structure. 11. The semiconductor device according to claim 8, wherein the dielectric structure extends in an extension direction along the recessed face of the spacer structure. 12. The semiconductor device according to claim 11, wherein the dielectric structure has non-uniform thicknesses in a direction substantially perpendicular to the extension direction of the dielectric structure. 13. The semiconductor device according to claim 12, wherein a thickness of the dielectric structure at a center of the dielectric structure is greater than a thickness of the dielectric structure at a side of the dielectric structure. 14. The semiconductor device according to claim 8, further comprising a first dielectric feature and a second dielectric feature over the semiconductor substrate, wherein a top surface of the first dielectric feature is lower than a top surface of the second dielectric feature. 15. The semiconductor device according to claim 14, wherein the dielectric structure is above the top surface of the first dielectric feature. 16. A method, comprising:
forming a gate stack over a fin structure of a semiconductor substrate; forming a spacer structure on a sidewall of the gate stack; removing a portion of the spacer structure to form a recessed face on the spacer structure, such that the spacer structure has a trench defined by the recessed face; depositing a dielectric layer on the gate stack and the spacer structure; and removing a portion of the dielectric layer outside the trench of the spacer structure to form a dielectric structure. 17. The method according to claim 15, wherein depositing the dielectric layer on the spacer structure is such that the dielectric layer is deposited on the recessed face of the spacer structure. 18. The method according to claim 15, further comprising:
forming a fin recess in the fin structure; forming an epitaxial structure protruding from the fin recess such that the epitaxial structure in contact with the dielectric structure. 19. The method according to claim 18, further comprising:
forming an etch stop layer over the epitaxial structure; and forming an interlayer dielectric over the etch stop layer. 20. The method according to claim 15, wherein forming the spacer structure on the sidewall of the gate stack comprises:
forming a first spacer layer on the gate stack; forming a second spacer layer on the first spacer layer; and forming a third spacer layer on the second spacer layer, wherein the first spacer layer, the second spacer layer, and the third spacer layer are made of different materials.
| 3,700
|
338,004
| 16,799,623
| 3,793
|
A computer-implemented method according to one embodiment includes creating a clean dictionary, utilizing a clean signal, creating a noisy dictionary, utilizing a first noisy signal, determining a time varying projection, utilizing the clean dictionary and the noisy dictionary, and denoising a second noisy signal, utilizing the time varying projection.
|
1. A computer-implemented method, comprising:
creating a clean dictionary, utilizing a clean signal; creating a noisy dictionary, utilizing a first noisy signal; determining a time varying projection, utilizing the clean dictionary and the noisy dictionary; and denoising a second noisy signal, utilizing the time varying projection. 2. The computer-implemented method of claim 1, wherein creating the noisy dictionary includes creating a noisy spectrogram, converting the noisy spectrogram into a plurality of noisy spectro-temporal building blocks by applying a convolutive non-negative matrix factorization (CNMF) algorithm may to the noisy spectrogram, and adding the plurality of noisy spectro-temporal building blocks to the noisy dictionary. 3. The computer-implemented method of claim 1, wherein determining the time varying projection includes:
generating a time activation matrix for the clean signal, utilizing the clean dictionary; generating a time activation matrix for the first noisy signal, utilizing the noisy dictionary; and comparing the time activation matrix for the clean signal and the time activation matrix for the first noisy signal to create the time varying projection. 4. The computer-implemented method of claim 1, further comprising expanding the clean dictionary and the noisy dictionary by updating the clean dictionary and the noisy dictionary to include new clean spectro-temporal building blocks and new noisy spectro-temporal building blocks created utilizing additional clean and noisy signals. 5. The computer-implemented method of claim 1, wherein creating the clean dictionary includes creating a clean spectrogram that includes a visual representation of a spectrum of frequencies in the clean signal as they vary with time. 6. The computer-implemented method of claim 5, wherein creating the clean dictionary includes converting the clean spectrogram into a plurality of clean spectro-temporal building blocks. 7. The computer-implemented method of claim 6, wherein converting the clean spectrogram into the plurality of clean spectro-temporal building blocks includes applying a convolutive non-negative matrix factorization (CNMF) algorithm to the clean spectrogram, where the CNMF identifies and creates the plurality of clean spectro-temporal building blocks within the clean spectrogram. 8. The computer-implemented method of claim 6, wherein creating the clean dictionary includes adding the plurality of clean spectro-temporal building blocks to the clean dictionary. 9. The computer-implemented method of claim 1, wherein denoising the second noisy signal includes creating a second noisy spectrogram, utilizing the second noisy signal. 10. The computer-implemented method of claim 9, wherein denoising the second noisy signal includes:
converting the second noisy spectrogram into a plurality of noisy spectro-temporal building blocks; adding the plurality of noisy spectro-temporal building blocks to a second noisy dictionary; generating a time activation matrix for the second noisy signal, utilizing the second noisy dictionary; and applying the time varying projection to the time activation matrix for the second noisy signal to obtain a denoised time activation matrix. 11. The computer-implemented method of claim 10, wherein the denoised time activation matrix is used to provide noise-robust acoustic features for automatic speech recognition (ASR). 12. The computer-implemented method of claim 11, wherein the denoised time activation matrix is used in combination with one or more acoustic features, selected from a group including but not limited to log-mel filterbank engeries and mel-frequency cepstral coefficients (MFCCs), to provide noise-robust acoustic features for ASR. 13. A computer program product for denoising a signal, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising:
creating, utilizing a processor, a clean dictionary, utilizing a clean signal; creating, utilizing the processor, a noisy dictionary, utilizing a first noisy signal; determining, utilizing the processor, a time varying projection, utilizing the clean dictionary and the noisy dictionary; and denoising, utilizing the processor, a second noisy signal, utilizing the time varying projection. 14. The computer program product of claim 13, wherein creating the noisy dictionary includes creating, utilizing the processor, a noisy spectrogram, converting, utilizing the processor, the noisy spectrogram into a plurality of noisy spectro-temporal building blocks by applying a convolutive non-negative matrix factorization (CNMF) algorithm may to the noisy spectrogram, and adding, utilizing the processor, the plurality of noisy spectro-temporal building blocks to the noisy dictionary. 15. The computer program product of claim 13, wherein determining the time varying projection includes:
generating, utilizing the processor, a time activation matrix for the clean signal, utilizing the clean dictionary; generating, utilizing the processor, a time activation matrix for the first noisy signal, utilizing the noisy dictionary; and comparing, utilizing the processor, the time activation matrix for the clean signal and the time activation matrix for the first noisy signal to create the time varying projection. 16. The computer program product of claim 13, further comprising expanding, utilizing the processor, the clean dictionary and the noisy dictionary by updating the clean dictionary and the noisy dictionary to include new clean spectro-temporal building blocks and new noisy spectro-temporal building blocks created utilizing additional clean and noisy signals. 17. The computer program product of claim 13, wherein creating the clean dictionary includes creating, utilizing the processor, a clean spectrogram that includes a visual representation of a spectrum of frequencies in the clean signal as they vary with time. 18. The computer program product of claim 13, wherein creating the clean dictionary includes converting, utilizing the processor, the clean signal into a plurality of clean spectro-temporal building blocks. 19. The computer program product of claim 18, wherein converting the clean signal into the plurality of clean spectro-temporal building blocks includes applying, utilizing the processor, a convolutive non-negative matrix factorization (CNMF) algorithm to the clean signal, where the CNMF identifies and creates the plurality of clean spectro-temporal building blocks within the clean signal. 20. A system, comprising:
a processor; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to: create a clean dictionary, utilizing a clean signal; create a noisy dictionary, utilizing a first noisy signal; determine a time varying projection, utilizing the clean dictionary and the noisy dictionary; and denoise a second noisy signal, utilizing the time varying projection.
|
A computer-implemented method according to one embodiment includes creating a clean dictionary, utilizing a clean signal, creating a noisy dictionary, utilizing a first noisy signal, determining a time varying projection, utilizing the clean dictionary and the noisy dictionary, and denoising a second noisy signal, utilizing the time varying projection.1. A computer-implemented method, comprising:
creating a clean dictionary, utilizing a clean signal; creating a noisy dictionary, utilizing a first noisy signal; determining a time varying projection, utilizing the clean dictionary and the noisy dictionary; and denoising a second noisy signal, utilizing the time varying projection. 2. The computer-implemented method of claim 1, wherein creating the noisy dictionary includes creating a noisy spectrogram, converting the noisy spectrogram into a plurality of noisy spectro-temporal building blocks by applying a convolutive non-negative matrix factorization (CNMF) algorithm may to the noisy spectrogram, and adding the plurality of noisy spectro-temporal building blocks to the noisy dictionary. 3. The computer-implemented method of claim 1, wherein determining the time varying projection includes:
generating a time activation matrix for the clean signal, utilizing the clean dictionary; generating a time activation matrix for the first noisy signal, utilizing the noisy dictionary; and comparing the time activation matrix for the clean signal and the time activation matrix for the first noisy signal to create the time varying projection. 4. The computer-implemented method of claim 1, further comprising expanding the clean dictionary and the noisy dictionary by updating the clean dictionary and the noisy dictionary to include new clean spectro-temporal building blocks and new noisy spectro-temporal building blocks created utilizing additional clean and noisy signals. 5. The computer-implemented method of claim 1, wherein creating the clean dictionary includes creating a clean spectrogram that includes a visual representation of a spectrum of frequencies in the clean signal as they vary with time. 6. The computer-implemented method of claim 5, wherein creating the clean dictionary includes converting the clean spectrogram into a plurality of clean spectro-temporal building blocks. 7. The computer-implemented method of claim 6, wherein converting the clean spectrogram into the plurality of clean spectro-temporal building blocks includes applying a convolutive non-negative matrix factorization (CNMF) algorithm to the clean spectrogram, where the CNMF identifies and creates the plurality of clean spectro-temporal building blocks within the clean spectrogram. 8. The computer-implemented method of claim 6, wherein creating the clean dictionary includes adding the plurality of clean spectro-temporal building blocks to the clean dictionary. 9. The computer-implemented method of claim 1, wherein denoising the second noisy signal includes creating a second noisy spectrogram, utilizing the second noisy signal. 10. The computer-implemented method of claim 9, wherein denoising the second noisy signal includes:
converting the second noisy spectrogram into a plurality of noisy spectro-temporal building blocks; adding the plurality of noisy spectro-temporal building blocks to a second noisy dictionary; generating a time activation matrix for the second noisy signal, utilizing the second noisy dictionary; and applying the time varying projection to the time activation matrix for the second noisy signal to obtain a denoised time activation matrix. 11. The computer-implemented method of claim 10, wherein the denoised time activation matrix is used to provide noise-robust acoustic features for automatic speech recognition (ASR). 12. The computer-implemented method of claim 11, wherein the denoised time activation matrix is used in combination with one or more acoustic features, selected from a group including but not limited to log-mel filterbank engeries and mel-frequency cepstral coefficients (MFCCs), to provide noise-robust acoustic features for ASR. 13. A computer program product for denoising a signal, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising:
creating, utilizing a processor, a clean dictionary, utilizing a clean signal; creating, utilizing the processor, a noisy dictionary, utilizing a first noisy signal; determining, utilizing the processor, a time varying projection, utilizing the clean dictionary and the noisy dictionary; and denoising, utilizing the processor, a second noisy signal, utilizing the time varying projection. 14. The computer program product of claim 13, wherein creating the noisy dictionary includes creating, utilizing the processor, a noisy spectrogram, converting, utilizing the processor, the noisy spectrogram into a plurality of noisy spectro-temporal building blocks by applying a convolutive non-negative matrix factorization (CNMF) algorithm may to the noisy spectrogram, and adding, utilizing the processor, the plurality of noisy spectro-temporal building blocks to the noisy dictionary. 15. The computer program product of claim 13, wherein determining the time varying projection includes:
generating, utilizing the processor, a time activation matrix for the clean signal, utilizing the clean dictionary; generating, utilizing the processor, a time activation matrix for the first noisy signal, utilizing the noisy dictionary; and comparing, utilizing the processor, the time activation matrix for the clean signal and the time activation matrix for the first noisy signal to create the time varying projection. 16. The computer program product of claim 13, further comprising expanding, utilizing the processor, the clean dictionary and the noisy dictionary by updating the clean dictionary and the noisy dictionary to include new clean spectro-temporal building blocks and new noisy spectro-temporal building blocks created utilizing additional clean and noisy signals. 17. The computer program product of claim 13, wherein creating the clean dictionary includes creating, utilizing the processor, a clean spectrogram that includes a visual representation of a spectrum of frequencies in the clean signal as they vary with time. 18. The computer program product of claim 13, wherein creating the clean dictionary includes converting, utilizing the processor, the clean signal into a plurality of clean spectro-temporal building blocks. 19. The computer program product of claim 18, wherein converting the clean signal into the plurality of clean spectro-temporal building blocks includes applying, utilizing the processor, a convolutive non-negative matrix factorization (CNMF) algorithm to the clean signal, where the CNMF identifies and creates the plurality of clean spectro-temporal building blocks within the clean signal. 20. A system, comprising:
a processor; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to: create a clean dictionary, utilizing a clean signal; create a noisy dictionary, utilizing a first noisy signal; determine a time varying projection, utilizing the clean dictionary and the noisy dictionary; and denoise a second noisy signal, utilizing the time varying projection.
| 3,700
|
338,005
| 16,799,614
| 3,793
|
A virtual reality system providing a virtual robotic surgical environment, and methods for using the virtual reality system, are described herein. The virtual reality system may simulate a robotic surgical environment in which a user may operate both a robotically-controlled surgical instrument using a handheld controller and a manual laparoscopic surgical instrument while adjacent a patient table. For example, the virtual reality system f may include one or more processors configured to generate a virtual robotic surgical environment comprising at least one virtual robotic arm and at least one virtual manual laparoscopic tool, a first handheld device communicatively coupled to the virtual reality controller for manipulating the at least one virtual robotic arm in the virtual robotic surgical environment, and a second handheld device comprising a handheld portion and a tool feature representative of at least a portion of a manual laparoscopic tool, wherein the second handheld device is communicatively coupled to the virtual reality controller for manipulating the at least one virtual manual laparoscopic tool in the virtual robotic surgical environment.
|
1. (canceled) 2. A virtual reality system for simulating a robotic surgical environment, the system comprising:
a virtual reality processor configured to generate a virtual robotic surgical environment comprising at least one virtual robotic arm and at least one virtual manual laparoscopic tool; and a handheld device communicatively coupled to the virtual reality processor for manipulating the at least one virtual manual laparoscopic tool in the virtual robotic surgical environment, the handheld device including
a handheld portion, and a tool feature that is removable from the handheld portion, the tool feature being representative of at least a portion of a manual laparoscopic tool. 3. The virtual reality system of claim 2, wherein the handheld device is used for manipulation of the at least one virtual robotic arm robotic arm when the tool feature is removed from the handheld portion of the handheld device. 4. The virtual reality system of claim 2, wherein the handheld device is used for manipulation of a virtual robotically-controlled tool when the tool feature is removed from the handheld portion of the handheld device. 5. The virtual reality system of claim 2, wherein the tool feature comprises a tool shaft and a shaft adapter for coupling the tool shaft to the handheld portion of the second handheld device. 6. The virtual reality system of claim 5, wherein the shaft adapter comprises fasteners. 7. The virtual reality system of claim 2, wherein the handheld portion comprises an interactive feature that actuates a function of the virtual manual laparoscopic tool in response to engagement of the interactive feature by a user. 8. The virtual reality system of claim 7, wherein the interactive feature comprises a trigger. 9. The virtual reality system of claim 2, wherein the virtual manual laparoscopic tool is a virtual manual laparoscopic stapler. 10. The virtual reality system of claim 2, wherein a trigger on the handheld portion controls firing of a virtual staple. 11. The virtual reality system of claim 2, further comprising a patient simulator comprising a cannula arranged to receive at least a portion of the tool feature of the handheld device. 12. A computer-implemented method for simulating a robotic surgical environment in a virtual reality system, the method comprising:
generating, by one or more processors, a virtual robotic surgical environment comprising at least one virtual robotic arm and a virtual manual laparoscopic tool; coupling a handheld device communicatively to the processors for manipulating the virtual manual laparoscopic tool in the virtual robotic surgical environment, the handheld device including a handheld portion and a tool feature that is removable from the handheld portion, the tool feature being representative of at least a portion of a manual laparoscopic tool; and simulating an over-the-bed surgery in the virtual reality system based on a user's input with the handheld device. 13. The method of claim 12, wherein the handheld device is used for manipulation of the at least one virtual robotic arm robotic arm when the tool feature is removed from the handheld portion of the handheld device. 14. The method of claim 12, wherein the handheld device is used for manipulation of a virtual robotically-controlled tool when the tool feature is removed from the handheld portion of the handheld device. 15. The method of claim 12, wherein the tool feature comprises a tool shaft and a shaft adapter for coupling the tool shaft to the handheld portion of the second handheld device. 16. The method of claim 15, wherein the shaft adapter comprises fasteners. 17. The method of claim 12, wherein the handheld portion comprises an interactive feature that actuates a function of the virtual manual laparoscopic tool in response to engagement of the interactive feature by a user. 18. The method of claim 17, wherein the interactive feature comprises a trigger. 19. The method of claim 12, wherein the virtual manual laparoscopic tool is a virtual manual laparoscopic stapler. 20. The method of claim 12, wherein a trigger on the handheld portion controls firing of a virtual staple. 21. The method of claim 12, further comprising a patient simulator comprising a cannula arranged to receive at least a portion of the tool feature of the handheld device.
|
A virtual reality system providing a virtual robotic surgical environment, and methods for using the virtual reality system, are described herein. The virtual reality system may simulate a robotic surgical environment in which a user may operate both a robotically-controlled surgical instrument using a handheld controller and a manual laparoscopic surgical instrument while adjacent a patient table. For example, the virtual reality system f may include one or more processors configured to generate a virtual robotic surgical environment comprising at least one virtual robotic arm and at least one virtual manual laparoscopic tool, a first handheld device communicatively coupled to the virtual reality controller for manipulating the at least one virtual robotic arm in the virtual robotic surgical environment, and a second handheld device comprising a handheld portion and a tool feature representative of at least a portion of a manual laparoscopic tool, wherein the second handheld device is communicatively coupled to the virtual reality controller for manipulating the at least one virtual manual laparoscopic tool in the virtual robotic surgical environment.1. (canceled) 2. A virtual reality system for simulating a robotic surgical environment, the system comprising:
a virtual reality processor configured to generate a virtual robotic surgical environment comprising at least one virtual robotic arm and at least one virtual manual laparoscopic tool; and a handheld device communicatively coupled to the virtual reality processor for manipulating the at least one virtual manual laparoscopic tool in the virtual robotic surgical environment, the handheld device including
a handheld portion, and a tool feature that is removable from the handheld portion, the tool feature being representative of at least a portion of a manual laparoscopic tool. 3. The virtual reality system of claim 2, wherein the handheld device is used for manipulation of the at least one virtual robotic arm robotic arm when the tool feature is removed from the handheld portion of the handheld device. 4. The virtual reality system of claim 2, wherein the handheld device is used for manipulation of a virtual robotically-controlled tool when the tool feature is removed from the handheld portion of the handheld device. 5. The virtual reality system of claim 2, wherein the tool feature comprises a tool shaft and a shaft adapter for coupling the tool shaft to the handheld portion of the second handheld device. 6. The virtual reality system of claim 5, wherein the shaft adapter comprises fasteners. 7. The virtual reality system of claim 2, wherein the handheld portion comprises an interactive feature that actuates a function of the virtual manual laparoscopic tool in response to engagement of the interactive feature by a user. 8. The virtual reality system of claim 7, wherein the interactive feature comprises a trigger. 9. The virtual reality system of claim 2, wherein the virtual manual laparoscopic tool is a virtual manual laparoscopic stapler. 10. The virtual reality system of claim 2, wherein a trigger on the handheld portion controls firing of a virtual staple. 11. The virtual reality system of claim 2, further comprising a patient simulator comprising a cannula arranged to receive at least a portion of the tool feature of the handheld device. 12. A computer-implemented method for simulating a robotic surgical environment in a virtual reality system, the method comprising:
generating, by one or more processors, a virtual robotic surgical environment comprising at least one virtual robotic arm and a virtual manual laparoscopic tool; coupling a handheld device communicatively to the processors for manipulating the virtual manual laparoscopic tool in the virtual robotic surgical environment, the handheld device including a handheld portion and a tool feature that is removable from the handheld portion, the tool feature being representative of at least a portion of a manual laparoscopic tool; and simulating an over-the-bed surgery in the virtual reality system based on a user's input with the handheld device. 13. The method of claim 12, wherein the handheld device is used for manipulation of the at least one virtual robotic arm robotic arm when the tool feature is removed from the handheld portion of the handheld device. 14. The method of claim 12, wherein the handheld device is used for manipulation of a virtual robotically-controlled tool when the tool feature is removed from the handheld portion of the handheld device. 15. The method of claim 12, wherein the tool feature comprises a tool shaft and a shaft adapter for coupling the tool shaft to the handheld portion of the second handheld device. 16. The method of claim 15, wherein the shaft adapter comprises fasteners. 17. The method of claim 12, wherein the handheld portion comprises an interactive feature that actuates a function of the virtual manual laparoscopic tool in response to engagement of the interactive feature by a user. 18. The method of claim 17, wherein the interactive feature comprises a trigger. 19. The method of claim 12, wherein the virtual manual laparoscopic tool is a virtual manual laparoscopic stapler. 20. The method of claim 12, wherein a trigger on the handheld portion controls firing of a virtual staple. 21. The method of claim 12, further comprising a patient simulator comprising a cannula arranged to receive at least a portion of the tool feature of the handheld device.
| 3,700
|
338,006
| 16,799,592
| 3,793
|
Provided herein are seed train processes and methods of producing a recombinant protein that include the use of these seed train processes.
|
1.-33. (canceled) 34. A method of producing a recombinant protein comprising:
(a) disposing a plurality of recombinant mammalian cells into a first culture medium comprised within a vessel to provide a first cell culture; (b) batch culturing the first cell culture to a cell density range of about 1.0×106 cells/mL to about 5.0×106 cells/mL; (c) disposing a volume of the first cell culture medium of (b) into a second culture medium comprised within a perfusion bioreactor to provide a second cell culture with an initial cell density in a range of about 0.25×106 cells/mL to about 0.5×106 cells/mL; (d) perfusion culturing the second cell culture to a cell density range of between about 5×106 cells/mL to about 60×106 cells/mL; (e) disposing a volume of the second cell culture of (d) into a third culture medium comprised within a production bioreactor to provide a production cell culture with an initial cell density in a range of about 0.25×106 cells/mL to about 8×106 cells/mL; (f) perfusion culturing the production cell culture under conditions that allow the recombinant mammalian cells to secrete a recombinant protein; (g) harvesting the recombinant protein from the production cell culture; and (h) isolating the recombinant protein from the third culture medium. 35. The method of claim 34, wherein disposing the plurality of recombinant mammalian cells in (a) comprises:
thawing a frozen cell bank; and disposing a volume of the thawed cell bank into the first culture medium. 36.-38. (canceled) 39. The method of claim 34, wherein disposing the plurality of recombinant mammalian cells in (a) comprises disposing a volume of a third cell culture comprising the plurality of recombinant mammalian cells into the first culture medium. 40. The method of claim 39, further comprising:
(1) disposing a plurality of the recombinant mammalian cells into a fourth culture medium comprised within a vessel to provide the third cell culture; (2) batch culturing the third cell culture in (1) to a cell density range of about 1.0×106 cells/mL to about 5.0×106 cells/mL, wherein a volume of the third cell culture in (2) is disposed into the first culture medium in (a). 41.-42. (canceled) 43. The method of claim 40, wherein disposing the plurality of the recombinant mammalian cells in (1) comprises:
thawing a frozen cell bank; and disposing a volume of the thawed cell bank into the fourth culture medium. 44.-47. (canceled) 48. The method of claim 34, wherein the first cell culture in (a) has a volume range of about 1.0 L to about 50 L. 49. (canceled) 50. The method of claim 34, wherein the second cell culture in (c) has a volume range of about 5 L to about 600 L. 51. (canceled) 52. The method of claim 34, wherein the production cell culture in (e) has a volume range of about 50 L to about 20,000 L. 53. (canceled) 54. The method of claim 40, wherein the fourth culture medium in (1) has a volume range of about 500 mL to about 20 L. 55. (canceled) 56. The method of claim 34, wherein the vessel in (a) has an internal volume range of about 1.5 L to about 100 L. 57. (canceled) 58. The method of claim 34, wherein the perfusion bioreactor in (c) has an internal volume range of about 7.5 L to about 1,000 L. 59. (canceled) 60. The method of claim 34, wherein the production bioreactor in (e) has an internal volume range of about 150 L to about 25,000 L. 61. (canceled) 62. The method of claim 40, wherein the vessel in (1) has an internal volume range of about 1 L to about 40 L. 63. (canceled) 64. The method of claim 34, wherein the perfusion culturing in (c) is performed using a perfusion bioreactor equipped with an alternating tangential flow filtration device. 65. The method of claim 34, wherein the initial cell density in (e) is in a range of about 2.0×106 cells/mL to about 8×106 cells/mL 66. The method of claim 34, wherein the initial cell density in (e) is at least 10% of the steady state production cell density. 67. (canceled) 68. The method of claim 66, wherein the steady state production cell density is between 5×106 cells/mL to about 50×106 cells/mL. 69. (canceled) 70. The method of claim 34, wherein the perfusion culturing in (f) results in the production cell culture reaching the steady state production cell density in a period of between about 1 day to about 10 days. 71.-74. (canceled) 75. The method of claim 34, wherein the isolating is performed using an integrated and continuous process. 76. The method of claim 34, further comprising formulating the isolated recombinant protein into a pharmaceutical agent.
|
Provided herein are seed train processes and methods of producing a recombinant protein that include the use of these seed train processes.1.-33. (canceled) 34. A method of producing a recombinant protein comprising:
(a) disposing a plurality of recombinant mammalian cells into a first culture medium comprised within a vessel to provide a first cell culture; (b) batch culturing the first cell culture to a cell density range of about 1.0×106 cells/mL to about 5.0×106 cells/mL; (c) disposing a volume of the first cell culture medium of (b) into a second culture medium comprised within a perfusion bioreactor to provide a second cell culture with an initial cell density in a range of about 0.25×106 cells/mL to about 0.5×106 cells/mL; (d) perfusion culturing the second cell culture to a cell density range of between about 5×106 cells/mL to about 60×106 cells/mL; (e) disposing a volume of the second cell culture of (d) into a third culture medium comprised within a production bioreactor to provide a production cell culture with an initial cell density in a range of about 0.25×106 cells/mL to about 8×106 cells/mL; (f) perfusion culturing the production cell culture under conditions that allow the recombinant mammalian cells to secrete a recombinant protein; (g) harvesting the recombinant protein from the production cell culture; and (h) isolating the recombinant protein from the third culture medium. 35. The method of claim 34, wherein disposing the plurality of recombinant mammalian cells in (a) comprises:
thawing a frozen cell bank; and disposing a volume of the thawed cell bank into the first culture medium. 36.-38. (canceled) 39. The method of claim 34, wherein disposing the plurality of recombinant mammalian cells in (a) comprises disposing a volume of a third cell culture comprising the plurality of recombinant mammalian cells into the first culture medium. 40. The method of claim 39, further comprising:
(1) disposing a plurality of the recombinant mammalian cells into a fourth culture medium comprised within a vessel to provide the third cell culture; (2) batch culturing the third cell culture in (1) to a cell density range of about 1.0×106 cells/mL to about 5.0×106 cells/mL, wherein a volume of the third cell culture in (2) is disposed into the first culture medium in (a). 41.-42. (canceled) 43. The method of claim 40, wherein disposing the plurality of the recombinant mammalian cells in (1) comprises:
thawing a frozen cell bank; and disposing a volume of the thawed cell bank into the fourth culture medium. 44.-47. (canceled) 48. The method of claim 34, wherein the first cell culture in (a) has a volume range of about 1.0 L to about 50 L. 49. (canceled) 50. The method of claim 34, wherein the second cell culture in (c) has a volume range of about 5 L to about 600 L. 51. (canceled) 52. The method of claim 34, wherein the production cell culture in (e) has a volume range of about 50 L to about 20,000 L. 53. (canceled) 54. The method of claim 40, wherein the fourth culture medium in (1) has a volume range of about 500 mL to about 20 L. 55. (canceled) 56. The method of claim 34, wherein the vessel in (a) has an internal volume range of about 1.5 L to about 100 L. 57. (canceled) 58. The method of claim 34, wherein the perfusion bioreactor in (c) has an internal volume range of about 7.5 L to about 1,000 L. 59. (canceled) 60. The method of claim 34, wherein the production bioreactor in (e) has an internal volume range of about 150 L to about 25,000 L. 61. (canceled) 62. The method of claim 40, wherein the vessel in (1) has an internal volume range of about 1 L to about 40 L. 63. (canceled) 64. The method of claim 34, wherein the perfusion culturing in (c) is performed using a perfusion bioreactor equipped with an alternating tangential flow filtration device. 65. The method of claim 34, wherein the initial cell density in (e) is in a range of about 2.0×106 cells/mL to about 8×106 cells/mL 66. The method of claim 34, wherein the initial cell density in (e) is at least 10% of the steady state production cell density. 67. (canceled) 68. The method of claim 66, wherein the steady state production cell density is between 5×106 cells/mL to about 50×106 cells/mL. 69. (canceled) 70. The method of claim 34, wherein the perfusion culturing in (f) results in the production cell culture reaching the steady state production cell density in a period of between about 1 day to about 10 days. 71.-74. (canceled) 75. The method of claim 34, wherein the isolating is performed using an integrated and continuous process. 76. The method of claim 34, further comprising formulating the isolated recombinant protein into a pharmaceutical agent.
| 3,700
|
338,007
| 16,799,644
| 3,793
|
A system for processing a handwritten message received by a messaging app can modify playback over time of the handwritten message based on a set of rules to determine how to modify the playback. In one embodiment, graphics data (e.g. vector graphics data) that represents the handwritten message is processed using the rules to determine how to modify the playback such that the resulting playback includes at least one modification over a portion of time of the playback.
|
1. A non-transitory machine readable medium storing executable program instructions which, when executed by a processor, cause the processor to perform operations comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 2. The non-transitory machine readable medium of claim 1, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 3. The non-transitory machine readable medium of claim 1, wherein the switching comprises removing the on-screen keyboard. 4. The non-transitory machine readable medium of claim 1, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 5. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the operations further comprise:
receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 6. The non-transitory machine readable medium of claim 5, wherein the operations further comprise:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 7. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 8. A method, comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 9. The method of claim 8, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 10. The method of claim 8, wherein the switching comprises removing the on-screen keyboard. 11. The method of claim 8, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 12. The method of claim 8, wherein the application is a messaging application, the method further comprising receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 13. The method of claim 12, further comprising:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 14. The method of claim 8, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 15. A device, comprising:
a memory; and one or more processors configured to:
display, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text;
detect, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and
switch, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 16. The device of claim 15, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 17. The device of claim 15, wherein the one or more processors are configured to switch the user interface of the application to the handwritten input mode, in part, by removing the on-screen keyboard. 18. The device of claim 15, further comprising at least one of an accelerometer or a gyroscope, wherein the one or more processors are configured to detect the change using the at least one of the accelerometer or the gyroscope. 19. The device of claim 15, wherein the application is a messaging application, and wherein one or more processors further configured to:
receive a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 20. The device of claim 19, wherein one or more processors further configured to:
detect, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switch, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and display the received handwritten message in a text staging region of the user interface in the keyboard entry mode.
|
A system for processing a handwritten message received by a messaging app can modify playback over time of the handwritten message based on a set of rules to determine how to modify the playback. In one embodiment, graphics data (e.g. vector graphics data) that represents the handwritten message is processed using the rules to determine how to modify the playback such that the resulting playback includes at least one modification over a portion of time of the playback.1. A non-transitory machine readable medium storing executable program instructions which, when executed by a processor, cause the processor to perform operations comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 2. The non-transitory machine readable medium of claim 1, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 3. The non-transitory machine readable medium of claim 1, wherein the switching comprises removing the on-screen keyboard. 4. The non-transitory machine readable medium of claim 1, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 5. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the operations further comprise:
receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 6. The non-transitory machine readable medium of claim 5, wherein the operations further comprise:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 7. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 8. A method, comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 9. The method of claim 8, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 10. The method of claim 8, wherein the switching comprises removing the on-screen keyboard. 11. The method of claim 8, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 12. The method of claim 8, wherein the application is a messaging application, the method further comprising receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 13. The method of claim 12, further comprising:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 14. The method of claim 8, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 15. A device, comprising:
a memory; and one or more processors configured to:
display, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text;
detect, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and
switch, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 16. The device of claim 15, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 17. The device of claim 15, wherein the one or more processors are configured to switch the user interface of the application to the handwritten input mode, in part, by removing the on-screen keyboard. 18. The device of claim 15, further comprising at least one of an accelerometer or a gyroscope, wherein the one or more processors are configured to detect the change using the at least one of the accelerometer or the gyroscope. 19. The device of claim 15, wherein the application is a messaging application, and wherein one or more processors further configured to:
receive a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 20. The device of claim 19, wherein one or more processors further configured to:
detect, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switch, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and display the received handwritten message in a text staging region of the user interface in the keyboard entry mode.
| 3,700
|
338,008
| 16,799,628
| 3,793
|
A system for processing a handwritten message received by a messaging app can modify playback over time of the handwritten message based on a set of rules to determine how to modify the playback. In one embodiment, graphics data (e.g. vector graphics data) that represents the handwritten message is processed using the rules to determine how to modify the playback such that the resulting playback includes at least one modification over a portion of time of the playback.
|
1. A non-transitory machine readable medium storing executable program instructions which, when executed by a processor, cause the processor to perform operations comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 2. The non-transitory machine readable medium of claim 1, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 3. The non-transitory machine readable medium of claim 1, wherein the switching comprises removing the on-screen keyboard. 4. The non-transitory machine readable medium of claim 1, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 5. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the operations further comprise:
receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 6. The non-transitory machine readable medium of claim 5, wherein the operations further comprise:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 7. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 8. A method, comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 9. The method of claim 8, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 10. The method of claim 8, wherein the switching comprises removing the on-screen keyboard. 11. The method of claim 8, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 12. The method of claim 8, wherein the application is a messaging application, the method further comprising receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 13. The method of claim 12, further comprising:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 14. The method of claim 8, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 15. A device, comprising:
a memory; and one or more processors configured to:
display, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text;
detect, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and
switch, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 16. The device of claim 15, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 17. The device of claim 15, wherein the one or more processors are configured to switch the user interface of the application to the handwritten input mode, in part, by removing the on-screen keyboard. 18. The device of claim 15, further comprising at least one of an accelerometer or a gyroscope, wherein the one or more processors are configured to detect the change using the at least one of the accelerometer or the gyroscope. 19. The device of claim 15, wherein the application is a messaging application, and wherein one or more processors further configured to:
receive a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 20. The device of claim 19, wherein one or more processors further configured to:
detect, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switch, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and display the received handwritten message in a text staging region of the user interface in the keyboard entry mode.
|
A system for processing a handwritten message received by a messaging app can modify playback over time of the handwritten message based on a set of rules to determine how to modify the playback. In one embodiment, graphics data (e.g. vector graphics data) that represents the handwritten message is processed using the rules to determine how to modify the playback such that the resulting playback includes at least one modification over a portion of time of the playback.1. A non-transitory machine readable medium storing executable program instructions which, when executed by a processor, cause the processor to perform operations comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 2. The non-transitory machine readable medium of claim 1, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 3. The non-transitory machine readable medium of claim 1, wherein the switching comprises removing the on-screen keyboard. 4. The non-transitory machine readable medium of claim 1, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 5. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the operations further comprise:
receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 6. The non-transitory machine readable medium of claim 5, wherein the operations further comprise:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 7. The non-transitory machine readable medium of claim 1, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 8. A method, comprising:
displaying, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text; detecting, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; switching, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 9. The method of claim 8, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 10. The method of claim 8, wherein the switching comprises removing the on-screen keyboard. 11. The method of claim 8, wherein detecting the change comprises detecting the change using at least one of an accelerometer or a gyroscope of the communication device. 12. The method of claim 8, wherein the application is a messaging application, the method further comprising receiving a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 13. The method of claim 12, further comprising:
detecting, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switching, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and displaying the received handwritten message in a text staging region of the user interface in the keyboard entry mode. 14. The method of claim 8, wherein the application is a messaging application, and wherein the handwritten input canvas comprises:
a portion configured to receive a handwritten message; a scrollable set of recently sent handwritten messages; and a toggle button that, when selected, causes the user interface to switch back to the keyboard entry mode while the communication device is in the second orientation. 15. A device, comprising:
a memory; and one or more processors configured to:
display, with a communication device while the communication device is in a first orientation, a keyboard entry mode of a user interface of an application, the keyboard entry mode of the user interface including an on-screen keyboard for entry of text;
detect, with the communication device, a change in orientation of the communication device from the first orientation to a second orientation; and
switch, as a result of the change in orientation, the user interface of the application to a handwritten input mode from the keyboard entry mode, the handwritten input mode including a handwritten input canvas. 16. The device of claim 15, wherein the first orientation is a portrait orientation, and wherein the second orientation is a landscape orientation. 17. The device of claim 15, wherein the one or more processors are configured to switch the user interface of the application to the handwritten input mode, in part, by removing the on-screen keyboard. 18. The device of claim 15, further comprising at least one of an accelerometer or a gyroscope, wherein the one or more processors are configured to detect the change using the at least one of the accelerometer or the gyroscope. 19. The device of claim 15, wherein the application is a messaging application, and wherein one or more processors further configured to:
receive a handwritten message with the handwritten input canvas, the handwritten message including at least one stroke received at a touchscreen of the communication device. 20. The device of claim 19, wherein one or more processors further configured to:
detect, with the communication device after the handwritten message is received, a return of the orientation of the communication device from the second orientation to a first orientation; switch, as a result of the return of the orientation, the user interface of the application to the keyboard entry mode from the handwritten input mode; and display the received handwritten message in a text staging region of the user interface in the keyboard entry mode.
| 3,700
|
338,009
| 16,799,666
| 3,793
|
A fastening device for supporting, hanging, holding and threading, includes: a shank with an aperture formed therethrough which can but doesn't have to include a built up area of material around it. The shank has two ends one end (head) is configured to be driven into by a driving tool such as a hammer, for securing the second pointed end into a member for securing the shank therewithin.
|
1. A fastening device for supporting, hanging, holding and threading, comprising: a shank with an aperture formed therethrough; the shank has two ends one end (head) is configured to be driven into by a driving tool such as a hammer for securing; the second pointed end into a member for securing shank therewithin. 2. The fastening device of claim 1 further comprising: a support of a built up area of material on the shank of the device, which can be composed of the same material that the shank is composed of or made of a different material that is added to the shank, with an aperture formed therethrough. 3. A fastening device for supporting, hanging and holding or threading comprising: a built up head with an aperture formed therethrough, the head can be formed from the same or different material as the shank is composed of. The shank has two ends one end is embedded in the build up head that is configured to be driven into by a driving tool or by force, for securing the second pointed narrow end i.e tack) into a member for securing shank therewithin.
|
A fastening device for supporting, hanging, holding and threading, includes: a shank with an aperture formed therethrough which can but doesn't have to include a built up area of material around it. The shank has two ends one end (head) is configured to be driven into by a driving tool such as a hammer, for securing the second pointed end into a member for securing the shank therewithin.1. A fastening device for supporting, hanging, holding and threading, comprising: a shank with an aperture formed therethrough; the shank has two ends one end (head) is configured to be driven into by a driving tool such as a hammer for securing; the second pointed end into a member for securing shank therewithin. 2. The fastening device of claim 1 further comprising: a support of a built up area of material on the shank of the device, which can be composed of the same material that the shank is composed of or made of a different material that is added to the shank, with an aperture formed therethrough. 3. A fastening device for supporting, hanging and holding or threading comprising: a built up head with an aperture formed therethrough, the head can be formed from the same or different material as the shank is composed of. The shank has two ends one end is embedded in the build up head that is configured to be driven into by a driving tool or by force, for securing the second pointed narrow end i.e tack) into a member for securing shank therewithin.
| 3,700
|
338,010
| 16,799,627
| 3,793
|
Various embodiments of sensors are described that exhibit several spectral features that together offer coverage of a wavelength range corresponding to the desired strain dynamic range (or temperature range) of a system. The spectral features arise from a Fabry-Perot interferometer formed by two overlapping chirped FBGs, the free-spectral range (FSR) of which varies with wavelength. The spectral features may be differentiated due to a combination of spacing and slope of the overlapped, chirped gratings.
|
1. A sensing unit, comprising:
a first sensor comprising:
a first grating having a first chirp slope; and
a second grating having a second chirp slope,
wherein the first grating and the second grating are separated by a first spatial offset; and
a second sensor comprising:
a third grating having a first chirp slope; and
a fourth grating having a second chirp slope,
wherein the third grating and the fourth grating are separated by the fixed spatial offset. 2. The sensing unit of claim 1, wherein the first grating and the second grating overlap along a length of a support structure. 3. The sensing unit of claim 2, wherein the support structure is at least a portion of a fiber optic cable. 4. The sensing unit of claim 1, wherein the first sensor and the second sensor overlap along a length of a support structure. 5. The sensing unit of claim 1, wherein the first grating and the second grating do not overlap along a length of a support structure. 6. The sensing unit of claim 1, wherein the first sensor and the second sensor do not overlap along a length of a support structure. 7. An Optical Frequency-Domain Reflectometry (OFDR) system comprising:
at least one sensing unit; an optical source configured to sweep across a subset of a wide-band spectral response range of the at least one sensing unit; and a signal processor configured to inspect a spectral response of the sensing unit and infer one or more of an absolute wavelength shift associated with the sensing unit and a relative wavelength shift associated with the sensing unit. 8. The OFDR system of claim 7, wherein the sensing unit comprises:
a first sensor comprising:
a first grating having a first chirp slope; and
a second grating having a second chirp slope,
wherein the first grating and the second grating are separated by a first spatial offset; and
a second sensor comprising:
a third grating having a first chirp slope; and
a fourth grating having a second chirp slope,
wherein the third grating and the fourth grating are separated by the fixed spatial offset. 9. A method comprising:
sweeping an optical source across a subset of a wide-band spectral response range of a sensing unit; inspecting one or more of a period of a spectral response of the sensing unit and a phase of the spectral response of the sensing unit; and inferring an absolute wavelength shift of the sensing unit or a relative wavelength shift of the sensing unit. 10. The method of claim 9, further comprising:
inferring one or more of temperature and strain about an object of interest responsive to one or more of an inferred wavelength shift of the sensing unit and an inferred relative wavelength shift of the sensing unit.
|
Various embodiments of sensors are described that exhibit several spectral features that together offer coverage of a wavelength range corresponding to the desired strain dynamic range (or temperature range) of a system. The spectral features arise from a Fabry-Perot interferometer formed by two overlapping chirped FBGs, the free-spectral range (FSR) of which varies with wavelength. The spectral features may be differentiated due to a combination of spacing and slope of the overlapped, chirped gratings.1. A sensing unit, comprising:
a first sensor comprising:
a first grating having a first chirp slope; and
a second grating having a second chirp slope,
wherein the first grating and the second grating are separated by a first spatial offset; and
a second sensor comprising:
a third grating having a first chirp slope; and
a fourth grating having a second chirp slope,
wherein the third grating and the fourth grating are separated by the fixed spatial offset. 2. The sensing unit of claim 1, wherein the first grating and the second grating overlap along a length of a support structure. 3. The sensing unit of claim 2, wherein the support structure is at least a portion of a fiber optic cable. 4. The sensing unit of claim 1, wherein the first sensor and the second sensor overlap along a length of a support structure. 5. The sensing unit of claim 1, wherein the first grating and the second grating do not overlap along a length of a support structure. 6. The sensing unit of claim 1, wherein the first sensor and the second sensor do not overlap along a length of a support structure. 7. An Optical Frequency-Domain Reflectometry (OFDR) system comprising:
at least one sensing unit; an optical source configured to sweep across a subset of a wide-band spectral response range of the at least one sensing unit; and a signal processor configured to inspect a spectral response of the sensing unit and infer one or more of an absolute wavelength shift associated with the sensing unit and a relative wavelength shift associated with the sensing unit. 8. The OFDR system of claim 7, wherein the sensing unit comprises:
a first sensor comprising:
a first grating having a first chirp slope; and
a second grating having a second chirp slope,
wherein the first grating and the second grating are separated by a first spatial offset; and
a second sensor comprising:
a third grating having a first chirp slope; and
a fourth grating having a second chirp slope,
wherein the third grating and the fourth grating are separated by the fixed spatial offset. 9. A method comprising:
sweeping an optical source across a subset of a wide-band spectral response range of a sensing unit; inspecting one or more of a period of a spectral response of the sensing unit and a phase of the spectral response of the sensing unit; and inferring an absolute wavelength shift of the sensing unit or a relative wavelength shift of the sensing unit. 10. The method of claim 9, further comprising:
inferring one or more of temperature and strain about an object of interest responsive to one or more of an inferred wavelength shift of the sensing unit and an inferred relative wavelength shift of the sensing unit.
| 3,700
|
338,011
| 16,799,622
| 1,759
|
Single-walled nanotubes for use as additives in energetic materials, and methods for synthesizing such materials are described. The single-walled carbon nanotube (SWNT) additives comprise a mixture of high-purity SWNT and carbon encapsulated iron nanoparticles. The SWNT mixtures may comprise no more than 5% non-SWNT carbon, and the iron nanoparticles may be from 2-5 nm. The method of synthesizing the SWNTs may comprise a high-pressure carbon monoxide (HiPCO) process. The SWNT mixtures may be adapted for use as additives in energetic processes, such as, for example, rocket motors.
|
1. A solid rocket motor fuel comprising an energetic material and an opacifier, wherein the opacifier comprises a mixture of high-purity single-walled carbon nanotubes and non-oxidizable metallic nanoparticles. 2. The solid rocket motor fuel of claim 1, wherein no more than 5% of the carbon of the opacifier is non-single walled carbon nanotubes. 3. The solid rocket motor fuel of claim 1, wherein the metallic nanoparticles are from 2 to 5 nm in dimension. 4. The solid rocket motor fuel of claim 1, wherein the metallic nanoparticles are carbon encapsulated iron. 5. The solid rocket motor fuel of claim 4, wherein the metallic nanoparticles are encapsulated in a carbon fullerene material. 6. The solid rocket motor fuel of claim 1, wherein the metallic nanoparticles comprise no greater than 20% of the mass of the mixture. 7. The solid rocket motor fuel of claim 1, wherein the single-walled carbon nanotubes comprise at least 95% of the mass of carbon, wherein the metallic nanoparticles are carbon encapsulated iron comprising no greater than 20% of the mass of the mixture. 8. The solid rocket motor fuel of claim 1 increases the solid rocket motor impulse by about 4.5%. 9. The solid rocket motor fuel of claim 1 increases the solid rocket motor peak velocity by about 10.7%. 10. The solid rocket motor fuel of claim 1 increases the solid rocket motor peak acceleration by about 31.7%.
|
Single-walled nanotubes for use as additives in energetic materials, and methods for synthesizing such materials are described. The single-walled carbon nanotube (SWNT) additives comprise a mixture of high-purity SWNT and carbon encapsulated iron nanoparticles. The SWNT mixtures may comprise no more than 5% non-SWNT carbon, and the iron nanoparticles may be from 2-5 nm. The method of synthesizing the SWNTs may comprise a high-pressure carbon monoxide (HiPCO) process. The SWNT mixtures may be adapted for use as additives in energetic processes, such as, for example, rocket motors.1. A solid rocket motor fuel comprising an energetic material and an opacifier, wherein the opacifier comprises a mixture of high-purity single-walled carbon nanotubes and non-oxidizable metallic nanoparticles. 2. The solid rocket motor fuel of claim 1, wherein no more than 5% of the carbon of the opacifier is non-single walled carbon nanotubes. 3. The solid rocket motor fuel of claim 1, wherein the metallic nanoparticles are from 2 to 5 nm in dimension. 4. The solid rocket motor fuel of claim 1, wherein the metallic nanoparticles are carbon encapsulated iron. 5. The solid rocket motor fuel of claim 4, wherein the metallic nanoparticles are encapsulated in a carbon fullerene material. 6. The solid rocket motor fuel of claim 1, wherein the metallic nanoparticles comprise no greater than 20% of the mass of the mixture. 7. The solid rocket motor fuel of claim 1, wherein the single-walled carbon nanotubes comprise at least 95% of the mass of carbon, wherein the metallic nanoparticles are carbon encapsulated iron comprising no greater than 20% of the mass of the mixture. 8. The solid rocket motor fuel of claim 1 increases the solid rocket motor impulse by about 4.5%. 9. The solid rocket motor fuel of claim 1 increases the solid rocket motor peak velocity by about 10.7%. 10. The solid rocket motor fuel of claim 1 increases the solid rocket motor peak acceleration by about 31.7%.
| 1,700
|
338,012
| 16,799,612
| 1,759
|
Embodiments of the disclosure relate to a ferritic alloy having excellent ability to withstand nuclear power plant accidents and a method of manufacturing a nuclear fuel cladding tube using the same. The alloy includes iron (Fe), aluminum (Al), chromium (Cr), and nickel (Ni). The nickel (Ni) may be included 0.5 to 10 wt % based on a total amount of the alloy. The chromium may be included 13 to 18 wt % based on the total amount of the alloy. The aluminum may be included 5 to 7 wt % based on the total amount of the alloy.
|
1. A ferritic alloy comprising:
iron (Fe), aluminum (Al), chromium (Cr), and nickel (Ni), wherein the nickel (Ni) is included 0.5 to 10 wt % based on a total amount of the alloy. 2. The ferritic alloy of claim 1, wherein the chromium is included 13 to 18 wt % based on the total amount of the alloy. 3. The ferritic alloy of claim 1, wherein the aluminum is included 5 to 7 wt % based on the total amount of the alloy. 4. The ferritic alloy of claim 1, further comprising:
yttrium. 5. The ferritic alloy of claim 1, further comprising:
manganese. 6. The ferritic alloy of claim 1, further comprising:
carbon. 7. A method of manufacturing a nuclear fuel cladding tube, the method comprising:
melting the ferritic alloy of claim 1 (first step); re-melting the melted alloy of the first step (second step); initially heat-treating the re-melted alloy of the second step (third step); forging the heat-treated alloy of the third step (fourth step); hot rolling the forged alloy of the fourth step (fifth step); intermediately heat-treating the hot rolled alloy of the fifth step (sixth step); drilling the heat-treated alloy of the sixth step (seventh step); pilgering the drilled alloy of the seventh step (eighth step); and finally heat-treating the pilgered alloy of the eighth step (ninth step). 8. The method of claim 7, wherein the melting of the first step is performed using a vacuum-induction melting furnace. 9. The method of claim 8, wherein the re-melting of the second step is performed using electric slag re-melting. 10. The method of claim 7, wherein the melting of the first step and the re-melting of the second step are performed using a vacuum-arc re-melting furnace. 11. The method of claim 7, wherein the forging of the fourth step is performed at 950 to 1200° C. 12. The method of claim 7, wherein the hot rolling of the fifth step is performed at 950 to 1100° C. 13. The method of claim 7, wherein the intermediately heat-treating of the sixth step is performed at 950 to 1050° C. 14. The method of claim 7, wherein a cold pilgering process of the eighth step is performed using 3-roll pilgering at room temperature. 15. The method of claim 7, wherein a final-heat-treating process of the ninth step is performed at 600 to 700° C.
|
Embodiments of the disclosure relate to a ferritic alloy having excellent ability to withstand nuclear power plant accidents and a method of manufacturing a nuclear fuel cladding tube using the same. The alloy includes iron (Fe), aluminum (Al), chromium (Cr), and nickel (Ni). The nickel (Ni) may be included 0.5 to 10 wt % based on a total amount of the alloy. The chromium may be included 13 to 18 wt % based on the total amount of the alloy. The aluminum may be included 5 to 7 wt % based on the total amount of the alloy.1. A ferritic alloy comprising:
iron (Fe), aluminum (Al), chromium (Cr), and nickel (Ni), wherein the nickel (Ni) is included 0.5 to 10 wt % based on a total amount of the alloy. 2. The ferritic alloy of claim 1, wherein the chromium is included 13 to 18 wt % based on the total amount of the alloy. 3. The ferritic alloy of claim 1, wherein the aluminum is included 5 to 7 wt % based on the total amount of the alloy. 4. The ferritic alloy of claim 1, further comprising:
yttrium. 5. The ferritic alloy of claim 1, further comprising:
manganese. 6. The ferritic alloy of claim 1, further comprising:
carbon. 7. A method of manufacturing a nuclear fuel cladding tube, the method comprising:
melting the ferritic alloy of claim 1 (first step); re-melting the melted alloy of the first step (second step); initially heat-treating the re-melted alloy of the second step (third step); forging the heat-treated alloy of the third step (fourth step); hot rolling the forged alloy of the fourth step (fifth step); intermediately heat-treating the hot rolled alloy of the fifth step (sixth step); drilling the heat-treated alloy of the sixth step (seventh step); pilgering the drilled alloy of the seventh step (eighth step); and finally heat-treating the pilgered alloy of the eighth step (ninth step). 8. The method of claim 7, wherein the melting of the first step is performed using a vacuum-induction melting furnace. 9. The method of claim 8, wherein the re-melting of the second step is performed using electric slag re-melting. 10. The method of claim 7, wherein the melting of the first step and the re-melting of the second step are performed using a vacuum-arc re-melting furnace. 11. The method of claim 7, wherein the forging of the fourth step is performed at 950 to 1200° C. 12. The method of claim 7, wherein the hot rolling of the fifth step is performed at 950 to 1100° C. 13. The method of claim 7, wherein the intermediately heat-treating of the sixth step is performed at 950 to 1050° C. 14. The method of claim 7, wherein a cold pilgering process of the eighth step is performed using 3-roll pilgering at room temperature. 15. The method of claim 7, wherein a final-heat-treating process of the ninth step is performed at 600 to 700° C.
| 1,700
|
338,013
| 16,799,593
| 1,759
|
Resource migration negotiation is disclosed. A request is received, from a remote physical node in a plurality of physical nodes, for a resource. An operating system is run collectively across the plurality of physical nodes. The request includes information pertaining to a guest thread running on the remote physical node. Based at least in part on at least some of the information included in the request, it is determined whether to send the requested resource or reject the request. A response is provided based at least in part on the determination.
|
1. A computer system, comprising:
a plurality of interconnected computing nodes, wherein a guest operating system is run on a virtual environment that is defined by a set of hyper-kernels running on the plurality of interconnected computing nodes; wherein a request for a resource made by a hyper-kernel on a first computing node is received at a second computing node that owns the resource; wherein in response to receiving the request for the resource made by the hyper-kernel on the first computing node, a hyper-kernel on the second computing node determines, at least in part by evaluating a set of owner-side cost functions, whether to send the resource or reject the request; and wherein the hyper-kernel on the second computing node provides a response based at least in part on the determination of whether to send the resource or reject the request. 2. The computer system recited in claim 1 wherein the hyper-kernel on the second computing node determines, based at least in part on the evaluating of the set of owner-side cost functions, a cost of sending the resource and a cost of rejecting the request. 3. The computer system recited in claim 2 wherein the cost of sending the resource is determined to be less than the cost of rejecting the request, and wherein the response comprises sending the resource to the first computing node. 4. The computer system recited in claim 2 wherein the cost of rejecting the request is determined to be less than the cost of sending the resource, and wherein the response comprises sending, to the first computing node, a message indicating rejection of the request. 5. The computer system recited in claim 4 wherein the message includes a reason for rejection of the request. 6. The computer system recited in claim 4 wherein based at least in part on the message indicating rejection of the request, the hyper-kernel on the first computing node migrates a virtual processor to the second computing node. 7. The computer system recited in claim 2 wherein an owner-side cost function comprises one or more owner-side cost terms. 8. The computer system recited in claim 7 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with an indication of whether the portion of memory is in use by a non-moveable device. 9. The computer system recited in claim 7 wherein the request is associated with a requesting guest thread running on the first computing node, and wherein an owner-side cost term is associated with an efficiency of the requesting guest thread. 10. The computer system recited in claim 7 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with a warmth of the portion of memory. 11. A method, comprising:
receiving a request for a resource made by a hyper-kernel on a first computing node, wherein the request is received at a second computing node that owns the resource, wherein the first computing node and the second computing node are included in a plurality of interconnected computing nodes, and wherein a guest operating system is run on a virtual environment that is defined by a set of hyper-kernels running on the plurality of interconnected computing nodes; in response to receiving the request for the resource made by the hyper-kernel on the first computing node, determining, by a hyper-kernel on the second computing node determines, whether to send the resource or reject the request, wherein whether to send the resource or reject the request is determined at least in part by evaluating a set of owner-side cost functions; and providing, by the hyper-kernel on the second computing node, a response based at least in part on the determination of whether to send the resource or reject the request. 12. The method of claim 11 further comprising, based at least in part on the evaluating of the set of owner-side cost functions, determining, by the hyper-kernel on the second computing node determines, a cost of sending the resource and a cost of rejecting the request. 13. The method of claim 12 wherein the cost of sending the resource is determined to be less than the cost of rejecting the request, and wherein the response comprises sending the resource to the first computing node. 14. The method of claim 12 wherein the cost of rejecting the request is determined to be less than the cost of sending the resource, and wherein the response comprises sending, to the first computing node, a message indicating rejection of the request. 15. The method of claim 14 wherein the message includes a reason for rejection of the request. 16. The method of claim 14 wherein based at least in part on the message indicating rejection of the request, the hyper-kernel on the first computing node migrates a virtual processor to the second computing node. 17. The method of claim 12 wherein an owner-side cost function comprises one or more owner-side cost terms. 18. The method of claim 17 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with an indication of whether the portion of memory is in use by a non-moveable device. 19. The method of claim 17 wherein the request is associated with a requesting guest thread running on the first computing node, and wherein an owner-side cost term is associated with an efficiency of the requesting guest thread. 20. The method of claim 17 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with a warmth of the portion of memory.
|
Resource migration negotiation is disclosed. A request is received, from a remote physical node in a plurality of physical nodes, for a resource. An operating system is run collectively across the plurality of physical nodes. The request includes information pertaining to a guest thread running on the remote physical node. Based at least in part on at least some of the information included in the request, it is determined whether to send the requested resource or reject the request. A response is provided based at least in part on the determination.1. A computer system, comprising:
a plurality of interconnected computing nodes, wherein a guest operating system is run on a virtual environment that is defined by a set of hyper-kernels running on the plurality of interconnected computing nodes; wherein a request for a resource made by a hyper-kernel on a first computing node is received at a second computing node that owns the resource; wherein in response to receiving the request for the resource made by the hyper-kernel on the first computing node, a hyper-kernel on the second computing node determines, at least in part by evaluating a set of owner-side cost functions, whether to send the resource or reject the request; and wherein the hyper-kernel on the second computing node provides a response based at least in part on the determination of whether to send the resource or reject the request. 2. The computer system recited in claim 1 wherein the hyper-kernel on the second computing node determines, based at least in part on the evaluating of the set of owner-side cost functions, a cost of sending the resource and a cost of rejecting the request. 3. The computer system recited in claim 2 wherein the cost of sending the resource is determined to be less than the cost of rejecting the request, and wherein the response comprises sending the resource to the first computing node. 4. The computer system recited in claim 2 wherein the cost of rejecting the request is determined to be less than the cost of sending the resource, and wherein the response comprises sending, to the first computing node, a message indicating rejection of the request. 5. The computer system recited in claim 4 wherein the message includes a reason for rejection of the request. 6. The computer system recited in claim 4 wherein based at least in part on the message indicating rejection of the request, the hyper-kernel on the first computing node migrates a virtual processor to the second computing node. 7. The computer system recited in claim 2 wherein an owner-side cost function comprises one or more owner-side cost terms. 8. The computer system recited in claim 7 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with an indication of whether the portion of memory is in use by a non-moveable device. 9. The computer system recited in claim 7 wherein the request is associated with a requesting guest thread running on the first computing node, and wherein an owner-side cost term is associated with an efficiency of the requesting guest thread. 10. The computer system recited in claim 7 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with a warmth of the portion of memory. 11. A method, comprising:
receiving a request for a resource made by a hyper-kernel on a first computing node, wherein the request is received at a second computing node that owns the resource, wherein the first computing node and the second computing node are included in a plurality of interconnected computing nodes, and wherein a guest operating system is run on a virtual environment that is defined by a set of hyper-kernels running on the plurality of interconnected computing nodes; in response to receiving the request for the resource made by the hyper-kernel on the first computing node, determining, by a hyper-kernel on the second computing node determines, whether to send the resource or reject the request, wherein whether to send the resource or reject the request is determined at least in part by evaluating a set of owner-side cost functions; and providing, by the hyper-kernel on the second computing node, a response based at least in part on the determination of whether to send the resource or reject the request. 12. The method of claim 11 further comprising, based at least in part on the evaluating of the set of owner-side cost functions, determining, by the hyper-kernel on the second computing node determines, a cost of sending the resource and a cost of rejecting the request. 13. The method of claim 12 wherein the cost of sending the resource is determined to be less than the cost of rejecting the request, and wherein the response comprises sending the resource to the first computing node. 14. The method of claim 12 wherein the cost of rejecting the request is determined to be less than the cost of sending the resource, and wherein the response comprises sending, to the first computing node, a message indicating rejection of the request. 15. The method of claim 14 wherein the message includes a reason for rejection of the request. 16. The method of claim 14 wherein based at least in part on the message indicating rejection of the request, the hyper-kernel on the first computing node migrates a virtual processor to the second computing node. 17. The method of claim 12 wherein an owner-side cost function comprises one or more owner-side cost terms. 18. The method of claim 17 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with an indication of whether the portion of memory is in use by a non-moveable device. 19. The method of claim 17 wherein the request is associated with a requesting guest thread running on the first computing node, and wherein an owner-side cost term is associated with an efficiency of the requesting guest thread. 20. The method of claim 17 wherein the requested resource comprises a portion of memory, and wherein an owner-side cost term is associated with a warmth of the portion of memory.
| 1,700
|
338,014
| 16,799,603
| 1,759
|
The frequency band of an uplink channel of the first node is identical to the frequency band of a downlink channel of the second node. The frequency band of the uplink channel of the first node is different from the frequency band of a downlink channel of the first node. Uplink data from the terminal is received through the uplink channel of the first node; when the terminal is an intra-frequency terminal, downlink data is transmitted to the terminal through the downlink channel of the second node; and when the terminal is an inter-frequency terminal, downlink data is transmitted to the terminal through the downlink channel of the first node. The wireless communication method is compatible with intra-frequency terminals and inter-frequency terminals, and the inter-frequency terminal transmits uplink data through the first node and receive downlink data through the second node, thus implementing duplex communication and improving communication efficiency.
|
1. A wireless communication method applied to a wireless network, the wireless network including a terminal, a first node, and a second node, the method comprising:
receiving uplink data from the terminal through an uplink channel of the first node, a frequency band of the uplink channel of the first node being identical to a frequency band of a downlink channel of the second node, the frequency band of the uplink channel of the first node being different from the frequency band of a downlink channel of the first node; determining a type of the terminal; and
in response to determining that the terminal is an intra-frequency terminal, transmitting downlink data to the terminal through the downlink channel of the second node;
in response to determining that the terminal is an inter-frequency terminal, transmitting the downlink data to the terminal through the downlink channel of the first node. 2. The method according to claim 1, wherein the downlink data is data generated by the first node according to the uplink data. 3. The method according to claim 1, wherein:
the wireless network further comprises an application terminal; and the downlink data is data generated by the application terminal according to the uplink data received through the first node. 4. The method according to claim 1, wherein the determining the type of the terminal includes:
obtaining type information of the terminal from the uplink data or according to a terminal identifier reported by the terminal; and in response to determining that the type information indicates an intra-frequency terminal, determining that the terminal is an intra-frequency terminal. 5. The method according to claim 1, wherein the determining the type of the terminal includes:
obtaining type information of the terminal from the uplink data or according to a terminal identifier reported by the terminal; and in response to determining that the type information indicates an inter-frequency terminal, determining that the terminal is an inter-frequency terminal. 6. The method according to claim 1, further comprising configuring the uplink and downlink channels of the first node and the second node, the configuring including:
obtaining a communication frequency band of the wireless network; dividing the communication frequency band into a plurality of sub-bands; determining at least one first frequency band from the plurality of sub-bands, the at least one first frequency band being a frequency band used by the first node to receive uplink data of the inter-frequency terminal; and determining at least one second frequency band from the plurality of sub-bands, the at least one second frequency band being a frequency band used by the first node to receive uplink data of the intra-frequency terminal and used by the second node to transmit the downlink data to the intra-frequency terminal. 7. The method according to claim 6, wherein the configuring further includes:
determining at least one third frequency band from the plurality of sub-bands, the at least one third frequency band being a frequency band used by the second node to receive the uplink data of the inter-frequency terminal. 8. The method according to claim 7, wherein the configuring further includes:
determining at least one fourth frequency band from the plurality of sub-bands, the at least one fourth frequency band being a frequency band used by the second node to receive the uplink data of the intra-frequency terminal and used by the first node to transmit the downlink data to the intra-frequency terminal. 9. The method according to claim 8, wherein the configuring further includes:
respectively dividing the at least one first frequency band, the at least one second frequency band, the at least one third frequency band, and the at least one fourth frequency band into a plurality of channels according to a preset channel division rule. 10. The method according to claim 9, wherein:
the first frequency band and the second frequency band are partially overlapped or completely overlapped; and the third frequency band and the fourth frequency band are partially overlapped or completely overlapped. 11. The method according to clause 1, wherein the transmitting the downlink data to the terminal through the downlink channel of the second node includes:
determining a second node having a communication distance covering the intra-frequency terminal; transmitting the downlink data to the second node; and transmitting, by the second node, the downlink data to the terminal through the downlink channel. 12. A device comprising:
one or more processors; and one or more memories storing computer-readable instructions that, executable by the one or more processors, cause the one or more processors to perform acts comprising:
determining that a preset trigger event is detected or a preset time is reached;
transmitting uplink data to a first node through an uplink channel of a first node, a frequency band of the uplink channel of the first node being identical to a frequency band of a downlink channel of a second node, the frequency band of the uplink channel of the first node being different from the frequency band of a downlink channel of the first node;
determining a type of a terminal; and
in response to determining that the terminal is an intra-frequency terminal, receiving downlink data from the downlink channel of the second node; or
in response to determining that the terminal is an inter-frequency terminal, receiving downlink data from the downlink channel of the first node. 13. The device according to claim 12, wherein the downlink data is data generated by the first node according to the uplink data. 14. The device according to claim 12, wherein the downlink data is data generated by an application terminal according to the uplink data received through the first node. 15. The device according to claim 12, wherein the receiving the downlink data from the downlink channel of the second node includes:
receiving a request for establishing the downlink channel from the second node; establishing the downlink channel with the second node; and receiving the downlink data through the downlink channel of the second node. 16. The device according to claim 12, wherein the acts further comprise configuring the uplink and downlink channels of the first node and the second node, the configuring including:
obtaining a communication frequency band of the wireless network; dividing the communication frequency band into a plurality of sub-bands; determining at least one first frequency band from the plurality of sub-bands, the at least one first frequency band being a frequency band used by the first node to receive uplink data of the inter-frequency terminal; and determining at least one second frequency band from the plurality of sub-bands, the at least one second frequency band being a frequency band used by the first node to receive uplink data of the intra-frequency terminal and used by the second node to transmit the downlink data to the intra-frequency terminal. 17. The device according to claim 16, wherein the configuring further includes:
determining at least one third frequency band from the plurality of sub-bands, the at least one third frequency band being a frequency band used by the second node to receive the uplink data of the inter-frequency terminal; and determining at least one fourth frequency band from the plurality of sub-bands, the at least one fourth frequency band being a frequency band used by the second node to receive the uplink data of the intra-frequency terminal and used by the first node to transmit the downlink data to the intra-frequency terminal. 18. The device according to claim 17, wherein the configuring further includes:
respectively dividing the at least one first frequency band, the at least one second frequency band, the at least one third frequency band, and the at least one fourth frequency band into a plurality of channels according to a preset channel division rule. 19. The device according to claim 18, wherein:
the first frequency band and the second frequency band are partially overlapped or completely overlapped; and the third frequency band and the fourth frequency band are partially overlapped or completely overlapped. 20. One or more memories storing computer-readable instructions that, executable by one or more processors, cause the one or more processors to perform acts comprising:
receiving uplink data from a terminal through an uplink channel of a first node, a frequency band of the uplink channel of the first node being identical to a frequency band of a downlink channel of a second node, the frequency band of the uplink channel of the first node being different from the frequency band of a downlink channel of the first node; determining that the terminal is an intra-frequency terminal; and transmitting downlink data to the terminal through the downlink channel of the second node.
|
The frequency band of an uplink channel of the first node is identical to the frequency band of a downlink channel of the second node. The frequency band of the uplink channel of the first node is different from the frequency band of a downlink channel of the first node. Uplink data from the terminal is received through the uplink channel of the first node; when the terminal is an intra-frequency terminal, downlink data is transmitted to the terminal through the downlink channel of the second node; and when the terminal is an inter-frequency terminal, downlink data is transmitted to the terminal through the downlink channel of the first node. The wireless communication method is compatible with intra-frequency terminals and inter-frequency terminals, and the inter-frequency terminal transmits uplink data through the first node and receive downlink data through the second node, thus implementing duplex communication and improving communication efficiency.1. A wireless communication method applied to a wireless network, the wireless network including a terminal, a first node, and a second node, the method comprising:
receiving uplink data from the terminal through an uplink channel of the first node, a frequency band of the uplink channel of the first node being identical to a frequency band of a downlink channel of the second node, the frequency band of the uplink channel of the first node being different from the frequency band of a downlink channel of the first node; determining a type of the terminal; and
in response to determining that the terminal is an intra-frequency terminal, transmitting downlink data to the terminal through the downlink channel of the second node;
in response to determining that the terminal is an inter-frequency terminal, transmitting the downlink data to the terminal through the downlink channel of the first node. 2. The method according to claim 1, wherein the downlink data is data generated by the first node according to the uplink data. 3. The method according to claim 1, wherein:
the wireless network further comprises an application terminal; and the downlink data is data generated by the application terminal according to the uplink data received through the first node. 4. The method according to claim 1, wherein the determining the type of the terminal includes:
obtaining type information of the terminal from the uplink data or according to a terminal identifier reported by the terminal; and in response to determining that the type information indicates an intra-frequency terminal, determining that the terminal is an intra-frequency terminal. 5. The method according to claim 1, wherein the determining the type of the terminal includes:
obtaining type information of the terminal from the uplink data or according to a terminal identifier reported by the terminal; and in response to determining that the type information indicates an inter-frequency terminal, determining that the terminal is an inter-frequency terminal. 6. The method according to claim 1, further comprising configuring the uplink and downlink channels of the first node and the second node, the configuring including:
obtaining a communication frequency band of the wireless network; dividing the communication frequency band into a plurality of sub-bands; determining at least one first frequency band from the plurality of sub-bands, the at least one first frequency band being a frequency band used by the first node to receive uplink data of the inter-frequency terminal; and determining at least one second frequency band from the plurality of sub-bands, the at least one second frequency band being a frequency band used by the first node to receive uplink data of the intra-frequency terminal and used by the second node to transmit the downlink data to the intra-frequency terminal. 7. The method according to claim 6, wherein the configuring further includes:
determining at least one third frequency band from the plurality of sub-bands, the at least one third frequency band being a frequency band used by the second node to receive the uplink data of the inter-frequency terminal. 8. The method according to claim 7, wherein the configuring further includes:
determining at least one fourth frequency band from the plurality of sub-bands, the at least one fourth frequency band being a frequency band used by the second node to receive the uplink data of the intra-frequency terminal and used by the first node to transmit the downlink data to the intra-frequency terminal. 9. The method according to claim 8, wherein the configuring further includes:
respectively dividing the at least one first frequency band, the at least one second frequency band, the at least one third frequency band, and the at least one fourth frequency band into a plurality of channels according to a preset channel division rule. 10. The method according to claim 9, wherein:
the first frequency band and the second frequency band are partially overlapped or completely overlapped; and the third frequency band and the fourth frequency band are partially overlapped or completely overlapped. 11. The method according to clause 1, wherein the transmitting the downlink data to the terminal through the downlink channel of the second node includes:
determining a second node having a communication distance covering the intra-frequency terminal; transmitting the downlink data to the second node; and transmitting, by the second node, the downlink data to the terminal through the downlink channel. 12. A device comprising:
one or more processors; and one or more memories storing computer-readable instructions that, executable by the one or more processors, cause the one or more processors to perform acts comprising:
determining that a preset trigger event is detected or a preset time is reached;
transmitting uplink data to a first node through an uplink channel of a first node, a frequency band of the uplink channel of the first node being identical to a frequency band of a downlink channel of a second node, the frequency band of the uplink channel of the first node being different from the frequency band of a downlink channel of the first node;
determining a type of a terminal; and
in response to determining that the terminal is an intra-frequency terminal, receiving downlink data from the downlink channel of the second node; or
in response to determining that the terminal is an inter-frequency terminal, receiving downlink data from the downlink channel of the first node. 13. The device according to claim 12, wherein the downlink data is data generated by the first node according to the uplink data. 14. The device according to claim 12, wherein the downlink data is data generated by an application terminal according to the uplink data received through the first node. 15. The device according to claim 12, wherein the receiving the downlink data from the downlink channel of the second node includes:
receiving a request for establishing the downlink channel from the second node; establishing the downlink channel with the second node; and receiving the downlink data through the downlink channel of the second node. 16. The device according to claim 12, wherein the acts further comprise configuring the uplink and downlink channels of the first node and the second node, the configuring including:
obtaining a communication frequency band of the wireless network; dividing the communication frequency band into a plurality of sub-bands; determining at least one first frequency band from the plurality of sub-bands, the at least one first frequency band being a frequency band used by the first node to receive uplink data of the inter-frequency terminal; and determining at least one second frequency band from the plurality of sub-bands, the at least one second frequency band being a frequency band used by the first node to receive uplink data of the intra-frequency terminal and used by the second node to transmit the downlink data to the intra-frequency terminal. 17. The device according to claim 16, wherein the configuring further includes:
determining at least one third frequency band from the plurality of sub-bands, the at least one third frequency band being a frequency band used by the second node to receive the uplink data of the inter-frequency terminal; and determining at least one fourth frequency band from the plurality of sub-bands, the at least one fourth frequency band being a frequency band used by the second node to receive the uplink data of the intra-frequency terminal and used by the first node to transmit the downlink data to the intra-frequency terminal. 18. The device according to claim 17, wherein the configuring further includes:
respectively dividing the at least one first frequency band, the at least one second frequency band, the at least one third frequency band, and the at least one fourth frequency band into a plurality of channels according to a preset channel division rule. 19. The device according to claim 18, wherein:
the first frequency band and the second frequency band are partially overlapped or completely overlapped; and the third frequency band and the fourth frequency band are partially overlapped or completely overlapped. 20. One or more memories storing computer-readable instructions that, executable by one or more processors, cause the one or more processors to perform acts comprising:
receiving uplink data from a terminal through an uplink channel of a first node, a frequency band of the uplink channel of the first node being identical to a frequency band of a downlink channel of a second node, the frequency band of the uplink channel of the first node being different from the frequency band of a downlink channel of the first node; determining that the terminal is an intra-frequency terminal; and transmitting downlink data to the terminal through the downlink channel of the second node.
| 1,700
|
338,015
| 16,799,659
| 1,759
|
An information processing apparatus includes a setting unit configured to set an imaging condition under which an imaging apparatus captures a video, a region determination unit configured to determine a detectable region in which a detection target is detectable in the video, based on the imaging condition, an acquisition unit configured to acquire a desired detection condition under which a user desires detection for the detection target to be executed, and a condition determination unit configured to determine a detection condition under which the detection target is detected from the video, based on the desired detection condition and the detectable region determined based on at least one imaging condition.
|
1. An information processing apparatus comprising:
a setting unit configured to set an imaging condition under which an imaging apparatus captures a video; a region determination unit configured to determine a detectable region in which a detection target is detectable in the video, based on the imaging condition; an acquisition unit configured to acquire a desired detection condition under which a user desires detection for a detection target to be executed; and a condition determination unit configured to determine a detection condition under which the detection target is detected from the video, based on the desired detection condition and the detectable region determined based on at least one imaging condition. 2. The information processing apparatus according to claim 1, further comprising a detection unit configured to detect a detection target from an input video based on the detection condition. 3. The information processing apparatus according to claim 1, wherein the acquisition unit acquires the desired detection condition including a desired detection region in which a user desires detection for the detection target to be executed. 4. The information processing apparatus according to claim 1, wherein the detection condition includes a detection region being a region in a video in which the detection is to be executed. 5. The information processing apparatus according to claim 1, further comprising a display unit configured to display at least one of the detectable region, the desired detection condition, or the detection condition. 6. The information processing apparatus according to claim 1,
wherein the imaging condition includes an imaging direction of the imaging apparatus, and wherein the region determination unit determines the detectable region based on the imaging direction. 7. The information processing apparatus according to claim 1,
wherein the setting unit sets a set of predetermined conditions as the imaging condition, and wherein the region determination unit determines the detectable region for each of the predetermined conditions in the set. 8. The information processing apparatus according to claim 7, wherein the condition determination unit selects and determines at least one detection condition from among detection conditions determined based on the respective detectable regions. 9. The information processing apparatus according to claim 8, wherein the condition determination unit selects the detection condition based on an area of a portion of the detectable region that conforms to the desired detection condition. 10. The information processing apparatus according to claim 1, wherein the region determination unit determines the detectable region based on a result obtained by analyzing a video for analysis that has been captured in advance by the imaging apparatus. 11. The information processing apparatus according to claim 10, wherein the region determination unit estimates a distribution of appearance of the detection target based on the video for analysis, and determines the detectable region based on the distribution. 12. The information processing apparatus according to claim 10, wherein the video for analysis is a video captured for each of a plurality of different imaging conditions set by the setting unit. 13. The information processing apparatus according to claim 1, wherein the region determination unit determines a plurality of detectable regions for a plurality of videos captured by the imaging apparatus. 14. The information processing apparatus according to claim 13, wherein the region determination unit determines the detectable region based on a video including a focused image capturing point designated by a user, among the plurality of videos captured by the imaging apparatus. 15. The information processing apparatus according to claim 1, wherein the condition determination unit determines the detection condition based on a plurality of detectable regions. 16. The information processing apparatus according to claim 1,
wherein the region determination unit determines respective detectable regions for a plurality of detection targets, and wherein the condition determination unit determines a detection condition based on the respective detectable regions determined for the plurality of respective detection targets. 17. The information processing apparatus according to claim 16, wherein the condition determination unit sets priorities designated by a user to a plurality of the detectable regions determined for the plurality of respective detection targets, and determines the detection condition. 18. The information processing apparatus according to claim 1, wherein the acquisition unit acquires the desired detection condition that includes a detection region including a caution point that is based on environmental information. 19. An information processing apparatus method comprising:
setting an imaging condition under which an imaging apparatus captures a video; determining a detectable region in which a detection target is detectable in the video, based on the imaging condition; acquiring a desired detection condition under which a user desires detection for the detection target to be executed; and determining a detection condition under which the detection target is detected from the video, based on the desired detection condition and the detectable region determined based on at least one imaging condition. 20. A non-transitory computer-readable storage medium storing a program for causing a computer to function as each unit of the information processing apparatus according to claim 1.
|
An information processing apparatus includes a setting unit configured to set an imaging condition under which an imaging apparatus captures a video, a region determination unit configured to determine a detectable region in which a detection target is detectable in the video, based on the imaging condition, an acquisition unit configured to acquire a desired detection condition under which a user desires detection for the detection target to be executed, and a condition determination unit configured to determine a detection condition under which the detection target is detected from the video, based on the desired detection condition and the detectable region determined based on at least one imaging condition.1. An information processing apparatus comprising:
a setting unit configured to set an imaging condition under which an imaging apparatus captures a video; a region determination unit configured to determine a detectable region in which a detection target is detectable in the video, based on the imaging condition; an acquisition unit configured to acquire a desired detection condition under which a user desires detection for a detection target to be executed; and a condition determination unit configured to determine a detection condition under which the detection target is detected from the video, based on the desired detection condition and the detectable region determined based on at least one imaging condition. 2. The information processing apparatus according to claim 1, further comprising a detection unit configured to detect a detection target from an input video based on the detection condition. 3. The information processing apparatus according to claim 1, wherein the acquisition unit acquires the desired detection condition including a desired detection region in which a user desires detection for the detection target to be executed. 4. The information processing apparatus according to claim 1, wherein the detection condition includes a detection region being a region in a video in which the detection is to be executed. 5. The information processing apparatus according to claim 1, further comprising a display unit configured to display at least one of the detectable region, the desired detection condition, or the detection condition. 6. The information processing apparatus according to claim 1,
wherein the imaging condition includes an imaging direction of the imaging apparatus, and wherein the region determination unit determines the detectable region based on the imaging direction. 7. The information processing apparatus according to claim 1,
wherein the setting unit sets a set of predetermined conditions as the imaging condition, and wherein the region determination unit determines the detectable region for each of the predetermined conditions in the set. 8. The information processing apparatus according to claim 7, wherein the condition determination unit selects and determines at least one detection condition from among detection conditions determined based on the respective detectable regions. 9. The information processing apparatus according to claim 8, wherein the condition determination unit selects the detection condition based on an area of a portion of the detectable region that conforms to the desired detection condition. 10. The information processing apparatus according to claim 1, wherein the region determination unit determines the detectable region based on a result obtained by analyzing a video for analysis that has been captured in advance by the imaging apparatus. 11. The information processing apparatus according to claim 10, wherein the region determination unit estimates a distribution of appearance of the detection target based on the video for analysis, and determines the detectable region based on the distribution. 12. The information processing apparatus according to claim 10, wherein the video for analysis is a video captured for each of a plurality of different imaging conditions set by the setting unit. 13. The information processing apparatus according to claim 1, wherein the region determination unit determines a plurality of detectable regions for a plurality of videos captured by the imaging apparatus. 14. The information processing apparatus according to claim 13, wherein the region determination unit determines the detectable region based on a video including a focused image capturing point designated by a user, among the plurality of videos captured by the imaging apparatus. 15. The information processing apparatus according to claim 1, wherein the condition determination unit determines the detection condition based on a plurality of detectable regions. 16. The information processing apparatus according to claim 1,
wherein the region determination unit determines respective detectable regions for a plurality of detection targets, and wherein the condition determination unit determines a detection condition based on the respective detectable regions determined for the plurality of respective detection targets. 17. The information processing apparatus according to claim 16, wherein the condition determination unit sets priorities designated by a user to a plurality of the detectable regions determined for the plurality of respective detection targets, and determines the detection condition. 18. The information processing apparatus according to claim 1, wherein the acquisition unit acquires the desired detection condition that includes a detection region including a caution point that is based on environmental information. 19. An information processing apparatus method comprising:
setting an imaging condition under which an imaging apparatus captures a video; determining a detectable region in which a detection target is detectable in the video, based on the imaging condition; acquiring a desired detection condition under which a user desires detection for the detection target to be executed; and determining a detection condition under which the detection target is detected from the video, based on the desired detection condition and the detectable region determined based on at least one imaging condition. 20. A non-transitory computer-readable storage medium storing a program for causing a computer to function as each unit of the information processing apparatus according to claim 1.
| 1,700
|
338,016
| 16,799,663
| 1,759
|
A resonator fiber optic gyroscope (RFOG) that includes at least one laser, a resonator and a resonator hopping control system is provided. The resonator is in operational communication with the at least one laser to receive a clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser. The resonance hopping control system is in communication with an output of the resonator and the at least one laser. The resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries.
|
1. A resonator fiber optic gyroscope (RFOG) comprising:
at least one laser; a resonator in operational communication with the at least one laser to receive clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser; and a resonance hopping control system in communication with an output of the resonator and the at least one laser, the resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries. 2. The RFOG of claim 1, wherein the at least one laser further comprises:
a master laser operationally controlled by the resonance hopping control system; a first slave laser to generate the CW laser light in the resonator, the first slave laser operationally controlled by the master laser; and a second slave laser to generate the CCW laser light in the resonator, the second slave laser operationally controlled by the master laser. 3. The RFOG of claim 2, further comprising:
a first optical phase lock loop (OPLL) coupled to a CW output of the resonator via CW resonance tracking loop, the first OPPL further in communication with the first slave laser; and a second optical phase lock loop (OPLL) coupled to an CCW output of the resonator via a CCW resonance tracking loop, the second OPPL further in communication with the second slave laser. 4. The RFOG of claim 2, further comprising:
a Pound-Drever-Hall (PDH) feedback control loop coupled to at least an output of the resonator, the PDH feedback loop further in communication with the master laser. 5. The RFOG of claim 4, wherein the resonance hopping control system is within the PDH feedback control loop. 6. The RFOG of claim 1, wherein the resonance hopping control system further comprises:
at least one controller configured to cause the at least one laser to unlock, hop and lock its frequency relative to resonance frequencies of the resonator. 7. The RFOG of claim 6, further comprising:
at least one memory configured to store operating instructions executed by the controller in causing the at least one laser of unlock, hop and lock its frequency relative to resonance frequencies of a resonator. 8. The RFOG of claim 6, further comprising:
a random number generator used by the controller to at least in part determine a resonance frequency to hop to. 9. The RFOG of claim 6, wherein the controller is further configured to unlock, hop and lock to resonance frequencies multiple times per second. 10. The RFOG of claim 1, wherein the resonance hopping control system is further configured to hop within a window of frequencies that allow the at least one laser to be within a single mode operation. 11. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
periodically unlocking, hopping and locking frequencies of laser light traveling in clockwise (CW) and counter-clockwise (CCW) directions in a resonator of a gyroscope to mitigate bias errors due to resonance asymmetries; measuring center frequencies of resonances in the CW and CCW directions of the resonator when the signals indicate that light is locked on the resonance frequencies; determining differences between the measured center frequencies of the resonances in the CW and CCW directions; and determining a rotation rate of the gyroscope based at least in part on the determined differences. 12. The method of claim 11, wherein the hopping occurs over multiple resonances. 13. The method of claim 11, wherein the period of unlocking, hopping and locking to resonance frequencies is multiple times per second. 14. The method of claim 11, further comprising:
determining a window of frequencies that allows at least one laser that generates the CW and CCW laser light in the resonator to be within a single mode operation; and hopping within the determined window. 15. The method of claim 14, wherein the window changes based on the then current resonance mode of the resonator. 16. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
generating clockwise (CW) laser light in a resonator with a first slave laser; generating counterclockwise (CCW) laser light in the resonator with a second slave laser; controlling outputs of the first slave laser and the second slave laser with a master laser; and periodically,
unlocking frequencies of the CW laser light and CCW laser light from a resonance of the resonator,
hopping the CW laser light and CCW laser light to a different resonance frequency of the resonator within a window of frequencies, wherein the window of frequencies allows the first slave laser, the second slave laser and the maser slave laser to remain in a single mode of operation, and
locking the CW laser light and the CCW laser light to the hopped different resonance frequency. 17. The method of claim 16, wherein the periodic unlocking, hopping and locking occurs multiple times per second. 18. The method of claim 16, wherein the hopping occurs over multiple resonances. 19. The method of claim 16, wherein the window changes based on the then current resonance mode of the resonator. 20. The method of claim 16, wherein the different resonance frequency is selected based at least in part on one of a sequential order and a random number generator.
|
A resonator fiber optic gyroscope (RFOG) that includes at least one laser, a resonator and a resonator hopping control system is provided. The resonator is in operational communication with the at least one laser to receive a clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser. The resonance hopping control system is in communication with an output of the resonator and the at least one laser. The resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries.1. A resonator fiber optic gyroscope (RFOG) comprising:
at least one laser; a resonator in operational communication with the at least one laser to receive clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser; and a resonance hopping control system in communication with an output of the resonator and the at least one laser, the resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries. 2. The RFOG of claim 1, wherein the at least one laser further comprises:
a master laser operationally controlled by the resonance hopping control system; a first slave laser to generate the CW laser light in the resonator, the first slave laser operationally controlled by the master laser; and a second slave laser to generate the CCW laser light in the resonator, the second slave laser operationally controlled by the master laser. 3. The RFOG of claim 2, further comprising:
a first optical phase lock loop (OPLL) coupled to a CW output of the resonator via CW resonance tracking loop, the first OPPL further in communication with the first slave laser; and a second optical phase lock loop (OPLL) coupled to an CCW output of the resonator via a CCW resonance tracking loop, the second OPPL further in communication with the second slave laser. 4. The RFOG of claim 2, further comprising:
a Pound-Drever-Hall (PDH) feedback control loop coupled to at least an output of the resonator, the PDH feedback loop further in communication with the master laser. 5. The RFOG of claim 4, wherein the resonance hopping control system is within the PDH feedback control loop. 6. The RFOG of claim 1, wherein the resonance hopping control system further comprises:
at least one controller configured to cause the at least one laser to unlock, hop and lock its frequency relative to resonance frequencies of the resonator. 7. The RFOG of claim 6, further comprising:
at least one memory configured to store operating instructions executed by the controller in causing the at least one laser of unlock, hop and lock its frequency relative to resonance frequencies of a resonator. 8. The RFOG of claim 6, further comprising:
a random number generator used by the controller to at least in part determine a resonance frequency to hop to. 9. The RFOG of claim 6, wherein the controller is further configured to unlock, hop and lock to resonance frequencies multiple times per second. 10. The RFOG of claim 1, wherein the resonance hopping control system is further configured to hop within a window of frequencies that allow the at least one laser to be within a single mode operation. 11. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
periodically unlocking, hopping and locking frequencies of laser light traveling in clockwise (CW) and counter-clockwise (CCW) directions in a resonator of a gyroscope to mitigate bias errors due to resonance asymmetries; measuring center frequencies of resonances in the CW and CCW directions of the resonator when the signals indicate that light is locked on the resonance frequencies; determining differences between the measured center frequencies of the resonances in the CW and CCW directions; and determining a rotation rate of the gyroscope based at least in part on the determined differences. 12. The method of claim 11, wherein the hopping occurs over multiple resonances. 13. The method of claim 11, wherein the period of unlocking, hopping and locking to resonance frequencies is multiple times per second. 14. The method of claim 11, further comprising:
determining a window of frequencies that allows at least one laser that generates the CW and CCW laser light in the resonator to be within a single mode operation; and hopping within the determined window. 15. The method of claim 14, wherein the window changes based on the then current resonance mode of the resonator. 16. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
generating clockwise (CW) laser light in a resonator with a first slave laser; generating counterclockwise (CCW) laser light in the resonator with a second slave laser; controlling outputs of the first slave laser and the second slave laser with a master laser; and periodically,
unlocking frequencies of the CW laser light and CCW laser light from a resonance of the resonator,
hopping the CW laser light and CCW laser light to a different resonance frequency of the resonator within a window of frequencies, wherein the window of frequencies allows the first slave laser, the second slave laser and the maser slave laser to remain in a single mode of operation, and
locking the CW laser light and the CCW laser light to the hopped different resonance frequency. 17. The method of claim 16, wherein the periodic unlocking, hopping and locking occurs multiple times per second. 18. The method of claim 16, wherein the hopping occurs over multiple resonances. 19. The method of claim 16, wherein the window changes based on the then current resonance mode of the resonator. 20. The method of claim 16, wherein the different resonance frequency is selected based at least in part on one of a sequential order and a random number generator.
| 1,700
|
338,017
| 16,799,674
| 2,687
|
A resonator fiber optic gyroscope (RFOG) that includes at least one laser, a resonator and a resonator hopping control system is provided. The resonator is in operational communication with the at least one laser to receive a clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser. The resonance hopping control system is in communication with an output of the resonator and the at least one laser. The resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries.
|
1. A resonator fiber optic gyroscope (RFOG) comprising:
at least one laser; a resonator in operational communication with the at least one laser to receive clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser; and a resonance hopping control system in communication with an output of the resonator and the at least one laser, the resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries. 2. The RFOG of claim 1, wherein the at least one laser further comprises:
a master laser operationally controlled by the resonance hopping control system; a first slave laser to generate the CW laser light in the resonator, the first slave laser operationally controlled by the master laser; and a second slave laser to generate the CCW laser light in the resonator, the second slave laser operationally controlled by the master laser. 3. The RFOG of claim 2, further comprising:
a first optical phase lock loop (OPLL) coupled to a CW output of the resonator via CW resonance tracking loop, the first OPPL further in communication with the first slave laser; and a second optical phase lock loop (OPLL) coupled to an CCW output of the resonator via a CCW resonance tracking loop, the second OPPL further in communication with the second slave laser. 4. The RFOG of claim 2, further comprising:
a Pound-Drever-Hall (PDH) feedback control loop coupled to at least an output of the resonator, the PDH feedback loop further in communication with the master laser. 5. The RFOG of claim 4, wherein the resonance hopping control system is within the PDH feedback control loop. 6. The RFOG of claim 1, wherein the resonance hopping control system further comprises:
at least one controller configured to cause the at least one laser to unlock, hop and lock its frequency relative to resonance frequencies of the resonator. 7. The RFOG of claim 6, further comprising:
at least one memory configured to store operating instructions executed by the controller in causing the at least one laser of unlock, hop and lock its frequency relative to resonance frequencies of a resonator. 8. The RFOG of claim 6, further comprising:
a random number generator used by the controller to at least in part determine a resonance frequency to hop to. 9. The RFOG of claim 6, wherein the controller is further configured to unlock, hop and lock to resonance frequencies multiple times per second. 10. The RFOG of claim 1, wherein the resonance hopping control system is further configured to hop within a window of frequencies that allow the at least one laser to be within a single mode operation. 11. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
periodically unlocking, hopping and locking frequencies of laser light traveling in clockwise (CW) and counter-clockwise (CCW) directions in a resonator of a gyroscope to mitigate bias errors due to resonance asymmetries; measuring center frequencies of resonances in the CW and CCW directions of the resonator when the signals indicate that light is locked on the resonance frequencies; determining differences between the measured center frequencies of the resonances in the CW and CCW directions; and determining a rotation rate of the gyroscope based at least in part on the determined differences. 12. The method of claim 11, wherein the hopping occurs over multiple resonances. 13. The method of claim 11, wherein the period of unlocking, hopping and locking to resonance frequencies is multiple times per second. 14. The method of claim 11, further comprising:
determining a window of frequencies that allows at least one laser that generates the CW and CCW laser light in the resonator to be within a single mode operation; and hopping within the determined window. 15. The method of claim 14, wherein the window changes based on the then current resonance mode of the resonator. 16. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
generating clockwise (CW) laser light in a resonator with a first slave laser; generating counterclockwise (CCW) laser light in the resonator with a second slave laser; controlling outputs of the first slave laser and the second slave laser with a master laser; and periodically,
unlocking frequencies of the CW laser light and CCW laser light from a resonance of the resonator,
hopping the CW laser light and CCW laser light to a different resonance frequency of the resonator within a window of frequencies, wherein the window of frequencies allows the first slave laser, the second slave laser and the maser slave laser to remain in a single mode of operation, and
locking the CW laser light and the CCW laser light to the hopped different resonance frequency. 17. The method of claim 16, wherein the periodic unlocking, hopping and locking occurs multiple times per second. 18. The method of claim 16, wherein the hopping occurs over multiple resonances. 19. The method of claim 16, wherein the window changes based on the then current resonance mode of the resonator. 20. The method of claim 16, wherein the different resonance frequency is selected based at least in part on one of a sequential order and a random number generator.
|
A resonator fiber optic gyroscope (RFOG) that includes at least one laser, a resonator and a resonator hopping control system is provided. The resonator is in operational communication with the at least one laser to receive a clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser. The resonance hopping control system is in communication with an output of the resonator and the at least one laser. The resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries.1. A resonator fiber optic gyroscope (RFOG) comprising:
at least one laser; a resonator in operational communication with the at least one laser to receive clockwise (CW) laser light and counterclockwise (CCW) laser light produced by the at least one laser; and a resonance hopping control system in communication with an output of the resonator and the at least one laser, the resonance hopping control system is configured to control an output of the at least one laser to periodically unlock, hop and lock frequencies of the laser light traveling in the CW and CCW directions in the resonator to resonance frequencies of the resonator to mitigate bias errors due to resonance asymmetries. 2. The RFOG of claim 1, wherein the at least one laser further comprises:
a master laser operationally controlled by the resonance hopping control system; a first slave laser to generate the CW laser light in the resonator, the first slave laser operationally controlled by the master laser; and a second slave laser to generate the CCW laser light in the resonator, the second slave laser operationally controlled by the master laser. 3. The RFOG of claim 2, further comprising:
a first optical phase lock loop (OPLL) coupled to a CW output of the resonator via CW resonance tracking loop, the first OPPL further in communication with the first slave laser; and a second optical phase lock loop (OPLL) coupled to an CCW output of the resonator via a CCW resonance tracking loop, the second OPPL further in communication with the second slave laser. 4. The RFOG of claim 2, further comprising:
a Pound-Drever-Hall (PDH) feedback control loop coupled to at least an output of the resonator, the PDH feedback loop further in communication with the master laser. 5. The RFOG of claim 4, wherein the resonance hopping control system is within the PDH feedback control loop. 6. The RFOG of claim 1, wherein the resonance hopping control system further comprises:
at least one controller configured to cause the at least one laser to unlock, hop and lock its frequency relative to resonance frequencies of the resonator. 7. The RFOG of claim 6, further comprising:
at least one memory configured to store operating instructions executed by the controller in causing the at least one laser of unlock, hop and lock its frequency relative to resonance frequencies of a resonator. 8. The RFOG of claim 6, further comprising:
a random number generator used by the controller to at least in part determine a resonance frequency to hop to. 9. The RFOG of claim 6, wherein the controller is further configured to unlock, hop and lock to resonance frequencies multiple times per second. 10. The RFOG of claim 1, wherein the resonance hopping control system is further configured to hop within a window of frequencies that allow the at least one laser to be within a single mode operation. 11. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
periodically unlocking, hopping and locking frequencies of laser light traveling in clockwise (CW) and counter-clockwise (CCW) directions in a resonator of a gyroscope to mitigate bias errors due to resonance asymmetries; measuring center frequencies of resonances in the CW and CCW directions of the resonator when the signals indicate that light is locked on the resonance frequencies; determining differences between the measured center frequencies of the resonances in the CW and CCW directions; and determining a rotation rate of the gyroscope based at least in part on the determined differences. 12. The method of claim 11, wherein the hopping occurs over multiple resonances. 13. The method of claim 11, wherein the period of unlocking, hopping and locking to resonance frequencies is multiple times per second. 14. The method of claim 11, further comprising:
determining a window of frequencies that allows at least one laser that generates the CW and CCW laser light in the resonator to be within a single mode operation; and hopping within the determined window. 15. The method of claim 14, wherein the window changes based on the then current resonance mode of the resonator. 16. A method of reducing gyroscope bias errors due to resonance asymmetries, the method comprising:
generating clockwise (CW) laser light in a resonator with a first slave laser; generating counterclockwise (CCW) laser light in the resonator with a second slave laser; controlling outputs of the first slave laser and the second slave laser with a master laser; and periodically,
unlocking frequencies of the CW laser light and CCW laser light from a resonance of the resonator,
hopping the CW laser light and CCW laser light to a different resonance frequency of the resonator within a window of frequencies, wherein the window of frequencies allows the first slave laser, the second slave laser and the maser slave laser to remain in a single mode of operation, and
locking the CW laser light and the CCW laser light to the hopped different resonance frequency. 17. The method of claim 16, wherein the periodic unlocking, hopping and locking occurs multiple times per second. 18. The method of claim 16, wherein the hopping occurs over multiple resonances. 19. The method of claim 16, wherein the window changes based on the then current resonance mode of the resonator. 20. The method of claim 16, wherein the different resonance frequency is selected based at least in part on one of a sequential order and a random number generator.
| 2,600
|
338,018
| 16,799,645
| 2,687
|
The positive electrode material for a lithium ion polymer battery of the present invention is active material particles including core particles represented by General Formula LixAyDzPO4 and the carbonaceous film that coats surfaces of the core particles, wherein a paste including the active material particles has a viscosity of 5,000 mPa·s or less when a viscosity of the paste is measured at a shear rate of 4.0 [1/s], wherein the paste is a mixture of the active material particles, an ion-conductive polymer, a conductive auxiliary agent and a solvent, in which the active material particles, the ion-conductive polymer and the conductive auxiliary agent are included in the paste in a mass ratio of 66:30:4, and a total solid content of the paste is 40% by mass.
|
1. A positive electrode material fora lithium ion polymer battery, wherein the positive electrode material consists of active material particles which includes core particles represented by General Formula LixAyDzPO4 (here, A represents at least one element selected from the group consisting of Co, Mn, Ni, Fe, Cu, and Cr, D represents at least one element selected from the group consisting of Mg, Ca, Sr, Ba, Ti, Zn, B, Al, Ga, In, Si, Ge, Sc, and Y, 0.9<x<1.1, 0<y≤1, 0≤z<1, and 0.9<y+z<1.1) and a carbonaceous film that coats surfaces of the core particles,
wherein a paste including the active material particles has a viscosity of 5,000 mPa·s or less, when a viscosity of the paste is measured at a shear rate of 4.0 [1/s],
wherein the paste is a mixture of the active material particles, an ion-conductive polymer, a conductive auxiliary agent and a solvent, in which the active material particles, the ion-conductive polymer and the conductive auxiliary agent are included in the paste in amass ratio of 66:30:4, and a total solid content of the paste is 40% by mass. 2. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a powder resistivity of the active material particles is 100 Ω·cm or less. 3. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a BET specific surface area of the active material particles is 5 m2/g or more and 25 m2/g or less. 4. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein an amount of carbon forming the carbonaceous film is 0.1 parts by mass or more and 10 parts by mass or less with respect to 100 parts by mass of the core particles. 5. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a coarse particle ratio in a particle size distribution of the active material particles is 35% or more and 65% or less. 6. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a median diameter of the active material particles is 0.50 μm or more and 0.80 μm or less, and chromaticity b* in an L*a*b* color system is 1.9 or more and 2.3 or less. 7. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the particle size distribution of the active material has at least two peaks, a maximum value of a fine particle-side peak in the particle size distribution of the active material particles is in a range of 0.15 μm or more and 0.35 μm or less, and a maximum value of a coarse particle-side peak in the particle size distribution of the active material particles is in a range of 0.80 μm or more and 1.20 μm or less. 8. A positive electrode for a lithium ion polymer battery, comprising:
an electrode current collector; and a positive electrode mixture layer formed on the electrode current collector, wherein the positive electrode mixture layer includes the positive electrode material for a lithium ion polymer battery according to claim 1. 9. A lithium ion polymer battery comprising:
the positive electrode for a lithium ion polymer battery according to claim 8. 10. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein
the ion-conductive polymer comprises at least one selected form polyethylene oxide and a modified polyethylene oxide, the conductive auxiliary agent comprises at least one selected from the group consisting of acetylene black, KETJEN BLACK, furnace black, fibrous carbon and carbon nanotube, and the solvent comprises at least one selected from the group consisting of water, alcohols, esters, ethers, ketones, amides, and glycols. 11. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the ion-conductive polymer comprises at least one of lithium salts. 12. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the solvent is N-methyl-2-pyrrolidone. 13. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the paste is used to evaluate the active material particles.
|
The positive electrode material for a lithium ion polymer battery of the present invention is active material particles including core particles represented by General Formula LixAyDzPO4 and the carbonaceous film that coats surfaces of the core particles, wherein a paste including the active material particles has a viscosity of 5,000 mPa·s or less when a viscosity of the paste is measured at a shear rate of 4.0 [1/s], wherein the paste is a mixture of the active material particles, an ion-conductive polymer, a conductive auxiliary agent and a solvent, in which the active material particles, the ion-conductive polymer and the conductive auxiliary agent are included in the paste in a mass ratio of 66:30:4, and a total solid content of the paste is 40% by mass.1. A positive electrode material fora lithium ion polymer battery, wherein the positive electrode material consists of active material particles which includes core particles represented by General Formula LixAyDzPO4 (here, A represents at least one element selected from the group consisting of Co, Mn, Ni, Fe, Cu, and Cr, D represents at least one element selected from the group consisting of Mg, Ca, Sr, Ba, Ti, Zn, B, Al, Ga, In, Si, Ge, Sc, and Y, 0.9<x<1.1, 0<y≤1, 0≤z<1, and 0.9<y+z<1.1) and a carbonaceous film that coats surfaces of the core particles,
wherein a paste including the active material particles has a viscosity of 5,000 mPa·s or less, when a viscosity of the paste is measured at a shear rate of 4.0 [1/s],
wherein the paste is a mixture of the active material particles, an ion-conductive polymer, a conductive auxiliary agent and a solvent, in which the active material particles, the ion-conductive polymer and the conductive auxiliary agent are included in the paste in amass ratio of 66:30:4, and a total solid content of the paste is 40% by mass. 2. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a powder resistivity of the active material particles is 100 Ω·cm or less. 3. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a BET specific surface area of the active material particles is 5 m2/g or more and 25 m2/g or less. 4. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein an amount of carbon forming the carbonaceous film is 0.1 parts by mass or more and 10 parts by mass or less with respect to 100 parts by mass of the core particles. 5. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a coarse particle ratio in a particle size distribution of the active material particles is 35% or more and 65% or less. 6. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein a median diameter of the active material particles is 0.50 μm or more and 0.80 μm or less, and chromaticity b* in an L*a*b* color system is 1.9 or more and 2.3 or less. 7. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the particle size distribution of the active material has at least two peaks, a maximum value of a fine particle-side peak in the particle size distribution of the active material particles is in a range of 0.15 μm or more and 0.35 μm or less, and a maximum value of a coarse particle-side peak in the particle size distribution of the active material particles is in a range of 0.80 μm or more and 1.20 μm or less. 8. A positive electrode for a lithium ion polymer battery, comprising:
an electrode current collector; and a positive electrode mixture layer formed on the electrode current collector, wherein the positive electrode mixture layer includes the positive electrode material for a lithium ion polymer battery according to claim 1. 9. A lithium ion polymer battery comprising:
the positive electrode for a lithium ion polymer battery according to claim 8. 10. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein
the ion-conductive polymer comprises at least one selected form polyethylene oxide and a modified polyethylene oxide, the conductive auxiliary agent comprises at least one selected from the group consisting of acetylene black, KETJEN BLACK, furnace black, fibrous carbon and carbon nanotube, and the solvent comprises at least one selected from the group consisting of water, alcohols, esters, ethers, ketones, amides, and glycols. 11. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the ion-conductive polymer comprises at least one of lithium salts. 12. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the solvent is N-methyl-2-pyrrolidone. 13. The positive electrode material for a lithium ion polymer battery according to claim 1, wherein the paste is used to evaluate the active material particles.
| 2,600
|
338,019
| 16,799,649
| 2,687
|
A wrist strengthening device includes a first handle, a second handle coupled to the first handle, and a tightening component coupled to the first handle and the second handle. The tightening component is configured to provide resistance to movement of the first handle and the second handle as the first handle is moved in a first direction and the second handle is moved in a second direction, opposite the first direction. The tightening component includes an outer piece, an inner piece, and a male and a female portion. Movement of the male portion toward the female portion causes space between the inner piece and the outer piece to decrease and friction therebetween to concurrently increase.
|
1. A wrist strengthening device comprising:
a first handle; a second handle coupled to the first handle; and a tightening component coupled to the first handle and the second handle and configured to provide resistance to movement of the first handle and the second handle as the first handle is moved in a first direction and the second handle is moved in a second direction, opposite the first direction, the tightening component comprising an outer piece, an inner piece, and a male and a female portion, wherein movement of the male portion toward the female portion causes space between the inner piece and the outer piece to decrease and friction therebetween to concurrently increase. 2. The wrist strengthening device of claim 1, wherein the outer piece is a first outer piece, and further including a second outer piece, the first and second outer pieces positioned on opposing sides of the inner piece, and further wherein movement of the male portion toward the female portion causes space between the inner piece and the first outer piece to decrease and space between the inner piece and the second outer piece to decrease. 3. The wrist strengthening device of claim 1, wherein at least one of the first handle or the second handle includes an opening on a distal end, and wherein the opening is configured to receive one or more weights. 4. The wrist strengthening device of claim 1, further comprising a detachable handle, wherein the detachable handle is configured to be received in at least one of the first handle or the second handle. 5. The wrist strengthening device of claim 1, wherein the first handle is configured to be moved simultaneously with the second handle. 6. The wrist strengthening device of claim 1, wherein the wrist strengthening device is free of any spring component. 7. The wrist strengthening device of claim 1, wherein the tightening component is configured to provide resistance to either one of the first handle or the second handle without providing resistance to the other one of the first handle or the second handle. 8. A wrist strengthening device comprising:
a first handle; a second handle coupled to the first handle; and a tightening component coupled to the first handle and the second handle and configured to provide resistance to movement of the first handle and the second handle as the first handle is moved in a first direction and the second handle is moved in a second direction, opposite the first direction, the tightening component comprising an outer piece, an inner piece, and a male and a female portion, wherein the wrist strengthening device lacks a spring component. 9. The wrist strengthening device of claim 8, wherein movement of the male portion toward the female portion causes an increase in friction between the outer piece and the inner piece. 10. The wrist strengthening device of claim 8, wherein at least one of the first handle or the second handle includes an opening configured to receive one or more weights. 11. The wrist strengthening device of claim 8, further comprising a detachable handle configured to be received in at least one of the first handle or the second handle. 12. The wrist strengthening device of claim 8, wherein the first handle is configured to be moved simultaneously with the second handle. 13. The wrist strengthening device of claim 8, wherein the tightening component is configured to provide resistance to either one of the first handle or the second handle without providing resistance to the other one of the first handle or the second handle. 14. A wrist strengthening device comprising:
a first handle; a second handle coupled to the first handle; and a tightening component coupled to the first handle and to the second handle and configured to provide rotational resistance to movement of the first handle relative to the second handle, the tightening component comprising an outer piece cooperatively associated with an inner piece, wherein adjustment of the tightening component causes an increase or decrease of operable friction between the outer piece and the inner piece, and wherein the wrist strengthening device lacks a spring component. 15. The wrist strengthening device of claim 14, wherein at least one of the first handle or the second handle includes an opening on a distal end, and wherein the opening is configured to receive one or more weights. 16. The wrist strengthening device of claim 14, further comprising a detachable handle, wherein the detachable handle is configured to be received in at least one of the first handle or the second handle. 17. The wrist strengthening device of claim 16, wherein the detachable handle is a replica of a handle of a particular piece of sporting equipment.
|
A wrist strengthening device includes a first handle, a second handle coupled to the first handle, and a tightening component coupled to the first handle and the second handle. The tightening component is configured to provide resistance to movement of the first handle and the second handle as the first handle is moved in a first direction and the second handle is moved in a second direction, opposite the first direction. The tightening component includes an outer piece, an inner piece, and a male and a female portion. Movement of the male portion toward the female portion causes space between the inner piece and the outer piece to decrease and friction therebetween to concurrently increase.1. A wrist strengthening device comprising:
a first handle; a second handle coupled to the first handle; and a tightening component coupled to the first handle and the second handle and configured to provide resistance to movement of the first handle and the second handle as the first handle is moved in a first direction and the second handle is moved in a second direction, opposite the first direction, the tightening component comprising an outer piece, an inner piece, and a male and a female portion, wherein movement of the male portion toward the female portion causes space between the inner piece and the outer piece to decrease and friction therebetween to concurrently increase. 2. The wrist strengthening device of claim 1, wherein the outer piece is a first outer piece, and further including a second outer piece, the first and second outer pieces positioned on opposing sides of the inner piece, and further wherein movement of the male portion toward the female portion causes space between the inner piece and the first outer piece to decrease and space between the inner piece and the second outer piece to decrease. 3. The wrist strengthening device of claim 1, wherein at least one of the first handle or the second handle includes an opening on a distal end, and wherein the opening is configured to receive one or more weights. 4. The wrist strengthening device of claim 1, further comprising a detachable handle, wherein the detachable handle is configured to be received in at least one of the first handle or the second handle. 5. The wrist strengthening device of claim 1, wherein the first handle is configured to be moved simultaneously with the second handle. 6. The wrist strengthening device of claim 1, wherein the wrist strengthening device is free of any spring component. 7. The wrist strengthening device of claim 1, wherein the tightening component is configured to provide resistance to either one of the first handle or the second handle without providing resistance to the other one of the first handle or the second handle. 8. A wrist strengthening device comprising:
a first handle; a second handle coupled to the first handle; and a tightening component coupled to the first handle and the second handle and configured to provide resistance to movement of the first handle and the second handle as the first handle is moved in a first direction and the second handle is moved in a second direction, opposite the first direction, the tightening component comprising an outer piece, an inner piece, and a male and a female portion, wherein the wrist strengthening device lacks a spring component. 9. The wrist strengthening device of claim 8, wherein movement of the male portion toward the female portion causes an increase in friction between the outer piece and the inner piece. 10. The wrist strengthening device of claim 8, wherein at least one of the first handle or the second handle includes an opening configured to receive one or more weights. 11. The wrist strengthening device of claim 8, further comprising a detachable handle configured to be received in at least one of the first handle or the second handle. 12. The wrist strengthening device of claim 8, wherein the first handle is configured to be moved simultaneously with the second handle. 13. The wrist strengthening device of claim 8, wherein the tightening component is configured to provide resistance to either one of the first handle or the second handle without providing resistance to the other one of the first handle or the second handle. 14. A wrist strengthening device comprising:
a first handle; a second handle coupled to the first handle; and a tightening component coupled to the first handle and to the second handle and configured to provide rotational resistance to movement of the first handle relative to the second handle, the tightening component comprising an outer piece cooperatively associated with an inner piece, wherein adjustment of the tightening component causes an increase or decrease of operable friction between the outer piece and the inner piece, and wherein the wrist strengthening device lacks a spring component. 15. The wrist strengthening device of claim 14, wherein at least one of the first handle or the second handle includes an opening on a distal end, and wherein the opening is configured to receive one or more weights. 16. The wrist strengthening device of claim 14, further comprising a detachable handle, wherein the detachable handle is configured to be received in at least one of the first handle or the second handle. 17. The wrist strengthening device of claim 16, wherein the detachable handle is a replica of a handle of a particular piece of sporting equipment.
| 2,600
|
338,020
| 16,799,669
| 2,687
|
Provided herein are oligomeric compounds with conjugate groups. In certain embodiments, the gomeric compounds are conjugated to N-Acetylgalactosamine or to N-Acetylgalactosamine anaologues.
|
1-243. (canceled) 244. A compound comprising an oligomer and a conjugate group having Formula II: 245. The compound of claim 244 wherein R1 is Q1 and Q1 has the formula: 246. The compound of claim 245, wherein Q1 has the formula: 247. The compound of claim 245, wherein Q2 is CH3. 248. The compound of claim 244, wherein R1 is CH2N3. 249. The compound of claim 248, wherein Q2 is CH3. 250. The compound of claim 244, wherein Q2 is selected from among: 251. The compound of claim 250, wherein Q2 is 252. The compound of claim 250, wherein R1 is CH2OH. 253. The compound of claim 244, wherein L optionally comprises one or more amides and wherein L attaches to T1 through a group selected from among: 254. The compound of claim 244 wherein L comprises a phosphorus linking group, NH2, or N(CH3)2. 255. The compound of claim 244 having the configuration: 256. The compound of claim 244, wherein the oligomer is a modified oligonucleotide comprising at least one modified nucleoside comprising a modified base and/or a modified sugar moiety. 257. The compound of claim 256 having at least one modified nucleoside comprising a modified sugar moiety selected from a bicyclic sugar moiety and a 2′-substituted sugar moiety. 258. The compound of claim 257, comprising at least one 4′-C(CH3)H—O-2′ or 4′-CH2—O-2′bridged bicyclic sugar moiety. 259. The compound of claim 257 comprising at least one 2′-O(CH2)2OCH3 substituted sugar moiety. 260. The compound of claim 244, wherein the conjugate group is attached to the 5′-terminal nucleoside of the oligomer. 261. The compound of claim 244, wherein the conjugate group is attached to the 3′-terminal nucleoside of the oligomer. 262. The compound of claim 244, wherein the oligomer is an oligonucleotide and has a sugar motif comprising:
a 5′-region consisting of 2-8 linked 5′-region nucleosides, wherein at least two 5′-region nucleosides are modified nucleosides and wherein the 3′-most 5′-region nucleoside is a modified nucleoside; a 3′-region consisting of 2-8 linked 3′-region nucleosides, wherein at least two 3′-region nucleosides are modified nucleosides and wherein the 5′-most 3′-region nucleoside is a modified nucleoside; and a central region between the 5′-region and the 3′-region consisting of 5-10 linked central region nucleosides, each independently selected from among: a modified nucleoside and an unmodified deoxynucleoside, wherein the 5′-most central region nucleoside is an unmodified deoxynucleoside and the 3′-most central region nucleoside is an unmodified deoxynucleoside. 263. The compound of claim 244, wherein the oligomer has a nucleobase sequence comprising an at least 14 or 16 nucleobase portion complementary to an equal length portion of a target nucleic acid. 264. The compound of claim 244, wherein the oligomer is an oligonucleotide and the compound consists of the oligonucleotide and the conjugate group. 265. A pharmaceutical composition comprising a compound according to claim 244 and a pharmaceutically acceptable carrier or diluent. 266. A method of treating a disease associated with a target nucleic acid, comprising administering to an individual having or at risk of developing a disease associated with the target nucleic acid a therapeutically effective amount of the pharmaceutical composition according to claim 264.
|
Provided herein are oligomeric compounds with conjugate groups. In certain embodiments, the gomeric compounds are conjugated to N-Acetylgalactosamine or to N-Acetylgalactosamine anaologues.1-243. (canceled) 244. A compound comprising an oligomer and a conjugate group having Formula II: 245. The compound of claim 244 wherein R1 is Q1 and Q1 has the formula: 246. The compound of claim 245, wherein Q1 has the formula: 247. The compound of claim 245, wherein Q2 is CH3. 248. The compound of claim 244, wherein R1 is CH2N3. 249. The compound of claim 248, wherein Q2 is CH3. 250. The compound of claim 244, wherein Q2 is selected from among: 251. The compound of claim 250, wherein Q2 is 252. The compound of claim 250, wherein R1 is CH2OH. 253. The compound of claim 244, wherein L optionally comprises one or more amides and wherein L attaches to T1 through a group selected from among: 254. The compound of claim 244 wherein L comprises a phosphorus linking group, NH2, or N(CH3)2. 255. The compound of claim 244 having the configuration: 256. The compound of claim 244, wherein the oligomer is a modified oligonucleotide comprising at least one modified nucleoside comprising a modified base and/or a modified sugar moiety. 257. The compound of claim 256 having at least one modified nucleoside comprising a modified sugar moiety selected from a bicyclic sugar moiety and a 2′-substituted sugar moiety. 258. The compound of claim 257, comprising at least one 4′-C(CH3)H—O-2′ or 4′-CH2—O-2′bridged bicyclic sugar moiety. 259. The compound of claim 257 comprising at least one 2′-O(CH2)2OCH3 substituted sugar moiety. 260. The compound of claim 244, wherein the conjugate group is attached to the 5′-terminal nucleoside of the oligomer. 261. The compound of claim 244, wherein the conjugate group is attached to the 3′-terminal nucleoside of the oligomer. 262. The compound of claim 244, wherein the oligomer is an oligonucleotide and has a sugar motif comprising:
a 5′-region consisting of 2-8 linked 5′-region nucleosides, wherein at least two 5′-region nucleosides are modified nucleosides and wherein the 3′-most 5′-region nucleoside is a modified nucleoside; a 3′-region consisting of 2-8 linked 3′-region nucleosides, wherein at least two 3′-region nucleosides are modified nucleosides and wherein the 5′-most 3′-region nucleoside is a modified nucleoside; and a central region between the 5′-region and the 3′-region consisting of 5-10 linked central region nucleosides, each independently selected from among: a modified nucleoside and an unmodified deoxynucleoside, wherein the 5′-most central region nucleoside is an unmodified deoxynucleoside and the 3′-most central region nucleoside is an unmodified deoxynucleoside. 263. The compound of claim 244, wherein the oligomer has a nucleobase sequence comprising an at least 14 or 16 nucleobase portion complementary to an equal length portion of a target nucleic acid. 264. The compound of claim 244, wherein the oligomer is an oligonucleotide and the compound consists of the oligonucleotide and the conjugate group. 265. A pharmaceutical composition comprising a compound according to claim 244 and a pharmaceutically acceptable carrier or diluent. 266. A method of treating a disease associated with a target nucleic acid, comprising administering to an individual having or at risk of developing a disease associated with the target nucleic acid a therapeutically effective amount of the pharmaceutical composition according to claim 264.
| 2,600
|
338,021
| 16,799,642
| 2,687
|
A catalytic membrane reactor and methods of operating and producing the same are provided that efficiently produces highly pure hydrogen (H2) from ammonia (NH3) as well as operates according to other chemical conversion processes. In one embodiment, a tubular ceramic support made from porous yttria-stabilized zirconia has an outer surface that is impregnated with a metal catalyst such as ruthenium and then plated with a hydrogen permeable membrane such as palladium. An inner surface of the ceramic support is impregnated with cesium to promote conversion of ammonia to hydrogen and nitrogen (N2). The resulting catalytic membrane reactor produces highly pure hydrogen at low temperatures and with less catalytic loading. Therefore, ammonia can be used to effectively transport hydrogen for use in, for example, fuel cells in a vehicle.
|
1. A catalytic membrane reactor for a chemical conversion process, comprising:
a ceramic support extending between an inner surface and an outer surface, wherein said ceramic support is impregnated with a metal catalyst that induces or speeds up said chemical conversion process; a first region of said ceramic support extending from said inner surface to a predetermined distance through a thickness of said ceramic support; a second region of said ceramic support extending from said predetermined distance through said thickness of said ceramic support to said outer surface, wherein said second region has a smaller porosity than said first region, said second region has a smaller thickness than said first region, and said second region comprises at least a portion of said metal catalyst; and a permeable membrane positioned on said outer surface of said ceramic support, wherein said permeable membrane has a smaller thickness than said second region, and said permeable membrane selectively allows at least one product of said chemical conversion process to pass through said permeable membrane and blocks at least one product of said chemical conversion process from passing through said permeable membrane. 2. The catalytic membrane reactor of claim 1, wherein said first region has a substantially constant porosity through said thickness of said first region, and said second region has a substantially constant porosity through said thickness of said second region. 3. The catalytic membrane reactor of claim 1, wherein said first region has a decreasing porosity from said inner surface of said ceramic support to said predetermined distance through said thickness of said ceramic support, and said second region has a decreasing porosity from said predetermined distance through said thickness of said ceramic support to said outer surface of said ceramic support. 4. The catalytic membrane reactor of claim 1, wherein said first region has an average pore size that is greater than 1 micron, and said second region has an average pore size of approximately 0.2 microns. 5. The catalytic membrane reactor of claim 1, wherein said ceramic support has a total wall thickness of approximately 0.13 cm, said thickness of said second region is approximately 20 microns, and said thickness of said hydrogen permeable membrane is less than 25 microns. 6. The catalytic membrane reactor of claim 1, wherein a ceramic support material is comprised of at least one of a zirconia, a zirconate, an alumina, a silica, a silicate, or a zeolite, and wherein a metal catalyst material is comprised of at least one of a metal from the platinum group, a transition metal, an alkali metal promoter, or an alkaline metal promoter. 7. The catalytic membrane reactor of claim 1, wherein said metal catalyst is impregnated into said outer surface of said ceramic support, and cesium is impregnated into said inner surface of said ceramic support to enhance said chemical conversion process. 8. The catalytic membrane reactor of claim 1, wherein said permeable membrane is a hydrogen permeable membrane made of a material comprising at least one of Pd, Pd alloys, Group V metals, or Group V metal alloys. 9. The catalytic membrane reactor of claim 1, wherein said chemical conversion process is NH3⇄1/2N2+3/2H2, and hydrogen is selectively allowed to pass through said permeable membrane and nitrogen is blocked by said permeable membrane from passing through said permeable membrane. 10. A method of producing an enhanced purity of hydrogen in a chemical conversion process, comprising:
moving a fluid having hydrogen into an interior volume of a catalytic membrane reactor, wherein said catalytic membrane reactor comprises: a ceramic support extending between an inner surface and an outer surface, and wherein said inner surface at least partially defines said interior volume, said ceramic support is impregnated with a metal catalyst, and said ceramic support has a smaller porosity proximate to said outer surface than said inner surface; a hydrogen permeable membrane positioned on said outer surface of said ceramic support, wherein said hydrogen permeable membrane at least partially defines an exterior volume of said catalytic membrane reactor; and reacting said fluid with said metal catalyst in said ceramic support such that such that at least some hydrogen flows through said hydrogen permeable membrane and into a permeate flow in said exterior volume, and a remaining product flows in a retentate flow and out of said interior volume. 11. The method of claim 10, further comprising:
increasing a pressure of said fluid to greater than 1 bar; and increasing a temperature of said fluid to greater than 350° C. 12. The method of claim 10, wherein said fluid is ammonia and said remaining product comprises nitrogen. 13. The method of claim 10, wherein said hydrogen is produced according to at least one of the following chemical conversion processes:
steam methane reforming: CH4+2H2O⇄4H2+CO2; water gas shift reaction: CO+H2O⇄CO2+H2; or dehydrogenation reactions: C3H8⇄C3H6+H2. 14. The method of claim 10, wherein said ceramic support is made of approximately 3% Y2O3 and approximately 97% Zr2O3. 15. A method of producing a catalytic membrane reactor, comprising:
positioning a ceramic support in a first bath comprising a metal catalyst, and impregnating an outer surface of said ceramic support with said metal catalyst; removing said ceramic support from said first bath and drying said ceramic support; positioning said ceramic support in a second bath comprising a coating material and plating said outer surface of said ceramic support with said coating material via electroless deposition; removing said ceramic support from said second bath and drying said ceramic support; and soaking an inner surface of said ceramic support with cesium nitrate to impregnate said inner surface of said ceramic support with cesium. 16. The method of claim 15, wherein said first bath comprises a solution of ruthenium chloride hydrate dissolved in approximately 75% acetone and approximately 25% deionized water. 17. The method of claim 15, further comprising:
covering, prior to positioning said ceramic support in said first bath, a first open end and a second open end of a tubular shape of said ceramic support to seal deionized water within said ceramic support; uncovering, after removing said ceramic support from said first bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support; covering, prior to positioning said ceramic support in said second bath, said first open end and said second open end of said tubular shape of said ceramic support to seal deionized water within said ceramic support; and uncovering, after removing said ceramic support from said second bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support. 18. The method of claim 15, further comprising covering, prior to soaking said inner surface of said ceramic support, one of a first open end or a second open end of a tubular shape of said ceramic support to retain said cesium nitrite within an interior of said tubular shape of said ceramic support and impregnating said inner surface of said ceramic support with cesium. 19. The method of claim 15, further comprising reducing, after removing said ceramic support from said first bath and drying said ceramic support, said impregnated ceramic support in a substantially pure hydrogen environment at approximately 400° C. and approximately 1 bar for approximately 60 minutes. 20. The method of claim 15, wherein further comprising agitating said ceramic support in said first bath with ultrasonic vibrations.
|
A catalytic membrane reactor and methods of operating and producing the same are provided that efficiently produces highly pure hydrogen (H2) from ammonia (NH3) as well as operates according to other chemical conversion processes. In one embodiment, a tubular ceramic support made from porous yttria-stabilized zirconia has an outer surface that is impregnated with a metal catalyst such as ruthenium and then plated with a hydrogen permeable membrane such as palladium. An inner surface of the ceramic support is impregnated with cesium to promote conversion of ammonia to hydrogen and nitrogen (N2). The resulting catalytic membrane reactor produces highly pure hydrogen at low temperatures and with less catalytic loading. Therefore, ammonia can be used to effectively transport hydrogen for use in, for example, fuel cells in a vehicle.1. A catalytic membrane reactor for a chemical conversion process, comprising:
a ceramic support extending between an inner surface and an outer surface, wherein said ceramic support is impregnated with a metal catalyst that induces or speeds up said chemical conversion process; a first region of said ceramic support extending from said inner surface to a predetermined distance through a thickness of said ceramic support; a second region of said ceramic support extending from said predetermined distance through said thickness of said ceramic support to said outer surface, wherein said second region has a smaller porosity than said first region, said second region has a smaller thickness than said first region, and said second region comprises at least a portion of said metal catalyst; and a permeable membrane positioned on said outer surface of said ceramic support, wherein said permeable membrane has a smaller thickness than said second region, and said permeable membrane selectively allows at least one product of said chemical conversion process to pass through said permeable membrane and blocks at least one product of said chemical conversion process from passing through said permeable membrane. 2. The catalytic membrane reactor of claim 1, wherein said first region has a substantially constant porosity through said thickness of said first region, and said second region has a substantially constant porosity through said thickness of said second region. 3. The catalytic membrane reactor of claim 1, wherein said first region has a decreasing porosity from said inner surface of said ceramic support to said predetermined distance through said thickness of said ceramic support, and said second region has a decreasing porosity from said predetermined distance through said thickness of said ceramic support to said outer surface of said ceramic support. 4. The catalytic membrane reactor of claim 1, wherein said first region has an average pore size that is greater than 1 micron, and said second region has an average pore size of approximately 0.2 microns. 5. The catalytic membrane reactor of claim 1, wherein said ceramic support has a total wall thickness of approximately 0.13 cm, said thickness of said second region is approximately 20 microns, and said thickness of said hydrogen permeable membrane is less than 25 microns. 6. The catalytic membrane reactor of claim 1, wherein a ceramic support material is comprised of at least one of a zirconia, a zirconate, an alumina, a silica, a silicate, or a zeolite, and wherein a metal catalyst material is comprised of at least one of a metal from the platinum group, a transition metal, an alkali metal promoter, or an alkaline metal promoter. 7. The catalytic membrane reactor of claim 1, wherein said metal catalyst is impregnated into said outer surface of said ceramic support, and cesium is impregnated into said inner surface of said ceramic support to enhance said chemical conversion process. 8. The catalytic membrane reactor of claim 1, wherein said permeable membrane is a hydrogen permeable membrane made of a material comprising at least one of Pd, Pd alloys, Group V metals, or Group V metal alloys. 9. The catalytic membrane reactor of claim 1, wherein said chemical conversion process is NH3⇄1/2N2+3/2H2, and hydrogen is selectively allowed to pass through said permeable membrane and nitrogen is blocked by said permeable membrane from passing through said permeable membrane. 10. A method of producing an enhanced purity of hydrogen in a chemical conversion process, comprising:
moving a fluid having hydrogen into an interior volume of a catalytic membrane reactor, wherein said catalytic membrane reactor comprises: a ceramic support extending between an inner surface and an outer surface, and wherein said inner surface at least partially defines said interior volume, said ceramic support is impregnated with a metal catalyst, and said ceramic support has a smaller porosity proximate to said outer surface than said inner surface; a hydrogen permeable membrane positioned on said outer surface of said ceramic support, wherein said hydrogen permeable membrane at least partially defines an exterior volume of said catalytic membrane reactor; and reacting said fluid with said metal catalyst in said ceramic support such that such that at least some hydrogen flows through said hydrogen permeable membrane and into a permeate flow in said exterior volume, and a remaining product flows in a retentate flow and out of said interior volume. 11. The method of claim 10, further comprising:
increasing a pressure of said fluid to greater than 1 bar; and increasing a temperature of said fluid to greater than 350° C. 12. The method of claim 10, wherein said fluid is ammonia and said remaining product comprises nitrogen. 13. The method of claim 10, wherein said hydrogen is produced according to at least one of the following chemical conversion processes:
steam methane reforming: CH4+2H2O⇄4H2+CO2; water gas shift reaction: CO+H2O⇄CO2+H2; or dehydrogenation reactions: C3H8⇄C3H6+H2. 14. The method of claim 10, wherein said ceramic support is made of approximately 3% Y2O3 and approximately 97% Zr2O3. 15. A method of producing a catalytic membrane reactor, comprising:
positioning a ceramic support in a first bath comprising a metal catalyst, and impregnating an outer surface of said ceramic support with said metal catalyst; removing said ceramic support from said first bath and drying said ceramic support; positioning said ceramic support in a second bath comprising a coating material and plating said outer surface of said ceramic support with said coating material via electroless deposition; removing said ceramic support from said second bath and drying said ceramic support; and soaking an inner surface of said ceramic support with cesium nitrate to impregnate said inner surface of said ceramic support with cesium. 16. The method of claim 15, wherein said first bath comprises a solution of ruthenium chloride hydrate dissolved in approximately 75% acetone and approximately 25% deionized water. 17. The method of claim 15, further comprising:
covering, prior to positioning said ceramic support in said first bath, a first open end and a second open end of a tubular shape of said ceramic support to seal deionized water within said ceramic support; uncovering, after removing said ceramic support from said first bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support; covering, prior to positioning said ceramic support in said second bath, said first open end and said second open end of said tubular shape of said ceramic support to seal deionized water within said ceramic support; and uncovering, after removing said ceramic support from said second bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support. 18. The method of claim 15, further comprising covering, prior to soaking said inner surface of said ceramic support, one of a first open end or a second open end of a tubular shape of said ceramic support to retain said cesium nitrite within an interior of said tubular shape of said ceramic support and impregnating said inner surface of said ceramic support with cesium. 19. The method of claim 15, further comprising reducing, after removing said ceramic support from said first bath and drying said ceramic support, said impregnated ceramic support in a substantially pure hydrogen environment at approximately 400° C. and approximately 1 bar for approximately 60 minutes. 20. The method of claim 15, wherein further comprising agitating said ceramic support in said first bath with ultrasonic vibrations.
| 2,600
|
338,022
| 16,799,670
| 2,687
|
A catalytic membrane reactor and methods of operating and producing the same are provided that efficiently produces highly pure hydrogen (H2) from ammonia (NH3) as well as operates according to other chemical conversion processes. In one embodiment, a tubular ceramic support made from porous yttria-stabilized zirconia has an outer surface that is impregnated with a metal catalyst such as ruthenium and then plated with a hydrogen permeable membrane such as palladium. An inner surface of the ceramic support is impregnated with cesium to promote conversion of ammonia to hydrogen and nitrogen (N2). The resulting catalytic membrane reactor produces highly pure hydrogen at low temperatures and with less catalytic loading. Therefore, ammonia can be used to effectively transport hydrogen for use in, for example, fuel cells in a vehicle.
|
1. A catalytic membrane reactor for a chemical conversion process, comprising:
a ceramic support extending between an inner surface and an outer surface, wherein said ceramic support is impregnated with a metal catalyst that induces or speeds up said chemical conversion process; a first region of said ceramic support extending from said inner surface to a predetermined distance through a thickness of said ceramic support; a second region of said ceramic support extending from said predetermined distance through said thickness of said ceramic support to said outer surface, wherein said second region has a smaller porosity than said first region, said second region has a smaller thickness than said first region, and said second region comprises at least a portion of said metal catalyst; and a permeable membrane positioned on said outer surface of said ceramic support, wherein said permeable membrane has a smaller thickness than said second region, and said permeable membrane selectively allows at least one product of said chemical conversion process to pass through said permeable membrane and blocks at least one product of said chemical conversion process from passing through said permeable membrane. 2. The catalytic membrane reactor of claim 1, wherein said first region has a substantially constant porosity through said thickness of said first region, and said second region has a substantially constant porosity through said thickness of said second region. 3. The catalytic membrane reactor of claim 1, wherein said first region has a decreasing porosity from said inner surface of said ceramic support to said predetermined distance through said thickness of said ceramic support, and said second region has a decreasing porosity from said predetermined distance through said thickness of said ceramic support to said outer surface of said ceramic support. 4. The catalytic membrane reactor of claim 1, wherein said first region has an average pore size that is greater than 1 micron, and said second region has an average pore size of approximately 0.2 microns. 5. The catalytic membrane reactor of claim 1, wherein said ceramic support has a total wall thickness of approximately 0.13 cm, said thickness of said second region is approximately 20 microns, and said thickness of said hydrogen permeable membrane is less than 25 microns. 6. The catalytic membrane reactor of claim 1, wherein a ceramic support material is comprised of at least one of a zirconia, a zirconate, an alumina, a silica, a silicate, or a zeolite, and wherein a metal catalyst material is comprised of at least one of a metal from the platinum group, a transition metal, an alkali metal promoter, or an alkaline metal promoter. 7. The catalytic membrane reactor of claim 1, wherein said metal catalyst is impregnated into said outer surface of said ceramic support, and cesium is impregnated into said inner surface of said ceramic support to enhance said chemical conversion process. 8. The catalytic membrane reactor of claim 1, wherein said permeable membrane is a hydrogen permeable membrane made of a material comprising at least one of Pd, Pd alloys, Group V metals, or Group V metal alloys. 9. The catalytic membrane reactor of claim 1, wherein said chemical conversion process is NH3⇄1/2N2+3/2H2, and hydrogen is selectively allowed to pass through said permeable membrane and nitrogen is blocked by said permeable membrane from passing through said permeable membrane. 10. A method of producing an enhanced purity of hydrogen in a chemical conversion process, comprising:
moving a fluid having hydrogen into an interior volume of a catalytic membrane reactor, wherein said catalytic membrane reactor comprises: a ceramic support extending between an inner surface and an outer surface, and wherein said inner surface at least partially defines said interior volume, said ceramic support is impregnated with a metal catalyst, and said ceramic support has a smaller porosity proximate to said outer surface than said inner surface; a hydrogen permeable membrane positioned on said outer surface of said ceramic support, wherein said hydrogen permeable membrane at least partially defines an exterior volume of said catalytic membrane reactor; and reacting said fluid with said metal catalyst in said ceramic support such that such that at least some hydrogen flows through said hydrogen permeable membrane and into a permeate flow in said exterior volume, and a remaining product flows in a retentate flow and out of said interior volume. 11. The method of claim 10, further comprising:
increasing a pressure of said fluid to greater than 1 bar; and increasing a temperature of said fluid to greater than 350° C. 12. The method of claim 10, wherein said fluid is ammonia and said remaining product comprises nitrogen. 13. The method of claim 10, wherein said hydrogen is produced according to at least one of the following chemical conversion processes:
steam methane reforming: CH4+2H2O⇄4H2+CO2; water gas shift reaction: CO+H2O⇄CO2+H2; or dehydrogenation reactions: C3H8⇄C3H6+H2. 14. The method of claim 10, wherein said ceramic support is made of approximately 3% Y2O3 and approximately 97% Zr2O3. 15. A method of producing a catalytic membrane reactor, comprising:
positioning a ceramic support in a first bath comprising a metal catalyst, and impregnating an outer surface of said ceramic support with said metal catalyst; removing said ceramic support from said first bath and drying said ceramic support; positioning said ceramic support in a second bath comprising a coating material and plating said outer surface of said ceramic support with said coating material via electroless deposition; removing said ceramic support from said second bath and drying said ceramic support; and soaking an inner surface of said ceramic support with cesium nitrate to impregnate said inner surface of said ceramic support with cesium. 16. The method of claim 15, wherein said first bath comprises a solution of ruthenium chloride hydrate dissolved in approximately 75% acetone and approximately 25% deionized water. 17. The method of claim 15, further comprising:
covering, prior to positioning said ceramic support in said first bath, a first open end and a second open end of a tubular shape of said ceramic support to seal deionized water within said ceramic support; uncovering, after removing said ceramic support from said first bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support; covering, prior to positioning said ceramic support in said second bath, said first open end and said second open end of said tubular shape of said ceramic support to seal deionized water within said ceramic support; and uncovering, after removing said ceramic support from said second bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support. 18. The method of claim 15, further comprising covering, prior to soaking said inner surface of said ceramic support, one of a first open end or a second open end of a tubular shape of said ceramic support to retain said cesium nitrite within an interior of said tubular shape of said ceramic support and impregnating said inner surface of said ceramic support with cesium. 19. The method of claim 15, further comprising reducing, after removing said ceramic support from said first bath and drying said ceramic support, said impregnated ceramic support in a substantially pure hydrogen environment at approximately 400° C. and approximately 1 bar for approximately 60 minutes. 20. The method of claim 15, wherein further comprising agitating said ceramic support in said first bath with ultrasonic vibrations.
|
A catalytic membrane reactor and methods of operating and producing the same are provided that efficiently produces highly pure hydrogen (H2) from ammonia (NH3) as well as operates according to other chemical conversion processes. In one embodiment, a tubular ceramic support made from porous yttria-stabilized zirconia has an outer surface that is impregnated with a metal catalyst such as ruthenium and then plated with a hydrogen permeable membrane such as palladium. An inner surface of the ceramic support is impregnated with cesium to promote conversion of ammonia to hydrogen and nitrogen (N2). The resulting catalytic membrane reactor produces highly pure hydrogen at low temperatures and with less catalytic loading. Therefore, ammonia can be used to effectively transport hydrogen for use in, for example, fuel cells in a vehicle.1. A catalytic membrane reactor for a chemical conversion process, comprising:
a ceramic support extending between an inner surface and an outer surface, wherein said ceramic support is impregnated with a metal catalyst that induces or speeds up said chemical conversion process; a first region of said ceramic support extending from said inner surface to a predetermined distance through a thickness of said ceramic support; a second region of said ceramic support extending from said predetermined distance through said thickness of said ceramic support to said outer surface, wherein said second region has a smaller porosity than said first region, said second region has a smaller thickness than said first region, and said second region comprises at least a portion of said metal catalyst; and a permeable membrane positioned on said outer surface of said ceramic support, wherein said permeable membrane has a smaller thickness than said second region, and said permeable membrane selectively allows at least one product of said chemical conversion process to pass through said permeable membrane and blocks at least one product of said chemical conversion process from passing through said permeable membrane. 2. The catalytic membrane reactor of claim 1, wherein said first region has a substantially constant porosity through said thickness of said first region, and said second region has a substantially constant porosity through said thickness of said second region. 3. The catalytic membrane reactor of claim 1, wherein said first region has a decreasing porosity from said inner surface of said ceramic support to said predetermined distance through said thickness of said ceramic support, and said second region has a decreasing porosity from said predetermined distance through said thickness of said ceramic support to said outer surface of said ceramic support. 4. The catalytic membrane reactor of claim 1, wherein said first region has an average pore size that is greater than 1 micron, and said second region has an average pore size of approximately 0.2 microns. 5. The catalytic membrane reactor of claim 1, wherein said ceramic support has a total wall thickness of approximately 0.13 cm, said thickness of said second region is approximately 20 microns, and said thickness of said hydrogen permeable membrane is less than 25 microns. 6. The catalytic membrane reactor of claim 1, wherein a ceramic support material is comprised of at least one of a zirconia, a zirconate, an alumina, a silica, a silicate, or a zeolite, and wherein a metal catalyst material is comprised of at least one of a metal from the platinum group, a transition metal, an alkali metal promoter, or an alkaline metal promoter. 7. The catalytic membrane reactor of claim 1, wherein said metal catalyst is impregnated into said outer surface of said ceramic support, and cesium is impregnated into said inner surface of said ceramic support to enhance said chemical conversion process. 8. The catalytic membrane reactor of claim 1, wherein said permeable membrane is a hydrogen permeable membrane made of a material comprising at least one of Pd, Pd alloys, Group V metals, or Group V metal alloys. 9. The catalytic membrane reactor of claim 1, wherein said chemical conversion process is NH3⇄1/2N2+3/2H2, and hydrogen is selectively allowed to pass through said permeable membrane and nitrogen is blocked by said permeable membrane from passing through said permeable membrane. 10. A method of producing an enhanced purity of hydrogen in a chemical conversion process, comprising:
moving a fluid having hydrogen into an interior volume of a catalytic membrane reactor, wherein said catalytic membrane reactor comprises: a ceramic support extending between an inner surface and an outer surface, and wherein said inner surface at least partially defines said interior volume, said ceramic support is impregnated with a metal catalyst, and said ceramic support has a smaller porosity proximate to said outer surface than said inner surface; a hydrogen permeable membrane positioned on said outer surface of said ceramic support, wherein said hydrogen permeable membrane at least partially defines an exterior volume of said catalytic membrane reactor; and reacting said fluid with said metal catalyst in said ceramic support such that such that at least some hydrogen flows through said hydrogen permeable membrane and into a permeate flow in said exterior volume, and a remaining product flows in a retentate flow and out of said interior volume. 11. The method of claim 10, further comprising:
increasing a pressure of said fluid to greater than 1 bar; and increasing a temperature of said fluid to greater than 350° C. 12. The method of claim 10, wherein said fluid is ammonia and said remaining product comprises nitrogen. 13. The method of claim 10, wherein said hydrogen is produced according to at least one of the following chemical conversion processes:
steam methane reforming: CH4+2H2O⇄4H2+CO2; water gas shift reaction: CO+H2O⇄CO2+H2; or dehydrogenation reactions: C3H8⇄C3H6+H2. 14. The method of claim 10, wherein said ceramic support is made of approximately 3% Y2O3 and approximately 97% Zr2O3. 15. A method of producing a catalytic membrane reactor, comprising:
positioning a ceramic support in a first bath comprising a metal catalyst, and impregnating an outer surface of said ceramic support with said metal catalyst; removing said ceramic support from said first bath and drying said ceramic support; positioning said ceramic support in a second bath comprising a coating material and plating said outer surface of said ceramic support with said coating material via electroless deposition; removing said ceramic support from said second bath and drying said ceramic support; and soaking an inner surface of said ceramic support with cesium nitrate to impregnate said inner surface of said ceramic support with cesium. 16. The method of claim 15, wherein said first bath comprises a solution of ruthenium chloride hydrate dissolved in approximately 75% acetone and approximately 25% deionized water. 17. The method of claim 15, further comprising:
covering, prior to positioning said ceramic support in said first bath, a first open end and a second open end of a tubular shape of said ceramic support to seal deionized water within said ceramic support; uncovering, after removing said ceramic support from said first bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support; covering, prior to positioning said ceramic support in said second bath, said first open end and said second open end of said tubular shape of said ceramic support to seal deionized water within said ceramic support; and uncovering, after removing said ceramic support from said second bath, said first open end and said second open end of said tubular shape of said ceramic support to remove deionized water from said ceramic support. 18. The method of claim 15, further comprising covering, prior to soaking said inner surface of said ceramic support, one of a first open end or a second open end of a tubular shape of said ceramic support to retain said cesium nitrite within an interior of said tubular shape of said ceramic support and impregnating said inner surface of said ceramic support with cesium. 19. The method of claim 15, further comprising reducing, after removing said ceramic support from said first bath and drying said ceramic support, said impregnated ceramic support in a substantially pure hydrogen environment at approximately 400° C. and approximately 1 bar for approximately 60 minutes. 20. The method of claim 15, wherein further comprising agitating said ceramic support in said first bath with ultrasonic vibrations.
| 2,600
|
338,023
| 16,799,658
| 2,687
|
A storage rack is provided for storing glass sheets. The rack includes substantially horizontal and vertical portions. The substantially horizontal and/or vertical portion(s) of the rack include(s) one or more flexible supports, each including at least one channel. Arms are attached to the left and right sides of the rack. The rear legs have tabs attached thereto, with lower lips extending away from the rack. The rack is stackable with another rack, e.g., with the upper rack's rear sitting on the lower rack's arms, and with the upper rack's front supported by a support member extending upwardly from tubing provided in the lower rack that is accommodated in holes/recesses of the upper rack. The arms are sized, shaped, and arranged to reduce the likelihood of tipping of the upper rack, and the tabs help mitigate the effect of side-to-side movement of the upper rack relative to the lower rack.
|
1. An apparatus for holding a plurality of glass sheets, the apparatus comprising:
a substantially horizontal portion and a substantially vertical portion, wherein the substantially vertical portion is oriented approximately perpendicular to the substantially horizontal portion; left and right arms, at least the left and right arms for operatively connecting the substantially vertical portion and the substantially horizontal portion, each of the left and right arms including a substantially horizontal member and a substantially vertical member, wherein the substantially vertical member is oriented approximately perpendicular to the substantially horizontal member; a plurality of front legs at a front of the substantially horizontal portion, and a plurality of rear legs at a rear of the substantially horizontal portion; at least one outward-facing tab provided for each of the plurality of rear legs, each said tab including a lip extending outwardly from a side of the horizontal portion; and a gasket assembly provided to the substantially horizontal portion and/or the substantially vertical portion, the gasket assembly comprising a plurality of elongated channels therein, wherein the elongated channels are defined along the length of a central portion of the gasket assembly, and the gasket assembly is configured so that an edge portion of a glass sheet is to be positioned so that the glass sheet fits in one of the channels and extends along a length of a substantial portion of the gasket assembly. 2. The apparatus of claim 1, wherein the gasket assembly further comprises
first and second flexible fingers provided on opposite sides of each said channel, a plurality of slits defined in the first and/or second flexible fingers adjacent each said channel so that the slits have respective open end portions at the channel, and a plurality of flexible lips or tabs defined between respective pairs of the slits; wherein the slits extend outwardly from the channels in a width direction of the gasket assembly so that an edge portion of a glass sheet is to be positioned so that the glass sheet fits in the channel and extends along a length of a substantial portion of the gasket assembly and the slits extend outwardly away from the glass sheet. 3. The apparatus of claim 2, wherein the slits and flexible lips or tabs are shaped and oriented so that when a glass sheet is inserted into one of the channels a first number of the flexible lips or tabs thereof is bent by the insertion of the glass sheet and a second number of the flexible lips or tabs is not bent by the insertion of the glass sheet, and wherein one or more of the second number of flexible lips or tabs acts as a stop to block the glass sheet from sliding in the channel in a direction away from the substantially vertical portion of the apparatus. 4. The apparatus of claim 1, wherein the apparatus is configured to be stackable on another like apparatus. 5. The apparatus of claim 4, wherein the arms are sized, shaped, and arranged to support the rear legs of the another apparatus. 6. The apparatus of claim 1, wherein the substantially horizontal portion further comprises tubing. 7. The apparatus of claim 6, wherein the tubing is adapted to receive a support member used to support an apparatus sitting thereon. 8. The apparatus of claim 7, wherein the front legs include holes or recesses such that the holes or recesses of the upper apparatus are adapted to receive the support member. 9. The apparatus of claim 1, wherein each of the substantially horizontal portion and the substantially vertical portion include the gasket assembly. 10. The apparatus of claim 1, wherein the substantially vertical portion includes the gasket assembly and the substantially horizontal portion does not. 11. The apparatus of claim 1, wherein the substantially horizontal portion includes a plurality of rails, wherein the rails are aligned with the channels of the gasket assembly so as to accommodate glass sheets. 12. The apparatus of claim 11, wherein the rails are substantially U-shaped when viewed in cross-section. 13. The apparatus claim 1, wherein the gasket assembly is elongated in shape and is supported by a track, so that the gasket assembly is slidably removable from the track. 14. A kit, comprising:
first and second apparatuses of claim 1; a support member enabling the second apparatus to be stacked on the first apparatus. 15. A method of transporting and/or storing racks, comprising:
having first and second apparatuses of claim 1; stacking the second apparatus on the first apparatus in connection with a support member. 16. The method of claim 15, further comprising inserting the support member into tubing of the first apparatus; and enabling the first apparatus to rest on the second apparatus such that the support member is inserted into holes of the front legs of the second apparatus and a rear portion of the second apparatus rests of the arms of the first apparatus. 17. The method of claim 16, wherein a center of gravity of the second apparatus is positioned behind a lateral center of the second apparatus when stacked on the first apparatus.
|
A storage rack is provided for storing glass sheets. The rack includes substantially horizontal and vertical portions. The substantially horizontal and/or vertical portion(s) of the rack include(s) one or more flexible supports, each including at least one channel. Arms are attached to the left and right sides of the rack. The rear legs have tabs attached thereto, with lower lips extending away from the rack. The rack is stackable with another rack, e.g., with the upper rack's rear sitting on the lower rack's arms, and with the upper rack's front supported by a support member extending upwardly from tubing provided in the lower rack that is accommodated in holes/recesses of the upper rack. The arms are sized, shaped, and arranged to reduce the likelihood of tipping of the upper rack, and the tabs help mitigate the effect of side-to-side movement of the upper rack relative to the lower rack.1. An apparatus for holding a plurality of glass sheets, the apparatus comprising:
a substantially horizontal portion and a substantially vertical portion, wherein the substantially vertical portion is oriented approximately perpendicular to the substantially horizontal portion; left and right arms, at least the left and right arms for operatively connecting the substantially vertical portion and the substantially horizontal portion, each of the left and right arms including a substantially horizontal member and a substantially vertical member, wherein the substantially vertical member is oriented approximately perpendicular to the substantially horizontal member; a plurality of front legs at a front of the substantially horizontal portion, and a plurality of rear legs at a rear of the substantially horizontal portion; at least one outward-facing tab provided for each of the plurality of rear legs, each said tab including a lip extending outwardly from a side of the horizontal portion; and a gasket assembly provided to the substantially horizontal portion and/or the substantially vertical portion, the gasket assembly comprising a plurality of elongated channels therein, wherein the elongated channels are defined along the length of a central portion of the gasket assembly, and the gasket assembly is configured so that an edge portion of a glass sheet is to be positioned so that the glass sheet fits in one of the channels and extends along a length of a substantial portion of the gasket assembly. 2. The apparatus of claim 1, wherein the gasket assembly further comprises
first and second flexible fingers provided on opposite sides of each said channel, a plurality of slits defined in the first and/or second flexible fingers adjacent each said channel so that the slits have respective open end portions at the channel, and a plurality of flexible lips or tabs defined between respective pairs of the slits; wherein the slits extend outwardly from the channels in a width direction of the gasket assembly so that an edge portion of a glass sheet is to be positioned so that the glass sheet fits in the channel and extends along a length of a substantial portion of the gasket assembly and the slits extend outwardly away from the glass sheet. 3. The apparatus of claim 2, wherein the slits and flexible lips or tabs are shaped and oriented so that when a glass sheet is inserted into one of the channels a first number of the flexible lips or tabs thereof is bent by the insertion of the glass sheet and a second number of the flexible lips or tabs is not bent by the insertion of the glass sheet, and wherein one or more of the second number of flexible lips or tabs acts as a stop to block the glass sheet from sliding in the channel in a direction away from the substantially vertical portion of the apparatus. 4. The apparatus of claim 1, wherein the apparatus is configured to be stackable on another like apparatus. 5. The apparatus of claim 4, wherein the arms are sized, shaped, and arranged to support the rear legs of the another apparatus. 6. The apparatus of claim 1, wherein the substantially horizontal portion further comprises tubing. 7. The apparatus of claim 6, wherein the tubing is adapted to receive a support member used to support an apparatus sitting thereon. 8. The apparatus of claim 7, wherein the front legs include holes or recesses such that the holes or recesses of the upper apparatus are adapted to receive the support member. 9. The apparatus of claim 1, wherein each of the substantially horizontal portion and the substantially vertical portion include the gasket assembly. 10. The apparatus of claim 1, wherein the substantially vertical portion includes the gasket assembly and the substantially horizontal portion does not. 11. The apparatus of claim 1, wherein the substantially horizontal portion includes a plurality of rails, wherein the rails are aligned with the channels of the gasket assembly so as to accommodate glass sheets. 12. The apparatus of claim 11, wherein the rails are substantially U-shaped when viewed in cross-section. 13. The apparatus claim 1, wherein the gasket assembly is elongated in shape and is supported by a track, so that the gasket assembly is slidably removable from the track. 14. A kit, comprising:
first and second apparatuses of claim 1; a support member enabling the second apparatus to be stacked on the first apparatus. 15. A method of transporting and/or storing racks, comprising:
having first and second apparatuses of claim 1; stacking the second apparatus on the first apparatus in connection with a support member. 16. The method of claim 15, further comprising inserting the support member into tubing of the first apparatus; and enabling the first apparatus to rest on the second apparatus such that the support member is inserted into holes of the front legs of the second apparatus and a rear portion of the second apparatus rests of the arms of the first apparatus. 17. The method of claim 16, wherein a center of gravity of the second apparatus is positioned behind a lateral center of the second apparatus when stacked on the first apparatus.
| 2,600
|
338,024
| 16,799,647
| 2,687
|
A speaker assembly is provided having a plurality of transducers disposed on a speaker body and configured to produce an audio beam being steerable based on at least one audio beam parameter. A light assembly is arranged on the speaker body and configured to produce a light output that varies based at least one audio beam parameter. The light output varies to provide a visual reference as the audio beam is steered.
|
1. A speaker assembly comprising:
a plurality of transducers disposed on a speaker body configured to produce an audio beam being steerable based on at least one audio beam parameter; and a light assembly arranged on the speaker body configured to produce a light output that varies based at least one audio beam parameter, wherein the light output varies to provide a visual reference as the audio beam is steered. 2. The speaker assembly of claim 1, wherein the at least one beam parameter includes at least one of a beam direction and a beam width. 3. The speaker assembly of claim 1, wherein the light assembly varies at least one light parameter corresponding to the audio beam parameter. 4. The speaker assembly of claim 3, wherein the at least one light parameter includes at least one of a light width and an angular light position. 5. The speaker assembly of claim 1, wherein the light assembly is arranged on a perimeter of the speaker body. 6. The speaker assembly of claim 5, wherein the light assembly is a light ring being generally circular. 7. The speaker assembly of claim 1 further comprising a controller in communication with the light assembly:
wherein the controller is programmed to:
receive a request steer an audio beam between at least a first beam configuration and a second beam configuration; and
provide a signal to vary the light output between a first light setting corresponding to the first beam configuration and a second light setting corresponding to the second beam configuration. 8. An audio system comprising:
a speaker configured to produce a steerable audio beam; and a light assembly arranged on the speaker configured to produce a variable light output; a controller in communication with the speaker and programmed to:
receive a speaker input signal indicating at least one audio beam parameter; and
provide a signal to the light assembly to adjust the variable light output based on the at least one audio beam parameter. 9. The audio system of claim 8, wherein the controller is further programmed to:
provide a signal to the light assembly to adjust the variable light output by varying at least one of a light width and an angular light position. 10. The audio system of claim 8, wherein the light assembly includes a plurality of light sources, wherein the controller is further programmed to:
provide a signal to the light assembly to illuminate a portion of the plurality of light sources based on the at least one audio beam parameter. 11. The audio system of claim 10, wherein the controller is further programmed to:
provide a signal to the vary an angular position of the portion of the plurality of light sources based on the audio beam parameter. 12. The audio system of claim 10, wherein the controller is further programmed to:
provide a signal to vary a width of the portion of the plurality of light sources based on the audio beam parameter. 13. The audio system of claim 8, wherein the controller is further programmed to:
receive the speaker input signal from a mobile device remote from the speaker. 14. A speaker assembly comprising:
a speaker body; and a light ring positioned on the speaker body and configured to provide a light output that varies at least one of a light width and an angular light position. 15. The speaker assembly of claim 14, wherein the light ring is positioned on along a periphery of the speaker body. 16. The speaker assembly of claim 14, wherein the light ring includes a plurality of light sources positioned on the speaker body in a circular array. 17. The speaker assembly of claim 16, wherein the light output varies by illuminating a portion of the plurality of light sources. 18. The speaker assembly of claim 16, wherein the plurality of light sources comprises a plurality of light-emitting diodes (LEDs). 19. The speaker assembly of claim 14, wherein the light ring is arranged along a top surface of the speaker body. 20. The speaker assembly of claim 14, wherein the light ring is arranged at an intermediate position on the speaker body.
|
A speaker assembly is provided having a plurality of transducers disposed on a speaker body and configured to produce an audio beam being steerable based on at least one audio beam parameter. A light assembly is arranged on the speaker body and configured to produce a light output that varies based at least one audio beam parameter. The light output varies to provide a visual reference as the audio beam is steered.1. A speaker assembly comprising:
a plurality of transducers disposed on a speaker body configured to produce an audio beam being steerable based on at least one audio beam parameter; and a light assembly arranged on the speaker body configured to produce a light output that varies based at least one audio beam parameter, wherein the light output varies to provide a visual reference as the audio beam is steered. 2. The speaker assembly of claim 1, wherein the at least one beam parameter includes at least one of a beam direction and a beam width. 3. The speaker assembly of claim 1, wherein the light assembly varies at least one light parameter corresponding to the audio beam parameter. 4. The speaker assembly of claim 3, wherein the at least one light parameter includes at least one of a light width and an angular light position. 5. The speaker assembly of claim 1, wherein the light assembly is arranged on a perimeter of the speaker body. 6. The speaker assembly of claim 5, wherein the light assembly is a light ring being generally circular. 7. The speaker assembly of claim 1 further comprising a controller in communication with the light assembly:
wherein the controller is programmed to:
receive a request steer an audio beam between at least a first beam configuration and a second beam configuration; and
provide a signal to vary the light output between a first light setting corresponding to the first beam configuration and a second light setting corresponding to the second beam configuration. 8. An audio system comprising:
a speaker configured to produce a steerable audio beam; and a light assembly arranged on the speaker configured to produce a variable light output; a controller in communication with the speaker and programmed to:
receive a speaker input signal indicating at least one audio beam parameter; and
provide a signal to the light assembly to adjust the variable light output based on the at least one audio beam parameter. 9. The audio system of claim 8, wherein the controller is further programmed to:
provide a signal to the light assembly to adjust the variable light output by varying at least one of a light width and an angular light position. 10. The audio system of claim 8, wherein the light assembly includes a plurality of light sources, wherein the controller is further programmed to:
provide a signal to the light assembly to illuminate a portion of the plurality of light sources based on the at least one audio beam parameter. 11. The audio system of claim 10, wherein the controller is further programmed to:
provide a signal to the vary an angular position of the portion of the plurality of light sources based on the audio beam parameter. 12. The audio system of claim 10, wherein the controller is further programmed to:
provide a signal to vary a width of the portion of the plurality of light sources based on the audio beam parameter. 13. The audio system of claim 8, wherein the controller is further programmed to:
receive the speaker input signal from a mobile device remote from the speaker. 14. A speaker assembly comprising:
a speaker body; and a light ring positioned on the speaker body and configured to provide a light output that varies at least one of a light width and an angular light position. 15. The speaker assembly of claim 14, wherein the light ring is positioned on along a periphery of the speaker body. 16. The speaker assembly of claim 14, wherein the light ring includes a plurality of light sources positioned on the speaker body in a circular array. 17. The speaker assembly of claim 16, wherein the light output varies by illuminating a portion of the plurality of light sources. 18. The speaker assembly of claim 16, wherein the plurality of light sources comprises a plurality of light-emitting diodes (LEDs). 19. The speaker assembly of claim 14, wherein the light ring is arranged along a top surface of the speaker body. 20. The speaker assembly of claim 14, wherein the light ring is arranged at an intermediate position on the speaker body.
| 2,600
|
338,025
| 16,799,651
| 2,687
|
The present disclosure relates generally to compounds that simultaneously bind both mutant huntingtin protein (mHTT) and an ubiquitin E3 ligase and their use as therapeutic agents, for example, in treating diseases, such as neurodegenerative disorders caused by aggregation of mHTT.
|
1. A compound of formula (I):
W-L-ULM (I) 2. The compound of claim 1, wherein ULM is a moiety that targets mouse double minute two homolog (MDM2), cellular inhibitor of apoptosis protein 1 (cIAP1), cereblon (CRBN), or von Hippel-Lindau (VHL). 3. (canceled) 4. (canceled) 5. (canceled) 6. The compound of claim 1, wherein ULM is selected from: 7. (canceled) 8. The compound of claim 1, wherein ULM is: 9. The compound of claim 1, wherein W is a compound of formula (A): 10. The compound of claim 1, wherein W is a compound of formula (B): 11.-18. (canceled) 19. The compound of claim 1, wherein W is a compound of formula (C): 20. The compound of claim 1, wherein W is a compound of formula (D): 21. The compound of claim 1, wherein W is a compound of formula (E): 22. (canceled) 23. (canceled) 24. The compound of claim 1, wherein W is a compound of formula (F): 25. (canceled) 26. (canceled) 27. (canceled) 28. The compound of claim 1, wherein L is a bond. 29. The compound of claim 1, wherein L is a linking moiety optionally substituted with B. 30. The compound of claim 29, wherein the linking moiety is alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene;
wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, may optionally comprise an arylene, heteroarylene, cycloalkylene or heterocycloalkylene; and further wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene is independently optionally substituted with one to five substituents independently selected from oxo, halo, C1-4 alkyl, C1-4 alkoxy, and C1-4 haloalkyl. 31. (canceled) 32. (canceled) 33. The compound of claim 1, wherein B is a carrier peptide, cholesterol, or a carrier peptide conjugated to cholesterol. 34. The compound of claim 1, wherein B is Angiopep2, ApoE-I, ApoE-II, ApoB, THR, Peptide-22, L57, TGN, leptin30, RVG29, nipah virus env. HR region conjugated to cholesterol, newcastle disease virus conjugated to cholesterol, or measles virus peptide conjugated to cholesterol. 35. A compound, or a pharmaceutically acceptable salt, stereoisomer, mixture of stereoisomers, or isotopically enriched analog thereof, selected from: 36. A pharmaceutical composition comprising a compound of claim 1, and a pharmaceutically acceptable excipient or carrier. 37. A method for inducing degradation of mHTT comprising administering a therapeutically effective amount of a compound of claim 1. 38. A method for treating Huntington's disease comprising administering a therapeutically effective amount of a compound of claim 1.
|
The present disclosure relates generally to compounds that simultaneously bind both mutant huntingtin protein (mHTT) and an ubiquitin E3 ligase and their use as therapeutic agents, for example, in treating diseases, such as neurodegenerative disorders caused by aggregation of mHTT.1. A compound of formula (I):
W-L-ULM (I) 2. The compound of claim 1, wherein ULM is a moiety that targets mouse double minute two homolog (MDM2), cellular inhibitor of apoptosis protein 1 (cIAP1), cereblon (CRBN), or von Hippel-Lindau (VHL). 3. (canceled) 4. (canceled) 5. (canceled) 6. The compound of claim 1, wherein ULM is selected from: 7. (canceled) 8. The compound of claim 1, wherein ULM is: 9. The compound of claim 1, wherein W is a compound of formula (A): 10. The compound of claim 1, wherein W is a compound of formula (B): 11.-18. (canceled) 19. The compound of claim 1, wherein W is a compound of formula (C): 20. The compound of claim 1, wherein W is a compound of formula (D): 21. The compound of claim 1, wherein W is a compound of formula (E): 22. (canceled) 23. (canceled) 24. The compound of claim 1, wherein W is a compound of formula (F): 25. (canceled) 26. (canceled) 27. (canceled) 28. The compound of claim 1, wherein L is a bond. 29. The compound of claim 1, wherein L is a linking moiety optionally substituted with B. 30. The compound of claim 29, wherein the linking moiety is alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene;
wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, may optionally comprise an arylene, heteroarylene, cycloalkylene or heterocycloalkylene; and further wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene is independently optionally substituted with one to five substituents independently selected from oxo, halo, C1-4 alkyl, C1-4 alkoxy, and C1-4 haloalkyl. 31. (canceled) 32. (canceled) 33. The compound of claim 1, wherein B is a carrier peptide, cholesterol, or a carrier peptide conjugated to cholesterol. 34. The compound of claim 1, wherein B is Angiopep2, ApoE-I, ApoE-II, ApoB, THR, Peptide-22, L57, TGN, leptin30, RVG29, nipah virus env. HR region conjugated to cholesterol, newcastle disease virus conjugated to cholesterol, or measles virus peptide conjugated to cholesterol. 35. A compound, or a pharmaceutically acceptable salt, stereoisomer, mixture of stereoisomers, or isotopically enriched analog thereof, selected from: 36. A pharmaceutical composition comprising a compound of claim 1, and a pharmaceutically acceptable excipient or carrier. 37. A method for inducing degradation of mHTT comprising administering a therapeutically effective amount of a compound of claim 1. 38. A method for treating Huntington's disease comprising administering a therapeutically effective amount of a compound of claim 1.
| 2,600
|
338,026
| 16,799,684
| 2,648
|
The present disclosure relates generally to compounds that simultaneously bind both mutant huntingtin protein (mHTT) and an ubiquitin E3 ligase and their use as therapeutic agents, for example, in treating diseases, such as neurodegenerative disorders caused by aggregation of mHTT.
|
1. A compound of formula (I):
W-L-ULM (I) 2. The compound of claim 1, wherein ULM is a moiety that targets mouse double minute two homolog (MDM2), cellular inhibitor of apoptosis protein 1 (cIAP1), cereblon (CRBN), or von Hippel-Lindau (VHL). 3. (canceled) 4. (canceled) 5. (canceled) 6. The compound of claim 1, wherein ULM is selected from: 7. (canceled) 8. The compound of claim 1, wherein ULM is: 9. The compound of claim 1, wherein W is a compound of formula (A): 10. The compound of claim 1, wherein W is a compound of formula (B): 11.-18. (canceled) 19. The compound of claim 1, wherein W is a compound of formula (C): 20. The compound of claim 1, wherein W is a compound of formula (D): 21. The compound of claim 1, wherein W is a compound of formula (E): 22. (canceled) 23. (canceled) 24. The compound of claim 1, wherein W is a compound of formula (F): 25. (canceled) 26. (canceled) 27. (canceled) 28. The compound of claim 1, wherein L is a bond. 29. The compound of claim 1, wherein L is a linking moiety optionally substituted with B. 30. The compound of claim 29, wherein the linking moiety is alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene;
wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, may optionally comprise an arylene, heteroarylene, cycloalkylene or heterocycloalkylene; and further wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene is independently optionally substituted with one to five substituents independently selected from oxo, halo, C1-4 alkyl, C1-4 alkoxy, and C1-4 haloalkyl. 31. (canceled) 32. (canceled) 33. The compound of claim 1, wherein B is a carrier peptide, cholesterol, or a carrier peptide conjugated to cholesterol. 34. The compound of claim 1, wherein B is Angiopep2, ApoE-I, ApoE-II, ApoB, THR, Peptide-22, L57, TGN, leptin30, RVG29, nipah virus env. HR region conjugated to cholesterol, newcastle disease virus conjugated to cholesterol, or measles virus peptide conjugated to cholesterol. 35. A compound, or a pharmaceutically acceptable salt, stereoisomer, mixture of stereoisomers, or isotopically enriched analog thereof, selected from: 36. A pharmaceutical composition comprising a compound of claim 1, and a pharmaceutically acceptable excipient or carrier. 37. A method for inducing degradation of mHTT comprising administering a therapeutically effective amount of a compound of claim 1. 38. A method for treating Huntington's disease comprising administering a therapeutically effective amount of a compound of claim 1.
|
The present disclosure relates generally to compounds that simultaneously bind both mutant huntingtin protein (mHTT) and an ubiquitin E3 ligase and their use as therapeutic agents, for example, in treating diseases, such as neurodegenerative disorders caused by aggregation of mHTT.1. A compound of formula (I):
W-L-ULM (I) 2. The compound of claim 1, wherein ULM is a moiety that targets mouse double minute two homolog (MDM2), cellular inhibitor of apoptosis protein 1 (cIAP1), cereblon (CRBN), or von Hippel-Lindau (VHL). 3. (canceled) 4. (canceled) 5. (canceled) 6. The compound of claim 1, wherein ULM is selected from: 7. (canceled) 8. The compound of claim 1, wherein ULM is: 9. The compound of claim 1, wherein W is a compound of formula (A): 10. The compound of claim 1, wherein W is a compound of formula (B): 11.-18. (canceled) 19. The compound of claim 1, wherein W is a compound of formula (C): 20. The compound of claim 1, wherein W is a compound of formula (D): 21. The compound of claim 1, wherein W is a compound of formula (E): 22. (canceled) 23. (canceled) 24. The compound of claim 1, wherein W is a compound of formula (F): 25. (canceled) 26. (canceled) 27. (canceled) 28. The compound of claim 1, wherein L is a bond. 29. The compound of claim 1, wherein L is a linking moiety optionally substituted with B. 30. The compound of claim 29, wherein the linking moiety is alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene;
wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, may optionally comprise an arylene, heteroarylene, cycloalkylene or heterocycloalkylene; and further wherein each alkylene, heteroalkylene, alkenylene, heteroalkenylene, alkynylene, heteroalkynylene, arylene, heteroarylene, cycloalkylene or heterocycloalkylene is independently optionally substituted with one to five substituents independently selected from oxo, halo, C1-4 alkyl, C1-4 alkoxy, and C1-4 haloalkyl. 31. (canceled) 32. (canceled) 33. The compound of claim 1, wherein B is a carrier peptide, cholesterol, or a carrier peptide conjugated to cholesterol. 34. The compound of claim 1, wherein B is Angiopep2, ApoE-I, ApoE-II, ApoB, THR, Peptide-22, L57, TGN, leptin30, RVG29, nipah virus env. HR region conjugated to cholesterol, newcastle disease virus conjugated to cholesterol, or measles virus peptide conjugated to cholesterol. 35. A compound, or a pharmaceutically acceptable salt, stereoisomer, mixture of stereoisomers, or isotopically enriched analog thereof, selected from: 36. A pharmaceutical composition comprising a compound of claim 1, and a pharmaceutically acceptable excipient or carrier. 37. A method for inducing degradation of mHTT comprising administering a therapeutically effective amount of a compound of claim 1. 38. A method for treating Huntington's disease comprising administering a therapeutically effective amount of a compound of claim 1.
| 2,600
|
338,027
| 16,799,671
| 2,648
|
A convolutional neural network includes a pooling unit. The pooling unit performs pooling operations between convolution layers of the convolutional neural network. The pooling unit includes hardware blocks that promote computational and area efficiency in the convolutional neural network.
|
1. A pooling unit of a convolutional neural network, comprising:
a cropper configured to receive a feature tensor and to generate a cropped feature tensor including a plurality of data values by cropping the feature tensor; a line buffer configured to receive the data values from the cropper; a column calculator configured to perform column pooling operations on data columns from the line buffer; and a row calculator configured to perform row pooling operations on data rows from the column calculator. 2. The pooling unit of claim 1, further comprising a global pooling data path configured to selectively bypass the line buffer, the column calculator, and the row calculator. 3. The pooling unit of claim 1, further comprising an unpooling block configured to perform unpooling operations on pooling data from the row calculator and the column calculator. 4. The pooling unit of claim 1, further comprising a configuration register configured to store configuration data for the cropper, the column calculator, and the row calculator. 5. The pooling unit of claim 4, wherein the configuration register stores data indicating a type of pooling operations to be performed by the column calculator and the row calculator. 6. The pooling unit of claim 4, wherein the configuration register stores data indicating how the cropper should crop the feature tensor. 7. The pooling unit of claim 1, further comprising an average multiplication stage configured to generate average values from row pooling data generated by the row calculator. 8. The pooling unit of claim 1, further comprising a padding control block configured to pad the data columns from the line buffer and to pass the padded data columns to the column calculator. 9. The pooling unit of claim 1, wherein the line buffer is a single ported line buffer. 10. The pooling unit of claim 1, further comprising a stride manager configured to control a window stride in pooling the cropped feature tensor. 11. A method, comprising:
receiving, in a pooling unit of a convolutional neural network, a feature tensor; generating a cropped feature tensor including a plurality of data values by cropping the feature tensor with a cropper of the pooling unit; passing the data values of the cropped feature tensor to a single ported line buffer of the pooling unit; generating pooled feature data by performing column and row pooling calculations on the data values from the line buffer. 12. The method of claim 11, further comprising generating prediction data with the convolutional neural network based, at least in part, on the pooled feature data. 13. The method of claim 11, further comprising storing, in a configuration register of the pooling unit, configuration data for the cropper. 14. The method of claim 13, wherein the configuration register stores data indicating a type of pooling operations to be performed by a column calculator and a row calculator of the pooling unit. 15. The method of claim 13, wherein the configuration register stores data indicating how the cropper should crop the feature tensor. 16. The method of claim 13, wherein the configuration data stores pooling window size data indicating a size for pooling windows. 17. The method of claim 11, further comprising outputting the pooled feature data to a convolution layer of the convolutional neural network. 18. A method, comprising:
receiving, in a pooling unit of a convolutional neural network, a feature tensor; storing, in a configuration register of the pooling unit, pooling window size data; generating, with the pooling unit, a plurality of pooling windows from the feature tensor in accordance with the pooling window size data; generating pooled feature data by performing column and row pooling calculations on the data values from the pooling windows. 19. The method of claim 18, further comprising selectively bypassing the line buffer, the column calculator, and the row calculator with a global pooling bypass line of the pooling unit. 20. The method of claim 19, further comprising performing, with an unpooling block of the pooling unit, unpooling operations on the pooled feature data. 21. The method of claim 18, further comprising generating prediction data with the convolutional neural network based, at least in part, on the pooled feature data. 22. The method of claim 18, further comprising outputting the pooled feature data to a convolution layer of the convolutional neural network.
|
A convolutional neural network includes a pooling unit. The pooling unit performs pooling operations between convolution layers of the convolutional neural network. The pooling unit includes hardware blocks that promote computational and area efficiency in the convolutional neural network.1. A pooling unit of a convolutional neural network, comprising:
a cropper configured to receive a feature tensor and to generate a cropped feature tensor including a plurality of data values by cropping the feature tensor; a line buffer configured to receive the data values from the cropper; a column calculator configured to perform column pooling operations on data columns from the line buffer; and a row calculator configured to perform row pooling operations on data rows from the column calculator. 2. The pooling unit of claim 1, further comprising a global pooling data path configured to selectively bypass the line buffer, the column calculator, and the row calculator. 3. The pooling unit of claim 1, further comprising an unpooling block configured to perform unpooling operations on pooling data from the row calculator and the column calculator. 4. The pooling unit of claim 1, further comprising a configuration register configured to store configuration data for the cropper, the column calculator, and the row calculator. 5. The pooling unit of claim 4, wherein the configuration register stores data indicating a type of pooling operations to be performed by the column calculator and the row calculator. 6. The pooling unit of claim 4, wherein the configuration register stores data indicating how the cropper should crop the feature tensor. 7. The pooling unit of claim 1, further comprising an average multiplication stage configured to generate average values from row pooling data generated by the row calculator. 8. The pooling unit of claim 1, further comprising a padding control block configured to pad the data columns from the line buffer and to pass the padded data columns to the column calculator. 9. The pooling unit of claim 1, wherein the line buffer is a single ported line buffer. 10. The pooling unit of claim 1, further comprising a stride manager configured to control a window stride in pooling the cropped feature tensor. 11. A method, comprising:
receiving, in a pooling unit of a convolutional neural network, a feature tensor; generating a cropped feature tensor including a plurality of data values by cropping the feature tensor with a cropper of the pooling unit; passing the data values of the cropped feature tensor to a single ported line buffer of the pooling unit; generating pooled feature data by performing column and row pooling calculations on the data values from the line buffer. 12. The method of claim 11, further comprising generating prediction data with the convolutional neural network based, at least in part, on the pooled feature data. 13. The method of claim 11, further comprising storing, in a configuration register of the pooling unit, configuration data for the cropper. 14. The method of claim 13, wherein the configuration register stores data indicating a type of pooling operations to be performed by a column calculator and a row calculator of the pooling unit. 15. The method of claim 13, wherein the configuration register stores data indicating how the cropper should crop the feature tensor. 16. The method of claim 13, wherein the configuration data stores pooling window size data indicating a size for pooling windows. 17. The method of claim 11, further comprising outputting the pooled feature data to a convolution layer of the convolutional neural network. 18. A method, comprising:
receiving, in a pooling unit of a convolutional neural network, a feature tensor; storing, in a configuration register of the pooling unit, pooling window size data; generating, with the pooling unit, a plurality of pooling windows from the feature tensor in accordance with the pooling window size data; generating pooled feature data by performing column and row pooling calculations on the data values from the pooling windows. 19. The method of claim 18, further comprising selectively bypassing the line buffer, the column calculator, and the row calculator with a global pooling bypass line of the pooling unit. 20. The method of claim 19, further comprising performing, with an unpooling block of the pooling unit, unpooling operations on the pooled feature data. 21. The method of claim 18, further comprising generating prediction data with the convolutional neural network based, at least in part, on the pooled feature data. 22. The method of claim 18, further comprising outputting the pooled feature data to a convolution layer of the convolutional neural network.
| 2,600
|
338,028
| 16,799,653
| 2,648
|
Threads of a process require a shared resource to perform their work. The threads have a shared object, which might include a lock and an expiration time. When the resource has not been acquired and any one of the threads attempts to access the shared resource, that thread locks the lock, acquires the shared resource, sets the expiration time, releases the lock, and then uses the shared resource to perform its work. When any one of the threads requires the resource and the resource has been acquired but the expiration time is within a time threshold, only that thread refreshes the resource, resets the expiration time, and uses the resource to perform its work. When any of the threads require the resource and the resource is available and not expired, the thread uses the shared resource.
|
1. A method performed by a computing device comprising processing hardware and storage hardware, the method comprising:
executing a process comprising threads, wherein each thread comprises respective instances of substantially the same executable code, a shared object that is shared among the threads, wherein the shared object comprises a lock, and wherein the executable code is configured to perform a process comprising:
executing work code that, when executed, performs work using the shared resource;
based on performing the work, acquiring the shared resource by:
if the lock is locked, blocking until it is released;
if the shared resource is available and the lock is not locked, acquiring the shared resource and performing the work with the shared resource; and
if the shared resource is unavailable and the lock is not locked, then locking the lock, acquiring the shared resource from a source external to the process, unlocking the lock, and performing the work with the shared resource. 2. A method according to claim 1, wherein the shared object further includes a time window variable corresponding to refreshing the shared resource, and wherein acquiring the shared resource further comprises:
if the time window variable indicates that current time is within the time window, then refreshing the shared resource with the external source, locking the lock, resetting the time window variable, and releasing the lock. 3. A method according to claim 1, wherein the source external to the process comprises a second server process or a cloud service. 4. A method according to claim 3, wherein the source external to the process generates an expiration time for the shared resource when providing the shared resource to process, and wherein the shared resource becomes invalid at the source external to the process when the expiration time is reached. 5. A method according to claim 1, further comprising receiving, by the server process, client requests sent by clients, distributing the client requests to the threads, servicing the client requests by the threads accessing the shared resource, and returning responses to the client. 6. A method according to claim 5, wherein sharing the lock among the threads prevents more than one thread at a time from acquiring or updating the shared resource. 7. A method according to claim 6, wherein when one of the threads is acquiring or updating the shared resource the other threads will block if they attempt to acquire the shared resource. 8. A method according to claim 1, wherein the lock comprises a condition variable, and wherein the shared object comprises a Boolean variable that is used to indicate if a thread has been selected to update the shared resource. 9. A computing device comprising:
storage hardware storing instructions; processing hardware that, when executing the instructions, performs a process comprising:
executing a process comprising threads, each thread comprising a shared object that stores a resource and an expiration time of the resource, each thread having a lock associated with the shared object, each thread configured to perform respective work using the resource;
when any of the threads require the resource to perform the work, the thread blocks on the lock if the lock is locked;
when any of the threads determine that the resource is available, the thread uses the resource to perform the work;
when any of the threads determine that the resource is not available, the thread locks the lock, acquires the resource from a source external to the process, sets the expiration time accordingly, and then unlocks the lock; and
when any of the threads determine that the expiration time is below threshold, the thread communicates with the external resource to renew the resource, then locks the lock to reset the expiration time, and then unlocks the lock. 10. A computing device according to claim 9, wherein the resource is used by the threads to access a helper service executing on another computing device. 11. A computing device according to claim 9, wherein the process executes as part of a first cloud service, and wherein the external resource comprises a second cloud service. 12. A computing device according to claim 9, wherein the expiration time is set according to an indication of same received from the external resource, and wherein the resource becomes invalid at the external resource at the expiration time unless one of the threads instructs the external resource to update or renew the resource. 13. A computing device according to claim 9, wherein use of the lock by the threads prevents more than one thread at a time from acquiring the resource. 14. A computing device according to claim 9, wherein use of the lock by the threads prevents more than one thread at a time from resetting the expiration time. 15. A computing device according to claim 9, wherein one thread updates the resource with the external resource while another thread uses the resource. 16. A computing device according to claim 9, wherein the lock comprises a member of a condition variable. 17. Computer storage hardware storing information configured to cause one or more computers to perform a process, the process comprising:
executing a process managed by an operating system, the process comprising worker threads and a shared resource; providing the shared resource, which is shared among the threads, wherein the threads use the shared resource to perform respective tasks; initially acquiring the shared resource from a source outside the process when any one of the threads requires the shared resource by any one of the threads: acquiring the resource from the source outside the process, setting an expiration time for the shared resource, copying the shared resource, and then signaling the other threads that the shared resource is available, wherein any other thread that requires the shared resource during the initial acquiring will: block until signaled that the shared resource is available, and then access the shared resource; refreshing the shared resource when any of the threads require the shared resource and the current time is within a threshold amount of time from the expiration time by any one of the threads: refreshing the shared resource with the source outside the process, and excluding the other threads from using the expiration time while resetting the expiration time, wherein any other thread can access the shared resource while the shared resource is being refreshed; and when any of the threads require the shared resource and the shared resource is available and current time is not within the threshold of the expiration time, the thread accesses the shared resource. 18. Computer storage hardware according to claim 17, wherein the shared resource comprises a security token that the threads provide to a cloud service to authenticate with the cloud service. 19. Computer storage hardware according to claim 17, wherein the expiration time is shared among the threads and all threads check the expiration time against current time when accessing the shared resource. 20. Computer storage hardware according to claim 17, wherein when the shared resource is available to the threads, each time a thread needs to access the shared resource the thread checks the expiration time to determine if the shared resource needs to be updated or renewed.
|
Threads of a process require a shared resource to perform their work. The threads have a shared object, which might include a lock and an expiration time. When the resource has not been acquired and any one of the threads attempts to access the shared resource, that thread locks the lock, acquires the shared resource, sets the expiration time, releases the lock, and then uses the shared resource to perform its work. When any one of the threads requires the resource and the resource has been acquired but the expiration time is within a time threshold, only that thread refreshes the resource, resets the expiration time, and uses the resource to perform its work. When any of the threads require the resource and the resource is available and not expired, the thread uses the shared resource.1. A method performed by a computing device comprising processing hardware and storage hardware, the method comprising:
executing a process comprising threads, wherein each thread comprises respective instances of substantially the same executable code, a shared object that is shared among the threads, wherein the shared object comprises a lock, and wherein the executable code is configured to perform a process comprising:
executing work code that, when executed, performs work using the shared resource;
based on performing the work, acquiring the shared resource by:
if the lock is locked, blocking until it is released;
if the shared resource is available and the lock is not locked, acquiring the shared resource and performing the work with the shared resource; and
if the shared resource is unavailable and the lock is not locked, then locking the lock, acquiring the shared resource from a source external to the process, unlocking the lock, and performing the work with the shared resource. 2. A method according to claim 1, wherein the shared object further includes a time window variable corresponding to refreshing the shared resource, and wherein acquiring the shared resource further comprises:
if the time window variable indicates that current time is within the time window, then refreshing the shared resource with the external source, locking the lock, resetting the time window variable, and releasing the lock. 3. A method according to claim 1, wherein the source external to the process comprises a second server process or a cloud service. 4. A method according to claim 3, wherein the source external to the process generates an expiration time for the shared resource when providing the shared resource to process, and wherein the shared resource becomes invalid at the source external to the process when the expiration time is reached. 5. A method according to claim 1, further comprising receiving, by the server process, client requests sent by clients, distributing the client requests to the threads, servicing the client requests by the threads accessing the shared resource, and returning responses to the client. 6. A method according to claim 5, wherein sharing the lock among the threads prevents more than one thread at a time from acquiring or updating the shared resource. 7. A method according to claim 6, wherein when one of the threads is acquiring or updating the shared resource the other threads will block if they attempt to acquire the shared resource. 8. A method according to claim 1, wherein the lock comprises a condition variable, and wherein the shared object comprises a Boolean variable that is used to indicate if a thread has been selected to update the shared resource. 9. A computing device comprising:
storage hardware storing instructions; processing hardware that, when executing the instructions, performs a process comprising:
executing a process comprising threads, each thread comprising a shared object that stores a resource and an expiration time of the resource, each thread having a lock associated with the shared object, each thread configured to perform respective work using the resource;
when any of the threads require the resource to perform the work, the thread blocks on the lock if the lock is locked;
when any of the threads determine that the resource is available, the thread uses the resource to perform the work;
when any of the threads determine that the resource is not available, the thread locks the lock, acquires the resource from a source external to the process, sets the expiration time accordingly, and then unlocks the lock; and
when any of the threads determine that the expiration time is below threshold, the thread communicates with the external resource to renew the resource, then locks the lock to reset the expiration time, and then unlocks the lock. 10. A computing device according to claim 9, wherein the resource is used by the threads to access a helper service executing on another computing device. 11. A computing device according to claim 9, wherein the process executes as part of a first cloud service, and wherein the external resource comprises a second cloud service. 12. A computing device according to claim 9, wherein the expiration time is set according to an indication of same received from the external resource, and wherein the resource becomes invalid at the external resource at the expiration time unless one of the threads instructs the external resource to update or renew the resource. 13. A computing device according to claim 9, wherein use of the lock by the threads prevents more than one thread at a time from acquiring the resource. 14. A computing device according to claim 9, wherein use of the lock by the threads prevents more than one thread at a time from resetting the expiration time. 15. A computing device according to claim 9, wherein one thread updates the resource with the external resource while another thread uses the resource. 16. A computing device according to claim 9, wherein the lock comprises a member of a condition variable. 17. Computer storage hardware storing information configured to cause one or more computers to perform a process, the process comprising:
executing a process managed by an operating system, the process comprising worker threads and a shared resource; providing the shared resource, which is shared among the threads, wherein the threads use the shared resource to perform respective tasks; initially acquiring the shared resource from a source outside the process when any one of the threads requires the shared resource by any one of the threads: acquiring the resource from the source outside the process, setting an expiration time for the shared resource, copying the shared resource, and then signaling the other threads that the shared resource is available, wherein any other thread that requires the shared resource during the initial acquiring will: block until signaled that the shared resource is available, and then access the shared resource; refreshing the shared resource when any of the threads require the shared resource and the current time is within a threshold amount of time from the expiration time by any one of the threads: refreshing the shared resource with the source outside the process, and excluding the other threads from using the expiration time while resetting the expiration time, wherein any other thread can access the shared resource while the shared resource is being refreshed; and when any of the threads require the shared resource and the shared resource is available and current time is not within the threshold of the expiration time, the thread accesses the shared resource. 18. Computer storage hardware according to claim 17, wherein the shared resource comprises a security token that the threads provide to a cloud service to authenticate with the cloud service. 19. Computer storage hardware according to claim 17, wherein the expiration time is shared among the threads and all threads check the expiration time against current time when accessing the shared resource. 20. Computer storage hardware according to claim 17, wherein when the shared resource is available to the threads, each time a thread needs to access the shared resource the thread checks the expiration time to determine if the shared resource needs to be updated or renewed.
| 2,600
|
338,029
| 16,799,640
| 2,648
|
Embodiments of this application disclose a dynamic image compositing method performed at a terminal. A skeleton animation of an animation model is displayed on a real-world image captured by the terminal; a currently displayed target real-world image is captured in a case that a photographing instruction is received, and the skeleton animation of the animation model is recorded, to obtain the recorded skeleton animation; image compositing is performed on the target real-world image and each frame of image of the recorded skeleton animation, to obtain a plurality of composited images; and the plurality of composited images are combined into a corresponding dynamic image. Based on the solutions, the real-world image and the skeleton animation of the animation model may be automatically composited into the corresponding dynamic image, and a user does not need to perform a large quantity of repetitive image addition and selection operations.
|
1. A dynamic image compositing method performed at a terminal having one or more processors and memory storing a plurality of programs to be executed by the one or more processors, the method comprising:
displaying a skeleton animation of an animation model on a real-world image captured by the terminal; receiving a photographing instruction; in response to the photographing instruction:
capturing a currently displayed target real-world image and recording the skeleton animation of the animation model, the recorded skeleton animation including a plurality of image frames;
performing image composition on the target real-world image and the plurality of image frames, to obtain a plurality of composited images, each composited image having the target real-world image as its background; and combining the plurality of composited images into a dynamic image animation. 2. The dynamic image compositing method according to claim 1, wherein the displaying a skeleton animation of an animation model on a real-world image captured by the terminal comprises:
displaying the captured real-world image through a first image display component of the terminal; and displaying the skeleton animation of the animation model through a second image display component of the terminal, wherein the second image display component is superimposed on the first image display component; and the capturing a currently displayed target real-world image and recording the skeleton animation of the animation model comprises: capturing the currently displayed target real-world image through the first image display component, and simultaneously recording the skeleton animation of the animation model through the second image display component. 3. The dynamic image compositing method according to claim 2, wherein the recording the skeleton animation of the animation model through the second image display component comprises:
capturing a currently displayed skeleton animation image of the animation model at intervals of a preset time length through the second image display component to serve as a frame of image of the recorded skeleton animation. 4. The dynamic image compositing method according to claim 1, further comprising:
setting the target real-world image into a parent image display control, and setting a target frame of image of the recorded skeleton animation into a child image display control of the parent image display control, wherein the target frame of image is a frame of image in the recorded skeleton animation; and displaying the target real-world image and the target frame of image on an interface through the parent image display control and the child image display control. 5. The dynamic image compositing method according to claim 4, further comprising:
in response to the photographing instruction, recording an animation offset location of the current skeleton animation of the animation model relative to the real-world image; and the displaying the target real-world image and the target frame of image on a corresponding interface through the parent image display control and the child image display control comprises:
setting an offset location of the child image display control relative to the parent image display control according to the animation offset location; and
displaying the target real-world image and the target frame of image on the corresponding interface according to the parent image display control and the child image display control after the setting. 6. The dynamic image compositing method according to claim 4, wherein the performing image composition on the target real-world image and the plurality of image frames comprises:
taking the target real-world image as a background image; and performing image composition on each frame of image of the recorded skeleton animation and the background image according to a current offset location of the child image display control relative to the parent image display control, to obtain the composited images. 7. The dynamic image compositing method according to claim 1, further comprising:
determining a location in an interface according to a location of the animation model and a size of the skeleton animation, and adding an information display box to the location; displaying, in the information display box, information inputted by a user; performing image capture on the information display box, to obtain an information display box image; and adding the information display box image to the dynamic image. 8. The dynamic image compositing method according to claim 7, wherein the adding the information display box image to the dynamic image comprises:
performing image composition on the information display box image and each of the plurality of composited images, and combining obtained images into the dynamic image. 9. A terminal comprising one or more processors, memory coupled to the one or more processors and a plurality of programs stored in the memory that, when executed by the one or more processors, cause the terminal to perform a plurality of operations comprising:
displaying a skeleton animation of an animation model on a real-world image captured by the terminal; receiving a photographing instruction; in response to the photographing instruction:
capturing a currently displayed target real-world image and recording the skeleton animation of the animation model, the recorded skeleton animation including a plurality of image frames;
performing image composition on the target real-world image and the plurality of image frames, to obtain a plurality of composited images, each composited image having the target real-world image as its background; and combining the plurality of composited images into a dynamic image animation. 10. The terminal according to claim 9, wherein the displaying a skeleton animation of an animation model on a real-world image captured by the terminal comprises:
displaying the captured real-world image through a first image display component of the terminal; and displaying the skeleton animation of the animation model through a second image display component of the terminal, wherein the second image display component is superimposed on the first image display component; and the capturing a currently displayed target real-world image and recording the skeleton animation of the animation model comprises: capturing the currently displayed target real-world image through the first image display component, and simultaneously recording the skeleton animation of the animation model through the second image display component. 11. The terminal according to claim 10, wherein the recording the skeleton animation of the animation model through the second image display component comprises:
capturing a currently displayed skeleton animation image of the animation model at intervals of a preset time length through the second image display component to serve as a frame of image of the recorded skeleton animation. 12. The terminal according to claim 9, wherein the plurality of operations further comprise:
setting the target real-world image into a parent image display control, and setting a target frame of image of the recorded skeleton animation into a child image display control of the parent image display control, wherein the target frame of image is a frame of image in the recorded skeleton animation; and displaying the target real-world image and the target frame of image on an interface through the parent image display control and the child image display control. 13. The terminal according to claim 12, wherein the plurality of operations further comprise:
in response to the photographing instruction, recording an animation offset location of the current skeleton animation of the animation model relative to the real-world image; and the displaying the target real-world image and the target frame of image on a corresponding interface through the parent image display control and the child image display control comprises:
setting an offset location of the child image display control relative to the parent image display control according to the animation offset location; and
displaying the target real-world image and the target frame of image on the corresponding interface according to the parent image display control and the child image display control after the setting. 14. The terminal according to claim 12, wherein the performing image composition on the target real-world image and the plurality of image frames comprises:
taking the target real-world image as a background image; and performing image composition on each frame of image of the recorded skeleton animation and the background image according to a current offset location of the child image display control relative to the parent image display control, to obtain the composited images. 15. The terminal according to claim 9, wherein the plurality of operations further comprise:
determining a location in an interface according to a location of the animation model and a size of the skeleton animation, and adding an information display box to the location; displaying, in the information display box, information inputted by a user; performing image capture on the information display box, to obtain an information display box image; and adding the information display box image to the dynamic image. 16. The terminal according to claim 15, wherein the adding the information display box image to the dynamic image comprises:
performing image composition on the information display box image and each of the plurality of composited images, and combining obtained images into the dynamic image. 17. A non-transitory computer readable storage medium storing a plurality of machine readable instructions in connection with a terminal having one or more processors, wherein the plurality of machine readable instructions, when executed by the one or more processors, cause the terminal to perform a plurality of operations including:
displaying a skeleton animation of an animation model on a real-world image captured by the terminal; receiving a photographing instruction; in response to the photographing instruction:
capturing a currently displayed target real-world image and recording the skeleton animation of the animation model, the recorded skeleton animation including a plurality of image frames;
performing image composition on the target real-world image and the plurality of image frames, to obtain a plurality of composited images, each composited image having the target real-world image as its background; and combining the plurality of composited images into a dynamic image animation. 18. The non-transitory computer readable storage medium according to claim 17, wherein the displaying a skeleton animation of an animation model on a real-world image captured by the terminal comprises:
displaying the captured real-world image through a first image display component of the terminal; and displaying the skeleton animation of the animation model through a second image display component of the terminal, wherein the second image display component is superimposed on the first image display component; and the capturing a currently displayed target real-world image and recording the skeleton animation of the animation model comprises: capturing the currently displayed target real-world image through the first image display component, and simultaneously recording the skeleton animation of the animation model through the second image display component. 19. The non-transitory computer readable storage medium according to claim 17, wherein the plurality of operations further comprise:
setting the target real-world image into a parent image display control, and setting a target frame of image of the recorded skeleton animation into a child image display control of the parent image display control, wherein the target frame of image is a frame of image in the recorded skeleton animation; and displaying the target real-world image and the target frame of image on an interface through the parent image display control and the child image display control. 20. The non-transitory computer readable storage medium according to claim 17, wherein the plurality of operations further comprise:
determining a location in an interface according to a location of the animation model and a size of the skeleton animation, and adding an information display box to the location; displaying, in the information display box, information inputted by a user; performing image capture on the information display box, to obtain an information display box image; and adding the information display box image to the dynamic image.
|
Embodiments of this application disclose a dynamic image compositing method performed at a terminal. A skeleton animation of an animation model is displayed on a real-world image captured by the terminal; a currently displayed target real-world image is captured in a case that a photographing instruction is received, and the skeleton animation of the animation model is recorded, to obtain the recorded skeleton animation; image compositing is performed on the target real-world image and each frame of image of the recorded skeleton animation, to obtain a plurality of composited images; and the plurality of composited images are combined into a corresponding dynamic image. Based on the solutions, the real-world image and the skeleton animation of the animation model may be automatically composited into the corresponding dynamic image, and a user does not need to perform a large quantity of repetitive image addition and selection operations.1. A dynamic image compositing method performed at a terminal having one or more processors and memory storing a plurality of programs to be executed by the one or more processors, the method comprising:
displaying a skeleton animation of an animation model on a real-world image captured by the terminal; receiving a photographing instruction; in response to the photographing instruction:
capturing a currently displayed target real-world image and recording the skeleton animation of the animation model, the recorded skeleton animation including a plurality of image frames;
performing image composition on the target real-world image and the plurality of image frames, to obtain a plurality of composited images, each composited image having the target real-world image as its background; and combining the plurality of composited images into a dynamic image animation. 2. The dynamic image compositing method according to claim 1, wherein the displaying a skeleton animation of an animation model on a real-world image captured by the terminal comprises:
displaying the captured real-world image through a first image display component of the terminal; and displaying the skeleton animation of the animation model through a second image display component of the terminal, wherein the second image display component is superimposed on the first image display component; and the capturing a currently displayed target real-world image and recording the skeleton animation of the animation model comprises: capturing the currently displayed target real-world image through the first image display component, and simultaneously recording the skeleton animation of the animation model through the second image display component. 3. The dynamic image compositing method according to claim 2, wherein the recording the skeleton animation of the animation model through the second image display component comprises:
capturing a currently displayed skeleton animation image of the animation model at intervals of a preset time length through the second image display component to serve as a frame of image of the recorded skeleton animation. 4. The dynamic image compositing method according to claim 1, further comprising:
setting the target real-world image into a parent image display control, and setting a target frame of image of the recorded skeleton animation into a child image display control of the parent image display control, wherein the target frame of image is a frame of image in the recorded skeleton animation; and displaying the target real-world image and the target frame of image on an interface through the parent image display control and the child image display control. 5. The dynamic image compositing method according to claim 4, further comprising:
in response to the photographing instruction, recording an animation offset location of the current skeleton animation of the animation model relative to the real-world image; and the displaying the target real-world image and the target frame of image on a corresponding interface through the parent image display control and the child image display control comprises:
setting an offset location of the child image display control relative to the parent image display control according to the animation offset location; and
displaying the target real-world image and the target frame of image on the corresponding interface according to the parent image display control and the child image display control after the setting. 6. The dynamic image compositing method according to claim 4, wherein the performing image composition on the target real-world image and the plurality of image frames comprises:
taking the target real-world image as a background image; and performing image composition on each frame of image of the recorded skeleton animation and the background image according to a current offset location of the child image display control relative to the parent image display control, to obtain the composited images. 7. The dynamic image compositing method according to claim 1, further comprising:
determining a location in an interface according to a location of the animation model and a size of the skeleton animation, and adding an information display box to the location; displaying, in the information display box, information inputted by a user; performing image capture on the information display box, to obtain an information display box image; and adding the information display box image to the dynamic image. 8. The dynamic image compositing method according to claim 7, wherein the adding the information display box image to the dynamic image comprises:
performing image composition on the information display box image and each of the plurality of composited images, and combining obtained images into the dynamic image. 9. A terminal comprising one or more processors, memory coupled to the one or more processors and a plurality of programs stored in the memory that, when executed by the one or more processors, cause the terminal to perform a plurality of operations comprising:
displaying a skeleton animation of an animation model on a real-world image captured by the terminal; receiving a photographing instruction; in response to the photographing instruction:
capturing a currently displayed target real-world image and recording the skeleton animation of the animation model, the recorded skeleton animation including a plurality of image frames;
performing image composition on the target real-world image and the plurality of image frames, to obtain a plurality of composited images, each composited image having the target real-world image as its background; and combining the plurality of composited images into a dynamic image animation. 10. The terminal according to claim 9, wherein the displaying a skeleton animation of an animation model on a real-world image captured by the terminal comprises:
displaying the captured real-world image through a first image display component of the terminal; and displaying the skeleton animation of the animation model through a second image display component of the terminal, wherein the second image display component is superimposed on the first image display component; and the capturing a currently displayed target real-world image and recording the skeleton animation of the animation model comprises: capturing the currently displayed target real-world image through the first image display component, and simultaneously recording the skeleton animation of the animation model through the second image display component. 11. The terminal according to claim 10, wherein the recording the skeleton animation of the animation model through the second image display component comprises:
capturing a currently displayed skeleton animation image of the animation model at intervals of a preset time length through the second image display component to serve as a frame of image of the recorded skeleton animation. 12. The terminal according to claim 9, wherein the plurality of operations further comprise:
setting the target real-world image into a parent image display control, and setting a target frame of image of the recorded skeleton animation into a child image display control of the parent image display control, wherein the target frame of image is a frame of image in the recorded skeleton animation; and displaying the target real-world image and the target frame of image on an interface through the parent image display control and the child image display control. 13. The terminal according to claim 12, wherein the plurality of operations further comprise:
in response to the photographing instruction, recording an animation offset location of the current skeleton animation of the animation model relative to the real-world image; and the displaying the target real-world image and the target frame of image on a corresponding interface through the parent image display control and the child image display control comprises:
setting an offset location of the child image display control relative to the parent image display control according to the animation offset location; and
displaying the target real-world image and the target frame of image on the corresponding interface according to the parent image display control and the child image display control after the setting. 14. The terminal according to claim 12, wherein the performing image composition on the target real-world image and the plurality of image frames comprises:
taking the target real-world image as a background image; and performing image composition on each frame of image of the recorded skeleton animation and the background image according to a current offset location of the child image display control relative to the parent image display control, to obtain the composited images. 15. The terminal according to claim 9, wherein the plurality of operations further comprise:
determining a location in an interface according to a location of the animation model and a size of the skeleton animation, and adding an information display box to the location; displaying, in the information display box, information inputted by a user; performing image capture on the information display box, to obtain an information display box image; and adding the information display box image to the dynamic image. 16. The terminal according to claim 15, wherein the adding the information display box image to the dynamic image comprises:
performing image composition on the information display box image and each of the plurality of composited images, and combining obtained images into the dynamic image. 17. A non-transitory computer readable storage medium storing a plurality of machine readable instructions in connection with a terminal having one or more processors, wherein the plurality of machine readable instructions, when executed by the one or more processors, cause the terminal to perform a plurality of operations including:
displaying a skeleton animation of an animation model on a real-world image captured by the terminal; receiving a photographing instruction; in response to the photographing instruction:
capturing a currently displayed target real-world image and recording the skeleton animation of the animation model, the recorded skeleton animation including a plurality of image frames;
performing image composition on the target real-world image and the plurality of image frames, to obtain a plurality of composited images, each composited image having the target real-world image as its background; and combining the plurality of composited images into a dynamic image animation. 18. The non-transitory computer readable storage medium according to claim 17, wherein the displaying a skeleton animation of an animation model on a real-world image captured by the terminal comprises:
displaying the captured real-world image through a first image display component of the terminal; and displaying the skeleton animation of the animation model through a second image display component of the terminal, wherein the second image display component is superimposed on the first image display component; and the capturing a currently displayed target real-world image and recording the skeleton animation of the animation model comprises: capturing the currently displayed target real-world image through the first image display component, and simultaneously recording the skeleton animation of the animation model through the second image display component. 19. The non-transitory computer readable storage medium according to claim 17, wherein the plurality of operations further comprise:
setting the target real-world image into a parent image display control, and setting a target frame of image of the recorded skeleton animation into a child image display control of the parent image display control, wherein the target frame of image is a frame of image in the recorded skeleton animation; and displaying the target real-world image and the target frame of image on an interface through the parent image display control and the child image display control. 20. The non-transitory computer readable storage medium according to claim 17, wherein the plurality of operations further comprise:
determining a location in an interface according to a location of the animation model and a size of the skeleton animation, and adding an information display box to the location; displaying, in the information display box, information inputted by a user; performing image capture on the information display box, to obtain an information display box image; and adding the information display box image to the dynamic image.
| 2,600
|
338,030
| 16,799,655
| 2,648
|
Detection of DNS tunneling traffic is disclosed. A DNS query comprising a subdomain portion and a root domain portion is received from a client device. A determination is made that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain. A remedial action is taken in response to the determining.
|
1. A system, comprising:
a processor configured to:
receive a DNS query comprising a subdomain portion and a root domain portion from a client device;
determine that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and
take a remedial action in response to the determining; and
a memory coupled to the processor and configured to provide the processor with instructions. 2. The system of claim 1 wherein taking the remedial action includes preventing the client device from communicating with a malicious DNS server. 3. The system of claim 1 wherein, in response to receiving the DNS query, a feature vector associated with the root domain portion is updated. 4. The system of claim 3 wherein the feature vector maintains information for a sliding time window of DNS query information. 5. The system of claim 3 wherein a feature included in the feature vector represents a number of distinct fully qualified domain names associated with the root domain portion. 6. The system of claim 3 wherein a feature included in the feature vector represents an average DNS query count for each fully qualified domain name associated with the root domain portion. 7. The system of claim 3 wherein a feature included in the feature vector represents a Jeffrey distribution of DNS query counts for all fully qualified domain names associated with the root domain portion. 8. The system of claim 3 wherein a feature included in the feature vector represents an average length of fully qualified domain names associated with the root domain portion. 9. The system of claim 3 wherein a feature included in the feature vector represents a ratio of record type queries. 10. The system of claim 3 wherein a feature included in the feature vector represents a ratio of meaningful words in fully qualified domain names associated with the root domain portion. 11. The system of claim 3 wherein a feature included in the feature vector represents an n-gram frequency of fully qualified domain names associated with the root domain portion. 12. The system of claim 3 wherein a feature included in the feature vector represents entropy of fully qualified domain names associated with the root domain portion. 13. The system of claim 3 wherein a feature included in the feature vector represents whether or not the root domain portion is associated with a trusted authoritative DNS server. 14. The system of claim 3 wherein the updated feature vector is compared against a previously built benign traffic model. 15. The system of claim 14 wherein the previously built benign traffic model comprises an isolation forest. 16. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes identifying a common regular expression pattern in the received DNS query and a domain associated with the malicious DNS tunneling root domain. 17. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes determining that a DNS server associated with the root domain portion and with the malicious DNS tunneling root domain share an IP address. 18. A method, comprising:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining. 19. A computer program product embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining.
|
Detection of DNS tunneling traffic is disclosed. A DNS query comprising a subdomain portion and a root domain portion is received from a client device. A determination is made that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain. A remedial action is taken in response to the determining.1. A system, comprising:
a processor configured to:
receive a DNS query comprising a subdomain portion and a root domain portion from a client device;
determine that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and
take a remedial action in response to the determining; and
a memory coupled to the processor and configured to provide the processor with instructions. 2. The system of claim 1 wherein taking the remedial action includes preventing the client device from communicating with a malicious DNS server. 3. The system of claim 1 wherein, in response to receiving the DNS query, a feature vector associated with the root domain portion is updated. 4. The system of claim 3 wherein the feature vector maintains information for a sliding time window of DNS query information. 5. The system of claim 3 wherein a feature included in the feature vector represents a number of distinct fully qualified domain names associated with the root domain portion. 6. The system of claim 3 wherein a feature included in the feature vector represents an average DNS query count for each fully qualified domain name associated with the root domain portion. 7. The system of claim 3 wherein a feature included in the feature vector represents a Jeffrey distribution of DNS query counts for all fully qualified domain names associated with the root domain portion. 8. The system of claim 3 wherein a feature included in the feature vector represents an average length of fully qualified domain names associated with the root domain portion. 9. The system of claim 3 wherein a feature included in the feature vector represents a ratio of record type queries. 10. The system of claim 3 wherein a feature included in the feature vector represents a ratio of meaningful words in fully qualified domain names associated with the root domain portion. 11. The system of claim 3 wherein a feature included in the feature vector represents an n-gram frequency of fully qualified domain names associated with the root domain portion. 12. The system of claim 3 wherein a feature included in the feature vector represents entropy of fully qualified domain names associated with the root domain portion. 13. The system of claim 3 wherein a feature included in the feature vector represents whether or not the root domain portion is associated with a trusted authoritative DNS server. 14. The system of claim 3 wherein the updated feature vector is compared against a previously built benign traffic model. 15. The system of claim 14 wherein the previously built benign traffic model comprises an isolation forest. 16. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes identifying a common regular expression pattern in the received DNS query and a domain associated with the malicious DNS tunneling root domain. 17. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes determining that a DNS server associated with the root domain portion and with the malicious DNS tunneling root domain share an IP address. 18. A method, comprising:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining. 19. A computer program product embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining.
| 2,600
|
338,031
| 16,799,695
| 2,648
|
Detection of DNS tunneling traffic is disclosed. A DNS query comprising a subdomain portion and a root domain portion is received from a client device. A determination is made that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain. A remedial action is taken in response to the determining.
|
1. A system, comprising:
a processor configured to:
receive a DNS query comprising a subdomain portion and a root domain portion from a client device;
determine that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and
take a remedial action in response to the determining; and
a memory coupled to the processor and configured to provide the processor with instructions. 2. The system of claim 1 wherein taking the remedial action includes preventing the client device from communicating with a malicious DNS server. 3. The system of claim 1 wherein, in response to receiving the DNS query, a feature vector associated with the root domain portion is updated. 4. The system of claim 3 wherein the feature vector maintains information for a sliding time window of DNS query information. 5. The system of claim 3 wherein a feature included in the feature vector represents a number of distinct fully qualified domain names associated with the root domain portion. 6. The system of claim 3 wherein a feature included in the feature vector represents an average DNS query count for each fully qualified domain name associated with the root domain portion. 7. The system of claim 3 wherein a feature included in the feature vector represents a Jeffrey distribution of DNS query counts for all fully qualified domain names associated with the root domain portion. 8. The system of claim 3 wherein a feature included in the feature vector represents an average length of fully qualified domain names associated with the root domain portion. 9. The system of claim 3 wherein a feature included in the feature vector represents a ratio of record type queries. 10. The system of claim 3 wherein a feature included in the feature vector represents a ratio of meaningful words in fully qualified domain names associated with the root domain portion. 11. The system of claim 3 wherein a feature included in the feature vector represents an n-gram frequency of fully qualified domain names associated with the root domain portion. 12. The system of claim 3 wherein a feature included in the feature vector represents entropy of fully qualified domain names associated with the root domain portion. 13. The system of claim 3 wherein a feature included in the feature vector represents whether or not the root domain portion is associated with a trusted authoritative DNS server. 14. The system of claim 3 wherein the updated feature vector is compared against a previously built benign traffic model. 15. The system of claim 14 wherein the previously built benign traffic model comprises an isolation forest. 16. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes identifying a common regular expression pattern in the received DNS query and a domain associated with the malicious DNS tunneling root domain. 17. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes determining that a DNS server associated with the root domain portion and with the malicious DNS tunneling root domain share an IP address. 18. A method, comprising:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining. 19. A computer program product embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining.
|
Detection of DNS tunneling traffic is disclosed. A DNS query comprising a subdomain portion and a root domain portion is received from a client device. A determination is made that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain. A remedial action is taken in response to the determining.1. A system, comprising:
a processor configured to:
receive a DNS query comprising a subdomain portion and a root domain portion from a client device;
determine that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and
take a remedial action in response to the determining; and
a memory coupled to the processor and configured to provide the processor with instructions. 2. The system of claim 1 wherein taking the remedial action includes preventing the client device from communicating with a malicious DNS server. 3. The system of claim 1 wherein, in response to receiving the DNS query, a feature vector associated with the root domain portion is updated. 4. The system of claim 3 wherein the feature vector maintains information for a sliding time window of DNS query information. 5. The system of claim 3 wherein a feature included in the feature vector represents a number of distinct fully qualified domain names associated with the root domain portion. 6. The system of claim 3 wherein a feature included in the feature vector represents an average DNS query count for each fully qualified domain name associated with the root domain portion. 7. The system of claim 3 wherein a feature included in the feature vector represents a Jeffrey distribution of DNS query counts for all fully qualified domain names associated with the root domain portion. 8. The system of claim 3 wherein a feature included in the feature vector represents an average length of fully qualified domain names associated with the root domain portion. 9. The system of claim 3 wherein a feature included in the feature vector represents a ratio of record type queries. 10. The system of claim 3 wherein a feature included in the feature vector represents a ratio of meaningful words in fully qualified domain names associated with the root domain portion. 11. The system of claim 3 wherein a feature included in the feature vector represents an n-gram frequency of fully qualified domain names associated with the root domain portion. 12. The system of claim 3 wherein a feature included in the feature vector represents entropy of fully qualified domain names associated with the root domain portion. 13. The system of claim 3 wherein a feature included in the feature vector represents whether or not the root domain portion is associated with a trusted authoritative DNS server. 14. The system of claim 3 wherein the updated feature vector is compared against a previously built benign traffic model. 15. The system of claim 14 wherein the previously built benign traffic model comprises an isolation forest. 16. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes identifying a common regular expression pattern in the received DNS query and a domain associated with the malicious DNS tunneling root domain. 17. The system of claim 1 wherein determining that the root domain portion received in the DNS query is associated with the malicious DNS tunneling root domain includes determining that a DNS server associated with the root domain portion and with the malicious DNS tunneling root domain share an IP address. 18. A method, comprising:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining. 19. A computer program product embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a DNS query comprising a subdomain portion and a root domain portion from a client device; determining that the root domain portion received in the DNS query is associated with a malicious DNS tunneling root domain; and taking a remedial action in response to the determining.
| 2,600
|
338,032
| 16,799,660
| 2,648
|
A snubber module is provided, which constitutes a snubber apparatus attachable to a terminal of a semiconductor module. The snubber module includes: a positive-side capacitor, a first diode and a negative-side capacitor sequentially connected between a positive-side snubber terminal and a negative-side snubber terminal, the positive-side snubber terminal connectable to a positive-side terminal of the semiconductor module, and the negative-side snubber terminal connectable to a negative-side terminal of the semiconductor module; a first coupling terminal directly or indirectly connected to one node of either a first node between the positive-side capacitor and the first diode or a second node between the negative-side capacitor and the first diode; and a housing accommodating the positive-side capacitor, the negative-side capacitor and the first diode, and having provided therein the positive-side snubber terminal, the negative-side snubber terminal and the first coupling terminal in a manner enabling external connection.
|
1. A snubber module constituting a snubber apparatus attachable to a terminal of a semiconductor module, the snubber module comprising:
a positive-side capacitor, a first diode and a negative-side capacitor sequentially connected between a positive-side snubber terminal and a negative-side snubber terminal, the positive-side snubber terminal being connectable to a positive-side terminal of the semiconductor module, and the negative-side snubber terminal being connectable to a negative-side terminal of the semiconductor module; a first coupling terminal directly or indirectly connected to one node of either a first node or a second node, the first node being located between the positive-side capacitor and the first diode, and the second node being located between the negative-side capacitor and the first diode; and a housing accommodating the positive-side capacitor, the negative-side capacitor and the first diode, and having provided therein the positive-side snubber terminal, the negative-side snubber terminal and the first coupling terminal in a manner enabling external connection. 2. The snubber module according to claim 1, further comprising a second diode provided between the one node and the first coupling terminal and allowing current to flow in a direction from the negative-side terminal to the positive-side terminal. 3. The snubber module according to claim 1, further comprising a second coupling terminal directly or indirectly connected to another node of the first node and the second node that is different from the one node. 4. The snubber module according to claim 3, further comprising a third diode provided between the other node and the second coupling terminal and allowing current to flow in a direction from the negative-side terminal to the positive-side terminal. 5. The snubber module according to claim 3, wherein at least one of the first coupling terminal and the second coupling terminal is pulled out of the housing via an electric wire. 6. The snubber module according to claim 1, further comprising a fourth diode provided along a path joining another node and the positive-side snubber terminal or the negative-side snubber terminal with the one node interposed, and allowing current to flow in a direction from the negative-side terminal to the positive-side terminal, the other node being one of the first node and the second node that is different from the one node. 7. A snubber apparatus comprising at least one snubber module according to claim 1. 8. A snubber apparatus comprising:
at least one snubber module according to claim 1; and at least one snubber module according to claim 1, the snubber module further including a second coupling terminal directly or indirectly connected to another node of the first node and the second node that is different from the one node, wherein the respective snubber modules are sequentially connected via the first coupling terminal and the second coupling terminal. 9. The snubber apparatus according to claim 8, wherein
the snubber apparatus comprises:
a plurality of charge paths parallel to one another and each allowing current to flow in a direction from the positive-side terminal to the negative-side terminal; and
a plurality of discharge paths parallel to one another and each allowing current to flow in a direction from the negative-side terminal to the positive-side terminal, and
a wiring inductance of each discharge path is greater than a wiring inductance in each charge path. 10. A power conversion apparatus comprising:
a semiconductor module; and a snubber apparatus according to claim 7.
|
A snubber module is provided, which constitutes a snubber apparatus attachable to a terminal of a semiconductor module. The snubber module includes: a positive-side capacitor, a first diode and a negative-side capacitor sequentially connected between a positive-side snubber terminal and a negative-side snubber terminal, the positive-side snubber terminal connectable to a positive-side terminal of the semiconductor module, and the negative-side snubber terminal connectable to a negative-side terminal of the semiconductor module; a first coupling terminal directly or indirectly connected to one node of either a first node between the positive-side capacitor and the first diode or a second node between the negative-side capacitor and the first diode; and a housing accommodating the positive-side capacitor, the negative-side capacitor and the first diode, and having provided therein the positive-side snubber terminal, the negative-side snubber terminal and the first coupling terminal in a manner enabling external connection.1. A snubber module constituting a snubber apparatus attachable to a terminal of a semiconductor module, the snubber module comprising:
a positive-side capacitor, a first diode and a negative-side capacitor sequentially connected between a positive-side snubber terminal and a negative-side snubber terminal, the positive-side snubber terminal being connectable to a positive-side terminal of the semiconductor module, and the negative-side snubber terminal being connectable to a negative-side terminal of the semiconductor module; a first coupling terminal directly or indirectly connected to one node of either a first node or a second node, the first node being located between the positive-side capacitor and the first diode, and the second node being located between the negative-side capacitor and the first diode; and a housing accommodating the positive-side capacitor, the negative-side capacitor and the first diode, and having provided therein the positive-side snubber terminal, the negative-side snubber terminal and the first coupling terminal in a manner enabling external connection. 2. The snubber module according to claim 1, further comprising a second diode provided between the one node and the first coupling terminal and allowing current to flow in a direction from the negative-side terminal to the positive-side terminal. 3. The snubber module according to claim 1, further comprising a second coupling terminal directly or indirectly connected to another node of the first node and the second node that is different from the one node. 4. The snubber module according to claim 3, further comprising a third diode provided between the other node and the second coupling terminal and allowing current to flow in a direction from the negative-side terminal to the positive-side terminal. 5. The snubber module according to claim 3, wherein at least one of the first coupling terminal and the second coupling terminal is pulled out of the housing via an electric wire. 6. The snubber module according to claim 1, further comprising a fourth diode provided along a path joining another node and the positive-side snubber terminal or the negative-side snubber terminal with the one node interposed, and allowing current to flow in a direction from the negative-side terminal to the positive-side terminal, the other node being one of the first node and the second node that is different from the one node. 7. A snubber apparatus comprising at least one snubber module according to claim 1. 8. A snubber apparatus comprising:
at least one snubber module according to claim 1; and at least one snubber module according to claim 1, the snubber module further including a second coupling terminal directly or indirectly connected to another node of the first node and the second node that is different from the one node, wherein the respective snubber modules are sequentially connected via the first coupling terminal and the second coupling terminal. 9. The snubber apparatus according to claim 8, wherein
the snubber apparatus comprises:
a plurality of charge paths parallel to one another and each allowing current to flow in a direction from the positive-side terminal to the negative-side terminal; and
a plurality of discharge paths parallel to one another and each allowing current to flow in a direction from the negative-side terminal to the positive-side terminal, and
a wiring inductance of each discharge path is greater than a wiring inductance in each charge path. 10. A power conversion apparatus comprising:
a semiconductor module; and a snubber apparatus according to claim 7.
| 2,600
|
338,033
| 16,799,626
| 2,648
|
A magneto-optical trap apparatus includes a vacuum vessel for encapsulating an atom to be trapped, an anti-Helmholtz coil for applying a magnetic field to an inside of the vacuum vessel, a laser device for generating a laser beam, and an irradiation device for irradiating the generated laser beam from a plurality of directions. The laser beam includes a first laser beam detuned from a first resonance frequency when the atom transits from a total angular momentum quantum number F in a ground state to a total angular momentum quantum number F′=F+1 in an excited state, and a second laser beam detuned from a second resonance frequency when the atom transits from the total angular momentum quantum number F in the ground state to a total angular momentum quantum number F′=F−1 in the excited state, among transitions from J=0 in a ground state to J′=1 in an excited state.
|
1. A magneto-optical trap method comprising steps of:
applying a magnetic field to an atom encapsulated in a vacuum vessel and having a nuclear spin of not less than 3/2 by using an anti-Helmholtz coil; generating a laser beam including a first laser beam detuned from a first resonance frequency when the atom transits from a total angular momentum quantum number F in a ground state related to a hyperfine structure to a total angular momentum quantum number F′=F+1 in an excited state related to the hyperfine structure, and a second laser beam detuned from a second resonance frequency when the atom transits from the total angular momentum quantum number F in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=F−1 in the excited state related to the hyperfine structure, among transitions of the atom from a total angular momentum quantum number J=0 in a ground state related to a fine structure to a total angular momentum quantum number J′=1 in an excited state related to the fine structure; and irradiating the laser beam including the first laser beam and the second laser beam toward the atom in the vacuum vessel from a plurality of directions including at least a pair of opposite directions. 2. The magneto-optical trap method according to claim 1, wherein the step of irradiating includes a step of converting the laser beam including the first laser beam and the second laser beam into one of a σ− polarized beam and a σ+ polarized beam. 3. The magneto-optical trap method according to claim 1, wherein
the atom is an 87 strontium atom, and the step of generating includes steps of: generating, as the first laser beam, a laser beam detuned from the first resonance frequency when the 87 strontium atom transits from a total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=11/2 in the excited state related to the hyperfine structure; and generating, as the second laser beam, a laser beam detuned from the second resonance frequency when the 87 strontium atom transits from the total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure. 4. The magneto-optical trap method according to claim 1, wherein
the atom is a 173 ytterbium atom, and the step of generating includes steps of: generating, as the first laser beam, a laser beam detuned from the first resonance frequency when the 173 ytterbium atom transits from a total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure; and generating, as the second laser beam, a laser beam detuned from the second resonance frequency when the 173 ytterbium atom transits from the total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=3/2 in the excited state related to the hyperfine structure. 5. A magneto-optical trap apparatus comprising:
a vacuum vessel for encapsulating an atom to be trapped; an anti-Helmholtz coil configured to apply a magnetic field to an inside of the vacuum vessel; a laser device configured to generate a laser beam including a first laser beam detuned from a first resonance frequency when the atom transits from a total angular momentum quantum number F in a ground state related to a hyperfine structure to a total angular momentum quantum number F′=F+1 in an excited state related to the hyperfine structure, and a second laser beam detuned from a second resonance frequency when the atom transits from the total angular momentum quantum number F in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=F−1 in the excited state related to the hyperfine structure, among transitions of the atom from a total angular momentum quantum number J=0 in a ground state related to a fine structure to a total angular momentum quantum number J′=1 in an excited state related to the fine structure; and an irradiation device configured to irradiate the laser beam generated by the laser device toward one point inside the vacuum vessel from a plurality of directions including at least a pair of opposite directions. 6. The magneto-optical trap apparatus according to claim 5, wherein the atom has a nuclear spin of not less than 3/2. 7. The magneto-optical trap apparatus according to claim 5, wherein the irradiation device includes a wave plate configured to convert the laser beam into one of a σ− polarized beam and a σ+ polarized beam. 8. The magneto-optical trap apparatus according to claim 5, wherein
the atom is an 87 strontium atom, and the laser device is configured to generate, as the first laser beam, a laser beam detuned from the first resonance frequency when the 87 strontium atom transits from a total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=11/2 in the excited state related to the hyperfine structure, and generate, as the second laser beam, a laser beam detuned from the second resonance frequency when the 87 strontium atom transits from the total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure. 9. The magneto-optical trap apparatus according to claim 5, wherein
the atom is a 173 ytterbium atom, and the laser device is configured to generate, as the first laser beam, a laser beam detuned from the first resonance frequency when the 173 ytterbium atom transits from a total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure, and generate, as the second laser beam, a laser beam detuned from the second resonance frequency when the 173 ytterbium atom transits from the total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=3/2 in the excited state related to the hyperfine structure.
|
A magneto-optical trap apparatus includes a vacuum vessel for encapsulating an atom to be trapped, an anti-Helmholtz coil for applying a magnetic field to an inside of the vacuum vessel, a laser device for generating a laser beam, and an irradiation device for irradiating the generated laser beam from a plurality of directions. The laser beam includes a first laser beam detuned from a first resonance frequency when the atom transits from a total angular momentum quantum number F in a ground state to a total angular momentum quantum number F′=F+1 in an excited state, and a second laser beam detuned from a second resonance frequency when the atom transits from the total angular momentum quantum number F in the ground state to a total angular momentum quantum number F′=F−1 in the excited state, among transitions from J=0 in a ground state to J′=1 in an excited state.1. A magneto-optical trap method comprising steps of:
applying a magnetic field to an atom encapsulated in a vacuum vessel and having a nuclear spin of not less than 3/2 by using an anti-Helmholtz coil; generating a laser beam including a first laser beam detuned from a first resonance frequency when the atom transits from a total angular momentum quantum number F in a ground state related to a hyperfine structure to a total angular momentum quantum number F′=F+1 in an excited state related to the hyperfine structure, and a second laser beam detuned from a second resonance frequency when the atom transits from the total angular momentum quantum number F in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=F−1 in the excited state related to the hyperfine structure, among transitions of the atom from a total angular momentum quantum number J=0 in a ground state related to a fine structure to a total angular momentum quantum number J′=1 in an excited state related to the fine structure; and irradiating the laser beam including the first laser beam and the second laser beam toward the atom in the vacuum vessel from a plurality of directions including at least a pair of opposite directions. 2. The magneto-optical trap method according to claim 1, wherein the step of irradiating includes a step of converting the laser beam including the first laser beam and the second laser beam into one of a σ− polarized beam and a σ+ polarized beam. 3. The magneto-optical trap method according to claim 1, wherein
the atom is an 87 strontium atom, and the step of generating includes steps of: generating, as the first laser beam, a laser beam detuned from the first resonance frequency when the 87 strontium atom transits from a total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=11/2 in the excited state related to the hyperfine structure; and generating, as the second laser beam, a laser beam detuned from the second resonance frequency when the 87 strontium atom transits from the total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure. 4. The magneto-optical trap method according to claim 1, wherein
the atom is a 173 ytterbium atom, and the step of generating includes steps of: generating, as the first laser beam, a laser beam detuned from the first resonance frequency when the 173 ytterbium atom transits from a total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure; and generating, as the second laser beam, a laser beam detuned from the second resonance frequency when the 173 ytterbium atom transits from the total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=3/2 in the excited state related to the hyperfine structure. 5. A magneto-optical trap apparatus comprising:
a vacuum vessel for encapsulating an atom to be trapped; an anti-Helmholtz coil configured to apply a magnetic field to an inside of the vacuum vessel; a laser device configured to generate a laser beam including a first laser beam detuned from a first resonance frequency when the atom transits from a total angular momentum quantum number F in a ground state related to a hyperfine structure to a total angular momentum quantum number F′=F+1 in an excited state related to the hyperfine structure, and a second laser beam detuned from a second resonance frequency when the atom transits from the total angular momentum quantum number F in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=F−1 in the excited state related to the hyperfine structure, among transitions of the atom from a total angular momentum quantum number J=0 in a ground state related to a fine structure to a total angular momentum quantum number J′=1 in an excited state related to the fine structure; and an irradiation device configured to irradiate the laser beam generated by the laser device toward one point inside the vacuum vessel from a plurality of directions including at least a pair of opposite directions. 6. The magneto-optical trap apparatus according to claim 5, wherein the atom has a nuclear spin of not less than 3/2. 7. The magneto-optical trap apparatus according to claim 5, wherein the irradiation device includes a wave plate configured to convert the laser beam into one of a σ− polarized beam and a σ+ polarized beam. 8. The magneto-optical trap apparatus according to claim 5, wherein
the atom is an 87 strontium atom, and the laser device is configured to generate, as the first laser beam, a laser beam detuned from the first resonance frequency when the 87 strontium atom transits from a total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=11/2 in the excited state related to the hyperfine structure, and generate, as the second laser beam, a laser beam detuned from the second resonance frequency when the 87 strontium atom transits from the total angular momentum quantum number F=9/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure. 9. The magneto-optical trap apparatus according to claim 5, wherein
the atom is a 173 ytterbium atom, and the laser device is configured to generate, as the first laser beam, a laser beam detuned from the first resonance frequency when the 173 ytterbium atom transits from a total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=7/2 in the excited state related to the hyperfine structure, and generate, as the second laser beam, a laser beam detuned from the second resonance frequency when the 173 ytterbium atom transits from the total angular momentum quantum number F=5/2 in the ground state related to the hyperfine structure to a total angular momentum quantum number F′=3/2 in the excited state related to the hyperfine structure.
| 2,600
|
338,034
| 16,799,641
| 2,648
|
In a method for identification of an Internet meme, a plurality of sources is monitored for digital visual content comprising a visual moment and a caption. It is determined whether instances of digital visual content include a same visual moment. Provided the instances of digital visual content include the same visual moment, the instances of digital visual content including the same visual moment are identified as similar digital visual content. Each instance of the similar digital visual content is tracked. Provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, the similar digital visual content is identified as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme.
|
1. A method for identification of an Internet meme, the method comprising:
monitoring a plurality of sources for digital visual content comprising a visual moment and a caption; determining whether instances of digital visual content include a same visual moment; provided the instances of digital visual content include the same visual moment, identifying the instances of digital visual content including the same visual moment as similar digital visual content; tracking each instance of the similar digital visual content; and provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, identifying the similar digital visual content as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme. 2. The method of claim 1, wherein the determining whether instances of digital visual content include a same visual moment comprises:
generating a perceptual hash for each instance of digital visual content; comparing perceptual hashes for each instance of the digital visual content to determine a distance between the perceptual hashes; and provided the distance between two perceptual hashes satisfies a similarity threshold, determining that the instances of digital visual content corresponding to the perceptual hashes include the same visual moment. 3. The method of claim 2, wherein the identifying the instances of digital visual content including the same visual moment as similar digital visual content comprises:
provided the distance between two perceptual hashes satisfies the similarity threshold, identifying the instances of digital visual content corresponding to the two perceptual hashes as similar digital visual content. 4. The method of claim 1, wherein the plurality of sources comprises websites and social media sites. 5. The method of claim 1, wherein the digital visual content comprises an image. 6. The method of claim 1, wherein the digital visual content comprises a video. 7. The method of claim 6, wherein the video is a short form looping video content item. 8. The method of claim 1, wherein the tracking each instance of the similar digital visual content comprises:
maintaining a count of each instance of the similar digital visual content. 9. The method of claim 1, further comprising:
comparing an instance of digital visual content to an Internet meme; and provided the instance of digital visual content satisfies a similarity threshold, identifying the instance of digital visual content as an instance of the Internet meme. 10. The method of claim 9, further comprising:
determining whether an instance of the Internet meme is identical to another instance of the Internet meme; provided the instance of the Internet meme is not identical to another instance of the Internet meme, determining that the instance of the Internet meme is a new iteration of the Internet meme; and provided the instance of the Internet meme is identical to another instance of the Internet meme, determining that the instance of the Internet meme is another instance of an existing iteration of the Internet meme. 11. The method of claim 1, further comprising:
tracking each instance of the Internet meme at the plurality of sources; tracking each iteration of the Internet meme; and determining a reach of each iteration of the Internet meme, wherein the reach of each iteration of the Internet meme corresponds to engagement with each iteration of the Internet meme. 12. The method of claim 11, further comprising:
calculating a viral score for each Internet meme, the viral score comprising a first component associated with the reach of each iteration of the Internet meme and a second component associated with a number of iterations of each Internet meme. 13. The method of claim 1, further comprising:
receiving an instance digital visual content. 14. A non-transitory computer readable storage medium having computer readable program code stored thereon for causing a computer system to perform a method for identification of an Internet meme, the method comprising:
monitoring a plurality of sources for digital visual content comprising a visual moment and a caption; determining whether instances of digital visual content include a same visual moment; provided the instances of digital visual content include the same visual moment, identifying the instances of digital visual content including the same visual moment as similar digital visual content; tracking each instance of the similar digital visual content; and provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, identifying the similar digital visual content as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme. 15. The non-transitory computer readable storage medium of claim 14, wherein the determining whether instances of digital visual content include a same visual moment comprises:
generating a perceptual hash for each instance of digital visual content; comparing perceptual hashes for each instance of the digital visual content to determine a distance between the perceptual hashes; and provided the distance between two perceptual hashes satisfies a similarity threshold, determining that the instances of digital visual content corresponding to the perceptual hashes include the same visual moment. 16. The non-transitory computer readable storage medium of claim 15, wherein the identifying the instances of digital visual content including the same visual moment as similar digital visual content comprises:
provided the distance between two perceptual hashes satisfies the similarity threshold, identifying the instances of digital visual content corresponding to the two perceptual hashes as similar digital visual content. 17. The non-transitory computer readable storage medium of claim 14, the method further comprising:
comparing an instance of digital visual content to an Internet meme; and provided the instance of digital visual content satisfies a similarity threshold, identifying the instance of digital visual content as an instance of the Internet meme. 18. The non-transitory computer readable storage medium of claim 17, the method further comprising:
determining whether an instance of the Internet meme is identical to another instance of the Internet meme; provided the instance of the Internet meme is not identical to another instance of the Internet meme, determining that the instance of the Internet meme is a new iteration of the Internet meme; and provided the instance of the Internet meme is identical to another instance of the Internet meme, determining that the instance of the Internet meme is another instance of an existing iteration of the Internet meme. 19. The non-transitory computer readable storage medium of claim 14, the method further comprising:
tracking each instance of the Internet meme at the plurality of sources; tracking each iteration of the Internet meme; determining a reach of each iteration of the Internet meme, wherein the reach of each iteration of the Internet meme corresponds to engagement with each iteration of the Internet meme; and calculating a viral score for each Internet meme, the viral score comprising a first component associated with the reach of each iteration of the Internet meme and a second component associated with a number of iterations of each Internet meme. 20. A computer system comprising:
a data storage unit; and a processor coupled with the data storage unit, the processor configured to:
monitor a plurality of sources for digital visual content comprising a visual moment and a caption;
generate a perceptual hash for each instance of digital visual content;
compare perceptual hashes for each instance of the digital visual content to determine a distance between the perceptual hashes;
provided the distance between two perceptual hashes satisfies a similarity threshold, determine that the instances of digital visual content corresponding to the perceptual hashes include a same visual moment and identifying the instances of digital visual content corresponding to the perceptual hashes as similar digital visual content;
track each instance of the similar digital visual content; and
provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, identify the similar digital visual content as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme.
|
In a method for identification of an Internet meme, a plurality of sources is monitored for digital visual content comprising a visual moment and a caption. It is determined whether instances of digital visual content include a same visual moment. Provided the instances of digital visual content include the same visual moment, the instances of digital visual content including the same visual moment are identified as similar digital visual content. Each instance of the similar digital visual content is tracked. Provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, the similar digital visual content is identified as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme.1. A method for identification of an Internet meme, the method comprising:
monitoring a plurality of sources for digital visual content comprising a visual moment and a caption; determining whether instances of digital visual content include a same visual moment; provided the instances of digital visual content include the same visual moment, identifying the instances of digital visual content including the same visual moment as similar digital visual content; tracking each instance of the similar digital visual content; and provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, identifying the similar digital visual content as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme. 2. The method of claim 1, wherein the determining whether instances of digital visual content include a same visual moment comprises:
generating a perceptual hash for each instance of digital visual content; comparing perceptual hashes for each instance of the digital visual content to determine a distance between the perceptual hashes; and provided the distance between two perceptual hashes satisfies a similarity threshold, determining that the instances of digital visual content corresponding to the perceptual hashes include the same visual moment. 3. The method of claim 2, wherein the identifying the instances of digital visual content including the same visual moment as similar digital visual content comprises:
provided the distance between two perceptual hashes satisfies the similarity threshold, identifying the instances of digital visual content corresponding to the two perceptual hashes as similar digital visual content. 4. The method of claim 1, wherein the plurality of sources comprises websites and social media sites. 5. The method of claim 1, wherein the digital visual content comprises an image. 6. The method of claim 1, wherein the digital visual content comprises a video. 7. The method of claim 6, wherein the video is a short form looping video content item. 8. The method of claim 1, wherein the tracking each instance of the similar digital visual content comprises:
maintaining a count of each instance of the similar digital visual content. 9. The method of claim 1, further comprising:
comparing an instance of digital visual content to an Internet meme; and provided the instance of digital visual content satisfies a similarity threshold, identifying the instance of digital visual content as an instance of the Internet meme. 10. The method of claim 9, further comprising:
determining whether an instance of the Internet meme is identical to another instance of the Internet meme; provided the instance of the Internet meme is not identical to another instance of the Internet meme, determining that the instance of the Internet meme is a new iteration of the Internet meme; and provided the instance of the Internet meme is identical to another instance of the Internet meme, determining that the instance of the Internet meme is another instance of an existing iteration of the Internet meme. 11. The method of claim 1, further comprising:
tracking each instance of the Internet meme at the plurality of sources; tracking each iteration of the Internet meme; and determining a reach of each iteration of the Internet meme, wherein the reach of each iteration of the Internet meme corresponds to engagement with each iteration of the Internet meme. 12. The method of claim 11, further comprising:
calculating a viral score for each Internet meme, the viral score comprising a first component associated with the reach of each iteration of the Internet meme and a second component associated with a number of iterations of each Internet meme. 13. The method of claim 1, further comprising:
receiving an instance digital visual content. 14. A non-transitory computer readable storage medium having computer readable program code stored thereon for causing a computer system to perform a method for identification of an Internet meme, the method comprising:
monitoring a plurality of sources for digital visual content comprising a visual moment and a caption; determining whether instances of digital visual content include a same visual moment; provided the instances of digital visual content include the same visual moment, identifying the instances of digital visual content including the same visual moment as similar digital visual content; tracking each instance of the similar digital visual content; and provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, identifying the similar digital visual content as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme. 15. The non-transitory computer readable storage medium of claim 14, wherein the determining whether instances of digital visual content include a same visual moment comprises:
generating a perceptual hash for each instance of digital visual content; comparing perceptual hashes for each instance of the digital visual content to determine a distance between the perceptual hashes; and provided the distance between two perceptual hashes satisfies a similarity threshold, determining that the instances of digital visual content corresponding to the perceptual hashes include the same visual moment. 16. The non-transitory computer readable storage medium of claim 15, wherein the identifying the instances of digital visual content including the same visual moment as similar digital visual content comprises:
provided the distance between two perceptual hashes satisfies the similarity threshold, identifying the instances of digital visual content corresponding to the two perceptual hashes as similar digital visual content. 17. The non-transitory computer readable storage medium of claim 14, the method further comprising:
comparing an instance of digital visual content to an Internet meme; and provided the instance of digital visual content satisfies a similarity threshold, identifying the instance of digital visual content as an instance of the Internet meme. 18. The non-transitory computer readable storage medium of claim 17, the method further comprising:
determining whether an instance of the Internet meme is identical to another instance of the Internet meme; provided the instance of the Internet meme is not identical to another instance of the Internet meme, determining that the instance of the Internet meme is a new iteration of the Internet meme; and provided the instance of the Internet meme is identical to another instance of the Internet meme, determining that the instance of the Internet meme is another instance of an existing iteration of the Internet meme. 19. The non-transitory computer readable storage medium of claim 14, the method further comprising:
tracking each instance of the Internet meme at the plurality of sources; tracking each iteration of the Internet meme; determining a reach of each iteration of the Internet meme, wherein the reach of each iteration of the Internet meme corresponds to engagement with each iteration of the Internet meme; and calculating a viral score for each Internet meme, the viral score comprising a first component associated with the reach of each iteration of the Internet meme and a second component associated with a number of iterations of each Internet meme. 20. A computer system comprising:
a data storage unit; and a processor coupled with the data storage unit, the processor configured to:
monitor a plurality of sources for digital visual content comprising a visual moment and a caption;
generate a perceptual hash for each instance of digital visual content;
compare perceptual hashes for each instance of the digital visual content to determine a distance between the perceptual hashes;
provided the distance between two perceptual hashes satisfies a similarity threshold, determine that the instances of digital visual content corresponding to the perceptual hashes include a same visual moment and identifying the instances of digital visual content corresponding to the perceptual hashes as similar digital visual content;
track each instance of the similar digital visual content; and
provided a total number of instances of the similar digital visual content exceeds an Internet meme threshold, identify the similar digital visual content as an Internet meme, wherein the same visual moment is a root visual moment and each caption corresponds to a different iteration of the Internet meme.
| 2,600
|
338,035
| 16,799,664
| 2,648
|
Certain embodiments involve techniques for generating a 3D representation based on a provided 2D image of an object. An image generation system receives the 2D image representation and generates a multi-dimensional vector of the input that represents the image. The image generation system samples a set of points and provides the set of points and the multi-dimensional vector to a neural network that was trained to predict a 3D surface representing the image such that the 3D surface is consistent with a 3D surface of the object calculated using an implicit function for representing the image. The neural network predicts, based on the multi-dimensional vector and the set of points, the 3D surface representing the object.
|
1. A computer-implemented method, comprising:
receiving, at a computing system, an input comprising a representation of an object; generating, by the computing system, a multi-dimensional vector for the input; providing the multi-dimensional vector for the input to a neural network, wherein the neural network was trained to predict a three-dimensional surface representing the input based on the multi-dimensional vector such that the three-dimensional surface corresponds to a second three-dimensional surface of the object calculated using an implicit function for representing the input; and predicting, using the neural network and based upon the multi-dimensional vector, the three-dimensional surface representing the input, the three-dimensional surface comprising a three-dimensional representation of the object. 2. The method of claim 1, wherein the input is a two-dimensional image of the object. 3. The method of claim 1, further comprising:
training the neural network using a plurality of training inputs, wherein the training comprises, for each of the plurality of training inputs:
encoding, by the computing system, the training input into a training multi-dimensional vector;
receiving, at the neural network, the training multi-dimensional vector and a training set of points;
generating, with the neural network based on the training multi-dimensional vector and the training set of points, a training three-dimensional surface representing the training input;
receiving, at a second neural network, the multi-dimensional vector;
generating, by the second neural network, the implicit function representing the training input;
calculating a loss based on the training three-dimensional surface and the implicit function; and
adjusting parameters of the neural network based on the loss. 4. The method of claim 3, wherein calculating the loss comprises:
calculating a surface normal value representing a normal value of the three-dimensional surface at a random point on the three-dimensional surface; calculating an implicit normal value representing a gradient of the implicit function at the random point; and calculating the loss based at least in part on a difference between the surface normal value and the implicit normal value. 5. The method of claim 3, wherein calculating the loss comprises:
calculating a volumetric value representing a value of the implicit function at a random point on a surface of the three-dimensional surface; and calculating the loss based at least in part on the volumetric value. 6. The method of claim 1, further comprising:
providing the three-dimensional surface to a user device for viewing in a graphical user interface. 7. A computer-implemented method of training an atlas-based surface neural network for generating a three-dimensional surface from an input image comprising:
receiving a set of input images; for each input image in the set of input images:
encoding the input image to generate a multi-dimensional vector representing the input image;
generating, using an implicit function neural network, an implicit function that, given a random point, provides a value indicating whether the random point is on a surface of a three-dimensional representation of the input image;
generating, using the atlas-based surface neural network, a three-dimensional surface representing the input image;
calculating a loss using the random point, the implicit function, and the three-dimensional surface; and
adjusting parameters of the atlas-based surface neural network based on the loss. 8. The computer-implemented method of claim 7, wherein calculating the loss comprises:
calculating a volumetric value of the implicit function at the random point on the three-dimensional surface; and calculating the loss based at least in part on the volumetric value. 9. The computer-implemented method of claim 7, wherein calculating the loss comprises:
calculating a surface normal value representing a normal value of the three-dimensional surface at the random point; calculating an implicit normal value representing a gradient of the implicit function at the random point; and calculating the loss based at least in part on a difference between the surface normal value and the implicit normal value. 10. The computer-implemented method of claim 7, further comprising:
adjusting parameters of the implicit function neural network based at least in part on the loss. 11. A system, comprising:
one or more processors; and a memory having stored thereon instructions that, when executed by the one or more processors, cause the one or more processors to: receive an input comprising a representation of an object; generate a multi-dimensional vector for the input; provide the multi-dimensional vector for the input to a neural network, wherein the neural network was trained to predict a three-dimensional surface representing the input based on the multi-dimensional vector such that the three-dimensional surface corresponds to a second three-dimensional surface of the object calculated using an implicit function for representing the input; and predict, using the neural network and based upon the multi-dimensional vector, the three-dimensional surface representing the input, the three-dimensional surface comprising a three-dimensional representation of the object. 12. The system of claim 11, wherein the input is a two-dimensional image of the object. 13. The system of claim 11, wherein the instructions comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
train the neural network using a plurality of training inputs, wherein the training comprises, for each of the plurality of training inputs:
encoding the training input into a training multi-dimensional vector;
receiving, at the neural network, the training multi-dimensional vector and a training set of points;
generating, with the neural network based on the training multi-dimensional vector and the training set of points, a training three-dimensional surface representing the training input;
receiving, at a second neural network, the multi-dimensional vector;
generating, by the second neural network, the implicit function representing the training input;
calculating a loss based on the training three-dimensional surface and the implicit function; and
adjusting parameters of the neural network based on the loss. 14. The system of claim 13, wherein the instructions for calculating the loss comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
calculate a surface normal value representing a normal value of the three-dimensional surface at a random point on the three-dimensional surface; calculate an implicit normal value representing a gradient of the implicit function at the random point; and calculate the loss based at least in part on a difference between the surface normal value and the implicit normal value. 15. The system of claim 13, wherein the instructions for calculating the loss comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
calculate a volumetric value representing a value of the implicit function at a random point on a surface of the three-dimensional surface; and calculate the loss based at least in part on the volumetric value. 16. The system of claim 11, wherein the instructions comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
provide the three-dimensional surface to a user device for viewing in a graphical user interface.
|
Certain embodiments involve techniques for generating a 3D representation based on a provided 2D image of an object. An image generation system receives the 2D image representation and generates a multi-dimensional vector of the input that represents the image. The image generation system samples a set of points and provides the set of points and the multi-dimensional vector to a neural network that was trained to predict a 3D surface representing the image such that the 3D surface is consistent with a 3D surface of the object calculated using an implicit function for representing the image. The neural network predicts, based on the multi-dimensional vector and the set of points, the 3D surface representing the object.1. A computer-implemented method, comprising:
receiving, at a computing system, an input comprising a representation of an object; generating, by the computing system, a multi-dimensional vector for the input; providing the multi-dimensional vector for the input to a neural network, wherein the neural network was trained to predict a three-dimensional surface representing the input based on the multi-dimensional vector such that the three-dimensional surface corresponds to a second three-dimensional surface of the object calculated using an implicit function for representing the input; and predicting, using the neural network and based upon the multi-dimensional vector, the three-dimensional surface representing the input, the three-dimensional surface comprising a three-dimensional representation of the object. 2. The method of claim 1, wherein the input is a two-dimensional image of the object. 3. The method of claim 1, further comprising:
training the neural network using a plurality of training inputs, wherein the training comprises, for each of the plurality of training inputs:
encoding, by the computing system, the training input into a training multi-dimensional vector;
receiving, at the neural network, the training multi-dimensional vector and a training set of points;
generating, with the neural network based on the training multi-dimensional vector and the training set of points, a training three-dimensional surface representing the training input;
receiving, at a second neural network, the multi-dimensional vector;
generating, by the second neural network, the implicit function representing the training input;
calculating a loss based on the training three-dimensional surface and the implicit function; and
adjusting parameters of the neural network based on the loss. 4. The method of claim 3, wherein calculating the loss comprises:
calculating a surface normal value representing a normal value of the three-dimensional surface at a random point on the three-dimensional surface; calculating an implicit normal value representing a gradient of the implicit function at the random point; and calculating the loss based at least in part on a difference between the surface normal value and the implicit normal value. 5. The method of claim 3, wherein calculating the loss comprises:
calculating a volumetric value representing a value of the implicit function at a random point on a surface of the three-dimensional surface; and calculating the loss based at least in part on the volumetric value. 6. The method of claim 1, further comprising:
providing the three-dimensional surface to a user device for viewing in a graphical user interface. 7. A computer-implemented method of training an atlas-based surface neural network for generating a three-dimensional surface from an input image comprising:
receiving a set of input images; for each input image in the set of input images:
encoding the input image to generate a multi-dimensional vector representing the input image;
generating, using an implicit function neural network, an implicit function that, given a random point, provides a value indicating whether the random point is on a surface of a three-dimensional representation of the input image;
generating, using the atlas-based surface neural network, a three-dimensional surface representing the input image;
calculating a loss using the random point, the implicit function, and the three-dimensional surface; and
adjusting parameters of the atlas-based surface neural network based on the loss. 8. The computer-implemented method of claim 7, wherein calculating the loss comprises:
calculating a volumetric value of the implicit function at the random point on the three-dimensional surface; and calculating the loss based at least in part on the volumetric value. 9. The computer-implemented method of claim 7, wherein calculating the loss comprises:
calculating a surface normal value representing a normal value of the three-dimensional surface at the random point; calculating an implicit normal value representing a gradient of the implicit function at the random point; and calculating the loss based at least in part on a difference between the surface normal value and the implicit normal value. 10. The computer-implemented method of claim 7, further comprising:
adjusting parameters of the implicit function neural network based at least in part on the loss. 11. A system, comprising:
one or more processors; and a memory having stored thereon instructions that, when executed by the one or more processors, cause the one or more processors to: receive an input comprising a representation of an object; generate a multi-dimensional vector for the input; provide the multi-dimensional vector for the input to a neural network, wherein the neural network was trained to predict a three-dimensional surface representing the input based on the multi-dimensional vector such that the three-dimensional surface corresponds to a second three-dimensional surface of the object calculated using an implicit function for representing the input; and predict, using the neural network and based upon the multi-dimensional vector, the three-dimensional surface representing the input, the three-dimensional surface comprising a three-dimensional representation of the object. 12. The system of claim 11, wherein the input is a two-dimensional image of the object. 13. The system of claim 11, wherein the instructions comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
train the neural network using a plurality of training inputs, wherein the training comprises, for each of the plurality of training inputs:
encoding the training input into a training multi-dimensional vector;
receiving, at the neural network, the training multi-dimensional vector and a training set of points;
generating, with the neural network based on the training multi-dimensional vector and the training set of points, a training three-dimensional surface representing the training input;
receiving, at a second neural network, the multi-dimensional vector;
generating, by the second neural network, the implicit function representing the training input;
calculating a loss based on the training three-dimensional surface and the implicit function; and
adjusting parameters of the neural network based on the loss. 14. The system of claim 13, wherein the instructions for calculating the loss comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
calculate a surface normal value representing a normal value of the three-dimensional surface at a random point on the three-dimensional surface; calculate an implicit normal value representing a gradient of the implicit function at the random point; and calculate the loss based at least in part on a difference between the surface normal value and the implicit normal value. 15. The system of claim 13, wherein the instructions for calculating the loss comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
calculate a volumetric value representing a value of the implicit function at a random point on a surface of the three-dimensional surface; and calculate the loss based at least in part on the volumetric value. 16. The system of claim 11, wherein the instructions comprise further instructions that, when executed by the one or more processors, cause the one or more processors to:
provide the three-dimensional surface to a user device for viewing in a graphical user interface.
| 2,600
|
338,036
| 16,799,619
| 2,648
|
Disclosed embodiments relate to spatial and temporal merging of remote atomic operations. In one example, a system includes an RAO instruction queue stored in a memory and having entries grouped by destination cache line, each entry to enqueue an RAO instruction including an opcode, a destination identifier, and source data, optimization circuitry to receive an incoming RAO instruction, scan the RAO instruction queue to detect a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimization circuitry further to, responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction; and, responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of cache line queue entries at different offsets.
|
1. A system for executing remote atomic operation (RAO) instructions atomically comprising:
an RAO instruction queue stored in a memory and having entries grouped by destination cache line, each entry to enqueue one or more RAO instructions comprising an opcode, a destination identifier, and source data; and optimization circuitry to receive an incoming RAO instruction, scan the RAO instruction queue to detect a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimization circuitry further to:
responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction in the RAO instruction queue; and
responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of destination cache line RAO instructions at different cache line offsets. 2. The system of claim 1, wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier and different but compatible opcodes, is further to conduct special processing by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions. 3. The system of claim 1, wherein the optimization circuitry, responsive to determining that overlap does exist, is further to temporally combine the incoming and matching RAO instructions by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions. 4. The system of claim 1, wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, is further to conduct special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete and subsequently dispatching the incoming RAO instruction to be executed. 5. The system of claim 1, wherein the incoming and enqueued RAO instructions each further comprise element size identifiers, and wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier and a same opcode but different identified element sizes, is further to conduct special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete, and subsequently dispatching the incoming RAO instruction to be executed. 6. The system of claim 1, wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, is further to conduct special processing by dispatching the matching RAO instruction to be executed with a to-be-continued signal set to TRUE, and subsequently dispatching the incoming RAO instruction to be executed. 7. The system of claim 1, further comprising a regularly incrementing system counter, wherein each RAO instruction queue entry further comprises an expiration timestamp, and wherein the optimization circuitry is further to, when enqueueing the incoming RAO instruction, initialize the expiration timestamp to a predetermined amount of time ahead of the system counter, the enqueued RAO instruction to be available to combine with other instructions as long as the expiration timestamp is ahead of the system counter. 8. The system of claim 7, further comprising multiple cores, each incorporating an instance of the RAO instruction queue and an instance of the optimization circuitry, each core further comprising:
fetch circuitry to fetch an RAO instruction from code storage; decode circuitry to decode and provide the fetched instruction to its instance of optimization circuitry; and scheduling circuitry to scan its instance of the RAO instruction queue, select an enqueued RAO instruction from among one or more enqueued RAO instructions whose expiration timestamps exceed the system counter, and dispatch the selected RAO instruction for execution by execution circuitry selected from among multiple execution circuits in the system, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance. 9. The system of claim 1, further comprising:
a regularly incrementing system counter, wherein each RAO instruction queue entry further comprises an expiration timestamp, and wherein the optimization circuitry is further to, when enqueueing the incoming RAO instruction, initialize the expiration timestamp to a predetermined amount of time ahead of the system counter, the enqueued RAO instruction to be available to combine with other instructions as long as the expiration timestamp is ahead of the system counter; and a cache control circuit incorporating instances of the RAO instruction queue and the optimization circuitry, the cache control circuit further comprising:
interface circuitry to receive and provide RAO instructions to its instance of optimization circuitry, the optimization circuitry to combine the received RAO instruction with an RAO instruction enqueued in its RAO instruction queue if there is an opportunity to combine, and, if not, to enqueue the received RAO instruction in its RAO instruction queue;
scheduling circuitry to scan its instance of the RAO instruction queue and select an RAO instruction among one or more enqueued RAO instructions whose expiration timestamps exceed the system counter, and to schedule the selected instruction to be executed, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance; and
execution circuitry to execute the selected RAO instruction by reading the entire cache line addressed by the destination identifier, performing the selected instruction on a cache line element addressed by the destination identifier, performing one or more additional enqueued RAO instructions whose identified destinations address the same cache line, writing the cache line back to the cache, and sending a confirmation to one or more requesting processing cores. 10. The system of claim 1, further comprising:
a regularly incrementing system counter, wherein each RAO instruction queue entry further comprises an expiration timestamp, and wherein the optimization circuitry is further to, when enqueueing the incoming RAO instruction, initialize the expiration timestamp to a predetermined amount of time ahead of the system counter, the enqueued RAO instruction to be available to combine with other instructions as long as the expiration timestamp is ahead of the system counter; and a mid-level shared cache control circuit incorporating instances of the RAO instruction queue and the optimization circuitry, the mid-level shared cache control circuit further comprising:
interface circuitry to receive and provide RAO instructions to its instance of optimization circuitry, the optimization circuitry to combine the received RAO instruction with an RAO instruction enqueued in its RAO instruction queue if there is an opportunity to combine, and, if not, to enqueue the received RAO instruction in its RAO instruction queue;
scheduling circuitry to scan its instance of the RAO instruction queue and select an RAO instruction among one or more enqueued RAO instructions whose expiration timestamps exceed the current timestamp, and to schedule the selected instruction to be executed, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance; and
execution circuitry to execute the selected RAO instruction by reading the entire cache line addressed by the destination identifier, performing the selected RAO instruction on a cache line element addressed by the destination identifier, performing one or more additional enqueued RAO instructions whose identified destinations address the same cache line, writing the cache line back to the cache, and sending a confirmation to one or more requesting processing cores. 11. A method of executing remote atomic operation (RAO) instructions atomically with weak ordering, the method comprising:
receiving, by optimization circuitry, an incoming RAO instruction; scanning, by the optimization circuitry, an RAO instruction queue having entries grouped by destination cache line, each RAO instruction comprising an opcode, a destination identifier, and source data, and detecting a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimization circuitry further to:
responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction in the RAO instruction queue; and
responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of destination cache line RAO instructions at different cache line offsets. 12. The method of claim 11, further comprising the optimizing circuitry, responsive to determining that overlap does exist, temporally combining the incoming and matching RAO instructions by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions. 13. The method of claim 11, further comprising the optimizing circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, conducting special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete and subsequently dispatching the incoming RAO instruction to be executed. 14. The method of claim 11, wherein the incoming and enqueued RAO instructions each further comprise element size identifiers, and the optimizing circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier and a same opcode but different identified element sizes, further conducts special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete, and subsequently dispatching the incoming RAO instruction to be executed. 15. The method of claim 11, further comprising conducting, by the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, special processing by dispatching the matching RAO instruction to be executed with a to-be-continued signal set to TRUE, and subsequently dispatching the incoming RAO instruction to be executed. 16. The method of claim 11, further comprising initializing, when enqueuing the incoming RAO instruction, an expiration timestamp to a predetermined amount of time ahead of a regularly incrementing system counter, wherein the expiration timestamp is maintained in the RAO instruction queue along with and enabling the incoming RAO instruction to combine with other incoming RAO instructions as long as the expiration timestamp is ahead of the system counter. 17. The method of claim 16, further comprising:
scanning, by scheduling circuitry, the RAO instruction queue to select an enqueued RAO instruction from among one or more enqueued RAO instructions whose expiration timestamps exceed the system counter; and dispatching, by the scheduling circuitry, the selected RAO instruction for execution by execution circuitry selected from among multiple execution circuits in the method, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance. 18. The method of claim 17, further comprising:
receiving the dispatched RAO instruction by a cache control circuit, wherein the cache control circuit contains the selected execution circuitry and incorporates an instance of the optimization circuitry and an instance of the RAO instruction queue; providing, by the cache control circuit, the received RAO instruction to its instance of optimization circuitry; combining, by the instance of optimization circuitry, the received RAO instruction with an already-enqueued RAO instruction when there is an opportunity to spatially combine, and, if not, enqueuing the received RAO instruction in its RAO instruction queue; scanning, by cache control circuit scheduling circuitry, its instance of the RAO instruction queue to select an RAO instruction among one or more enqueued RAO instructions, whose expiration timestamps exceed the system counter; and executing the selected RAO instruction by reading the entire cache line addressed by the destination identifier from a cache, performing the selected RAO instruction on a cache line element addressed by the destination identifier, writing the cache line back to the cache, and sending a confirmation to one or more requesting processing cores. 19. An apparatus for executing remote atomic operation (RAO) instructions atomically with weak ordering, the apparatus comprising:
an RAO instruction queue having entries grouped by destination cache line, each entry to enqueue one or more RAO instructions comprising an opcode, a destination identifier, and source data; and optimizing means for receiving an incoming RAO instruction, scanning the RAO instruction queue to detect a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimizing means further to: responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction in the RAO instruction queue; and responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of destination cache line RAO instructions at different cache line offsets. 20. The apparatus of claim 19, wherein the optimizing means, responsive to determining that overlap does exist, is further to temporally combine the incoming and matching RAO instructions by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions.
|
Disclosed embodiments relate to spatial and temporal merging of remote atomic operations. In one example, a system includes an RAO instruction queue stored in a memory and having entries grouped by destination cache line, each entry to enqueue an RAO instruction including an opcode, a destination identifier, and source data, optimization circuitry to receive an incoming RAO instruction, scan the RAO instruction queue to detect a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimization circuitry further to, responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction; and, responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of cache line queue entries at different offsets.1. A system for executing remote atomic operation (RAO) instructions atomically comprising:
an RAO instruction queue stored in a memory and having entries grouped by destination cache line, each entry to enqueue one or more RAO instructions comprising an opcode, a destination identifier, and source data; and optimization circuitry to receive an incoming RAO instruction, scan the RAO instruction queue to detect a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimization circuitry further to:
responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction in the RAO instruction queue; and
responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of destination cache line RAO instructions at different cache line offsets. 2. The system of claim 1, wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier and different but compatible opcodes, is further to conduct special processing by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions. 3. The system of claim 1, wherein the optimization circuitry, responsive to determining that overlap does exist, is further to temporally combine the incoming and matching RAO instructions by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions. 4. The system of claim 1, wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, is further to conduct special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete and subsequently dispatching the incoming RAO instruction to be executed. 5. The system of claim 1, wherein the incoming and enqueued RAO instructions each further comprise element size identifiers, and wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier and a same opcode but different identified element sizes, is further to conduct special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete, and subsequently dispatching the incoming RAO instruction to be executed. 6. The system of claim 1, wherein the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, is further to conduct special processing by dispatching the matching RAO instruction to be executed with a to-be-continued signal set to TRUE, and subsequently dispatching the incoming RAO instruction to be executed. 7. The system of claim 1, further comprising a regularly incrementing system counter, wherein each RAO instruction queue entry further comprises an expiration timestamp, and wherein the optimization circuitry is further to, when enqueueing the incoming RAO instruction, initialize the expiration timestamp to a predetermined amount of time ahead of the system counter, the enqueued RAO instruction to be available to combine with other instructions as long as the expiration timestamp is ahead of the system counter. 8. The system of claim 7, further comprising multiple cores, each incorporating an instance of the RAO instruction queue and an instance of the optimization circuitry, each core further comprising:
fetch circuitry to fetch an RAO instruction from code storage; decode circuitry to decode and provide the fetched instruction to its instance of optimization circuitry; and scheduling circuitry to scan its instance of the RAO instruction queue, select an enqueued RAO instruction from among one or more enqueued RAO instructions whose expiration timestamps exceed the system counter, and dispatch the selected RAO instruction for execution by execution circuitry selected from among multiple execution circuits in the system, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance. 9. The system of claim 1, further comprising:
a regularly incrementing system counter, wherein each RAO instruction queue entry further comprises an expiration timestamp, and wherein the optimization circuitry is further to, when enqueueing the incoming RAO instruction, initialize the expiration timestamp to a predetermined amount of time ahead of the system counter, the enqueued RAO instruction to be available to combine with other instructions as long as the expiration timestamp is ahead of the system counter; and a cache control circuit incorporating instances of the RAO instruction queue and the optimization circuitry, the cache control circuit further comprising:
interface circuitry to receive and provide RAO instructions to its instance of optimization circuitry, the optimization circuitry to combine the received RAO instruction with an RAO instruction enqueued in its RAO instruction queue if there is an opportunity to combine, and, if not, to enqueue the received RAO instruction in its RAO instruction queue;
scheduling circuitry to scan its instance of the RAO instruction queue and select an RAO instruction among one or more enqueued RAO instructions whose expiration timestamps exceed the system counter, and to schedule the selected instruction to be executed, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance; and
execution circuitry to execute the selected RAO instruction by reading the entire cache line addressed by the destination identifier, performing the selected instruction on a cache line element addressed by the destination identifier, performing one or more additional enqueued RAO instructions whose identified destinations address the same cache line, writing the cache line back to the cache, and sending a confirmation to one or more requesting processing cores. 10. The system of claim 1, further comprising:
a regularly incrementing system counter, wherein each RAO instruction queue entry further comprises an expiration timestamp, and wherein the optimization circuitry is further to, when enqueueing the incoming RAO instruction, initialize the expiration timestamp to a predetermined amount of time ahead of the system counter, the enqueued RAO instruction to be available to combine with other instructions as long as the expiration timestamp is ahead of the system counter; and a mid-level shared cache control circuit incorporating instances of the RAO instruction queue and the optimization circuitry, the mid-level shared cache control circuit further comprising:
interface circuitry to receive and provide RAO instructions to its instance of optimization circuitry, the optimization circuitry to combine the received RAO instruction with an RAO instruction enqueued in its RAO instruction queue if there is an opportunity to combine, and, if not, to enqueue the received RAO instruction in its RAO instruction queue;
scheduling circuitry to scan its instance of the RAO instruction queue and select an RAO instruction among one or more enqueued RAO instructions whose expiration timestamps exceed the current timestamp, and to schedule the selected instruction to be executed, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance; and
execution circuitry to execute the selected RAO instruction by reading the entire cache line addressed by the destination identifier, performing the selected RAO instruction on a cache line element addressed by the destination identifier, performing one or more additional enqueued RAO instructions whose identified destinations address the same cache line, writing the cache line back to the cache, and sending a confirmation to one or more requesting processing cores. 11. A method of executing remote atomic operation (RAO) instructions atomically with weak ordering, the method comprising:
receiving, by optimization circuitry, an incoming RAO instruction; scanning, by the optimization circuitry, an RAO instruction queue having entries grouped by destination cache line, each RAO instruction comprising an opcode, a destination identifier, and source data, and detecting a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimization circuitry further to:
responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction in the RAO instruction queue; and
responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of destination cache line RAO instructions at different cache line offsets. 12. The method of claim 11, further comprising the optimizing circuitry, responsive to determining that overlap does exist, temporally combining the incoming and matching RAO instructions by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions. 13. The method of claim 11, further comprising the optimizing circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, conducting special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete and subsequently dispatching the incoming RAO instruction to be executed. 14. The method of claim 11, wherein the incoming and enqueued RAO instructions each further comprise element size identifiers, and the optimizing circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier and a same opcode but different identified element sizes, further conducts special processing by delaying the incoming RAO instruction until the matching RAO instruction is complete, and subsequently dispatching the incoming RAO instruction to be executed. 15. The method of claim 11, further comprising conducting, by the optimization circuitry, responsive to determining that partial overlap exists because the incoming and matching RAO instructions have a same destination identifier but different opcodes, special processing by dispatching the matching RAO instruction to be executed with a to-be-continued signal set to TRUE, and subsequently dispatching the incoming RAO instruction to be executed. 16. The method of claim 11, further comprising initializing, when enqueuing the incoming RAO instruction, an expiration timestamp to a predetermined amount of time ahead of a regularly incrementing system counter, wherein the expiration timestamp is maintained in the RAO instruction queue along with and enabling the incoming RAO instruction to combine with other incoming RAO instructions as long as the expiration timestamp is ahead of the system counter. 17. The method of claim 16, further comprising:
scanning, by scheduling circuitry, the RAO instruction queue to select an enqueued RAO instruction from among one or more enqueued RAO instructions whose expiration timestamps exceed the system counter; and dispatching, by the scheduling circuitry, the selected RAO instruction for execution by execution circuitry selected from among multiple execution circuits in the method, wherein the scheduling circuit selects the RAO instruction out of order with respect to other enqueued RAO instructions, with an order selected to optimize at least one of latency, throughput, power, and performance. 18. The method of claim 17, further comprising:
receiving the dispatched RAO instruction by a cache control circuit, wherein the cache control circuit contains the selected execution circuitry and incorporates an instance of the optimization circuitry and an instance of the RAO instruction queue; providing, by the cache control circuit, the received RAO instruction to its instance of optimization circuitry; combining, by the instance of optimization circuitry, the received RAO instruction with an already-enqueued RAO instruction when there is an opportunity to spatially combine, and, if not, enqueuing the received RAO instruction in its RAO instruction queue; scanning, by cache control circuit scheduling circuitry, its instance of the RAO instruction queue to select an RAO instruction among one or more enqueued RAO instructions, whose expiration timestamps exceed the system counter; and executing the selected RAO instruction by reading the entire cache line addressed by the destination identifier from a cache, performing the selected RAO instruction on a cache line element addressed by the destination identifier, writing the cache line back to the cache, and sending a confirmation to one or more requesting processing cores. 19. An apparatus for executing remote atomic operation (RAO) instructions atomically with weak ordering, the apparatus comprising:
an RAO instruction queue having entries grouped by destination cache line, each entry to enqueue one or more RAO instructions comprising an opcode, a destination identifier, and source data; and optimizing means for receiving an incoming RAO instruction, scanning the RAO instruction queue to detect a matching enqueued RAO instruction identifying a same destination cache line as the incoming RAO instruction, the optimizing means further to: responsive to no matching enqueued RAO instruction being detected, enqueue the incoming RAO instruction in the RAO instruction queue; and responsive to a matching enqueued RAO instruction being detected, determine whether the incoming and matching RAO instructions have a same opcode to non-overlapping cache line elements, and, if so, spatially combine the incoming and matching RAO instructions by enqueuing both RAO instructions in a same group of destination cache line RAO instructions at different cache line offsets. 20. The apparatus of claim 19, wherein the optimizing means, responsive to determining that overlap does exist, is further to temporally combine the incoming and matching RAO instructions by replacing the matching RAO instruction with a new instruction that, when executed, produces a same result as sequentially executing both instructions.
| 2,600
|
338,037
| 16,799,635
| 2,648
|
A driver tool for insertion and removal of a first part configured for threaded engagement in a corresponding threaded bore in a second part has a driving end portion of polygonal shape with multiple flats configured for engagement in a recess in the first part having a corresponding polygonal shape. Some or all of the flats have a respective grabbing feature or edge designed to grab or grip into the opposing surface of the recess to allow a greater amount of torque to be applied to the first part when the tool is rotated in the unthreading direction than when it is rotated in the opposite threading or insertion direction.
|
1. A driver tool for threading a first part into a threaded bore of a second part and unthreading the first part from the threaded bore, comprising:
an elongate member having a handle at a first end and a shaft extending from the handle and having a driving end portion of polygonal cross-sectional shape having an outer end face and an outer surface having multiple flats extending up to the outer end face and configured for engagement in a recess in a first part which is of substantially matching polygonal cross-sectional shape; one or more flats of the driving end portion each having a grabbing feature extending along at least part of the length of the driving end portion from the outer end face, which is configured to engage a respective opposing flat of the recess when the driver is rotated in opposite clockwise and counter-clockwise directions relative to the recess, wherein the grabbing feature is configured to bite into the respective opposing flat of the recess and apply a greater amount of torque to the first part when the driver is rotated in a counter-clockwise, unthreading direction than when it is rotated in a clockwise, threading direction relative to the recess. 2. The driver tool of claim 1, when each flat of the driving end portion has a grabbing feature. 3. The driver tool of claim 2, wherein each flat of the driving end portion has an indent extending along at least part of the driving end portion from the outer end face, the indent having opposite first and second side faces extending from an inner end of the recess up to the outer surface, the first side faces of each indent forming an edge between the first side face of the indent and an adjacent flat of the driving end portion, the edge comprising said grabbing feature. 4. The driver tool of claim 3, wherein an angle θ1 between the adjacent flat to the grabbing feature and the opposing flat of the recess when the driver is rotated in a clockwise, threading direction is less than an angle θ2 between said first side face of the indent and the opposing flat of the recess when the driver is rotated in an anti-clockwise, unthreading direction. 5. The driver tool of claim 4, wherein θ1 is less than ten degrees and θ2 is greater than twenty five degrees. 6. The driver tool of claim 5, wherein θ1 is approximately 2 degrees and θ2 is approximately 24 degrees. 7. The driver tool of claim 3, wherein the second side face of the indent extends from the inner end to the respective flat of the driving end portion in which the indent is located and the first side face of the indent extends from the inner end to an adjacent flat of the driving end portion. 8. The driver tool of claim 3, wherein the indent is generally V-shaped in cross-section and the first face of the indent has a cross-sectional length greater than the cross-sectional length of the second face. 9. The driver tool of claim 1, wherein the driving end portion is of hexagonal cross-sectional shape. 10. The driver tool of claim 1, wherein the driving end portion is configured for engagement in a tool engagement bore of polygonal shape in a retention member of a denture attachment assembly which has a threaded end portion for threaded engagement in a mating threaded bore of a denture attachment housing. 11. The driver tool of claim 1, wherein the shaft has a first, larger diameter portion extending from the handle, and a reduced diameter portion extending from the first, larger diameter portion and terminating in said driving end portion of polygonal shape. 12. A method of threading or unthreading a first part having a threaded end portion for threaded engagement in a corresponding threaded bore in a second part, comprising:
engaging a driving end portion of a driver tool in a tool receiving bore of the first part, the driving end portion and tool receiving bore being of matching polygonal shape including a plurality of flats; rotating the driver tool in a threading direction in order to threadably engage a threaded end portion of the first part into the corresponding threaded bore of the second part, whereby a series of grabbing features on the respective flats of the driving end portion of the tool bite into respective opposing flats of the tool receiving bore to apply a first amount of torque in order to assist in the threaded engagement; removing the driver tool from the tool receiving bore when the first part is secured to the second part; engaging the driving end portion of the driver tool in the tool receiving bore when the first part is to be separated from second part; rotating the driver tool in an unthreading direction opposite to the threading direction in order to unthread and release the threaded end portion of the first part from the threaded bore in the second part, whereby the grabbing features on the respective flats of the driving end portion bite into respective opposing flats of the tool receiving bore to apply a second amount of torque greater than the first amount of torque to the first part to assist in unthreading the first part from the second part. 13. The method of claim 12, wherein the first part is a retention member having an end portion configured for releasable mating engagement with a dental abutment attached to a tooth root or implant and the second part is a denture attachment housing, the polygonal tool receiving bore is located in an end face of the end portion, and at least the end portion of the first part is of softer material than the driving end portion of the driver tool. 14. The method of claim 13, wherein the retention member is of compressible material. 15. The method of claim 13, wherein the driving end portion is of first metallic material and the retention member is of a second metal or plastic material which is softer than the first metallic material.
|
A driver tool for insertion and removal of a first part configured for threaded engagement in a corresponding threaded bore in a second part has a driving end portion of polygonal shape with multiple flats configured for engagement in a recess in the first part having a corresponding polygonal shape. Some or all of the flats have a respective grabbing feature or edge designed to grab or grip into the opposing surface of the recess to allow a greater amount of torque to be applied to the first part when the tool is rotated in the unthreading direction than when it is rotated in the opposite threading or insertion direction.1. A driver tool for threading a first part into a threaded bore of a second part and unthreading the first part from the threaded bore, comprising:
an elongate member having a handle at a first end and a shaft extending from the handle and having a driving end portion of polygonal cross-sectional shape having an outer end face and an outer surface having multiple flats extending up to the outer end face and configured for engagement in a recess in a first part which is of substantially matching polygonal cross-sectional shape; one or more flats of the driving end portion each having a grabbing feature extending along at least part of the length of the driving end portion from the outer end face, which is configured to engage a respective opposing flat of the recess when the driver is rotated in opposite clockwise and counter-clockwise directions relative to the recess, wherein the grabbing feature is configured to bite into the respective opposing flat of the recess and apply a greater amount of torque to the first part when the driver is rotated in a counter-clockwise, unthreading direction than when it is rotated in a clockwise, threading direction relative to the recess. 2. The driver tool of claim 1, when each flat of the driving end portion has a grabbing feature. 3. The driver tool of claim 2, wherein each flat of the driving end portion has an indent extending along at least part of the driving end portion from the outer end face, the indent having opposite first and second side faces extending from an inner end of the recess up to the outer surface, the first side faces of each indent forming an edge between the first side face of the indent and an adjacent flat of the driving end portion, the edge comprising said grabbing feature. 4. The driver tool of claim 3, wherein an angle θ1 between the adjacent flat to the grabbing feature and the opposing flat of the recess when the driver is rotated in a clockwise, threading direction is less than an angle θ2 between said first side face of the indent and the opposing flat of the recess when the driver is rotated in an anti-clockwise, unthreading direction. 5. The driver tool of claim 4, wherein θ1 is less than ten degrees and θ2 is greater than twenty five degrees. 6. The driver tool of claim 5, wherein θ1 is approximately 2 degrees and θ2 is approximately 24 degrees. 7. The driver tool of claim 3, wherein the second side face of the indent extends from the inner end to the respective flat of the driving end portion in which the indent is located and the first side face of the indent extends from the inner end to an adjacent flat of the driving end portion. 8. The driver tool of claim 3, wherein the indent is generally V-shaped in cross-section and the first face of the indent has a cross-sectional length greater than the cross-sectional length of the second face. 9. The driver tool of claim 1, wherein the driving end portion is of hexagonal cross-sectional shape. 10. The driver tool of claim 1, wherein the driving end portion is configured for engagement in a tool engagement bore of polygonal shape in a retention member of a denture attachment assembly which has a threaded end portion for threaded engagement in a mating threaded bore of a denture attachment housing. 11. The driver tool of claim 1, wherein the shaft has a first, larger diameter portion extending from the handle, and a reduced diameter portion extending from the first, larger diameter portion and terminating in said driving end portion of polygonal shape. 12. A method of threading or unthreading a first part having a threaded end portion for threaded engagement in a corresponding threaded bore in a second part, comprising:
engaging a driving end portion of a driver tool in a tool receiving bore of the first part, the driving end portion and tool receiving bore being of matching polygonal shape including a plurality of flats; rotating the driver tool in a threading direction in order to threadably engage a threaded end portion of the first part into the corresponding threaded bore of the second part, whereby a series of grabbing features on the respective flats of the driving end portion of the tool bite into respective opposing flats of the tool receiving bore to apply a first amount of torque in order to assist in the threaded engagement; removing the driver tool from the tool receiving bore when the first part is secured to the second part; engaging the driving end portion of the driver tool in the tool receiving bore when the first part is to be separated from second part; rotating the driver tool in an unthreading direction opposite to the threading direction in order to unthread and release the threaded end portion of the first part from the threaded bore in the second part, whereby the grabbing features on the respective flats of the driving end portion bite into respective opposing flats of the tool receiving bore to apply a second amount of torque greater than the first amount of torque to the first part to assist in unthreading the first part from the second part. 13. The method of claim 12, wherein the first part is a retention member having an end portion configured for releasable mating engagement with a dental abutment attached to a tooth root or implant and the second part is a denture attachment housing, the polygonal tool receiving bore is located in an end face of the end portion, and at least the end portion of the first part is of softer material than the driving end portion of the driver tool. 14. The method of claim 13, wherein the retention member is of compressible material. 15. The method of claim 13, wherein the driving end portion is of first metallic material and the retention member is of a second metal or plastic material which is softer than the first metallic material.
| 2,600
|
338,038
| 16,799,605
| 2,648
|
The present disclosure is drawn to HCMV US11 based therapeutics that can be used to target and reduce the activity of the FcRn protein. The disclosure provides a method of treating auto-immune mediated and albumin-mediated diseases in a subject comprising administering to the subject a therapeutically effective amount of a pharmaceutical composition comprising HCMV US11 (herein after referred to as “US11”) polypeptide, polypeptide fragments, or variants thereof. The disclosure also provides methods for preventing, or treating, infections of HCMV through administration of a US11 inhibitor. US11 containing vaccine compositions are also provided for stimulation of an anti-US11 immune response for protection against HCMV infection.
|
1. A method for inhibiting the activity of FcRn in a subject, the method comprising administering to the subject, an effective amount of a human cytomegalovirus (HCMV) US11 protein in a pharmaceutically acceptable form. 2. The method of claim 1, wherein the subject is suffering from an antibody-mediated autoimmune disease or is at risk for developing an antibody-mediated autoimmune disease. 3. The method of claim 1, wherein the subject is suffering from an albumin-mediated diseases or is at risk for developing an albumin-mediated diseases. 4. The method of claim 1, wherein the US11 in a pharmaceutically acceptable form is co-administered with a second therapeutic useful for treatment of an antibody-mediated autoimmune disease or useful for treatment of an albumin-mediated autoimmune disease. 5. The method of claim 2, wherein the autoimmune disease is selected from the group consisiting of ankylosing spondylitis, lupus, rheumatoid arthritis, juvenile arthritis, scleroderma dermatomyositis, behcet's disease, reactive arthritis, mixed connective tissue disease, raynaud's phenomenon, giant cell arteritis/temporal arteritis, polymyalgia rheumatica, polyarteritis nodosa, polymyositis, takayasu arteritis, granulomatosis with polyangiitis, and vasculitis, alopecia areata, antiphospholipid antibody syndrome, autoimmune hepatitis, type 1 diabetes, celiac disease, chron's disease, Graves' disease, Guillain-Barre syndrome, Hashimoto's disease, idiopathic thrombocytopenic purpura, inflammatory bowel disease, multiple sclerosis, myasthenia gravis, primary biliary cirrhosis, psoriasis, Sjogren's syndrome, vitiligo, bullous pemphigoid, pemphigus foliaceus, pemphigus vulgaris and epidermolysis bullosa acquisita. 6. The method of claim 3, wherein the albumin-mediated disease is selected from the group consisting of those resulting from aberrant expression of albumin. 7. The method of claim 1, wherein the US11 is a polypeptide fragment or variant thereof that retains the ability to inhibiting the activity of FcRn. 8. The method of claim 7, wherein the inhibition of FcRn activity results in a reduction in production of autoantibodies in a subject suffering from an antibody-mediated auto-immune disease. 9. The method of claim 4, wherein the second therapeutic used for treatment of an antibody-mediated autoimmune disease is an immunosuppressive agent. 10. A method for preventing and/or treating a HCMV infection in a subject comprising administering an inhibitor of US11 expression or activity a pharmaceutically acceptable form. 11. The method of claim 10, wherein the inhibitor of US11 expression is a nucleic acid molecule that targets the US11 mRNA and inhibits, silences or attenuates the expression of the US11 RNA. 12. The method of claim 11, wherein the nucleic acid molecule is an antisense, siRNA, shRNA or microRNA. 13. A vaccine formulation comprising US11 and a pharmacutically acceptable carrier. 14. The vaccine formulation of claim 13, further comprising additional HCMV proteins or fragments thereof. 15. The vaccine formulation of claim 14, wherein the US11 is one or more US11 proteins or polypeptide fragments thereon. 16. A method for treatment or prevention of an infection with human cytomegalovirus (HCMV) in a subject, comprising administering the vaccine formulation of claim 14. 17. The method of claim 16, wherein the treatment results in an immune response to HMCV in the subject. 18. The method of claim 16, wherein the treatment results in a protective immune response to HCMV in the subject. 19. The method of claim 16 wherein the subject is a pregnant women. 20. A kit comprising a pharmaceutical composition comprising a US11 protein, or a US11 protein inhibitor.
|
The present disclosure is drawn to HCMV US11 based therapeutics that can be used to target and reduce the activity of the FcRn protein. The disclosure provides a method of treating auto-immune mediated and albumin-mediated diseases in a subject comprising administering to the subject a therapeutically effective amount of a pharmaceutical composition comprising HCMV US11 (herein after referred to as “US11”) polypeptide, polypeptide fragments, or variants thereof. The disclosure also provides methods for preventing, or treating, infections of HCMV through administration of a US11 inhibitor. US11 containing vaccine compositions are also provided for stimulation of an anti-US11 immune response for protection against HCMV infection.1. A method for inhibiting the activity of FcRn in a subject, the method comprising administering to the subject, an effective amount of a human cytomegalovirus (HCMV) US11 protein in a pharmaceutically acceptable form. 2. The method of claim 1, wherein the subject is suffering from an antibody-mediated autoimmune disease or is at risk for developing an antibody-mediated autoimmune disease. 3. The method of claim 1, wherein the subject is suffering from an albumin-mediated diseases or is at risk for developing an albumin-mediated diseases. 4. The method of claim 1, wherein the US11 in a pharmaceutically acceptable form is co-administered with a second therapeutic useful for treatment of an antibody-mediated autoimmune disease or useful for treatment of an albumin-mediated autoimmune disease. 5. The method of claim 2, wherein the autoimmune disease is selected from the group consisiting of ankylosing spondylitis, lupus, rheumatoid arthritis, juvenile arthritis, scleroderma dermatomyositis, behcet's disease, reactive arthritis, mixed connective tissue disease, raynaud's phenomenon, giant cell arteritis/temporal arteritis, polymyalgia rheumatica, polyarteritis nodosa, polymyositis, takayasu arteritis, granulomatosis with polyangiitis, and vasculitis, alopecia areata, antiphospholipid antibody syndrome, autoimmune hepatitis, type 1 diabetes, celiac disease, chron's disease, Graves' disease, Guillain-Barre syndrome, Hashimoto's disease, idiopathic thrombocytopenic purpura, inflammatory bowel disease, multiple sclerosis, myasthenia gravis, primary biliary cirrhosis, psoriasis, Sjogren's syndrome, vitiligo, bullous pemphigoid, pemphigus foliaceus, pemphigus vulgaris and epidermolysis bullosa acquisita. 6. The method of claim 3, wherein the albumin-mediated disease is selected from the group consisting of those resulting from aberrant expression of albumin. 7. The method of claim 1, wherein the US11 is a polypeptide fragment or variant thereof that retains the ability to inhibiting the activity of FcRn. 8. The method of claim 7, wherein the inhibition of FcRn activity results in a reduction in production of autoantibodies in a subject suffering from an antibody-mediated auto-immune disease. 9. The method of claim 4, wherein the second therapeutic used for treatment of an antibody-mediated autoimmune disease is an immunosuppressive agent. 10. A method for preventing and/or treating a HCMV infection in a subject comprising administering an inhibitor of US11 expression or activity a pharmaceutically acceptable form. 11. The method of claim 10, wherein the inhibitor of US11 expression is a nucleic acid molecule that targets the US11 mRNA and inhibits, silences or attenuates the expression of the US11 RNA. 12. The method of claim 11, wherein the nucleic acid molecule is an antisense, siRNA, shRNA or microRNA. 13. A vaccine formulation comprising US11 and a pharmacutically acceptable carrier. 14. The vaccine formulation of claim 13, further comprising additional HCMV proteins or fragments thereof. 15. The vaccine formulation of claim 14, wherein the US11 is one or more US11 proteins or polypeptide fragments thereon. 16. A method for treatment or prevention of an infection with human cytomegalovirus (HCMV) in a subject, comprising administering the vaccine formulation of claim 14. 17. The method of claim 16, wherein the treatment results in an immune response to HMCV in the subject. 18. The method of claim 16, wherein the treatment results in a protective immune response to HCMV in the subject. 19. The method of claim 16 wherein the subject is a pregnant women. 20. A kit comprising a pharmaceutical composition comprising a US11 protein, or a US11 protein inhibitor.
| 2,600
|
338,039
| 16,799,646
| 2,648
|
The control handle has deflection means for each puller wire that include a gear, and a carrier to which the proximal end of a puller wire is anchored. The gear is rotatably coupled to a lever controlled by an operator and the gear engages the carrier such that rotation of the gear by the lever results in longitudinal movement of the carrier, which results in deflection of the tip section.
|
1. A bi-directional catheter comprising:
an elongated catheter body having proximal and distal ends; first and second puller wires extending through the catheter body; and a control handle mounted to the proximal end of the catheter body, the control handle comprising:
a first carrier connected to a proximal end of the first puller wire, the first carrier riding in a first dedicated channel having a first proximal wall and a first distal wall;
a second carrier connected to a proximal end of the second puller wire, the second carrier riding in a second dedicated channel having a second proximal wall and a second distal wall;
a first gear in engagement with the first carrier, the first gear configured to drive the first carrier distally or proximally in response to rotation of the first gear to thereby deflect the catheter body in a first direction; and
a second gear in engagement with the second carrier, the second gear configured to drive the second carrier distally or proximally in response to rotation of the second gear to thereby deflect the catheter body in a second direction that is different than the first direction. 2. The catheter according to claim 1, further comprising:
a first lever configured for translational movement by an operator, the first lever rotatably coupled to the first gear; and a second lever configured for translational movement by an operator, the second lever rotatably coupled to the second gear. 3. The catheter according to claim 1, further comprising at least one first biasing member configured to act directly on the first carrier to bias the first gear toward a resting position. 4. The catheter according to claim 3, wherein the at least one first biasing member is either fixedly attached to the first proximal wall of the first dedicated channel and a proximal end of the first carrier or fixedly attached to the first distal wall of the first dedicated channel and a distal end of the first carrier. 5. The catheter according to claim 4, wherein the at least one first biasing member comprises:
a proximal first biasing member fixedly attached to the first proximal wall of the first dedicated channel and the proximal end of the first carrier; and/or a distal first biasing member fixedly attached to the first distal wall of the first dedicated channel and the distal end of the first carrier. 6. The catheter according to claim 3, further comprising at least one second biasing member configured to act directly on the second carrier to bias the second gear toward a resting position. 7. The catheter according to claim 6, wherein the at least one second biasing member is either fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier or fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 8. The catheter according to claim 5, wherein the at least one second biasing member comprises:
a proximal second biasing member fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier; and/or a distal second biasing member fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 9. The catheter according to claim 2, wherein:
the first lever extends through a first longitudinal slot in a handle housing and terminates in a first thumb control outside the handle housing; and the second lever extends through a second longitudinal slot in a handle housing and terminates in a second thumb control outside the handle housing. 10. The catheter according to claim 1, wherein distal ends of the first and second puller wires are anchored at different distal distances from the control handle. 11. The catheter according to claim 1, wherein distal ends of the first and second puller wires are anchored at generally equal distal distances from the control handle. 12. The catheter according to claim 2, wherein:
each of the first and second levers is individually configured for both distal and proximal movement from the resting position; or each of the first and second levers is individually configured for only proximal movement form the resting position and distal movement toward the resting position. 13. A control handle for a bi-directional catheter, the control handle comprising:
a first carrier configured for connection to a proximal end of a first puller wire, the first carrier riding in a first dedicated channel having a first proximal wall and a first distal wall; a second carrier configured for connection to a proximal end of a second puller wire, the second carrier riding in a second dedicated channel having a second proximal wall and a second distal wall; a first gear in engagement with the first carrier, the first gear configured to drive the first carrier distally or proximally in response to rotation of the first gear; and a second gear in engagement with the second carrier, the second gear configured to drive the second carrier distally or proximally in response to rotation of the second gear. 14. The control handle according to claim 13, further comprising:
a first lever configured for translational movement by an operator, the first lever fixedly attached to the first gear; and a second lever configured for translational movement by an operator, the second lever fixedly attached to the second gear. 15. The control handle according to claim 13, further comprising at least one first biasing member configured to act directly on the first carrier to bias the gear toward a resting position, wherein the at least one first biasing member is either fixedly attached to the first proximal wall of the first dedicated channel and a proximal end of the first carrier or fixedly attached to the first distal wall of the first dedicated channel and a distal end of the first carrier. 16. The control handle according to claim 15, wherein the at least one first biasing member comprises:
a proximal first biasing member fixedly attached to the first proximal wall of the first dedicated channel and a proximal end of the first carrier; and/or a distal first biasing member fixedly attached to the first distal wall of the first dedicated channel and a distal end of the first carrier. 17. The control handle according to claim 15, further comprising at least one second biasing member configured to act directly on the second carrier to bias the gear toward a resting position, wherein the at least one second biasing member is either fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier or fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 18. The control handle according to claim 17, wherein the at least one second biasing member comprises:
a proximal second biasing member fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier; and/or a distal second biasing member fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 19. The control handle according to claim 13, further comprising:
a generally hollow handle housing; a first gear housing within the generally hollow handle housing, the first gear being housed in the first gear housing, and the first gear housing being in communication with the first dedicated channel; and a second gear housing within the generally hollow handle housing, the second gear being housed in the second gear housing, and the second gear housing being in communication with the second dedicated channel. 20. The control handle according to claim 13, wherein:
each of the first and second levers is individually configured for both distal and proximal movement from the resting position; or each of the first and second levers is individually configured for only proximal movement form the resting position and distal movement toward the resting position.
|
The control handle has deflection means for each puller wire that include a gear, and a carrier to which the proximal end of a puller wire is anchored. The gear is rotatably coupled to a lever controlled by an operator and the gear engages the carrier such that rotation of the gear by the lever results in longitudinal movement of the carrier, which results in deflection of the tip section.1. A bi-directional catheter comprising:
an elongated catheter body having proximal and distal ends; first and second puller wires extending through the catheter body; and a control handle mounted to the proximal end of the catheter body, the control handle comprising:
a first carrier connected to a proximal end of the first puller wire, the first carrier riding in a first dedicated channel having a first proximal wall and a first distal wall;
a second carrier connected to a proximal end of the second puller wire, the second carrier riding in a second dedicated channel having a second proximal wall and a second distal wall;
a first gear in engagement with the first carrier, the first gear configured to drive the first carrier distally or proximally in response to rotation of the first gear to thereby deflect the catheter body in a first direction; and
a second gear in engagement with the second carrier, the second gear configured to drive the second carrier distally or proximally in response to rotation of the second gear to thereby deflect the catheter body in a second direction that is different than the first direction. 2. The catheter according to claim 1, further comprising:
a first lever configured for translational movement by an operator, the first lever rotatably coupled to the first gear; and a second lever configured for translational movement by an operator, the second lever rotatably coupled to the second gear. 3. The catheter according to claim 1, further comprising at least one first biasing member configured to act directly on the first carrier to bias the first gear toward a resting position. 4. The catheter according to claim 3, wherein the at least one first biasing member is either fixedly attached to the first proximal wall of the first dedicated channel and a proximal end of the first carrier or fixedly attached to the first distal wall of the first dedicated channel and a distal end of the first carrier. 5. The catheter according to claim 4, wherein the at least one first biasing member comprises:
a proximal first biasing member fixedly attached to the first proximal wall of the first dedicated channel and the proximal end of the first carrier; and/or a distal first biasing member fixedly attached to the first distal wall of the first dedicated channel and the distal end of the first carrier. 6. The catheter according to claim 3, further comprising at least one second biasing member configured to act directly on the second carrier to bias the second gear toward a resting position. 7. The catheter according to claim 6, wherein the at least one second biasing member is either fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier or fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 8. The catheter according to claim 5, wherein the at least one second biasing member comprises:
a proximal second biasing member fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier; and/or a distal second biasing member fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 9. The catheter according to claim 2, wherein:
the first lever extends through a first longitudinal slot in a handle housing and terminates in a first thumb control outside the handle housing; and the second lever extends through a second longitudinal slot in a handle housing and terminates in a second thumb control outside the handle housing. 10. The catheter according to claim 1, wherein distal ends of the first and second puller wires are anchored at different distal distances from the control handle. 11. The catheter according to claim 1, wherein distal ends of the first and second puller wires are anchored at generally equal distal distances from the control handle. 12. The catheter according to claim 2, wherein:
each of the first and second levers is individually configured for both distal and proximal movement from the resting position; or each of the first and second levers is individually configured for only proximal movement form the resting position and distal movement toward the resting position. 13. A control handle for a bi-directional catheter, the control handle comprising:
a first carrier configured for connection to a proximal end of a first puller wire, the first carrier riding in a first dedicated channel having a first proximal wall and a first distal wall; a second carrier configured for connection to a proximal end of a second puller wire, the second carrier riding in a second dedicated channel having a second proximal wall and a second distal wall; a first gear in engagement with the first carrier, the first gear configured to drive the first carrier distally or proximally in response to rotation of the first gear; and a second gear in engagement with the second carrier, the second gear configured to drive the second carrier distally or proximally in response to rotation of the second gear. 14. The control handle according to claim 13, further comprising:
a first lever configured for translational movement by an operator, the first lever fixedly attached to the first gear; and a second lever configured for translational movement by an operator, the second lever fixedly attached to the second gear. 15. The control handle according to claim 13, further comprising at least one first biasing member configured to act directly on the first carrier to bias the gear toward a resting position, wherein the at least one first biasing member is either fixedly attached to the first proximal wall of the first dedicated channel and a proximal end of the first carrier or fixedly attached to the first distal wall of the first dedicated channel and a distal end of the first carrier. 16. The control handle according to claim 15, wherein the at least one first biasing member comprises:
a proximal first biasing member fixedly attached to the first proximal wall of the first dedicated channel and a proximal end of the first carrier; and/or a distal first biasing member fixedly attached to the first distal wall of the first dedicated channel and a distal end of the first carrier. 17. The control handle according to claim 15, further comprising at least one second biasing member configured to act directly on the second carrier to bias the gear toward a resting position, wherein the at least one second biasing member is either fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier or fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 18. The control handle according to claim 17, wherein the at least one second biasing member comprises:
a proximal second biasing member fixedly attached to the second proximal wall of the second dedicated channel and a proximal end of the second carrier; and/or a distal second biasing member fixedly attached to the second distal wall of the second dedicated channel and a distal end of the second carrier. 19. The control handle according to claim 13, further comprising:
a generally hollow handle housing; a first gear housing within the generally hollow handle housing, the first gear being housed in the first gear housing, and the first gear housing being in communication with the first dedicated channel; and a second gear housing within the generally hollow handle housing, the second gear being housed in the second gear housing, and the second gear housing being in communication with the second dedicated channel. 20. The control handle according to claim 13, wherein:
each of the first and second levers is individually configured for both distal and proximal movement from the resting position; or each of the first and second levers is individually configured for only proximal movement form the resting position and distal movement toward the resting position.
| 2,600
|
338,040
| 16,799,699
| 2,648
|
A game controller includes a casing, a base, a movable seat, a signal control module and an operation element. The base, the movable seat, and the signal control module are installed within the casing. The signal control module is installed on the movable seat. The operation element is connected with the signal control module. A portion of the operation element is exposed to an operation hole in an upper cover of the casing. Consequently, a position-limiting movement of the movable seat relative to the base is achieved, and an altitude of the operation element is adjustable.
|
1. A game controller, comprising:
a casing comprising an upper cover and a lower cover, wherein at least one operation hole is formed in the upper cover; a base comprising a main body, at least one driving module and at least one first position-limiting structure, wherein the main body is fixed on an inner surface of the upper cover, the at least one driving module is installed on the main body, and the at least one first position-limiting structure is disposed on the main body; a movable seat disposed over the base, and comprising at least one linking part and at least one second position-limiting structure, wherein the at least one linking part is connected with the corresponding driving module, and the at least one second position-limiting structure cooperates with the corresponding first position-limiting structure, so that the movable seat is movable along the at least one first position-limiting structures; a signal control module installed on the movable seat; and an operation element connected with the signal control module, wherein a portion of the operation element is exposed to the at least one operation hole, wherein the at least one driving module drives a position-limiting movement of the movable seat relative to the base through the at least one linking part, so that an altitude of the operation element is adjustable. 2. The game controller according to claim 1, wherein the at least one linking part and the at least one second position-limiting structure are protrusion ear structures that are externally extended from external surfaces of the movable seat, wherein each of the at least one linking part has two opposed threaded holes, and each of the at least one second position-limiting structure has two opposed position-limiting holes. 3. The game controller according to claim 2, wherein each of the at least one driving module comprises a step motor and a threaded rod, wherein the threaded rod is connected with the step motor, the threaded rod is penetrated through the two threaded holes sequentially, and an external thread segment of the threaded rod is engaged with internal thread segments of the two threaded holes, wherein the step motor drives rotation of the threaded rod, so that the threaded rod is moved in an engaged manner to drive the movement of the movable seat. 4. The game controller according to claim 3, wherein each of the at least one first position-limiting structure is a support bar, and the support bar is penetrated through the two position-limiting holes sequentially. 5. The game controller according to claim 4, wherein the game controller further comprises a position-limiting seat, and the position-limiting seat comprises a top part, a bottom part and a lateral wall part, wherein the lateral wall part is connected with the top part and the bottom part, a receiving space running through the top part and the bottom part is defined by the lateral wall part, the bottom part is connected with the main body of the base, and the movable seat is disposed within the receiving space. 6. The game controller according to claim 5, wherein the lateral wall part comprises at least one first pocket hole and at least one second pocket hole, which are open from the bottom part to the top part, wherein the at least one first pocket hole is aligned with the at least one linking part, and the at least one second pocket hole is aligned with the at least one second position-limiting structure, so that the at least one linking part is inserted into the at least one first pocket hole, and the at least one second position-limiting structure is inserted into the at least one second pocket hole. 7. The game controller according to claim 6, wherein the top part of the position-limiting seat comprises at least one first positioning hole corresponding to the at least one threaded rod and at least one second positioning hole corresponding to the support bar, wherein an end of the threaded rod away from the step motor is penetrated through the corresponding first positioning hole, and an end of the support bar way from the main body of the base is inserted into the corresponding second positioning hole. 8. The game controller according to claim 7, wherein the at least one second position-limiting structure is stopped by the top part of the position-limiting seat, so that a movable range of the movable seat is limited. 9. The game controller according to claim 1, wherein the movable seat comprises an installation space, and the signal control module is installed within the installation space. 10. The game controller according to claim 1, wherein the signal control module comprises a circuit board and a controlling element, wherein the controlling element is installed on the circuit board, the controlling element comprises a coupling part, and the coupling part is connected with the operation element. 11. The game controller according to claim 1, wherein each of the at least one second position-limiting structure is a position-limiting recess that is concavely formed in an external surface of the movable seat. 12. The game controller according to claim 11, wherein each of the at least one first position-limiting structure is a position-limiting guide post, and a shape of a cross section of the position-limiting guide post matches a shape of a cross section of the corresponding position-limiting recess, so that the position-limiting guide post is slidably engaged with the corresponding position-limiting recess. 13. The game controller according to claim 12, wherein the cross section of the position-limiting guide post and the cross section of the corresponding position-limiting recess have semi-elliptic shapes, similar-circular shapes or trapezoid shapes. 14. The game controller according to claim 3, wherein the lower cover comprises an adjusting switch, wherein by operating the adjusting switch to drive and control the step motor, the threaded rod is rotated in a clockwise direction or a counterclockwise direction. 15. The game controller according to claim 1, wherein the operation element is a joystick, a directional key or a button.
|
A game controller includes a casing, a base, a movable seat, a signal control module and an operation element. The base, the movable seat, and the signal control module are installed within the casing. The signal control module is installed on the movable seat. The operation element is connected with the signal control module. A portion of the operation element is exposed to an operation hole in an upper cover of the casing. Consequently, a position-limiting movement of the movable seat relative to the base is achieved, and an altitude of the operation element is adjustable.1. A game controller, comprising:
a casing comprising an upper cover and a lower cover, wherein at least one operation hole is formed in the upper cover; a base comprising a main body, at least one driving module and at least one first position-limiting structure, wherein the main body is fixed on an inner surface of the upper cover, the at least one driving module is installed on the main body, and the at least one first position-limiting structure is disposed on the main body; a movable seat disposed over the base, and comprising at least one linking part and at least one second position-limiting structure, wherein the at least one linking part is connected with the corresponding driving module, and the at least one second position-limiting structure cooperates with the corresponding first position-limiting structure, so that the movable seat is movable along the at least one first position-limiting structures; a signal control module installed on the movable seat; and an operation element connected with the signal control module, wherein a portion of the operation element is exposed to the at least one operation hole, wherein the at least one driving module drives a position-limiting movement of the movable seat relative to the base through the at least one linking part, so that an altitude of the operation element is adjustable. 2. The game controller according to claim 1, wherein the at least one linking part and the at least one second position-limiting structure are protrusion ear structures that are externally extended from external surfaces of the movable seat, wherein each of the at least one linking part has two opposed threaded holes, and each of the at least one second position-limiting structure has two opposed position-limiting holes. 3. The game controller according to claim 2, wherein each of the at least one driving module comprises a step motor and a threaded rod, wherein the threaded rod is connected with the step motor, the threaded rod is penetrated through the two threaded holes sequentially, and an external thread segment of the threaded rod is engaged with internal thread segments of the two threaded holes, wherein the step motor drives rotation of the threaded rod, so that the threaded rod is moved in an engaged manner to drive the movement of the movable seat. 4. The game controller according to claim 3, wherein each of the at least one first position-limiting structure is a support bar, and the support bar is penetrated through the two position-limiting holes sequentially. 5. The game controller according to claim 4, wherein the game controller further comprises a position-limiting seat, and the position-limiting seat comprises a top part, a bottom part and a lateral wall part, wherein the lateral wall part is connected with the top part and the bottom part, a receiving space running through the top part and the bottom part is defined by the lateral wall part, the bottom part is connected with the main body of the base, and the movable seat is disposed within the receiving space. 6. The game controller according to claim 5, wherein the lateral wall part comprises at least one first pocket hole and at least one second pocket hole, which are open from the bottom part to the top part, wherein the at least one first pocket hole is aligned with the at least one linking part, and the at least one second pocket hole is aligned with the at least one second position-limiting structure, so that the at least one linking part is inserted into the at least one first pocket hole, and the at least one second position-limiting structure is inserted into the at least one second pocket hole. 7. The game controller according to claim 6, wherein the top part of the position-limiting seat comprises at least one first positioning hole corresponding to the at least one threaded rod and at least one second positioning hole corresponding to the support bar, wherein an end of the threaded rod away from the step motor is penetrated through the corresponding first positioning hole, and an end of the support bar way from the main body of the base is inserted into the corresponding second positioning hole. 8. The game controller according to claim 7, wherein the at least one second position-limiting structure is stopped by the top part of the position-limiting seat, so that a movable range of the movable seat is limited. 9. The game controller according to claim 1, wherein the movable seat comprises an installation space, and the signal control module is installed within the installation space. 10. The game controller according to claim 1, wherein the signal control module comprises a circuit board and a controlling element, wherein the controlling element is installed on the circuit board, the controlling element comprises a coupling part, and the coupling part is connected with the operation element. 11. The game controller according to claim 1, wherein each of the at least one second position-limiting structure is a position-limiting recess that is concavely formed in an external surface of the movable seat. 12. The game controller according to claim 11, wherein each of the at least one first position-limiting structure is a position-limiting guide post, and a shape of a cross section of the position-limiting guide post matches a shape of a cross section of the corresponding position-limiting recess, so that the position-limiting guide post is slidably engaged with the corresponding position-limiting recess. 13. The game controller according to claim 12, wherein the cross section of the position-limiting guide post and the cross section of the corresponding position-limiting recess have semi-elliptic shapes, similar-circular shapes or trapezoid shapes. 14. The game controller according to claim 3, wherein the lower cover comprises an adjusting switch, wherein by operating the adjusting switch to drive and control the step motor, the threaded rod is rotated in a clockwise direction or a counterclockwise direction. 15. The game controller according to claim 1, wherein the operation element is a joystick, a directional key or a button.
| 2,600
|
338,041
| 16,799,692
| 2,648
|
The disclosure is directed to a network gateway device (“gateway”) that provides various network management features, including a device zoning feature in which client computing devices (“client devices”) connected to the gateway are assigned to different device zones. The client devices connected to the gateway form a local area network (LAN) of the gateway, and can access an external network, e.g., Internet, using the gateway. Each of the device zones has a specific set of network access privileges. Different device zones can have different network access privileges and can provide device isolation in the LAN at different degrees.
|
1. A computer-implemented method performed at a network gateway device, comprising:
generating multiple device zones in a local area network of the network gateway device; receiving a connection request from a first computing device for connecting to the network gateway device; extracting one or more parameters associated with the first computing device from the connection request; measuring a network bandwidth usage associated with the multiple device zones in the local area network; and assigning the first computing device to one of the device zones based on the one or more parameters and based on the network bandwidth usage. 2. The computer-implemented method of claim 1, wherein the one or more parameters include a software related parameter or a hardware related parameter of the first computing device. 3. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
assigning the first computing device to a new device zone in an event the first computing device is not in a known-devices list, wherein the new device zone restricts the first computing device from accessing other resources in the local area network while providing limited access to an external network. 4. The computer-implemented method of claim 3 further comprising:
determining a type of the first computing device based on the one or more parameters; and
assigning the first computing device from the new device zone to one of the multiple device zones based on the type of the first computing device. 5. The computer-implemented method of claim 4, wherein assigning the first computing device to one of the device zones includes:
generating, by the network gateway device, a notification recommending a specified zone to which the first computing device is to be assigned, and receiving an approval from a user associated with the network gateway device to assign the first computing device to the specified zone. 6. The computer-implemented method of claim 3, wherein providing the limited access to the external network includes limiting an available network bandwidth to the first computing device. 7. The computer-implemented method of claim 4, wherein assigning the first computing device to one of the device zones includes assigning the first computing device to a PC zone if the first computing device is of a personal computer type, wherein the PC zone allows the first computing device to access other computing devices in the PC zone, at least some other resources in the local area network, and the external network. 8. The computer-implemented method of claim 4, wherein assigning the first computing device to one of the device zones includes assigning the first computing device to a mobile device zone if the first computing device is of a mobile device type, wherein the mobile device zone allows the first computing device to access the external network while restricting the first computing device from accessing other resources in the local area network other than a portion of a data storage system. 9. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
determining from the one or more parameters that the first computing device failed an integrity or a security check, and moving the first computing device to a timeout zone, wherein the timeout zone restricts the first computing device from accessing other resources in the local area network while permitting limited access to an external network. 10. The computer-implemented method of claim 9 further comprising:
generating an alert to indicate that the first computing device failed the integrity or security check. 11. The computer-implemented method of claim 9, wherein permitting the limited access to the external network includes at least one of limiting an available network bandwidth to the first computing device or restricting the first computing device from accessing one or more websites. 12. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
determining from the one or more parameters that the first computing device is an IoT device, and assigning the first computing device to an IoT device zone, wherein the IoT device zone provides the first computing device access to an external network, restricts the first computing device from accessing any resources in the local area network other than computing devices within the IoT device zone, and provides a limited access to a data storage system. 13. The computer-implemented method of claim 12, wherein the IoT device zone provides the limited access to the data storage system by providing access to data that is accessible through an internal access mode of the data storage system. 14. The computer-implemented method of claim 12, wherein the IoT device zone permits the external network to access the IoT device. 15. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
assigning the first computing device to a printer zone in an event the one or more parameters indicate that the first computing device is a printer device, wherein the printer zone restricts the first computing device from accessing other resources in the local area network. 16. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
determining based on the one or more parameters that the first computing device is a trusted device; and assigning the first computing device to a first trusted zone, wherein the first trusted zone allows the first computing device to access other computing devices in the first trusted zone, at least some other resources in the local area network, and an external network. 17. The computer-implemented method of claim 16, wherein determining the first computing device is the trusted device includes:
prompting a user associated with the network gateway device to confirm that the first computing device is the trusted device, and receiving an indication from the user that the first computing device is the trusted device. 18. The computer-implemented method of claim 16, wherein the at least some other resources in the local area network that can be accessed by the first computing device include computing devices in a printer zone and a data storage system in a storage zone. 19. The computer-implemented method of claim 1, wherein the local area network is a wireless network and at least a subset of the multiple device zones has the same SSID of the wireless network. 20. The computer-implemented method of claim 1, wherein the local area network is a wireless network and at least one of the multiple device zones has an SSID that is different from that of the rest of the multiple device zones. 21. The computer-implemented method of claim 1 further comprising:
providing backup services for backing up data from at least some of the computing devices in the local area network to a data storage system. 22. The computer-implemented method of claim 21, wherein providing backup services includes backing up at least a portion of the data from the data storage system and/or the at least some of the computing devices to a data storage server. 23. The computer-implemented method of claim 1 further comprising:
providing security services for detecting and mitigating malware in at least some of the computing devices in the local area network. 24. A computer-readable storage medium storing computer-readable instructions, comprising:
instructions for generating multiple device zones in a local area network of a network gateway device; instructions for receiving a connection request from a first computing device for connecting to the network gateway device; instructions for extracting one or more parameters associated with the first computing device from the connection request; instructions for measuring a network bandwidth usage associated with the multiple device zones in the local area network; and instructions for assigning the first computing device to one of the device zones based on the one or more parameters and based on the network bandwidth usage. 25. The computer-readable storage medium of claim 24, wherein the instructions for assigning include:
instructions for determining from the one or more parameters that the first computing device is an IoT device, and instructions for assigning the first computing device to an IoT device zone, wherein the IoT device zone provides the first computing device access to an external network and a limited access to a data storage system in a storage zone of the device zones, and wherein the IoT device zone restricts the first computing device from accessing any resources in the local area network other than computing devices within the IoT device zone. 26. The computer-readable storage medium of claim 25, wherein the data storage system stores content that can be accessed by the first computing device for streaming onto a presentation device. 27. The computer-readable storage medium of claim 24, wherein the instructions for assigning include:
instructions for determining from the one or more parameters that the first computing device failed an integrity or a security check, and instructions for moving the first computing device to a timeout zone, wherein the timeout zone restricts the first computing device from accessing other resources in the local area network while permitting limited access to an external network. 28. The computer-readable storage medium of claim 27, wherein the instructions for permitting the limited access to the external network include instructions for at least one of limiting an available network bandwidth to the first computing device or restricting the first computing device from accessing one or more websites. 29. The computer-readable storage medium of claim 27 further comprising:
instructions for generating an alert to indicate that the first computing device failed the integrity or security check. 30. The computer-readable storage medium of claim 24 further comprising:
instructions for receiving device configuration information that assigns the first computing device to one of the multiple device zones, wherein the device configuration information is received from a first user associated with the network gateway device via a client device within the local area network. 31. The computer-readable storage medium of claim 24 further comprising:
instructions for receiving device configuration information that assigns the first computing device to one of the multiple device zones, wherein the device configuration information is received from a first user associated with the network gateway device via a client device outside of the local area network. 32. A system, comprising:
a first component configured to generate multiple device zones in a local area network of a network gateway device; a second component configured to receive a connection request from a first computing device for connecting to the network gateway device; a third component configured to extract one or more parameters associated with the first computing device from the connection request; a fourth component configured to measure a network bandwidth usage associated with the multiple device zones in the local area network; and a fifth component configured to assign the first computing device to one of the device zones based on the one or more parameters and based on the network bandwidth usage. 33. The system of claim 32, wherein the network gateway device is a set-top box.
|
The disclosure is directed to a network gateway device (“gateway”) that provides various network management features, including a device zoning feature in which client computing devices (“client devices”) connected to the gateway are assigned to different device zones. The client devices connected to the gateway form a local area network (LAN) of the gateway, and can access an external network, e.g., Internet, using the gateway. Each of the device zones has a specific set of network access privileges. Different device zones can have different network access privileges and can provide device isolation in the LAN at different degrees.1. A computer-implemented method performed at a network gateway device, comprising:
generating multiple device zones in a local area network of the network gateway device; receiving a connection request from a first computing device for connecting to the network gateway device; extracting one or more parameters associated with the first computing device from the connection request; measuring a network bandwidth usage associated with the multiple device zones in the local area network; and assigning the first computing device to one of the device zones based on the one or more parameters and based on the network bandwidth usage. 2. The computer-implemented method of claim 1, wherein the one or more parameters include a software related parameter or a hardware related parameter of the first computing device. 3. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
assigning the first computing device to a new device zone in an event the first computing device is not in a known-devices list, wherein the new device zone restricts the first computing device from accessing other resources in the local area network while providing limited access to an external network. 4. The computer-implemented method of claim 3 further comprising:
determining a type of the first computing device based on the one or more parameters; and
assigning the first computing device from the new device zone to one of the multiple device zones based on the type of the first computing device. 5. The computer-implemented method of claim 4, wherein assigning the first computing device to one of the device zones includes:
generating, by the network gateway device, a notification recommending a specified zone to which the first computing device is to be assigned, and receiving an approval from a user associated with the network gateway device to assign the first computing device to the specified zone. 6. The computer-implemented method of claim 3, wherein providing the limited access to the external network includes limiting an available network bandwidth to the first computing device. 7. The computer-implemented method of claim 4, wherein assigning the first computing device to one of the device zones includes assigning the first computing device to a PC zone if the first computing device is of a personal computer type, wherein the PC zone allows the first computing device to access other computing devices in the PC zone, at least some other resources in the local area network, and the external network. 8. The computer-implemented method of claim 4, wherein assigning the first computing device to one of the device zones includes assigning the first computing device to a mobile device zone if the first computing device is of a mobile device type, wherein the mobile device zone allows the first computing device to access the external network while restricting the first computing device from accessing other resources in the local area network other than a portion of a data storage system. 9. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
determining from the one or more parameters that the first computing device failed an integrity or a security check, and moving the first computing device to a timeout zone, wherein the timeout zone restricts the first computing device from accessing other resources in the local area network while permitting limited access to an external network. 10. The computer-implemented method of claim 9 further comprising:
generating an alert to indicate that the first computing device failed the integrity or security check. 11. The computer-implemented method of claim 9, wherein permitting the limited access to the external network includes at least one of limiting an available network bandwidth to the first computing device or restricting the first computing device from accessing one or more websites. 12. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
determining from the one or more parameters that the first computing device is an IoT device, and assigning the first computing device to an IoT device zone, wherein the IoT device zone provides the first computing device access to an external network, restricts the first computing device from accessing any resources in the local area network other than computing devices within the IoT device zone, and provides a limited access to a data storage system. 13. The computer-implemented method of claim 12, wherein the IoT device zone provides the limited access to the data storage system by providing access to data that is accessible through an internal access mode of the data storage system. 14. The computer-implemented method of claim 12, wherein the IoT device zone permits the external network to access the IoT device. 15. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
assigning the first computing device to a printer zone in an event the one or more parameters indicate that the first computing device is a printer device, wherein the printer zone restricts the first computing device from accessing other resources in the local area network. 16. The computer-implemented method of claim 1, wherein assigning the first computing device to the one of the multiple device zones includes:
determining based on the one or more parameters that the first computing device is a trusted device; and assigning the first computing device to a first trusted zone, wherein the first trusted zone allows the first computing device to access other computing devices in the first trusted zone, at least some other resources in the local area network, and an external network. 17. The computer-implemented method of claim 16, wherein determining the first computing device is the trusted device includes:
prompting a user associated with the network gateway device to confirm that the first computing device is the trusted device, and receiving an indication from the user that the first computing device is the trusted device. 18. The computer-implemented method of claim 16, wherein the at least some other resources in the local area network that can be accessed by the first computing device include computing devices in a printer zone and a data storage system in a storage zone. 19. The computer-implemented method of claim 1, wherein the local area network is a wireless network and at least a subset of the multiple device zones has the same SSID of the wireless network. 20. The computer-implemented method of claim 1, wherein the local area network is a wireless network and at least one of the multiple device zones has an SSID that is different from that of the rest of the multiple device zones. 21. The computer-implemented method of claim 1 further comprising:
providing backup services for backing up data from at least some of the computing devices in the local area network to a data storage system. 22. The computer-implemented method of claim 21, wherein providing backup services includes backing up at least a portion of the data from the data storage system and/or the at least some of the computing devices to a data storage server. 23. The computer-implemented method of claim 1 further comprising:
providing security services for detecting and mitigating malware in at least some of the computing devices in the local area network. 24. A computer-readable storage medium storing computer-readable instructions, comprising:
instructions for generating multiple device zones in a local area network of a network gateway device; instructions for receiving a connection request from a first computing device for connecting to the network gateway device; instructions for extracting one or more parameters associated with the first computing device from the connection request; instructions for measuring a network bandwidth usage associated with the multiple device zones in the local area network; and instructions for assigning the first computing device to one of the device zones based on the one or more parameters and based on the network bandwidth usage. 25. The computer-readable storage medium of claim 24, wherein the instructions for assigning include:
instructions for determining from the one or more parameters that the first computing device is an IoT device, and instructions for assigning the first computing device to an IoT device zone, wherein the IoT device zone provides the first computing device access to an external network and a limited access to a data storage system in a storage zone of the device zones, and wherein the IoT device zone restricts the first computing device from accessing any resources in the local area network other than computing devices within the IoT device zone. 26. The computer-readable storage medium of claim 25, wherein the data storage system stores content that can be accessed by the first computing device for streaming onto a presentation device. 27. The computer-readable storage medium of claim 24, wherein the instructions for assigning include:
instructions for determining from the one or more parameters that the first computing device failed an integrity or a security check, and instructions for moving the first computing device to a timeout zone, wherein the timeout zone restricts the first computing device from accessing other resources in the local area network while permitting limited access to an external network. 28. The computer-readable storage medium of claim 27, wherein the instructions for permitting the limited access to the external network include instructions for at least one of limiting an available network bandwidth to the first computing device or restricting the first computing device from accessing one or more websites. 29. The computer-readable storage medium of claim 27 further comprising:
instructions for generating an alert to indicate that the first computing device failed the integrity or security check. 30. The computer-readable storage medium of claim 24 further comprising:
instructions for receiving device configuration information that assigns the first computing device to one of the multiple device zones, wherein the device configuration information is received from a first user associated with the network gateway device via a client device within the local area network. 31. The computer-readable storage medium of claim 24 further comprising:
instructions for receiving device configuration information that assigns the first computing device to one of the multiple device zones, wherein the device configuration information is received from a first user associated with the network gateway device via a client device outside of the local area network. 32. A system, comprising:
a first component configured to generate multiple device zones in a local area network of a network gateway device; a second component configured to receive a connection request from a first computing device for connecting to the network gateway device; a third component configured to extract one or more parameters associated with the first computing device from the connection request; a fourth component configured to measure a network bandwidth usage associated with the multiple device zones in the local area network; and a fifth component configured to assign the first computing device to one of the device zones based on the one or more parameters and based on the network bandwidth usage. 33. The system of claim 32, wherein the network gateway device is a set-top box.
| 2,600
|
338,042
| 16,799,616
| 2,648
|
Embodiments of the present disclosure can provide distributed system resource allocation methods and apparatuses. The method comprises: receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server; determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, resources to be returned by a second job management server and a resource return deadline; and returning, according to and the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline.
|
1. (canceled) 2. A distributed system resource allocation method by a second job management server, comprising:
receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server; determining, according to the job execution information corresponding to the first job management server, resources to be returned by the second job management server and a resource return deadline; and returning, according to the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline. 3. The method of claim 2, wherein the job execution information corresponding to the first job management server comprises an output deadline of the job and an execution time of the job, and
wherein determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, the resources to be returned by the second job management server and the resource return deadline comprises: obtaining a resource obtaining deadline of the job according to a difference between the output deadline of the job and the execution time of the job, and setting the resource return deadline of the second job management server as the resource obtaining deadline of the job. 4. The method of claim 2, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and returning, by the second job management server, the resources to be returned to the resource scheduling server after execution of the current job is completed in response to a determination that a sum of a current time and the remaining time for completion of the current job is not later than the resource return deadline. 5. The method of claim 2, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and backing up the current job, recording a backup position, and returning the resources to be returned to the resource scheduling server after the backup is completed in response to a determination that a sum of the current time and the remaining time for completion of the current job is later than the resource return deadline. 6. The method of claim 5, further comprising:
receiving resources re-allocated by the resource scheduling server; acquiring the backup of the current job; and resuming the execution of the current job from the backup position. 7-11. (canceled) 12. An apparatus for resource allocation, comprising:
a memory storing a set of instructions; and one or more processors configured to execute the set of instructions to cause the apparatus to perform:
receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server,
determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, resources to be returned by a second job management server and a resource return deadline, and
returning, according to the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline. 13. The apparatus of claim 12, wherein the job execution information corresponding to the first job management server comprises an output deadline of the job and an execution time of the job, and
wherein determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, the resources to be returned by the second job management server and the resource return deadline comprises:
obtaining a resource obtaining deadline of the job according to a difference between the output deadline of the job and the execution time of the job, and
setting the resource return deadline of the second job management server as the resource obtaining deadline of the job. 14. The apparatus of 13, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and returning, by the second job management server, the resources to be returned to the resource scheduling server after execution of the current job is completed in response to a determination that a sum of a current time and the remaining time for completion of the current job is not later than the resource return deadline. 15. The apparatus of claim 12, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and backing up the current job, recording a backup position, and returning the resources to be returned to the resource scheduling server after the backup is completed in response to a determination that a sum of the current time and the remaining time for completion of the current job is later than the resource return deadline. 16. The apparatus of claim 12, wherein the set of instructions that are executable by one or more processor of the first terminal device to cause the first terminal device to further perform:
receiving resources re-allocated by the resource scheduling server; acquiring the backup of the current job; and resuming the execution of the current job from the backup position. 17-21. (canceled) 22. A non-transitory computer readable medium that stores a set of instructions that is executable by at least one processor of a computer to cause the computer to perform a network management method, the method comprising:
receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server; determining, according to the job execution information corresponding to the first job management server, resources to be returned by the second job management server and a resource return deadline; and returning, according to the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline. 23. The non-transitory computer readable medium of claim 22, wherein the job execution information corresponding to the first job management server comprises an output deadline of the job and an execution time of the job, and
wherein determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, the resources to be returned by the second job management server and the resource return deadline comprises:
obtaining a resource obtaining deadline of the job according to a difference between the output deadline of the job and the execution time of the job, and
setting the resource return deadline of the second job management server as the resource obtaining deadline of the job. 24. The non-transitory computer readable medium of claim 22, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and returning, by the second job management server, the resources to be returned to the resource scheduling server after execution of the current job is completed in response to a determination that a sum of a current time and the remaining time for completion of the current job is not later than the resource return deadline. 25. The non-transitory computer readable medium of claim 22, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and backing up the current job, recording a backup position, and returning the resources to be returned to the resource scheduling server after the backup is completed in response to a determination that a sum of the current time and the remaining time for completion of the current job is later than the resource return deadline. 26. The non-transitory computer readable medium of claim 22, wherein the set of instructions that are executable by the at least one processor of a computer to cause the computer to further perform:
receiving resources re-allocated by the resource scheduling server; acquiring the backup of the current job; and resuming the execution of the current job from the backup position. 27-31 (canceled)
|
Embodiments of the present disclosure can provide distributed system resource allocation methods and apparatuses. The method comprises: receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server; determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, resources to be returned by a second job management server and a resource return deadline; and returning, according to and the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline.1. (canceled) 2. A distributed system resource allocation method by a second job management server, comprising:
receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server; determining, according to the job execution information corresponding to the first job management server, resources to be returned by the second job management server and a resource return deadline; and returning, according to the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline. 3. The method of claim 2, wherein the job execution information corresponding to the first job management server comprises an output deadline of the job and an execution time of the job, and
wherein determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, the resources to be returned by the second job management server and the resource return deadline comprises: obtaining a resource obtaining deadline of the job according to a difference between the output deadline of the job and the execution time of the job, and setting the resource return deadline of the second job management server as the resource obtaining deadline of the job. 4. The method of claim 2, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and returning, by the second job management server, the resources to be returned to the resource scheduling server after execution of the current job is completed in response to a determination that a sum of a current time and the remaining time for completion of the current job is not later than the resource return deadline. 5. The method of claim 2, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and backing up the current job, recording a backup position, and returning the resources to be returned to the resource scheduling server after the backup is completed in response to a determination that a sum of the current time and the remaining time for completion of the current job is later than the resource return deadline. 6. The method of claim 5, further comprising:
receiving resources re-allocated by the resource scheduling server; acquiring the backup of the current job; and resuming the execution of the current job from the backup position. 7-11. (canceled) 12. An apparatus for resource allocation, comprising:
a memory storing a set of instructions; and one or more processors configured to execute the set of instructions to cause the apparatus to perform:
receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server,
determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, resources to be returned by a second job management server and a resource return deadline, and
returning, according to the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline. 13. The apparatus of claim 12, wherein the job execution information corresponding to the first job management server comprises an output deadline of the job and an execution time of the job, and
wherein determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, the resources to be returned by the second job management server and the resource return deadline comprises:
obtaining a resource obtaining deadline of the job according to a difference between the output deadline of the job and the execution time of the job, and
setting the resource return deadline of the second job management server as the resource obtaining deadline of the job. 14. The apparatus of 13, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and returning, by the second job management server, the resources to be returned to the resource scheduling server after execution of the current job is completed in response to a determination that a sum of a current time and the remaining time for completion of the current job is not later than the resource return deadline. 15. The apparatus of claim 12, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and backing up the current job, recording a backup position, and returning the resources to be returned to the resource scheduling server after the backup is completed in response to a determination that a sum of the current time and the remaining time for completion of the current job is later than the resource return deadline. 16. The apparatus of claim 12, wherein the set of instructions that are executable by one or more processor of the first terminal device to cause the first terminal device to further perform:
receiving resources re-allocated by the resource scheduling server; acquiring the backup of the current job; and resuming the execution of the current job from the backup position. 17-21. (canceled) 22. A non-transitory computer readable medium that stores a set of instructions that is executable by at least one processor of a computer to cause the computer to perform a network management method, the method comprising:
receiving a resource preemption request sent by a resource scheduling server, the resource preemption request comprising job execution information corresponding to a first job management server; determining, according to the job execution information corresponding to the first job management server, resources to be returned by the second job management server and a resource return deadline; and returning, according to the resource return deadline and a current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline. 23. The non-transitory computer readable medium of claim 22, wherein the job execution information corresponding to the first job management server comprises an output deadline of the job and an execution time of the job, and
wherein determining, according to the job execution information corresponding to the first job management server and comprised in the resource preemption request, the resources to be returned by the second job management server and the resource return deadline comprises:
obtaining a resource obtaining deadline of the job according to a difference between the output deadline of the job and the execution time of the job, and
setting the resource return deadline of the second job management server as the resource obtaining deadline of the job. 24. The non-transitory computer readable medium of claim 22, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and returning, by the second job management server, the resources to be returned to the resource scheduling server after execution of the current job is completed in response to a determination that a sum of a current time and the remaining time for completion of the current job is not later than the resource return deadline. 25. The non-transitory computer readable medium of claim 22, wherein returning, according to the determined resource return deadline and the current job execution progress of the second job management server, the resources to be returned to the resource scheduling server before expiration of the resource return deadline comprises:
determining a remaining time for completion of a current job according to the current job execution progress of the second job management server; and backing up the current job, recording a backup position, and returning the resources to be returned to the resource scheduling server after the backup is completed in response to a determination that a sum of the current time and the remaining time for completion of the current job is later than the resource return deadline. 26. The non-transitory computer readable medium of claim 22, wherein the set of instructions that are executable by the at least one processor of a computer to cause the computer to further perform:
receiving resources re-allocated by the resource scheduling server; acquiring the backup of the current job; and resuming the execution of the current job from the backup position. 27-31 (canceled)
| 2,600
|
338,043
| 16,799,693
| 2,648
|
One embodiment comprises receiving scene data for a scene, the scene data including data for a plurality of triangles, loading a plurality of viewpoints and processing the scene data using a plurality of parallel rendering pipelines of a graphics processing unit to render image data for a plurality of hogel views of the scene in parallel to a set of render targets, the plurality of hogel views based on the plurality of viewpoints. Processing the scene data using the plurality of parallel rendering pipelines comprises rasterizing a same triangle from the plurality of triangles in parallel for each of the plurality of hogel views prior to moving to a next triangle from the plurality of triangles.
|
1. A non-transitory computer readable medium embodying a set of computer-executable instructions, the set of computer-executable instructions comprising instructions for:
receiving scene data for a scene, the scene data including data for a plurality of triangles; loading a plurality of viewpoints; and processing the scene data using a plurality of parallel rendering pipelines of a graphics processing unit to render image data for a plurality of hogel views of the scene in parallel to a set of render targets, the plurality of hogel views based on the plurality of viewpoints, and wherein processing the scene data using the plurality of parallel rendering pipelines comprises rasterizing a same triangle from the plurality of triangles in parallel for each of the plurality of hogel views prior to moving to a next triangle from the plurality of triangles. 2. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for assigning a different viewpoint from the plurality of viewpoints and a different render target from the set of render targets to each rendering pipeline from the plurality of parallel rendering pipelines. 3. The non-transitory computer readable medium of claim 2, wherein the set of computer-executable instructions comprises instructions for performing, in each of the plurality of parallel rendering pipelines, a model space to viewpoint specific eye space transform on a set of geometry data using the viewpoint assigned to that rendering pipeline. 4. The non-transitory computer readable medium of claim 1, wherein processing the scene data using the plurality of parallel rendering pipelines to render the image data for the plurality of hogel views of the scene in parallel further comprises:
defining a bowtie frustum having an origin at an image plane; and rendering multiple sides of the bowtie frustum in a single pass without duplicating geometric shapes that pass through the image plane. 5. The non-transitory computer readable medium of claim 1, wherein the plurality of viewpoints comprises a plurality of viewpoint-specific transforms and the scene data includes 3D geometry data for a 3D model in a model space. 6. The non-transitory computer readable medium of claim 5, herein the set of computer-executable instructions comprises instructions for:
receiving a model transform expressing a relationship between the model space and a world space; 7. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for dispatching geometry data and render lists to the graphics processing unit. 8. The non-transitory computer readable medium of claim 7, wherein the set of computer-executable instructions comprises instructions for triple buffering the render lists for dispatch to the graphics processing unit. 9. The non-transitory computer readable medium of claim 7, wherein the set of computer-executable instructions comprises instructions for halting dispatching of a next scene frame to the graphics processing unit until a synchronization signal is received from the graphics processing unit. 10. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for caching vertices and texture at the graphics processing unit. 11. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for:
receiving a synchronization signal at the graphics processing unit; and based on the synchronization signal, indicating to a display that an image is ready to be displayed. 12. An image rendering method comprising:
receiving 3D model data for a 3D model, the 3D model data including geometry data and texture data for a plurality of triangles; loading a viewpoint; and processing the 3D model data to render image data for a hogel view to a render target, the hogel view based on the viewpoint, wherein processing the 3D model data to render the image data for the hogel view comprises:
defining a bowtie frustum having an origin at an image plane for a viewpoint-specific eye space, the bowtie frustum comprising a plurality of planes defining a top portion of the bowtie frustum and a bottom portion of the bowtie frustum; and
rendering multiple sides of the bowtie frustum in a single pass without duplicating geometric shapes that pass through the image plane. 13. The method of claim 12, further comprising:
receiving a bounding volume, wherein processing the 3D model data comprises: determining if an object in the 3D model falls entirely outside of the bowtie frustum; and based on a determination that the object falls entirely outside of the bowtie frustum, culling the object. 14. The method of claim 12, wherein processing the 3D model data to render image data for the hogel view to the render target comprises:
selecting a triangle from the plurality of triangles; determinizing if the selected triangle faces a virtual viewer; and based on a determination that the selected triangle does not face the virtual viewer discarding the triangle. 15. The method of claim 12, processing the 3D model data to render the image data for the hogel view to the render target comprises:
selecting a triangle from the plurality of triangles; determinizing if the selected triangle falls entirely outside of the bowtie frustum; and based on a determination that the selected triangle falls entirely outside of the bowtie frustum, discarding the selected triangle. 16. The method of claim 12, wherein processing the 3D model data to render the image data for the hogel view to the render target comprises:
selecting a triangle from the plurality of triangles; determining if the selected triangle intersects the bowtie frustum; and based on a determination that the selected triangle intersects the bowtie frustum, clipping the selected triangle to the bowtie frustum. 17. The method of claim 16, wherein processing the 3D model data to render the image data for the hogel view to the render target comprises:
determining that at least a portion of the selected triangle falls within the bottom portion of the bowtie frustum; performing a facing test on the at least a portion of the selected triangle falls within the bottom portion of the bowtie frustum to determine if the at least a portion of the selected triangle faces a virtual viewer; and based on a determination that the at least a portion of the selected triangle falls that within the bottom portion of the bowtie frustum does not face the virtual viewer, discarding the at least a portion of the triangle. 18. The method of claim 15, further comprising:
selecting a triangle from the plurality of triangles, wherein rendering multiple sides of the bowtie frustum comprises rasterizing the selected triangle. 19. The method of claim 18, wherein rasterizing the selected triangle comprises:
based on a determination that the selected triangle represents a singularity:
performing a barycentric texture lookup based on a first set of barycentric coordinates determined for the selected triangle to determine a color indicated in the texture data;
using the color to color the entire render target for a pixel depth of zero; and
drawing a set of edges for the selected triangle. 20. The method of claim 18, wherein rasterizing the selected triangle comprises:
determining a set of valid top bounding points for the selected triangle using the top portion of the bowtie frustum; building a top bounding box based on the set of valid top bounding points; converting the top bounding box to integer pixel coordinates for a first set of pixels; for each pixel in the first set of pixels:
converting the integer pixel coordinates for the pixel to normalized pixel coordinates for the top portion of the bowtie frustum;
performing a ray trace to find an intersection with a triangle plane of the selected triangle for that pixel from the first set of pixels;
based on the intersection with the triangle plane found for that pixel plane in the first set of pixels, determining a set of barycentric distances;
using the set of barycentric distances, determine a set of barycentric weights;
performing a barycentric lookup using the set of barycentric weights to determine a color for the pixel; and
shading the first set of pixels based on one or more colors determined for the pixels in the first set of pixels. 21. The method of claim 18, wherein rasterizing the selected triangle comprises:
determining a set of valid bottom bounding points for the selected triangle using the bottom portion of the bowtie frustum; building a bottom bounding box based on the set of valid bottom bounding points; converting the bottom bounding box to integer pixel coordinates for a second set of pixels; for each pixel in the second set of pixels:
converting the integer pixel coordinates for the pixel to normalized pixel coordinates for the bottom portion of the bowtie frustum;
performing a ray trace to find for an intersection with a triangle plane of the selected triangle for that pixel from the second set of pixels;
based on the intersection with the triangle plane found for that pixel in the second set of pixels, determining a set of barycentric distances;
using the set of barycentric distances, determine a set of barycentric weights;
performing a barycentric lookup using the set of barycentric weights to determine a color for that pixel from the second set of pixels; and
shading the second set of pixels based on one or more colors determined for the pixels in the second set of pixels.
|
One embodiment comprises receiving scene data for a scene, the scene data including data for a plurality of triangles, loading a plurality of viewpoints and processing the scene data using a plurality of parallel rendering pipelines of a graphics processing unit to render image data for a plurality of hogel views of the scene in parallel to a set of render targets, the plurality of hogel views based on the plurality of viewpoints. Processing the scene data using the plurality of parallel rendering pipelines comprises rasterizing a same triangle from the plurality of triangles in parallel for each of the plurality of hogel views prior to moving to a next triangle from the plurality of triangles.1. A non-transitory computer readable medium embodying a set of computer-executable instructions, the set of computer-executable instructions comprising instructions for:
receiving scene data for a scene, the scene data including data for a plurality of triangles; loading a plurality of viewpoints; and processing the scene data using a plurality of parallel rendering pipelines of a graphics processing unit to render image data for a plurality of hogel views of the scene in parallel to a set of render targets, the plurality of hogel views based on the plurality of viewpoints, and wherein processing the scene data using the plurality of parallel rendering pipelines comprises rasterizing a same triangle from the plurality of triangles in parallel for each of the plurality of hogel views prior to moving to a next triangle from the plurality of triangles. 2. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for assigning a different viewpoint from the plurality of viewpoints and a different render target from the set of render targets to each rendering pipeline from the plurality of parallel rendering pipelines. 3. The non-transitory computer readable medium of claim 2, wherein the set of computer-executable instructions comprises instructions for performing, in each of the plurality of parallel rendering pipelines, a model space to viewpoint specific eye space transform on a set of geometry data using the viewpoint assigned to that rendering pipeline. 4. The non-transitory computer readable medium of claim 1, wherein processing the scene data using the plurality of parallel rendering pipelines to render the image data for the plurality of hogel views of the scene in parallel further comprises:
defining a bowtie frustum having an origin at an image plane; and rendering multiple sides of the bowtie frustum in a single pass without duplicating geometric shapes that pass through the image plane. 5. The non-transitory computer readable medium of claim 1, wherein the plurality of viewpoints comprises a plurality of viewpoint-specific transforms and the scene data includes 3D geometry data for a 3D model in a model space. 6. The non-transitory computer readable medium of claim 5, herein the set of computer-executable instructions comprises instructions for:
receiving a model transform expressing a relationship between the model space and a world space; 7. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for dispatching geometry data and render lists to the graphics processing unit. 8. The non-transitory computer readable medium of claim 7, wherein the set of computer-executable instructions comprises instructions for triple buffering the render lists for dispatch to the graphics processing unit. 9. The non-transitory computer readable medium of claim 7, wherein the set of computer-executable instructions comprises instructions for halting dispatching of a next scene frame to the graphics processing unit until a synchronization signal is received from the graphics processing unit. 10. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for caching vertices and texture at the graphics processing unit. 11. The non-transitory computer readable medium of claim 1, wherein the set of computer-executable instructions comprises instructions for:
receiving a synchronization signal at the graphics processing unit; and based on the synchronization signal, indicating to a display that an image is ready to be displayed. 12. An image rendering method comprising:
receiving 3D model data for a 3D model, the 3D model data including geometry data and texture data for a plurality of triangles; loading a viewpoint; and processing the 3D model data to render image data for a hogel view to a render target, the hogel view based on the viewpoint, wherein processing the 3D model data to render the image data for the hogel view comprises:
defining a bowtie frustum having an origin at an image plane for a viewpoint-specific eye space, the bowtie frustum comprising a plurality of planes defining a top portion of the bowtie frustum and a bottom portion of the bowtie frustum; and
rendering multiple sides of the bowtie frustum in a single pass without duplicating geometric shapes that pass through the image plane. 13. The method of claim 12, further comprising:
receiving a bounding volume, wherein processing the 3D model data comprises: determining if an object in the 3D model falls entirely outside of the bowtie frustum; and based on a determination that the object falls entirely outside of the bowtie frustum, culling the object. 14. The method of claim 12, wherein processing the 3D model data to render image data for the hogel view to the render target comprises:
selecting a triangle from the plurality of triangles; determinizing if the selected triangle faces a virtual viewer; and based on a determination that the selected triangle does not face the virtual viewer discarding the triangle. 15. The method of claim 12, processing the 3D model data to render the image data for the hogel view to the render target comprises:
selecting a triangle from the plurality of triangles; determinizing if the selected triangle falls entirely outside of the bowtie frustum; and based on a determination that the selected triangle falls entirely outside of the bowtie frustum, discarding the selected triangle. 16. The method of claim 12, wherein processing the 3D model data to render the image data for the hogel view to the render target comprises:
selecting a triangle from the plurality of triangles; determining if the selected triangle intersects the bowtie frustum; and based on a determination that the selected triangle intersects the bowtie frustum, clipping the selected triangle to the bowtie frustum. 17. The method of claim 16, wherein processing the 3D model data to render the image data for the hogel view to the render target comprises:
determining that at least a portion of the selected triangle falls within the bottom portion of the bowtie frustum; performing a facing test on the at least a portion of the selected triangle falls within the bottom portion of the bowtie frustum to determine if the at least a portion of the selected triangle faces a virtual viewer; and based on a determination that the at least a portion of the selected triangle falls that within the bottom portion of the bowtie frustum does not face the virtual viewer, discarding the at least a portion of the triangle. 18. The method of claim 15, further comprising:
selecting a triangle from the plurality of triangles, wherein rendering multiple sides of the bowtie frustum comprises rasterizing the selected triangle. 19. The method of claim 18, wherein rasterizing the selected triangle comprises:
based on a determination that the selected triangle represents a singularity:
performing a barycentric texture lookup based on a first set of barycentric coordinates determined for the selected triangle to determine a color indicated in the texture data;
using the color to color the entire render target for a pixel depth of zero; and
drawing a set of edges for the selected triangle. 20. The method of claim 18, wherein rasterizing the selected triangle comprises:
determining a set of valid top bounding points for the selected triangle using the top portion of the bowtie frustum; building a top bounding box based on the set of valid top bounding points; converting the top bounding box to integer pixel coordinates for a first set of pixels; for each pixel in the first set of pixels:
converting the integer pixel coordinates for the pixel to normalized pixel coordinates for the top portion of the bowtie frustum;
performing a ray trace to find an intersection with a triangle plane of the selected triangle for that pixel from the first set of pixels;
based on the intersection with the triangle plane found for that pixel plane in the first set of pixels, determining a set of barycentric distances;
using the set of barycentric distances, determine a set of barycentric weights;
performing a barycentric lookup using the set of barycentric weights to determine a color for the pixel; and
shading the first set of pixels based on one or more colors determined for the pixels in the first set of pixels. 21. The method of claim 18, wherein rasterizing the selected triangle comprises:
determining a set of valid bottom bounding points for the selected triangle using the bottom portion of the bowtie frustum; building a bottom bounding box based on the set of valid bottom bounding points; converting the bottom bounding box to integer pixel coordinates for a second set of pixels; for each pixel in the second set of pixels:
converting the integer pixel coordinates for the pixel to normalized pixel coordinates for the bottom portion of the bowtie frustum;
performing a ray trace to find for an intersection with a triangle plane of the selected triangle for that pixel from the second set of pixels;
based on the intersection with the triangle plane found for that pixel in the second set of pixels, determining a set of barycentric distances;
using the set of barycentric distances, determine a set of barycentric weights;
performing a barycentric lookup using the set of barycentric weights to determine a color for that pixel from the second set of pixels; and
shading the second set of pixels based on one or more colors determined for the pixels in the second set of pixels.
| 2,600
|
338,044
| 16,799,686
| 2,648
|
Systems and methods provide a non-contact current measurement system which operates to measure alternating current flowing through an insulated wire without requiring galvanic contact with the insulated wire. The measurement system may include a magnetic field sensor that is selectively positionable proximate an insulated wire under test. In operation the magnetic field sensor detects a magnetic field generated by the current flowing in the insulated wire. Using an adjustable clamp assembly, the measurement system provides control over the mechanical positioning of the insulated wire relative to the magnetic field sensor to ensure consistent measurements. The non-contact current measurement system may determine information relating to the physical dimensions (e.g., diameter) of the insulated wire. Using the detected magnetic field, the known mechanical positioning, and the determined information relating to the physical dimensions of the insulated wire, the measurement system accurately determines the magnitude of the current flowing through the insulated wire without galvanic contact.
|
1. A current measurement system, comprising:
an adjustable clamp assembly which selectively clamps and locates an insulated wire at a position within the adjustable clamp assembly; a position feedback sensor that, in operation, autonomously senses the position of the insulated wire and generates a position feedback sensor signal indicative of the sensed position of the insulated wire clamped within the adjustable clamp assembly; a magnetic field sensor positioned proximate the adjustable clamp assembly, wherein in operation the magnetic field sensor generates a magnetic field sensor signal that is indicative of at least one characteristic of a current flowing through the insulated wire clamped within the adjustable clamp assembly; and control circuitry communicatively coupled to the position feedback sensor and the magnetic field sensor, wherein in operation, the control circuitry:
receives the position feedback sensor signal from the position feedback sensor;
receives the magnetic field sensor signal from the magnetic field sensor; and
determines at least one characteristic of the current flowing through the insulated wire based at least in part on the received position feedback sensor signal and the magnetic field sensor signal. 2. The current measurement system of claim 1 wherein the adjustable clamp assembly comprises a first clamp surface and a second clamp surface, wherein the second clamp surface faces the first clamp surface, and at least one of the first and second clamp surfaces is movable in a direction toward and away from the other of the first and second clamp surfaces to selectively clamp the insulated wire between the first and second clamp surfaces. 3. The current measurement system of claim 2 wherein the first clamp surface comprises a front end surface of a front end of a housing of the current measurement system, and the second clamp surface is disposed on a clamp member that is selectively movable with respect to the front end surface. 4. The current measurement system of claim 3 wherein the magnetic field sensor is positioned proximate the front end surface of the front end of the housing. 5. The current measurement system of claim 1 wherein the adjustable clamp assembly comprises a slider clamp assembly, and the position feedback sensor comprises a linear position feedback sensor that generates a position feedback signal indicative of a linear position of the slider clamp assembly. 6. The current measurement system of claim 1 wherein the adjustable clamp assembly comprises a first clamp portion having a first clamp surface and a second clamp portion having a second clamp surface that faces the first clamp surface, and a biasing member biases the first clamp portion toward the second clamp portion. 7. The current measurement system of claim 6 wherein at least one of the first clamp surface and the second clamp surface operates as a shield for the magnetic field sensor. 8. The current measurement system of claim 1 wherein the at least one characteristic of the current flowing through the insulated wire comprises a magnitude of the current flowing through the insulated wire. 9. The current measurement system of claim 1 wherein the position feedback sensor comprises a resistive sensor, a magneto-resistive sensor, a Hall Effect sensor, a capacitive sensor, an inductive sensor, or an optical sensor. 10. The current measurement system of claim 1, further comprising:
a reference signal type sensor that, in operation, senses a reference signal in the insulated wire without galvanically contacting the insulated wire, wherein the control circuitry receives the reference signal and determines the at least one characteristic of the current flowing through the insulated wire based at least in part on the received reference signal. 11. The current measurement system of claim 10 wherein the control circuitry further determines at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal, wherein the at least one physical dimension is indicative of a distance between the conductor and the magnetic field sensor. 12. The current measurement system of claim 10 wherein the control circuitry further determines at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal and the received position feedback sensor signal. 13. A method of measuring current in an insulated wire without galvanically contacting a conductor in the insulated wire, the method comprising:
clamping, via an adjustable clamp assembly, the insulated wire between first and second clamp surfaces; autonomously determining a position of the insulated wire clamped between the first and second clamp surfaces; sensing, via a magnetic field sensor positioned proximate the insulated wire clamped between the first and second clamp surfaces, a magnetic field generated by the current flowing through the insulated wire; and determining at least one characteristic of the current flowing through the insulated wire based at least in part on the determined position of the insulated wire clamped between the first and second clamp surfaces and the sensed magnetic field generated by the current flowing through the insulated wire. 14. The method of claim 13 wherein the first clamp surface comprises a front end surface of a front end of a housing and the second clamp surface comprises a surface of a clamp member of the adjustable clamp assembly that is movable with respect to the front end surface, and clamping the insulated wire between the first and second clamp surfaces comprises clamping the insulated wire between the front end surface and the surface of the clamp member. 15. The method of claim 14 wherein sensing the magnetic field generated by the current flowing through the insulated wire comprises sensing the magnetic field via the magnetic field sensor, and the magnetic field sensor is positioned proximate the front end surface of the front end of the housing. 16. The method of claim 13 wherein clamping the insulated wire between the first and second clamp surfaces comprises clamping the insulated wire between first and second clamp surfaces of a slider clamp assembly. 17. The method of claim 13 wherein the first clamp surface is positioned on a first clamp portion and the second clamp surface is positioned on a second clamp portion, and the method further comprises biasing the first clamp portion toward the second clamp portion. 18. The method of claim 13 wherein determining the at least one characteristic of the current flowing through the insulated wire comprises determining a magnitude of the current flowing through the insulated wire. 19. The method of claim 13, further comprising:
sensing, via a reference signal type sensor positioned in a housing, a reference signal in the insulated wire without galvanically contacting the insulated wire; and determining, via the control circuitry, the at least one characteristic of the current flowing through the insulated wire based at least in part on the sensed reference signal. 20. The method of claim 19, further determining, via the control circuitry, at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal. 21. The method of claim 19, further determining, via the control circuitry, at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal and the received position feedback sensor signal. 22. A current measurement system, comprising:
a housing; a movable clamp coupled to the housing that is selectively movable to clamp an insulated wire under test; a position feedback sensor that generates a position feedback sensor signal that is indicative of a position of the movable clamp; a current sensor positioned proximate the movable clamp, wherein the current sensor is operative to generate a current sensor signal that is indicative of at least one characteristic of a current flowing through the insulated wire; and control circuitry communicatively coupled to the position feedback sensor and the current sensor, wherein, in operation, the control circuitry:
receives the position feedback sensor signal from the position feedback sensor;
receives the current sensor signal from the current sensor; and
determines at least one characteristic of the current flowing through the insulated wire based at least in part on the received position feedback signal and the current sensor signal. 23. The current measurement system of claim 22 wherein the current sensor comprises a magnetic field sensor. 24. The current measurement system of claim 22 wherein the position feedback sensor comprises a resistive sensor, a magneto-resistive sensor, a Hall Effect sensor, or an optical sensor. 25. The current measurement system of claim 22, wherein the moveable clamp comprises a retractable hook that is slidably coupled to the housing. 26. The current measurement system of claim 25, wherein the retractable hook is slidable linearly along a length of the housing. 27. The current measurement system of claim 25, wherein the current sensor is positioned in the housing, and wherein the retractable hook is slidable to bear against the insulated conductor and clamp the insulated conductor against the current sensor.
|
Systems and methods provide a non-contact current measurement system which operates to measure alternating current flowing through an insulated wire without requiring galvanic contact with the insulated wire. The measurement system may include a magnetic field sensor that is selectively positionable proximate an insulated wire under test. In operation the magnetic field sensor detects a magnetic field generated by the current flowing in the insulated wire. Using an adjustable clamp assembly, the measurement system provides control over the mechanical positioning of the insulated wire relative to the magnetic field sensor to ensure consistent measurements. The non-contact current measurement system may determine information relating to the physical dimensions (e.g., diameter) of the insulated wire. Using the detected magnetic field, the known mechanical positioning, and the determined information relating to the physical dimensions of the insulated wire, the measurement system accurately determines the magnitude of the current flowing through the insulated wire without galvanic contact.1. A current measurement system, comprising:
an adjustable clamp assembly which selectively clamps and locates an insulated wire at a position within the adjustable clamp assembly; a position feedback sensor that, in operation, autonomously senses the position of the insulated wire and generates a position feedback sensor signal indicative of the sensed position of the insulated wire clamped within the adjustable clamp assembly; a magnetic field sensor positioned proximate the adjustable clamp assembly, wherein in operation the magnetic field sensor generates a magnetic field sensor signal that is indicative of at least one characteristic of a current flowing through the insulated wire clamped within the adjustable clamp assembly; and control circuitry communicatively coupled to the position feedback sensor and the magnetic field sensor, wherein in operation, the control circuitry:
receives the position feedback sensor signal from the position feedback sensor;
receives the magnetic field sensor signal from the magnetic field sensor; and
determines at least one characteristic of the current flowing through the insulated wire based at least in part on the received position feedback sensor signal and the magnetic field sensor signal. 2. The current measurement system of claim 1 wherein the adjustable clamp assembly comprises a first clamp surface and a second clamp surface, wherein the second clamp surface faces the first clamp surface, and at least one of the first and second clamp surfaces is movable in a direction toward and away from the other of the first and second clamp surfaces to selectively clamp the insulated wire between the first and second clamp surfaces. 3. The current measurement system of claim 2 wherein the first clamp surface comprises a front end surface of a front end of a housing of the current measurement system, and the second clamp surface is disposed on a clamp member that is selectively movable with respect to the front end surface. 4. The current measurement system of claim 3 wherein the magnetic field sensor is positioned proximate the front end surface of the front end of the housing. 5. The current measurement system of claim 1 wherein the adjustable clamp assembly comprises a slider clamp assembly, and the position feedback sensor comprises a linear position feedback sensor that generates a position feedback signal indicative of a linear position of the slider clamp assembly. 6. The current measurement system of claim 1 wherein the adjustable clamp assembly comprises a first clamp portion having a first clamp surface and a second clamp portion having a second clamp surface that faces the first clamp surface, and a biasing member biases the first clamp portion toward the second clamp portion. 7. The current measurement system of claim 6 wherein at least one of the first clamp surface and the second clamp surface operates as a shield for the magnetic field sensor. 8. The current measurement system of claim 1 wherein the at least one characteristic of the current flowing through the insulated wire comprises a magnitude of the current flowing through the insulated wire. 9. The current measurement system of claim 1 wherein the position feedback sensor comprises a resistive sensor, a magneto-resistive sensor, a Hall Effect sensor, a capacitive sensor, an inductive sensor, or an optical sensor. 10. The current measurement system of claim 1, further comprising:
a reference signal type sensor that, in operation, senses a reference signal in the insulated wire without galvanically contacting the insulated wire, wherein the control circuitry receives the reference signal and determines the at least one characteristic of the current flowing through the insulated wire based at least in part on the received reference signal. 11. The current measurement system of claim 10 wherein the control circuitry further determines at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal, wherein the at least one physical dimension is indicative of a distance between the conductor and the magnetic field sensor. 12. The current measurement system of claim 10 wherein the control circuitry further determines at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal and the received position feedback sensor signal. 13. A method of measuring current in an insulated wire without galvanically contacting a conductor in the insulated wire, the method comprising:
clamping, via an adjustable clamp assembly, the insulated wire between first and second clamp surfaces; autonomously determining a position of the insulated wire clamped between the first and second clamp surfaces; sensing, via a magnetic field sensor positioned proximate the insulated wire clamped between the first and second clamp surfaces, a magnetic field generated by the current flowing through the insulated wire; and determining at least one characteristic of the current flowing through the insulated wire based at least in part on the determined position of the insulated wire clamped between the first and second clamp surfaces and the sensed magnetic field generated by the current flowing through the insulated wire. 14. The method of claim 13 wherein the first clamp surface comprises a front end surface of a front end of a housing and the second clamp surface comprises a surface of a clamp member of the adjustable clamp assembly that is movable with respect to the front end surface, and clamping the insulated wire between the first and second clamp surfaces comprises clamping the insulated wire between the front end surface and the surface of the clamp member. 15. The method of claim 14 wherein sensing the magnetic field generated by the current flowing through the insulated wire comprises sensing the magnetic field via the magnetic field sensor, and the magnetic field sensor is positioned proximate the front end surface of the front end of the housing. 16. The method of claim 13 wherein clamping the insulated wire between the first and second clamp surfaces comprises clamping the insulated wire between first and second clamp surfaces of a slider clamp assembly. 17. The method of claim 13 wherein the first clamp surface is positioned on a first clamp portion and the second clamp surface is positioned on a second clamp portion, and the method further comprises biasing the first clamp portion toward the second clamp portion. 18. The method of claim 13 wherein determining the at least one characteristic of the current flowing through the insulated wire comprises determining a magnitude of the current flowing through the insulated wire. 19. The method of claim 13, further comprising:
sensing, via a reference signal type sensor positioned in a housing, a reference signal in the insulated wire without galvanically contacting the insulated wire; and determining, via the control circuitry, the at least one characteristic of the current flowing through the insulated wire based at least in part on the sensed reference signal. 20. The method of claim 19, further determining, via the control circuitry, at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal. 21. The method of claim 19, further determining, via the control circuitry, at least one physical dimension of a conductor inside the insulated wire based at least in part on the received reference signal and the received position feedback sensor signal. 22. A current measurement system, comprising:
a housing; a movable clamp coupled to the housing that is selectively movable to clamp an insulated wire under test; a position feedback sensor that generates a position feedback sensor signal that is indicative of a position of the movable clamp; a current sensor positioned proximate the movable clamp, wherein the current sensor is operative to generate a current sensor signal that is indicative of at least one characteristic of a current flowing through the insulated wire; and control circuitry communicatively coupled to the position feedback sensor and the current sensor, wherein, in operation, the control circuitry:
receives the position feedback sensor signal from the position feedback sensor;
receives the current sensor signal from the current sensor; and
determines at least one characteristic of the current flowing through the insulated wire based at least in part on the received position feedback signal and the current sensor signal. 23. The current measurement system of claim 22 wherein the current sensor comprises a magnetic field sensor. 24. The current measurement system of claim 22 wherein the position feedback sensor comprises a resistive sensor, a magneto-resistive sensor, a Hall Effect sensor, or an optical sensor. 25. The current measurement system of claim 22, wherein the moveable clamp comprises a retractable hook that is slidably coupled to the housing. 26. The current measurement system of claim 25, wherein the retractable hook is slidable linearly along a length of the housing. 27. The current measurement system of claim 25, wherein the current sensor is positioned in the housing, and wherein the retractable hook is slidable to bear against the insulated conductor and clamp the insulated conductor against the current sensor.
| 2,600
|
338,045
| 16,799,689
| 2,648
|
Provided is an assembly jig set of semiconductor module having a plurality of semiconductor chips, the assembly jig set comprising: a first outer frame jig; and a plurality of inner piece jigs positioned by the first outer frame jig and each having a sectioned shape corresponding to the first outer frame jig, wherein one of the inner piece jigs has a plurality of opening portions for positioning the semiconductor chips. A manufacturing method of a semiconductor module using an assembly jig set is provided.
|
1. An assembly jig set of semiconductor module having a plurality of semiconductor chips, the assembly jig set comprising:
a first outer frame jig; and a plurality of inner piece jigs positioned by the first outer frame jig and each having a sectioned shape corresponding to the first outer frame jig, wherein at least one of the inner piece jigs has a plurality of opening portions for positioning the semiconductor chips. 2. The assembly jig set according to claim 1,
wherein the inner piece jigs each have: a main body portion provided with the opening portions; and an outer protruding portion extending from the main body portion and for being hooked and attached to the first outer frame jig. 3. The assembly jig set according to claim 2,
wherein the outer protruding portion is provided at a position opposing to any one of the opening portions. 4. The assembly jig set according to claim 1,
wherein the opening portions of the inner piece jigs each have an inner protruding portion for positioning the semiconductor chips. 5. The assembly jig set according to claim 1, wherein
the inner piece jigs have a first inner piece jig and a second inner piece jig, and the first inner piece jig has an opening portion, three sides of the opening portion being defined by a main body portion of the first inner piece jig, and one side of the opening portion being defined by a main body portion of the second inner piece jig. 6. The assembly jig set according to claim 1,
wherein the inner piece jigs each have a taper for preventing interference at an end portion where the inner piece jigs are adjacent to each other. 7. The assembly jig set according to claim 1, further comprising a second outer frame jig that positions an insulation substrate on which the semiconductor chips are mounted and that overlaps with the first outer frame jig,
wherein the second outer frame jig has a positioning portion for aligning the second outer frame jig with the first outer frame jig. 8. The assembly jig set according to claim 1,
wherein the inner piece jigs each have a recognition mark for positional recognition. 9. The assembly jig set according to claim 1, further comprising a partition plate for partitioning the inner piece jigs therebetween,
wherein the partition plate has an attachment portion for being hooked and attached to the first outer frame jig. 10. The assembly jig set according to claim 9,
wherein a material of the partition plate is different from a material of the first outer frame jig and a material of the inner piece jigs. 11. The assembly jig set according to claim 10, wherein
the material of the first outer frame jig and the inner piece jigs is carbon, and the material of the partition plate is a carbon fiber composite material. 12. The assembly jig set according to claim 1, wherein
the inner piece jigs include a pair of a first inner piece jig and a second inner piece jig, and the pair of the first inner piece jig and the second inner piece jig has an outer shape that can be inserted into an opening portion of the first outer frame jig. 13. The assembly jig set according to claim 12, wherein
the first inner piece jig and the second inner piece jig each have: a main body portion provided with at least one opening portion for positioning a semiconductor chip; and an outer protruding portion extending from the main body portion and for being hooked to an edge of the opening portion of the first outer frame jig. 14. The assembly jig set according to claim 13,
wherein the outer protruding portion is provided at a position opposing to any one of the at least one opening portion of the first inner piece jig and the at least one opening portion of the second inner piece jig. 15. The assembly jig set according to claim 13,
wherein in the first inner piece jig, the at least one opening portion provided to the main body portion has four sides in a top plan view, and three sides of the four sides are defined by the main body portion of the first inner piece jig, and one side thereof is defined by the main body portion of the second inner piece jig. 16. The assembly jig set according to claim 12,
wherein the first inner piece jig and the second inner piece jig each have a taper for preventing interference at an end portion where the first inner piece jig and the second inner piece jig are adjacent to each other. 17. The assembly jig set according to claim 12,
wherein the first inner piece jig and the second inner piece jig each have a recognition mark for positional recognition. 18. The assembly jig set according to claim 13, further comprising:
a pair of a third inner piece jig and a fourth inner piece jig; and a partition plate that partitions between the pair of the first inner piece jig and the second inner piece jig, and the pair of the third inner piece jig and the fourth inner piece jig, wherein the partition plate has an attachment portion for being hooked to the first outer frame jig. 19. The assembly jig set according to claim 18,
wherein each of the first inner piece jig and the second inner piece jig further has another outer protruding portion extending from the main body portion and for being hooked to the partition plate. 20. A manufacturing method of a semiconductor module having a plurality of semiconductor chips, the manufacturing method comprising:
providing an insulation substrate on which the semiconductor chips are mounted; providing a first outer frame jig; attaching a plurality of inner piece jigs, each of which has a sectioned shape corresponding to the first outer frame jig, to the first outer frame jig; placing the inner piece jigs on the insulation substrate by one operation with the first outer frame jig; and positioning the semiconductor chips by the inner piece jigs to mount the semiconductor chips on the insulation substrate, wherein at least one of the inner piece jigs has a plurality of opening portions for positioning the semiconductor chips. 21. The manufacturing method according to claim 20, further comprising:
placing a second outer frame jig on a base substrate of the semiconductor module; and positioning the insulation substrate by the second outer frame jig to place the insulation substrate on the base substrate. 22. The manufacturing method according to claim 21,
wherein the placing the inner piece jigs on the insulation substrate includes placing the first outer frame jig on the second outer frame jig. 23. The manufacturing method according to claim 20, further comprising attaching a partition plate for partitioning the inner piece jigs therebetween to the first outer frame jig.
|
Provided is an assembly jig set of semiconductor module having a plurality of semiconductor chips, the assembly jig set comprising: a first outer frame jig; and a plurality of inner piece jigs positioned by the first outer frame jig and each having a sectioned shape corresponding to the first outer frame jig, wherein one of the inner piece jigs has a plurality of opening portions for positioning the semiconductor chips. A manufacturing method of a semiconductor module using an assembly jig set is provided.1. An assembly jig set of semiconductor module having a plurality of semiconductor chips, the assembly jig set comprising:
a first outer frame jig; and a plurality of inner piece jigs positioned by the first outer frame jig and each having a sectioned shape corresponding to the first outer frame jig, wherein at least one of the inner piece jigs has a plurality of opening portions for positioning the semiconductor chips. 2. The assembly jig set according to claim 1,
wherein the inner piece jigs each have: a main body portion provided with the opening portions; and an outer protruding portion extending from the main body portion and for being hooked and attached to the first outer frame jig. 3. The assembly jig set according to claim 2,
wherein the outer protruding portion is provided at a position opposing to any one of the opening portions. 4. The assembly jig set according to claim 1,
wherein the opening portions of the inner piece jigs each have an inner protruding portion for positioning the semiconductor chips. 5. The assembly jig set according to claim 1, wherein
the inner piece jigs have a first inner piece jig and a second inner piece jig, and the first inner piece jig has an opening portion, three sides of the opening portion being defined by a main body portion of the first inner piece jig, and one side of the opening portion being defined by a main body portion of the second inner piece jig. 6. The assembly jig set according to claim 1,
wherein the inner piece jigs each have a taper for preventing interference at an end portion where the inner piece jigs are adjacent to each other. 7. The assembly jig set according to claim 1, further comprising a second outer frame jig that positions an insulation substrate on which the semiconductor chips are mounted and that overlaps with the first outer frame jig,
wherein the second outer frame jig has a positioning portion for aligning the second outer frame jig with the first outer frame jig. 8. The assembly jig set according to claim 1,
wherein the inner piece jigs each have a recognition mark for positional recognition. 9. The assembly jig set according to claim 1, further comprising a partition plate for partitioning the inner piece jigs therebetween,
wherein the partition plate has an attachment portion for being hooked and attached to the first outer frame jig. 10. The assembly jig set according to claim 9,
wherein a material of the partition plate is different from a material of the first outer frame jig and a material of the inner piece jigs. 11. The assembly jig set according to claim 10, wherein
the material of the first outer frame jig and the inner piece jigs is carbon, and the material of the partition plate is a carbon fiber composite material. 12. The assembly jig set according to claim 1, wherein
the inner piece jigs include a pair of a first inner piece jig and a second inner piece jig, and the pair of the first inner piece jig and the second inner piece jig has an outer shape that can be inserted into an opening portion of the first outer frame jig. 13. The assembly jig set according to claim 12, wherein
the first inner piece jig and the second inner piece jig each have: a main body portion provided with at least one opening portion for positioning a semiconductor chip; and an outer protruding portion extending from the main body portion and for being hooked to an edge of the opening portion of the first outer frame jig. 14. The assembly jig set according to claim 13,
wherein the outer protruding portion is provided at a position opposing to any one of the at least one opening portion of the first inner piece jig and the at least one opening portion of the second inner piece jig. 15. The assembly jig set according to claim 13,
wherein in the first inner piece jig, the at least one opening portion provided to the main body portion has four sides in a top plan view, and three sides of the four sides are defined by the main body portion of the first inner piece jig, and one side thereof is defined by the main body portion of the second inner piece jig. 16. The assembly jig set according to claim 12,
wherein the first inner piece jig and the second inner piece jig each have a taper for preventing interference at an end portion where the first inner piece jig and the second inner piece jig are adjacent to each other. 17. The assembly jig set according to claim 12,
wherein the first inner piece jig and the second inner piece jig each have a recognition mark for positional recognition. 18. The assembly jig set according to claim 13, further comprising:
a pair of a third inner piece jig and a fourth inner piece jig; and a partition plate that partitions between the pair of the first inner piece jig and the second inner piece jig, and the pair of the third inner piece jig and the fourth inner piece jig, wherein the partition plate has an attachment portion for being hooked to the first outer frame jig. 19. The assembly jig set according to claim 18,
wherein each of the first inner piece jig and the second inner piece jig further has another outer protruding portion extending from the main body portion and for being hooked to the partition plate. 20. A manufacturing method of a semiconductor module having a plurality of semiconductor chips, the manufacturing method comprising:
providing an insulation substrate on which the semiconductor chips are mounted; providing a first outer frame jig; attaching a plurality of inner piece jigs, each of which has a sectioned shape corresponding to the first outer frame jig, to the first outer frame jig; placing the inner piece jigs on the insulation substrate by one operation with the first outer frame jig; and positioning the semiconductor chips by the inner piece jigs to mount the semiconductor chips on the insulation substrate, wherein at least one of the inner piece jigs has a plurality of opening portions for positioning the semiconductor chips. 21. The manufacturing method according to claim 20, further comprising:
placing a second outer frame jig on a base substrate of the semiconductor module; and positioning the insulation substrate by the second outer frame jig to place the insulation substrate on the base substrate. 22. The manufacturing method according to claim 21,
wherein the placing the inner piece jigs on the insulation substrate includes placing the first outer frame jig on the second outer frame jig. 23. The manufacturing method according to claim 20, further comprising attaching a partition plate for partitioning the inner piece jigs therebetween to the first outer frame jig.
| 2,600
|
338,046
| 16,799,698
| 2,648
|
Systems and methods for an automated conversation with a transactional assistant are provided. This conversation relies upon initially a set of exchanges being defined. Each exchange connected to every other exchange by bidirectional edge transitions. A response from the conversation target is received, and is processed for natural language understanding (NLU) generate intents and entities. After the NLU, a determination is made which bidirectional edge transition applies, as a function of the intent and the source exchange. Subsequently, the exchange may be transitioned to a new exchange based upon the determined bidirectional edge transition, and a response is formulated using natural language generation (NLG) for the new exchange.
|
1. A method for feature deployment for a transactional assistant comprising:
defining a business requirement for a feature; creating a technical design for the feature; generating an optimal training desk responsive to the technical design using user experience design principles and A/B testing; collecting and aggregating data from the training desk; generating a model for the feature once the aggregated data is above a minimum threshold; deploying the model; and selecting a subsequent feature. 2. A method for conversation customization for a transactional assistant comprising:
collecting human in the loop responses for entities, intents, transaction actions, and replies as a set of annotations; intelligent querying the set of annotations via an annotation microservice; automatically building at least one of a natural language understanding (NLU) model, an inference engine (IE) model, and a natural language generation (NLG) model using the queried annotations; automatically deploying the at least one built model; and providing alerts responsive to the deployed at least one model.
|
Systems and methods for an automated conversation with a transactional assistant are provided. This conversation relies upon initially a set of exchanges being defined. Each exchange connected to every other exchange by bidirectional edge transitions. A response from the conversation target is received, and is processed for natural language understanding (NLU) generate intents and entities. After the NLU, a determination is made which bidirectional edge transition applies, as a function of the intent and the source exchange. Subsequently, the exchange may be transitioned to a new exchange based upon the determined bidirectional edge transition, and a response is formulated using natural language generation (NLG) for the new exchange.1. A method for feature deployment for a transactional assistant comprising:
defining a business requirement for a feature; creating a technical design for the feature; generating an optimal training desk responsive to the technical design using user experience design principles and A/B testing; collecting and aggregating data from the training desk; generating a model for the feature once the aggregated data is above a minimum threshold; deploying the model; and selecting a subsequent feature. 2. A method for conversation customization for a transactional assistant comprising:
collecting human in the loop responses for entities, intents, transaction actions, and replies as a set of annotations; intelligent querying the set of annotations via an annotation microservice; automatically building at least one of a natural language understanding (NLU) model, an inference engine (IE) model, and a natural language generation (NLG) model using the queried annotations; automatically deploying the at least one built model; and providing alerts responsive to the deployed at least one model.
| 2,600
|
338,047
| 16,799,691
| 2,648
|
A sensor for use with vehicular components. The sensors may comprise transmitting and receiving antennas that can be interleaved or placed within the various materials throughout the vehicle so that interaction with the materials will provide information related to the use. Sensors may also infuse signal into an occupant within the vehicle via the material which can provide enhanced interactions with various vehicle features and components.
|
1. A vehicle seat having a sensor, comprising:
a first and a second antenna located within the vehicle seat; a signal generation source adapted to generate a signal comprising at least one frequency, the signal generation source being operatively connected to the first antenna; a signal receiver operatively connected to the second antenna, the first antenna and the second antenna being oriented such that an event in proximity thereto causes a change in coupling therebetween; a signal processor operatively connected to the signal receiver, the signal processor adapted to periodically make at least one measurement associated with the generated signal; and a detector module configured to use the at least one measurement to determine a use of the seat. 2. The vehicle seat of claim 1, wherein the detector module detects a presence or absence of an occupant. 3. The vehicle seat of claim 1, wherein the detector module detects a biometric of an occupant. 4. The vehicle seat of claim 1, wherein the detector module detects a position of an occupant. 5. The vehicle seat of claim 1, wherein the detector module detects a weight of an occupant. 6. The vehicle seat of claim 1, wherein the detector module detects distance of a head from a head rest. 7. The vehicle seat of claim 1, wherein the detector module detects presence of an object. 8. The vehicle seat of claim 1, wherein the detector module runs on the signal processor. 9. A vehicle seat having a sensor, comprising:
a plurality of first antennas and a plurality of second antennas located within the vehicle seat; a signal generation source adapted to generate a signal comprising at least one frequency, the signal generation source being operatively connected to at least one of the plurality of first antennas; a signal receiver operatively connected to at least one of the plurality of second antennas, the plurality of first antennas and the plurality of second antennas being oriented such that events proximate to the plurality of first antennas and the plurality of second antennas causes a change in coupling therebetween; a signal processor operatively connected to the signal receiver, the signal processor adapted to periodically make at least one measurement associated with the generated signal; and a detector module configured to use the at least one measurement to determine a use of the seat. 10. The vehicle seat of claim 9, wherein the detector module detects a presence or absence of an occupant. 11. The vehicle seat of claim 9, wherein the detector module detects a biometric of an occupant. 12. The vehicle seat of claim 9, wherein the detector module detects a position of an occupant. 13. The vehicle seat of claim 9, wherein the detector module detects a weight of an occupant. 14. The vehicle seat of claim 9, wherein the detector module detects distance of a head from a head rest. 15. The vehicle seat of claim 9, wherein the detector module detects presence of an object. 16. The vehicle seat of claim 9, wherein the detector module runs on the signal processor. 17. A vehicle seat having a sensor, comprising:
a plurality of antennas located within the seat; a signal generation source adapted to generate a plurality of unique frequency-orthogonal signals, the signal generation source being operatively connected to at least two of the plurality of antennas and configured to transmit at least one of the plurality of unique frequency-orthogonal signals to each antenna to which it is operatively connected; a signal receiver operatively connected to at least two more of the plurality of antennas other than the at least two of the plurality of antennas, the at least two more of the antennas and the at least two of the plurality antennas being selected such that an event in proximity with respect to one of the at least two of the plurality of antennas and one of the at least two more of the plurality antennas causes a change in coupling therebetween such that an event in proximity thereto causes a change in coupling therebetween a signal processor operatively connected to the signal receiver, the signal processor adapted to periodically make at least one measurement associated with each of the generated unique frequency-orthogonal signals; and a detector module configured to use the at least one measurement associated with each of the generated unique frequency-orthogonal signals to determine a use of the seat. 18. The vehicle seat of claim 17, wherein the detector module detects a presence or absence of an occupant. 19. The vehicle seat of claim 17, wherein the detector module detects presence of an object. 20. The vehicle seat of claim 17, wherein the detector module runs on the signal processor.
|
A sensor for use with vehicular components. The sensors may comprise transmitting and receiving antennas that can be interleaved or placed within the various materials throughout the vehicle so that interaction with the materials will provide information related to the use. Sensors may also infuse signal into an occupant within the vehicle via the material which can provide enhanced interactions with various vehicle features and components.1. A vehicle seat having a sensor, comprising:
a first and a second antenna located within the vehicle seat; a signal generation source adapted to generate a signal comprising at least one frequency, the signal generation source being operatively connected to the first antenna; a signal receiver operatively connected to the second antenna, the first antenna and the second antenna being oriented such that an event in proximity thereto causes a change in coupling therebetween; a signal processor operatively connected to the signal receiver, the signal processor adapted to periodically make at least one measurement associated with the generated signal; and a detector module configured to use the at least one measurement to determine a use of the seat. 2. The vehicle seat of claim 1, wherein the detector module detects a presence or absence of an occupant. 3. The vehicle seat of claim 1, wherein the detector module detects a biometric of an occupant. 4. The vehicle seat of claim 1, wherein the detector module detects a position of an occupant. 5. The vehicle seat of claim 1, wherein the detector module detects a weight of an occupant. 6. The vehicle seat of claim 1, wherein the detector module detects distance of a head from a head rest. 7. The vehicle seat of claim 1, wherein the detector module detects presence of an object. 8. The vehicle seat of claim 1, wherein the detector module runs on the signal processor. 9. A vehicle seat having a sensor, comprising:
a plurality of first antennas and a plurality of second antennas located within the vehicle seat; a signal generation source adapted to generate a signal comprising at least one frequency, the signal generation source being operatively connected to at least one of the plurality of first antennas; a signal receiver operatively connected to at least one of the plurality of second antennas, the plurality of first antennas and the plurality of second antennas being oriented such that events proximate to the plurality of first antennas and the plurality of second antennas causes a change in coupling therebetween; a signal processor operatively connected to the signal receiver, the signal processor adapted to periodically make at least one measurement associated with the generated signal; and a detector module configured to use the at least one measurement to determine a use of the seat. 10. The vehicle seat of claim 9, wherein the detector module detects a presence or absence of an occupant. 11. The vehicle seat of claim 9, wherein the detector module detects a biometric of an occupant. 12. The vehicle seat of claim 9, wherein the detector module detects a position of an occupant. 13. The vehicle seat of claim 9, wherein the detector module detects a weight of an occupant. 14. The vehicle seat of claim 9, wherein the detector module detects distance of a head from a head rest. 15. The vehicle seat of claim 9, wherein the detector module detects presence of an object. 16. The vehicle seat of claim 9, wherein the detector module runs on the signal processor. 17. A vehicle seat having a sensor, comprising:
a plurality of antennas located within the seat; a signal generation source adapted to generate a plurality of unique frequency-orthogonal signals, the signal generation source being operatively connected to at least two of the plurality of antennas and configured to transmit at least one of the plurality of unique frequency-orthogonal signals to each antenna to which it is operatively connected; a signal receiver operatively connected to at least two more of the plurality of antennas other than the at least two of the plurality of antennas, the at least two more of the antennas and the at least two of the plurality antennas being selected such that an event in proximity with respect to one of the at least two of the plurality of antennas and one of the at least two more of the plurality antennas causes a change in coupling therebetween such that an event in proximity thereto causes a change in coupling therebetween a signal processor operatively connected to the signal receiver, the signal processor adapted to periodically make at least one measurement associated with each of the generated unique frequency-orthogonal signals; and a detector module configured to use the at least one measurement associated with each of the generated unique frequency-orthogonal signals to determine a use of the seat. 18. The vehicle seat of claim 17, wherein the detector module detects a presence or absence of an occupant. 19. The vehicle seat of claim 17, wherein the detector module detects presence of an object. 20. The vehicle seat of claim 17, wherein the detector module runs on the signal processor.
| 2,600
|
338,048
| 16,799,668
| 2,648
|
Apparatuses and methods for identifying memory devices of a semiconductor device sharing an external resistance are disclosed. A memory device of a semiconductor device may be set in an identification mode and provide an identification request to other memory devices that are coupled to a common communication channel. The memory devices that are coupled to the common communication channel may share an external resistance, for example, for calibration of respective programmable termination components of the memory devices. The memory devices that receive the identification request set a respective identification flag which can be read to determine which memory devices share an external resistance with the memory device having the set identification mode.
|
1. (canceled) 2. A method, comprising:
operating a package comprising one or more dynamic random access memory (DRAM) dice in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command; determining which DRAM die or dice in the package is designated as ZQ Master; and issuing a ZQ calibration command to the ZQ Master DRAM die or dice in the package. 3. The method of claim 2, further comprising:
reading operand 6 (OP[6]) of a mode register of one or more DRAM die or dice in the package, wherein the DRAM die or dice designated as ZQ Master is determined based at least in part on reading OP[6] of the mode register. 4. The method of claim 3, wherein the mode register comprises eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master. 5. The method of claim 4, further comprising:
determining that the DRAM die or dice is not the ZQ Master based at least in part on reading a logic value of 0 at OP[6]. 6. The method of claim 4, further comprising:
determining that the DRAM die or dice is the ZQ Master based at least in part on reading a logic value of 1 at OP[6].c 7. The method of claim 4, wherein a value of OP[6] has a default value of 0 to indicate that one of the DRAM die is not a ZQ Master or is set to a value of 1 to indicate that the DRAM die is a ZQ Master. 8. An apparatus, comprising:
a memory controller configured to operate a package comprising one or more dynamic random access memory (DRAM) dice in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command, the memory controller further configured to determine which DRAM die or dice in the package is designated as ZQ Master, and to issue a ZQ calibration command to the ZQ Master DRAM die or dice in the package. 9. The apparatus of claim 8, wherein the memory controller is further configured to read operand 6 (OP[6]) of a mode register of one or more DRAM die or dice in the package, wherein the DRAM die or dice designated as ZQ Master is determined based at least in part on reading OP[6] of the mode register. 10. The apparatus of claim 9, wherein the memory controller reads a mode register comprising eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master. 11. The apparatus of claim 9, wherein the memory controller is further configured to determine that the DRAM die or dice is not the ZQ Master based at least in part on reading a logic value of 0 at OP[6]. 12. The apparatus of claim 9, wherein the memory controller is further configured to determine that the DRAM die or dice is the ZQ Master based at least in part on reading a logic value of 1 at OP[6]. 13. The apparatus of claim 9, wherein a value of OP[6] read by the memory controller has a default value of 0 to indicate that one of the DRAM die is not a ZQ Master or has a value of 1 to indicate that the DRAM die is a ZQ Master. 14. A method, comprising:
in a package comprising one or more dynamic random access memory (DRAM) dice including DRAM die or dice designated as ZQ Master, operating in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command; and receiving a ZQ calibration command at the ZQ Master DRAM die or dice in the package. 15. The method of claim 14, further comprising:
storing information at operand 6 (OP[6]) of a mode register of one or more DRAM die or dice in the package, wherein the DRAM die or dice designated as ZQ Master is identified based at least in part on OP[6] of the mode register. 16. The method of claim 15, wherein the mode register comprises eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master. 17. The method of claim 15, wherein the DRAM die or dice not designated as the ZQ Master is based at least in part on a logic value of 0 stored at OP[6]. 18. The method of claim 15, wherein the DRAM die or dice is designated the ZQ Master based at least in part on a logic value of 1 stored at OP[6]. 19. An apparatus, comprising:
a package comprising one or more dynamic random access memory (DRAM) dice including DRAM die or dice designated as ZQ Master, the package configured to operate in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command, and further configured to receive a ZQ calibration command at the ZQ Master DRAM die or dice in the package. 20. The method of claim 19, wherein one or more DRAM die or dice in the package comprises a mode register configured to store a value at operand 6 (OP[6]), wherein the DRAM die or dice designated as ZQ Master is identified based at least in part on OP[6] of the mode register. 21. The method of claim 20, wherein the mode register comprises eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master.
|
Apparatuses and methods for identifying memory devices of a semiconductor device sharing an external resistance are disclosed. A memory device of a semiconductor device may be set in an identification mode and provide an identification request to other memory devices that are coupled to a common communication channel. The memory devices that are coupled to the common communication channel may share an external resistance, for example, for calibration of respective programmable termination components of the memory devices. The memory devices that receive the identification request set a respective identification flag which can be read to determine which memory devices share an external resistance with the memory device having the set identification mode.1. (canceled) 2. A method, comprising:
operating a package comprising one or more dynamic random access memory (DRAM) dice in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command; determining which DRAM die or dice in the package is designated as ZQ Master; and issuing a ZQ calibration command to the ZQ Master DRAM die or dice in the package. 3. The method of claim 2, further comprising:
reading operand 6 (OP[6]) of a mode register of one or more DRAM die or dice in the package, wherein the DRAM die or dice designated as ZQ Master is determined based at least in part on reading OP[6] of the mode register. 4. The method of claim 3, wherein the mode register comprises eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master. 5. The method of claim 4, further comprising:
determining that the DRAM die or dice is not the ZQ Master based at least in part on reading a logic value of 0 at OP[6]. 6. The method of claim 4, further comprising:
determining that the DRAM die or dice is the ZQ Master based at least in part on reading a logic value of 1 at OP[6].c 7. The method of claim 4, wherein a value of OP[6] has a default value of 0 to indicate that one of the DRAM die is not a ZQ Master or is set to a value of 1 to indicate that the DRAM die is a ZQ Master. 8. An apparatus, comprising:
a memory controller configured to operate a package comprising one or more dynamic random access memory (DRAM) dice in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command, the memory controller further configured to determine which DRAM die or dice in the package is designated as ZQ Master, and to issue a ZQ calibration command to the ZQ Master DRAM die or dice in the package. 9. The apparatus of claim 8, wherein the memory controller is further configured to read operand 6 (OP[6]) of a mode register of one or more DRAM die or dice in the package, wherein the DRAM die or dice designated as ZQ Master is determined based at least in part on reading OP[6] of the mode register. 10. The apparatus of claim 9, wherein the memory controller reads a mode register comprising eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master. 11. The apparatus of claim 9, wherein the memory controller is further configured to determine that the DRAM die or dice is not the ZQ Master based at least in part on reading a logic value of 0 at OP[6]. 12. The apparatus of claim 9, wherein the memory controller is further configured to determine that the DRAM die or dice is the ZQ Master based at least in part on reading a logic value of 1 at OP[6]. 13. The apparatus of claim 9, wherein a value of OP[6] read by the memory controller has a default value of 0 to indicate that one of the DRAM die is not a ZQ Master or has a value of 1 to indicate that the DRAM die is a ZQ Master. 14. A method, comprising:
in a package comprising one or more dynamic random access memory (DRAM) dice including DRAM die or dice designated as ZQ Master, operating in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command; and receiving a ZQ calibration command at the ZQ Master DRAM die or dice in the package. 15. The method of claim 14, further comprising:
storing information at operand 6 (OP[6]) of a mode register of one or more DRAM die or dice in the package, wherein the DRAM die or dice designated as ZQ Master is identified based at least in part on OP[6] of the mode register. 16. The method of claim 15, wherein the mode register comprises eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master. 17. The method of claim 15, wherein the DRAM die or dice not designated as the ZQ Master is based at least in part on a logic value of 0 stored at OP[6]. 18. The method of claim 15, wherein the DRAM die or dice is designated the ZQ Master based at least in part on a logic value of 1 stored at OP[6]. 19. An apparatus, comprising:
a package comprising one or more dynamic random access memory (DRAM) dice including DRAM die or dice designated as ZQ Master, the package configured to operate in a mode in which calibration associated with a termination impedance (ZQ) occurs in response to a command, and further configured to receive a ZQ calibration command at the ZQ Master DRAM die or dice in the package. 20. The method of claim 19, wherein one or more DRAM die or dice in the package comprises a mode register configured to store a value at operand 6 (OP[6]), wherein the DRAM die or dice designated as ZQ Master is identified based at least in part on OP[6] of the mode register. 21. The method of claim 20, wherein the mode register comprises eight (8) bits corresponding to operands 7 through 0 (OP[7:0]), and OP[6] comprises an indication of ZQ Master.
| 2,600
|
338,049
| 16,799,677
| 2,648
|
Embodiments of this application provide a data transmission method and apparatus. The data transmission method is applied to a network based on a CSMA/CA mechanism and the network includes a plurality of nodes that share one channel. According to the data transmission method, a sending node determines, in the plurality of nodes through a first clear channel assessment, that the channel is idle. The sending node then waits for a delay duration, and performs a second clear channel assessment on the channel after the delay duration. The sending node sends a data frame to a receiving node in the plurality of nodes through the channel in response to determining, through the second clear channel assessment, that the channel is idle. The sending node performs a clear channel assessment twice before sending a data frame, which reflects priorities of different types of data frames and shortens a network latency.
|
1. A data transmission method, applied to a network based on an unslotted carrier sense multiple access with collision avoidance (CSMA/CA) mechanism, wherein the network comprises a plurality of nodes, the plurality of nodes share one channel, and the method comprises:
determining, by a sending node in the plurality of nodes through a first clear channel assessment, that the channel is idle; waiting, by the sending node, for a delay duration, and performing a second clear channel assessment on the channel after the delay duration; and sending, by the sending node, a data frame to a receiving node in the plurality of nodes through the channel in response to determining, through the second clear channel assessment, that the channel is idle. 2. The method according to claim 1, further comprising:
updating, by the sending node, a first value and a second value based on whether an acknowledge frame sent by the receiving node is received by the sending node, wherein the first value indicates a quantity of data frames successfully sent successively by the sending node, and the second value indicates a quantity of data frames unsuccessfully sent successively by the sending node; and adjusting, by the sending node, the delay duration based on the first value and the second value. 3. The method according to claim 2, wherein the delay duration is an interframe spacing (IFS). 4. The method according to claim 3, wherein
if the data frame is a long frame, the IFS is max(TLIFS, Tturnaround)+β·Tcca; 5. The method according to claim 4, wherein the adjusting, by the sending node, the delay duration based on the first value and the second value comprises:
adjusting, by the sending node, the dynamic adjustment coefficient &abased on the first value and the second value; and calculating, by the sending node, the IFS based on an adjusted dynamic adjustment coefficient β. 6. The method according to claim 5, wherein the adjusting, by the sending node, the dynamic adjustment coefficient β based on the first value and the second value comprises:
if the first value is greater than a first preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to 1; and
if the second value is greater than a second preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to a random value between 1 and a maximum value of the dynamic adjustment coefficient, wherein the maximum value of the dynamic adjustment coefficient is greater than 1. 7. The method according to claim 4, wherein the sending, by the sending node, a data frame to a receiving node in the plurality of nodes through the channel comprises:
selecting, by the sending node, a CSMA algorithm based on the dynamic adjustment coefficient β; and sending, by the sending node through the channel, the data frame to the receiving node based on the selected CSMA algorithm, wherein the selecting, by the sending node, a CSMA algorithm based on the dynamic adjustment coefficient β comprises: selecting a 1-persistence CSMA algorithm when the dynamic adjustment coefficient β is 1; and selecting a P-persistence CSMA algorithm when the dynamic adjustment coefficient β is greater than 1. 8. The method according to claim 7, further comprising:
performing, by the sending node, a clear channel assessment on the channel after preset duration if determining, by using the P-persistence CSMA algorithm, that the data frame cannot be sent to the receiving node through the channel, and performing the data transmission method again. 9. The method according to claim 2, wherein the updating, by the sending node, a first value and a second value based on whether an acknowledge frame sent by the receiving node is received by the sending node comprises:
increasing, by the sending node, the first value by 1 and setting the second value to 0 if receiving the acknowledge frame sent by the receiving node; or increasing, by the sending node, the second value by 1 and setting the first value to 0 if the sending node does not receive the acknowledge frame sent by the receiving node. 10. A data transmission apparatus, applied to a network based on an unslotted carrier sense multiple access with collision avoidance (CSMA/CA) mechanism, wherein the network comprises a plurality of nodes, the plurality of nodes share one channel, the data transmission apparatus is a sending node in the plurality of nodes, and the apparatus comprises a memory and a processor, wherein:
the memory is configured to store instructions, and the processor is configured to execute the instruction stored in the memory to implement a data transmission method comprising: determining, through a first clear channel assessment, that the channel is idle; waiting for a delay duration, and performing a second clear channel assessment on the channel after the delay duration; and sending a data frame to a receiving node in the plurality of nodes through the channel in response to determining, through the second clear channel assessment, that the channel is idle. 11. The data transmission apparatus according to claim 10, the method further comprises:
updating a first value and a second value based on whether an acknowledge frame sent by the receiving node is received, wherein the first value indicates a quantity of data frames successfully sent successively, and the second value indicates a quantity of data frames unsuccessfully sent successively; and adjusting the delay duration based on the first value and the second value. 12. The data transmission apparatus according to claim 11, wherein the delay duration is an interframe spacing (IFS). 13. The data transmission apparatus according to claim 12, wherein
if the data frame is a long frame, the IFS is max(TLIFS, Tturnaround)+β·Tcca; 14. The data transmission apparatus according to claim 13, wherein the adjusting the delay duration based on the first value and the second value comprises:
adjusting the dynamic adjustment coefficient β abased on the first value and the second value; and calculating the IFS based on an adjusted dynamic adjustment coefficient β. 15. The data transmission apparatus according to claim 14, wherein the adjusting the dynamic adjustment coefficient β based on the first value and the second value comprises:
if the first value is greater than a first preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to 1; and
if the second value is greater than a second preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to a random value between 1 and a maximum value of the dynamic adjustment coefficient, wherein the maximum value of the dynamic adjustment coefficient is greater than 1. 16. The data transmission apparatus according to claim 13, wherein the sending a data frame to a receiving node in the plurality of nodes through the channel comprises:
selecting a CSMA algorithm based on the dynamic adjustment coefficient β; and sending, by the sending node through the channel, the data frame to the receiving node based on the selected CSMA algorithm, wherein the selecting a CSMA algorithm based on the dynamic adjustment coefficient β comprises: selecting a 1-persistence CSMA algorithm when the dynamic adjustment coefficient β is 1; and selecting a P-persistence CSMA algorithm when the dynamic adjustment coefficient β is greater than 1. 17. The data transmission apparatus according to claim 16, further comprising:
performing a clear channel assessment on the channel after preset duration if determining, by using the P-persistence CSMA algorithm, that the data frame cannot be sent to the receiving node through the channel, and performing the data transmission method again. 18. The data transmission apparatus according to claim 11, wherein the updating a first value and a second value based on whether an acknowledge frame sent by the receiving node is received by the sending node comprises:
increasing the first value by 1 and setting the second value to 0 if receiving the acknowledge frame sent by the receiving node; or increasing the second value by 1 and setting the first value to 0 if the sending node does not receive the acknowledge frame sent by the receiving node.
|
Embodiments of this application provide a data transmission method and apparatus. The data transmission method is applied to a network based on a CSMA/CA mechanism and the network includes a plurality of nodes that share one channel. According to the data transmission method, a sending node determines, in the plurality of nodes through a first clear channel assessment, that the channel is idle. The sending node then waits for a delay duration, and performs a second clear channel assessment on the channel after the delay duration. The sending node sends a data frame to a receiving node in the plurality of nodes through the channel in response to determining, through the second clear channel assessment, that the channel is idle. The sending node performs a clear channel assessment twice before sending a data frame, which reflects priorities of different types of data frames and shortens a network latency.1. A data transmission method, applied to a network based on an unslotted carrier sense multiple access with collision avoidance (CSMA/CA) mechanism, wherein the network comprises a plurality of nodes, the plurality of nodes share one channel, and the method comprises:
determining, by a sending node in the plurality of nodes through a first clear channel assessment, that the channel is idle; waiting, by the sending node, for a delay duration, and performing a second clear channel assessment on the channel after the delay duration; and sending, by the sending node, a data frame to a receiving node in the plurality of nodes through the channel in response to determining, through the second clear channel assessment, that the channel is idle. 2. The method according to claim 1, further comprising:
updating, by the sending node, a first value and a second value based on whether an acknowledge frame sent by the receiving node is received by the sending node, wherein the first value indicates a quantity of data frames successfully sent successively by the sending node, and the second value indicates a quantity of data frames unsuccessfully sent successively by the sending node; and adjusting, by the sending node, the delay duration based on the first value and the second value. 3. The method according to claim 2, wherein the delay duration is an interframe spacing (IFS). 4. The method according to claim 3, wherein
if the data frame is a long frame, the IFS is max(TLIFS, Tturnaround)+β·Tcca; 5. The method according to claim 4, wherein the adjusting, by the sending node, the delay duration based on the first value and the second value comprises:
adjusting, by the sending node, the dynamic adjustment coefficient &abased on the first value and the second value; and calculating, by the sending node, the IFS based on an adjusted dynamic adjustment coefficient β. 6. The method according to claim 5, wherein the adjusting, by the sending node, the dynamic adjustment coefficient β based on the first value and the second value comprises:
if the first value is greater than a first preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to 1; and
if the second value is greater than a second preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to a random value between 1 and a maximum value of the dynamic adjustment coefficient, wherein the maximum value of the dynamic adjustment coefficient is greater than 1. 7. The method according to claim 4, wherein the sending, by the sending node, a data frame to a receiving node in the plurality of nodes through the channel comprises:
selecting, by the sending node, a CSMA algorithm based on the dynamic adjustment coefficient β; and sending, by the sending node through the channel, the data frame to the receiving node based on the selected CSMA algorithm, wherein the selecting, by the sending node, a CSMA algorithm based on the dynamic adjustment coefficient β comprises: selecting a 1-persistence CSMA algorithm when the dynamic adjustment coefficient β is 1; and selecting a P-persistence CSMA algorithm when the dynamic adjustment coefficient β is greater than 1. 8. The method according to claim 7, further comprising:
performing, by the sending node, a clear channel assessment on the channel after preset duration if determining, by using the P-persistence CSMA algorithm, that the data frame cannot be sent to the receiving node through the channel, and performing the data transmission method again. 9. The method according to claim 2, wherein the updating, by the sending node, a first value and a second value based on whether an acknowledge frame sent by the receiving node is received by the sending node comprises:
increasing, by the sending node, the first value by 1 and setting the second value to 0 if receiving the acknowledge frame sent by the receiving node; or increasing, by the sending node, the second value by 1 and setting the first value to 0 if the sending node does not receive the acknowledge frame sent by the receiving node. 10. A data transmission apparatus, applied to a network based on an unslotted carrier sense multiple access with collision avoidance (CSMA/CA) mechanism, wherein the network comprises a plurality of nodes, the plurality of nodes share one channel, the data transmission apparatus is a sending node in the plurality of nodes, and the apparatus comprises a memory and a processor, wherein:
the memory is configured to store instructions, and the processor is configured to execute the instruction stored in the memory to implement a data transmission method comprising: determining, through a first clear channel assessment, that the channel is idle; waiting for a delay duration, and performing a second clear channel assessment on the channel after the delay duration; and sending a data frame to a receiving node in the plurality of nodes through the channel in response to determining, through the second clear channel assessment, that the channel is idle. 11. The data transmission apparatus according to claim 10, the method further comprises:
updating a first value and a second value based on whether an acknowledge frame sent by the receiving node is received, wherein the first value indicates a quantity of data frames successfully sent successively, and the second value indicates a quantity of data frames unsuccessfully sent successively; and adjusting the delay duration based on the first value and the second value. 12. The data transmission apparatus according to claim 11, wherein the delay duration is an interframe spacing (IFS). 13. The data transmission apparatus according to claim 12, wherein
if the data frame is a long frame, the IFS is max(TLIFS, Tturnaround)+β·Tcca; 14. The data transmission apparatus according to claim 13, wherein the adjusting the delay duration based on the first value and the second value comprises:
adjusting the dynamic adjustment coefficient β abased on the first value and the second value; and calculating the IFS based on an adjusted dynamic adjustment coefficient β. 15. The data transmission apparatus according to claim 14, wherein the adjusting the dynamic adjustment coefficient β based on the first value and the second value comprises:
if the first value is greater than a first preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to 1; and
if the second value is greater than a second preset threshold, adjusting the dynamic adjustment coefficient β is adjusted to a random value between 1 and a maximum value of the dynamic adjustment coefficient, wherein the maximum value of the dynamic adjustment coefficient is greater than 1. 16. The data transmission apparatus according to claim 13, wherein the sending a data frame to a receiving node in the plurality of nodes through the channel comprises:
selecting a CSMA algorithm based on the dynamic adjustment coefficient β; and sending, by the sending node through the channel, the data frame to the receiving node based on the selected CSMA algorithm, wherein the selecting a CSMA algorithm based on the dynamic adjustment coefficient β comprises: selecting a 1-persistence CSMA algorithm when the dynamic adjustment coefficient β is 1; and selecting a P-persistence CSMA algorithm when the dynamic adjustment coefficient β is greater than 1. 17. The data transmission apparatus according to claim 16, further comprising:
performing a clear channel assessment on the channel after preset duration if determining, by using the P-persistence CSMA algorithm, that the data frame cannot be sent to the receiving node through the channel, and performing the data transmission method again. 18. The data transmission apparatus according to claim 11, wherein the updating a first value and a second value based on whether an acknowledge frame sent by the receiving node is received by the sending node comprises:
increasing the first value by 1 and setting the second value to 0 if receiving the acknowledge frame sent by the receiving node; or increasing the second value by 1 and setting the first value to 0 if the sending node does not receive the acknowledge frame sent by the receiving node.
| 2,600
|
338,050
| 16,799,681
| 2,648
|
Understanding emojis in the context of online experiences is described. In at least some embodiments, text input is received and a vector representation of the text input is computed. Based on the vector representation, one or more emojis that correspond to the vector representation of the text input are ascertained and a response is formulated that includes at least one of the one or more emojis. In other embodiments, input from a client machine is received. The input includes at least one emoji. A computed vector representation of the emoji is used to look for vector representations of words or phrases that are close to the computed vector representation of the emoji. At least one of the words or phrases is selected and at least one task is performed using the selected word(s) or phrase(s).
|
1. A computer-implemented method comprising:
receiving, with a network-based provider and over a network, a message containing text, the message input by a user using a messaging application on a client machine; ascertaining, by the network-based provider, one or more emojis that correspond to the text; formulating, by the network-based provider, a reply message that includes at least one of the one or more emojis; and communicating the formulated reply message over the network to the client machine for output by the messaging application. 2. The computer-implemented method as described in claim 1, wherein the message containing text is associated with an interactive shopping experience. 3. The computer-implemented method as described in claim 1, wherein the message containing text is associated with an experience other than an interactive shopping experience. 4. The computer-implemented method as described in claim 1, wherein the network-based provider provides online shopping experiences. 5. The computer-implemented method as described in claim 1, wherein said ascertaining further comprises measuring a semantic similarity of the one or more emojis to the text of the message. 6. The computer-implemented method as described in claim 1, wherein the formulated reply message is communicated via a bot. 7. A computer-implemented method, comprising:
receiving, by a network-based provider and over a network, a message containing at least one emoji, the message input by a user using a messaging application on a client machine; ascertaining, by the network-based provider, a meaning of the at least one emoji; selecting, by the network-based provider, one or more words or phrases based on the ascertained meaning of the at least one emoji; formulating, by the network-based provider, a reply message that includes the one or more words or phrases; and communicating the formulated reply message over the network to the client machine for output by the messaging application. 8. The computer-implemented method as described in claim 7, wherein the formulated reply message asks for additional information associated with the message. 9. The computer-implemented method as described in claim 7, wherein the message containing the at least one emoji is associated with an interactive shopping experience. 10. The method as described in claim 7, wherein the message containing the at least one emoji is associated with an experience other than an interactive shopping experience. 11. The computer-implemented method as described in claim 7, wherein the message contains text along with the at least one emoji. 12. The computer-implemented method as described in claim 11, wherein the message containing text along with the at least one emoji corresponds to a search. 13. The computer-implemented method as described in claim 12, wherein the formulated reply message includes at least one additional emoji that is relevant to the search. 14. The computer-implemented method as described in claim 7, wherein the formulated reply message is communicated via a bot. 15. The computer-implemented method as described in claim 7, further comprising determining, by the network-based provider, a sentiment associated with the at least one emoji, and wherein the formulating further comprises formulating the reply message that includes the one or more words or phrases based at least in part on the determined sentiment associated with the at least one emoji. 16. A non-transitory computer-readable storage medium encoding computer executable instructions that, when executed by a processing unit, perform operations comprising:
receiving, by a network-based provider and over a network, a message containing at least one emoji, the message input by a user using a messaging application on a client machine; ascertaining, by the network-based provider, a meaning of the at least one emoji; selecting, by the network-based provider, one or more words or phrases based on the ascertained meaning of the at least one emoji; formulating, by the network-based provider, a reply message that includes the one or more words or phrases; and communicating the formulated reply message over the network to the client machine for output by the messaging application. 17. The non-transitory computer-readable storage medium as described in claim 16, wherein the message contains text along with the at least one emoji. 18. The non-transitory computer-readable storage medium as described in claim 17, wherein the message containing text along with the at least one emoji corresponds to a search. 19. The non-transitory computer-readable storage medium as described in claim 18, wherein the formulated reply message includes at least one additional emoji that is relevant to the search. 20. The non-transitory computer-readable storage medium as described in claim 16, wherein the formulated reply message is communicated via a bot.
|
Understanding emojis in the context of online experiences is described. In at least some embodiments, text input is received and a vector representation of the text input is computed. Based on the vector representation, one or more emojis that correspond to the vector representation of the text input are ascertained and a response is formulated that includes at least one of the one or more emojis. In other embodiments, input from a client machine is received. The input includes at least one emoji. A computed vector representation of the emoji is used to look for vector representations of words or phrases that are close to the computed vector representation of the emoji. At least one of the words or phrases is selected and at least one task is performed using the selected word(s) or phrase(s).1. A computer-implemented method comprising:
receiving, with a network-based provider and over a network, a message containing text, the message input by a user using a messaging application on a client machine; ascertaining, by the network-based provider, one or more emojis that correspond to the text; formulating, by the network-based provider, a reply message that includes at least one of the one or more emojis; and communicating the formulated reply message over the network to the client machine for output by the messaging application. 2. The computer-implemented method as described in claim 1, wherein the message containing text is associated with an interactive shopping experience. 3. The computer-implemented method as described in claim 1, wherein the message containing text is associated with an experience other than an interactive shopping experience. 4. The computer-implemented method as described in claim 1, wherein the network-based provider provides online shopping experiences. 5. The computer-implemented method as described in claim 1, wherein said ascertaining further comprises measuring a semantic similarity of the one or more emojis to the text of the message. 6. The computer-implemented method as described in claim 1, wherein the formulated reply message is communicated via a bot. 7. A computer-implemented method, comprising:
receiving, by a network-based provider and over a network, a message containing at least one emoji, the message input by a user using a messaging application on a client machine; ascertaining, by the network-based provider, a meaning of the at least one emoji; selecting, by the network-based provider, one or more words or phrases based on the ascertained meaning of the at least one emoji; formulating, by the network-based provider, a reply message that includes the one or more words or phrases; and communicating the formulated reply message over the network to the client machine for output by the messaging application. 8. The computer-implemented method as described in claim 7, wherein the formulated reply message asks for additional information associated with the message. 9. The computer-implemented method as described in claim 7, wherein the message containing the at least one emoji is associated with an interactive shopping experience. 10. The method as described in claim 7, wherein the message containing the at least one emoji is associated with an experience other than an interactive shopping experience. 11. The computer-implemented method as described in claim 7, wherein the message contains text along with the at least one emoji. 12. The computer-implemented method as described in claim 11, wherein the message containing text along with the at least one emoji corresponds to a search. 13. The computer-implemented method as described in claim 12, wherein the formulated reply message includes at least one additional emoji that is relevant to the search. 14. The computer-implemented method as described in claim 7, wherein the formulated reply message is communicated via a bot. 15. The computer-implemented method as described in claim 7, further comprising determining, by the network-based provider, a sentiment associated with the at least one emoji, and wherein the formulating further comprises formulating the reply message that includes the one or more words or phrases based at least in part on the determined sentiment associated with the at least one emoji. 16. A non-transitory computer-readable storage medium encoding computer executable instructions that, when executed by a processing unit, perform operations comprising:
receiving, by a network-based provider and over a network, a message containing at least one emoji, the message input by a user using a messaging application on a client machine; ascertaining, by the network-based provider, a meaning of the at least one emoji; selecting, by the network-based provider, one or more words or phrases based on the ascertained meaning of the at least one emoji; formulating, by the network-based provider, a reply message that includes the one or more words or phrases; and communicating the formulated reply message over the network to the client machine for output by the messaging application. 17. The non-transitory computer-readable storage medium as described in claim 16, wherein the message contains text along with the at least one emoji. 18. The non-transitory computer-readable storage medium as described in claim 17, wherein the message containing text along with the at least one emoji corresponds to a search. 19. The non-transitory computer-readable storage medium as described in claim 18, wherein the formulated reply message includes at least one additional emoji that is relevant to the search. 20. The non-transitory computer-readable storage medium as described in claim 16, wherein the formulated reply message is communicated via a bot.
| 2,600
|
338,051
| 16,799,685
| 2,648
|
A hydraulic assembly for an extendable lift arm assembly can include an extension cylinder, a leveling cylinder, a main control valve, a flow combiner/divider, and one or more flow-blocking arrangements. The main control valve can be configured to control commanded movement of the extension and leveling cylinders of the lift arm assembly. The flow combiner/divider can be configured to hydraulically link the extension cylinder with the leveling cylinder for synchronized operation of the extension cylinder and the leveling cylinder. The one or more flow-blocking arrangements can be configured to restrict flow from rod or base ends of the leveling or extension cylinders during commanded extension or retraction of the leveling and extension cylinders, or in the absence of commanded movement of the leveling and extension cylinders, to maintain synchronized orientation of the leveling and extension cylinders.
|
1. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement supported by the implement interface relative to the extendable lift arm portion; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion; a main control valve configured to control commanded movement of the leveling and extension cylinders by selectively directing flow along a first hydraulic flow path (706) to rod ends of the extension and leveling cylinders or along a second hydraulic flow path (708) to base ends of the leveling and extension cylinders; a flow combiner/divider along one of the first or second hydraulic flow paths, the flow combiner/divider configured to divide hydraulic flow to, respectively, one of (i) the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, and to combine hydraulic flow from, respectively, one of (i) the rod ends of the extension and leveling cylinders during extension of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the leveling and extension cylinders; and a first flow-blocking arrangement positioned along the first hydraulic flow path and a second flow-blocking arrangement positioned along the second hydraulic flow path, the first flow-blocking arrangement configured to restrict flow from the rod end of the leveling cylinder and the second flow-blocking arrangement configured to restrict flow from the base end of the extension cylinder during movement of the leveling and extension cylinders. 2. The hydraulic assembly of claim 1, wherein one or more of the first or second flow-blocking arrangements includes a restriction orifice in parallel with a check valve, the check valve being configured to permit flow through the check valve to one or more of, respectively, the rod end of the leveling cylinder during retraction of the leveling and extension cylinders or the base end of the extension cylinder during extension of the leveling and extension cylinders. 3. The hydraulic assembly of claim 1, wherein the second flow-blocking arrangement includes a counterbalance valve having:
a first position with a check valve configured to permit flow through the check valve to the base end of the extension cylinder during extension of the leveling and extension cylinders; and a second position with a flow orifice configured to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 4. The hydraulic assembly of claim 3, wherein the check valve is biased closed. 5. The hydraulic assembly of claim 3, wherein the counterbalance valve is a hydraulically actuated valve, the first position is a default position, and the counterbalance valve is configured to be moved from the first position to the second position by pressurization of the first hydraulic flow path. 6. The hydraulic assembly of claim 5, wherein the counterbalance valve is configured to be moved from the first position to the second position by pressurization of the first flow path between the flow combiner/divider and the rod end of the extension cylinder. 7. The hydraulic assembly of claim 1, further comprising:
a lock valve along the first hydraulic flow path configured to move to a first configuration during commanded movement of the extension and leveling cylinders and to a second configuration when there is no commanded movement of the extension and leveling cylinders; wherein the first configuration of the lock valve permits hydraulic flow between the rod ends of the extension and leveling cylinders; and wherein the second configuration of the lock valve blocks hydraulic flow between the rod ends of the extension and leveling cylinders. 8. The hydraulic assembly of claim 1, further comprising:
a third flow-blocking arrangement positioned along the second hydraulic flow path, the third flow-blocking arrangement configured to restrict flow from the base end of the leveling cylinder during retraction of the leveling and extension cylinders when the leveling cylinder is under compression. 9. The hydraulic assembly of claim 8, wherein the third flow-blocking arrangement includes a restriction orifice in parallel with a pilot-operated check valve that is configured to block flow from the base end of the leveling cylinder in a default state and to be:
opened by pressurization of the first hydraulic flow path, during retraction of the leveling and extension cylinders, to permit flow through the pilot-operated check valve from the base end of the leveling cylinder; and closed, during retraction of the leveling and extension cylinders, upon compression loading of the leveling cylinder. 10. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion, and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement relative to the extendable lift arm portion, causing one of a tensile load and a compression load on the leveling cylinder depending a load introduced by an implement attached to the implement interface; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion; a main control valve configured to control commanded movement of the extension and leveling cylinders by selectively directing flow along a first hydraulic flow path to rod ends of the extension and leveling cylinders or along a second hydraulic flow path to base ends of the leveling and extension cylinders; a flow combiner/divider along one of the first or second hydraulic flow paths, the flow combiner/divider configured to divide hydraulic flow to, respectively, one of (i) the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, and to combine hydraulic flow from, respectively, one of (i) the rod ends of the extension and leveling cylinders during extension of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the leveling and extension cylinders when the extension cylinder is under tension; and a lock valve arranged along one of the first hydraulic flow path and the second hydraulic flow path; the lock valve being configured to be moved to a first configuration during commanded movement of the extension and leveling cylinders and to a second configuration when there is no commanded movement of the extension and leveling cylinders; the first configuration of the lock valve permitting hydraulic flow between the rod ends of the extension and leveling cylinders; and the second configuration of the lock valve blocking hydraulic flow between the rod ends of the extension and leveling cylinders. 11. The hydraulic assembly of claim 10, wherein a first flow-blocking arrangement is positioned along the first hydraulic flow path and a second flow-blocking arrangement is positioned along the second hydraulic flow path, the first flow-blocking arrangement configured to restrict flow from the rod end of the leveling cylinder during extension of the leveling and extension cylinders and the second flow-blocking arrangement configured to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 12. The hydraulic assembly of claim 11, wherein the second flow-blocking arrangement includes a counterbalance valve having:
a first position with a spring-biased check valve configured to permit flow through the check valve to the base end of the extension cylinder during extension of the leveling and extension cylinders; and a second position with a flow orifice to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 13. The hydraulic assembly of claim 12, wherein the counterbalance valve is a hydraulically actuated valve and is configured to be moved from the first position to the second position by pressurization of the first hydraulic flow path when the lock valve is in the first configuration, during retraction of the leveling and extension cylinders. 14. The hydraulic assembly of claim 11, wherein one or more of the first or second flow-blocking arrangements includes a restriction orifice in parallel with a check valve, the check valve configured to permit flow through the check valve to one or more of, respectively, the rod end of the leveling cylinder during retraction of the leveling and extension cylinders or the base end of the extension cylinder during extension of the leveling and extension cylinders. 15. The hydraulic assembly of claim 11, further comprising:
a third flow-blocking arrangement positioned along the second hydraulic flow path, the third flow-blocking arrangement including a restriction orifice in parallel with a pilot-operated check valve that is configured to block flow from the base end of the leveling cylinder in a default state and to be:
opened by pressurization of the first hydraulic flow path, during retraction of the leveling and extension cylinders, to permit flow through the pilot-operated check valve from the base end of the leveling cylinder; and
closed, during retraction of the leveling and extension cylinders, upon compression loading of the leveling cylinder. 16. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion, and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement relative to the extendable lift arm portion, causing one of a tensile load and a compression load on the leveling cylinder depending a load introduced by an implement attached to the implement interface; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion, the extension cylinder being under a compression load; a main control valve configured to control commanded movement of the leveling and extension cylinders by selectively directing flow along a first hydraulic flow path to rod ends of the extension and leveling cylinders or along a second hydraulic flow path to base ends of the leveling and extension cylinders; a first flow divider along the first hydraulic flow path configured to divide hydraulic flow to the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the extension and leveling cylinders; a second flow divider along the second hydraulic flow path configured to divide hydraulic flow to the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, for synchronized operation of the extension and leveling cylinders; a first flow-blocking arrangement along the first hydraulic flow path configured to restrict flow from the rod end of the leveling cylinder, during movement of the extension and leveling cylinders; and a second flow-blocking arrangement along the second hydraulic flow path configured to restrict flow from the base end of the extension cylinder, during movement of the extension and leveling cylinders. 17. The hydraulic assembly of claim 16, wherein one of the first or second flow-blocking arrangements includes a first counterbalance valve having:
a first position with a check valve configured to permit flow through the check valve to one of, respectively, the rod end of the leveling cylinder during retraction of the extension and leveling cylinders, or the base end of the extension cylinder during extension of the extension and leveling cylinders; and a second position with a flow orifice configured to restrict flow from one of, respectively, the rod end of the leveling cylinder during extension of the extension and leveling cylinders, or the base end of the extension cylinder during retraction of the extension and leveling cylinders. 18. The hydraulic assembly of claim 17, wherein the first counterbalance valve is a hydraulically actuated valve, the first position is a default position, and the first counterbalance valve is configured to be moved from the first position to the second position by pressurization of, respectively, the second hydraulic flow path or the first hydraulic flow path. 19. The hydraulic assembly of claim 17, wherein the other of the first or second flow-blocking arrangements includes a second counterbalance valve having:
a first position with a check valve configured to permit flow to the other of, respectively, the rod end of the leveling cylinder during retraction of the extension and leveling cylinders, or the base end of the extension cylinder during extension of the extension and leveling cylinders; and a second position with a flow orifice configured to restrict flow from the other of, respectively, the rod end of the leveling cylinder during extension of the extension and leveling cylinders, or the base end of the extension cylinder during retraction of the extension and leveling cylinders. 20. The hydraulic assembly of claim 16, further comprising:
a third flow-blocking arrangement along the second hydraulic flow path configured to restrict flow from the base end of the leveling cylinder, during retraction of the extension and leveling cylinders, upon compressive loading of the leveling cylinder. 21. The hydraulic assembly of claim 16, wherein the first flow divider includes a directional bypass to allow flow from the first flow blocking arrangement to bypass the flow divider. 22. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement supported by the implement interface relative to the extendable lift arm portion, causing one of a tensile load and a compression load on the leveling cylinder depending on a load introduced by an implement attached to the implement interface; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion, the extension cylinder; a main control valve configured to control commanded movement of the leveling and extension cylinders by selectively directing flow along a first hydraulic flow path to rod ends of the extension and leveling cylinders or along a second hydraulic flow path to base ends of the leveling and extension cylinders; a flow combiner/divider along one of the first or second hydraulic flow paths, the flow combiner/divider configured to divide hydraulic flow to, respectively, one of (i) the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, and to combine hydraulic flow from, respectively, one of (i) the rod ends of the extension and leveling cylinders during extension of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the leveling and extension cylinders; and a first flow-blocking arrangement positioned along the first hydraulic flow path, a second flow-blocking arrangement positioned along the second hydraulic flow path, and a third flow-blocking arrangement positioned along the second hydraulic flow path; the first flow-blocking arrangement configured to restrict flow from the rod end of the leveling cylinder during extension of the leveling and extension cylinders when the leveling cylinder is under tension and the extension cylinder is under compression; the second flow-blocking arrangement configured to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders when the leveling cylinder is under tension and the extension cylinder is under compression; and the third flow-blocking arrangement configured to restrict flow from the base end of the leveling cylinder during retraction of the leveling and extension cylinders when the leveling cylinder is under compression. 23. The hydraulic assembly of claim 22, wherein a plurality of the first, second, and third flow-blocking arrangements include a restriction orifice in parallel with a check valve. 24. The hydraulic assembly of claim 23, wherein the second flow-blocking arrangement includes a hydraulically actuated counterbalance valve that is configured to be moved from a first position to a second position by pressurization of the first hydraulic flow path during commanded retraction of the leveling and extension cylinders;
wherein the first position is a default position and includes a spring-biased check valve configured to permit flow through the check valve to the base end of the extension cylinder during extension of the leveling and extension cylinders; and wherein the second position includes a flow orifice to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 25. The hydraulic assembly of claim 24, wherein the third flow-blocking arrangement includes a restriction orifice in parallel with a pilot-operated check valve that is configured to block flow from the base end of the leveling cylinder in a default state and to be:
opened by pressurization of the first hydraulic flow path, during retraction of the leveling and extension cylinders when the leveling cylinder is under tension loading, to permit flow through the pilot-operated check valve from the base end of the leveling cylinder; and closed, during retraction of the leveling and extension cylinders when the leveling cylinder is under compression loading.
|
A hydraulic assembly for an extendable lift arm assembly can include an extension cylinder, a leveling cylinder, a main control valve, a flow combiner/divider, and one or more flow-blocking arrangements. The main control valve can be configured to control commanded movement of the extension and leveling cylinders of the lift arm assembly. The flow combiner/divider can be configured to hydraulically link the extension cylinder with the leveling cylinder for synchronized operation of the extension cylinder and the leveling cylinder. The one or more flow-blocking arrangements can be configured to restrict flow from rod or base ends of the leveling or extension cylinders during commanded extension or retraction of the leveling and extension cylinders, or in the absence of commanded movement of the leveling and extension cylinders, to maintain synchronized orientation of the leveling and extension cylinders.1. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement supported by the implement interface relative to the extendable lift arm portion; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion; a main control valve configured to control commanded movement of the leveling and extension cylinders by selectively directing flow along a first hydraulic flow path (706) to rod ends of the extension and leveling cylinders or along a second hydraulic flow path (708) to base ends of the leveling and extension cylinders; a flow combiner/divider along one of the first or second hydraulic flow paths, the flow combiner/divider configured to divide hydraulic flow to, respectively, one of (i) the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, and to combine hydraulic flow from, respectively, one of (i) the rod ends of the extension and leveling cylinders during extension of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the leveling and extension cylinders; and a first flow-blocking arrangement positioned along the first hydraulic flow path and a second flow-blocking arrangement positioned along the second hydraulic flow path, the first flow-blocking arrangement configured to restrict flow from the rod end of the leveling cylinder and the second flow-blocking arrangement configured to restrict flow from the base end of the extension cylinder during movement of the leveling and extension cylinders. 2. The hydraulic assembly of claim 1, wherein one or more of the first or second flow-blocking arrangements includes a restriction orifice in parallel with a check valve, the check valve being configured to permit flow through the check valve to one or more of, respectively, the rod end of the leveling cylinder during retraction of the leveling and extension cylinders or the base end of the extension cylinder during extension of the leveling and extension cylinders. 3. The hydraulic assembly of claim 1, wherein the second flow-blocking arrangement includes a counterbalance valve having:
a first position with a check valve configured to permit flow through the check valve to the base end of the extension cylinder during extension of the leveling and extension cylinders; and a second position with a flow orifice configured to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 4. The hydraulic assembly of claim 3, wherein the check valve is biased closed. 5. The hydraulic assembly of claim 3, wherein the counterbalance valve is a hydraulically actuated valve, the first position is a default position, and the counterbalance valve is configured to be moved from the first position to the second position by pressurization of the first hydraulic flow path. 6. The hydraulic assembly of claim 5, wherein the counterbalance valve is configured to be moved from the first position to the second position by pressurization of the first flow path between the flow combiner/divider and the rod end of the extension cylinder. 7. The hydraulic assembly of claim 1, further comprising:
a lock valve along the first hydraulic flow path configured to move to a first configuration during commanded movement of the extension and leveling cylinders and to a second configuration when there is no commanded movement of the extension and leveling cylinders; wherein the first configuration of the lock valve permits hydraulic flow between the rod ends of the extension and leveling cylinders; and wherein the second configuration of the lock valve blocks hydraulic flow between the rod ends of the extension and leveling cylinders. 8. The hydraulic assembly of claim 1, further comprising:
a third flow-blocking arrangement positioned along the second hydraulic flow path, the third flow-blocking arrangement configured to restrict flow from the base end of the leveling cylinder during retraction of the leveling and extension cylinders when the leveling cylinder is under compression. 9. The hydraulic assembly of claim 8, wherein the third flow-blocking arrangement includes a restriction orifice in parallel with a pilot-operated check valve that is configured to block flow from the base end of the leveling cylinder in a default state and to be:
opened by pressurization of the first hydraulic flow path, during retraction of the leveling and extension cylinders, to permit flow through the pilot-operated check valve from the base end of the leveling cylinder; and closed, during retraction of the leveling and extension cylinders, upon compression loading of the leveling cylinder. 10. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion, and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement relative to the extendable lift arm portion, causing one of a tensile load and a compression load on the leveling cylinder depending a load introduced by an implement attached to the implement interface; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion; a main control valve configured to control commanded movement of the extension and leveling cylinders by selectively directing flow along a first hydraulic flow path to rod ends of the extension and leveling cylinders or along a second hydraulic flow path to base ends of the leveling and extension cylinders; a flow combiner/divider along one of the first or second hydraulic flow paths, the flow combiner/divider configured to divide hydraulic flow to, respectively, one of (i) the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, and to combine hydraulic flow from, respectively, one of (i) the rod ends of the extension and leveling cylinders during extension of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the leveling and extension cylinders when the extension cylinder is under tension; and a lock valve arranged along one of the first hydraulic flow path and the second hydraulic flow path; the lock valve being configured to be moved to a first configuration during commanded movement of the extension and leveling cylinders and to a second configuration when there is no commanded movement of the extension and leveling cylinders; the first configuration of the lock valve permitting hydraulic flow between the rod ends of the extension and leveling cylinders; and the second configuration of the lock valve blocking hydraulic flow between the rod ends of the extension and leveling cylinders. 11. The hydraulic assembly of claim 10, wherein a first flow-blocking arrangement is positioned along the first hydraulic flow path and a second flow-blocking arrangement is positioned along the second hydraulic flow path, the first flow-blocking arrangement configured to restrict flow from the rod end of the leveling cylinder during extension of the leveling and extension cylinders and the second flow-blocking arrangement configured to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 12. The hydraulic assembly of claim 11, wherein the second flow-blocking arrangement includes a counterbalance valve having:
a first position with a spring-biased check valve configured to permit flow through the check valve to the base end of the extension cylinder during extension of the leveling and extension cylinders; and a second position with a flow orifice to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 13. The hydraulic assembly of claim 12, wherein the counterbalance valve is a hydraulically actuated valve and is configured to be moved from the first position to the second position by pressurization of the first hydraulic flow path when the lock valve is in the first configuration, during retraction of the leveling and extension cylinders. 14. The hydraulic assembly of claim 11, wherein one or more of the first or second flow-blocking arrangements includes a restriction orifice in parallel with a check valve, the check valve configured to permit flow through the check valve to one or more of, respectively, the rod end of the leveling cylinder during retraction of the leveling and extension cylinders or the base end of the extension cylinder during extension of the leveling and extension cylinders. 15. The hydraulic assembly of claim 11, further comprising:
a third flow-blocking arrangement positioned along the second hydraulic flow path, the third flow-blocking arrangement including a restriction orifice in parallel with a pilot-operated check valve that is configured to block flow from the base end of the leveling cylinder in a default state and to be:
opened by pressurization of the first hydraulic flow path, during retraction of the leveling and extension cylinders, to permit flow through the pilot-operated check valve from the base end of the leveling cylinder; and
closed, during retraction of the leveling and extension cylinders, upon compression loading of the leveling cylinder. 16. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion, and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement relative to the extendable lift arm portion, causing one of a tensile load and a compression load on the leveling cylinder depending a load introduced by an implement attached to the implement interface; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion, the extension cylinder being under a compression load; a main control valve configured to control commanded movement of the leveling and extension cylinders by selectively directing flow along a first hydraulic flow path to rod ends of the extension and leveling cylinders or along a second hydraulic flow path to base ends of the leveling and extension cylinders; a first flow divider along the first hydraulic flow path configured to divide hydraulic flow to the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the extension and leveling cylinders; a second flow divider along the second hydraulic flow path configured to divide hydraulic flow to the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, for synchronized operation of the extension and leveling cylinders; a first flow-blocking arrangement along the first hydraulic flow path configured to restrict flow from the rod end of the leveling cylinder, during movement of the extension and leveling cylinders; and a second flow-blocking arrangement along the second hydraulic flow path configured to restrict flow from the base end of the extension cylinder, during movement of the extension and leveling cylinders. 17. The hydraulic assembly of claim 16, wherein one of the first or second flow-blocking arrangements includes a first counterbalance valve having:
a first position with a check valve configured to permit flow through the check valve to one of, respectively, the rod end of the leveling cylinder during retraction of the extension and leveling cylinders, or the base end of the extension cylinder during extension of the extension and leveling cylinders; and a second position with a flow orifice configured to restrict flow from one of, respectively, the rod end of the leveling cylinder during extension of the extension and leveling cylinders, or the base end of the extension cylinder during retraction of the extension and leveling cylinders. 18. The hydraulic assembly of claim 17, wherein the first counterbalance valve is a hydraulically actuated valve, the first position is a default position, and the first counterbalance valve is configured to be moved from the first position to the second position by pressurization of, respectively, the second hydraulic flow path or the first hydraulic flow path. 19. The hydraulic assembly of claim 17, wherein the other of the first or second flow-blocking arrangements includes a second counterbalance valve having:
a first position with a check valve configured to permit flow to the other of, respectively, the rod end of the leveling cylinder during retraction of the extension and leveling cylinders, or the base end of the extension cylinder during extension of the extension and leveling cylinders; and a second position with a flow orifice configured to restrict flow from the other of, respectively, the rod end of the leveling cylinder during extension of the extension and leveling cylinders, or the base end of the extension cylinder during retraction of the extension and leveling cylinders. 20. The hydraulic assembly of claim 16, further comprising:
a third flow-blocking arrangement along the second hydraulic flow path configured to restrict flow from the base end of the leveling cylinder, during retraction of the extension and leveling cylinders, upon compressive loading of the leveling cylinder. 21. The hydraulic assembly of claim 16, wherein the first flow divider includes a directional bypass to allow flow from the first flow blocking arrangement to bypass the flow divider. 22. A hydraulic assembly for controlling position of portions of a lift arm assembly, the lift arm assembly including a main lift arm portion, an extendable lift arm portion configured to be extended relative to the main lift arm portion and an implement interface for supporting an implement, the hydraulic assembly comprising:
a leveling cylinder configured to adjust an attitude of the implement supported by the implement interface relative to the extendable lift arm portion, causing one of a tensile load and a compression load on the leveling cylinder depending on a load introduced by an implement attached to the implement interface; an extension cylinder configured to move the extendable lift arm portion relative to the main lift arm portion, the extension cylinder; a main control valve configured to control commanded movement of the leveling and extension cylinders by selectively directing flow along a first hydraulic flow path to rod ends of the extension and leveling cylinders or along a second hydraulic flow path to base ends of the leveling and extension cylinders; a flow combiner/divider along one of the first or second hydraulic flow paths, the flow combiner/divider configured to divide hydraulic flow to, respectively, one of (i) the rod ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during extension of the extension and leveling cylinders, and to combine hydraulic flow from, respectively, one of (i) the rod ends of the extension and leveling cylinders during extension of the extension and leveling cylinders or (ii) the base ends of the extension and leveling cylinders during retraction of the extension and leveling cylinders, for synchronized operation of the leveling and extension cylinders; and a first flow-blocking arrangement positioned along the first hydraulic flow path, a second flow-blocking arrangement positioned along the second hydraulic flow path, and a third flow-blocking arrangement positioned along the second hydraulic flow path; the first flow-blocking arrangement configured to restrict flow from the rod end of the leveling cylinder during extension of the leveling and extension cylinders when the leveling cylinder is under tension and the extension cylinder is under compression; the second flow-blocking arrangement configured to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders when the leveling cylinder is under tension and the extension cylinder is under compression; and the third flow-blocking arrangement configured to restrict flow from the base end of the leveling cylinder during retraction of the leveling and extension cylinders when the leveling cylinder is under compression. 23. The hydraulic assembly of claim 22, wherein a plurality of the first, second, and third flow-blocking arrangements include a restriction orifice in parallel with a check valve. 24. The hydraulic assembly of claim 23, wherein the second flow-blocking arrangement includes a hydraulically actuated counterbalance valve that is configured to be moved from a first position to a second position by pressurization of the first hydraulic flow path during commanded retraction of the leveling and extension cylinders;
wherein the first position is a default position and includes a spring-biased check valve configured to permit flow through the check valve to the base end of the extension cylinder during extension of the leveling and extension cylinders; and wherein the second position includes a flow orifice to restrict flow from the base end of the extension cylinder during retraction of the leveling and extension cylinders. 25. The hydraulic assembly of claim 24, wherein the third flow-blocking arrangement includes a restriction orifice in parallel with a pilot-operated check valve that is configured to block flow from the base end of the leveling cylinder in a default state and to be:
opened by pressurization of the first hydraulic flow path, during retraction of the leveling and extension cylinders when the leveling cylinder is under tension loading, to permit flow through the pilot-operated check valve from the base end of the leveling cylinder; and closed, during retraction of the leveling and extension cylinders when the leveling cylinder is under compression loading.
| 2,600
|
338,052
| 16,799,654
| 2,648
|
Methods, systems, and devices for wireless communication are described. Generally, the described techniques provide for efficiently performing dynamic power control with minimal complexity in a dual connectivity mode. In particular, a user equipment (UE) may determine the reserved power (or maximum available power) for uplink transmissions on one or more cells in one cell group to a base station based on the total power available to the UE and the minimum reserved power for uplink transmissions on one or more cells in another cell group. Once the UE determines the reserved power for conflicting uplink transmissions on one or more cells in a cell group, the UE may allocate the reserved power to each uplink transmission on the one or more cells in the cell group (e.g., based on a priority of each of the uplink transmissions).
|
1. A method for wireless communication at a user equipment (UE), comprising:
identifying that the UE is operating in dual connectivity with a master cell group and a secondary cell group; determining a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; allocating a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power and a channel type priority; allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and communicating with the master cell group and with the secondary cell group in accordance with the power allocations. 2. The method of claim 1, wherein the channel type priority comprises at least one of a non-ultra-reliable low-latency communication with the master cell group, an ultra-reliable low-latency communication with the secondary cell group, or an ultra-reliable low-latency communication with the master cell group. 3. The method of claim 1, further comprising:
identifying the secondary cell group minimum reserved transmission power for the transmissions from the UE to the secondary cell group during the transmission occasion; and determining the master cell group reserved transmission power, the master cell group reserved transmission power for allocation across component carriers of the master cell group during the transmission occasion. 4. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is less than or equal to a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; and setting the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being less than or equal to the difference. 5. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determining that no transmission is scheduled to the secondary cell group during the transmission occasion; and setting the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being greater than the difference and a lack of scheduled transmissions to the secondary cell group during the transmission occasion. 6. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determining that at least one transmission is scheduled to the secondary cell group during the transmission occasion; determining that a secondary cell group total scheduled transmission power is less than the secondary cell group minimum reserved transmission power; and setting the master cell group reserved transmission power equal to a difference between the total available transmission power and the secondary cell group total scheduled transmission power. 7. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determining that at least one transmission is scheduled to the secondary cell group during the transmission occasion; determining that a secondary cell group total scheduled transmission power is greater than or equal to the secondary cell group minimum reserved transmission power; and setting the master cell group reserved transmission power equal to a difference between the total available transmission power and the secondary cell group minimum reserved transmission power. 8. The method of claim 3, further comprising:
identifying a master cell group minimum reserved transmission power for transmissions from the UE to the master cell group during the transmission occasion. 9. The method of claim 1, wherein allocating the master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion comprises:
allocating the master cell group reserved transmission power between scheduled transmissions to the master cell group based at least in part on a priority of the scheduled transmissions. 10. The method of claim 1, wherein allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion comprises:
allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group based at least in part on a priority of the scheduled transmissions. 11. The method of claim 1, wherein the scheduled transmissions to the master cell group include ultra-reliable low-latency communications, and wherein the scheduled transmissions to the secondary cell group do not include ultra-reliable low-latency communications. 12. The method of claim 1, further comprising:
identifying the secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; determining a secondary cell group ultra-reliable low-latency communications total scheduled transmission power during the transmission occasion; and determining that a master cell group total scheduled transmission power is less than or equal to a difference between a total available transmission power and the secondary cell group minimum reserved transmission power. 13. The method of claim 12, wherein determining the secondary cell group reserved transmission power comprises:
scaling down a power of non-ultra-reliable low-latency communications with the secondary cell group during the transmission occasion; determining that a sum of the scaled down power of the non-ultra-reliable low-latency communications with the secondary cell group and the secondary cell group ultra-reliable low-latency communications is less than or equal to the secondary cell group minimum reserved transmission power; and setting the secondary cell group reserved transmission power to be equal to the secondary cell group minimum reserved transmission power. 14. The method of claim 12, wherein determining the secondary cell group reserved transmission power comprises:
scaling down a power of non-ultra-reliable low-latency communications with the secondary cell group during the transmission occasion; determining that a sum of the scaled down power of non-ultra-reliable low-latency communications with the secondary cell group and the secondary cell group ultra-reliable low-latency communications is greater than the secondary cell group minimum reserved transmission power; identifying that the scheduled transmissions to the master cell group do not include ultra-reliable low-latency communications; scaling down the master cell group reserved transmission power based at least in part on a lack of ultra-reliable low-latency communications being scheduled during the transmission occasion; and setting the secondary cell group reserved transmission power to be equal to at least the secondary cell group ultra-reliable low-latency communications total scheduled transmission power. 15. The method of claim 12, further comprising:
scaling down a power of non-ultra-reliable low-latency communications with the secondary cell group during the transmission occasion; determining that a sum of the scaled down power of non-ultra-reliable low-latency communications with the secondary cell group and the secondary cell group ultra-reliable low-latency communications is greater than the secondary cell group minimum reserved transmission power; identifying that the scheduled transmissions to the master cell group include ultra-reliable low-latency communications; and scaling down selected transmission powers in order so that ultra-reliable low-latency communications with the master cell group are prioritized. 16. The method of claim 15, wherein the order for scaling down the selected transmission powers comprises:
scaling down the secondary cell group reserved transmission power to be equal to the secondary cell group minimum reserved transmission power, followed by scaling down non-ultra-reliable low-latency communications with the master cell group, and followed by scaling down ultra-reliable low-latency communications with the master cell group. 17. The method of claim 15, wherein the order for scaling down the selected transmission powers comprises:
scaling down non-ultra-reliable low-latency communications with the master cell group, followed by scaling down ultra-reliable low-latency communications with the secondary cell group, and followed by scaling down ultra-reliable low-latency communications with the master cell group. 18. The method of claim 1, further comprising:
identifying the secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; determining a secondary cell group ultra-reliable low-latency communications total scheduled transmission power during the transmission occasion; determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; and scaling down communications with the master cell group so that the master cell group reserved transmission power is equal to the difference between the total available transmission power and the secondary cell group minimum reserved transmission power. 19. The method of claim 1, further comprising:
identifying a master cell group minimum reserved transmission power for non-ultra-reliable low-latency communications for non-ultra-reliable low-latency transmissions from the UE to the master cell group during the transmission occasion; identifying a master cell group minimum reserved transmission power for ultra-reliable low-latency communications for ultra-reliable low-latency transmissions from the UE to the master cell group during the transmission occasion; identifying the secondary cell group minimum reserved transmission power for non-ultra-reliable low-latency communications for non-ultra-reliable low-latency transmissions from the UE to the secondary cell group during the transmission occasion; and identifying a secondary cell group minimum reserved transmission power for ultra-reliable low-latency communications for ultra-reliable low-latency transmissions from the UE to the secondary cell group during the transmission occasion. 20. The method of claim 19, wherein the master cell group minimum reserved transmission power for non-ultra-reliable low-latency communications is independent from the master cell group minimum reserved transmission power for ultra-reliable low-latency communications, and wherein the secondary cell group minimum reserved transmission power for non-ultra-reliable low-latency communications is independent from the secondary cell group minimum reserved transmission power for ultra-reliable low-latency communications. 21. The method of claim 1, further comprising:
identifying that the UE is power-limited. 22. The method of claim 1, further comprising:
identifying that communications with the master cell group have a higher priority than communications with the secondary cell group. 23. The method of claim 22, wherein determining the secondary cell group reserved transmission power comprises:
scaling down the secondary cell group reserved transmission power based at least in part on the communications with the master cell group having the higher priority than the communications with the secondary cell group. 24. An apparatus for wireless communication at a user equipment (UE), comprising:
a processor, memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
identify that the UE is operating in dual connectivity with a master cell group and a secondary cell group;
determine a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion;
allocate a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power;
allocate the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and
communicate with the master cell group and with the secondary cell group in accordance with the power allocations. 25. The apparatus of claim 24, wherein the instructions are further executable by the processor to cause the apparatus to:
identify the secondary cell group minimum reserved transmission power for the transmissions from the UE to the secondary cell group during the transmission occasion; and determine the master cell group reserved transmission power, the master cell group reserved transmission power for allocation across component carriers of the master cell group during the transmission occasion. 26. The apparatus of claim 25, wherein the instructions to determine the master cell group reserved transmission power are executable by the processor to cause the apparatus to:
determine that a master cell group total scheduled transmission power is less than or equal to a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; and set the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being less than or equal to the difference. 27. The apparatus of claim 25, wherein the instructions to determine the master cell group reserved transmission power are executable by the processor to cause the apparatus to:
determine that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determine that no transmission is scheduled to the secondary cell group during the transmission occasion; and set the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being greater than the difference and a lack of scheduled transmissions to the secondary cell group during the transmission occasion. 28. The apparatus of claim 25, wherein the instructions to determine the master cell group reserved transmission power are executable by the processor to cause the apparatus to:
determine that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determine that at least one transmission is scheduled to the secondary cell group during the transmission occasion; determine that a secondary cell group total scheduled transmission power is less than the secondary cell group minimum reserved transmission power; and set the master cell group reserved transmission power equal to a difference between the total available transmission power and the secondary cell group total scheduled transmission power. 29. An apparatus for wireless communication at a user equipment (UE), comprising:
means for identifying that the UE is operating in dual connectivity with a master cell group and a secondary cell group; means for determining a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; means for allocating a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power; means for allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and means for communicating with the master cell group and with the secondary cell group in accordance with the power allocations. 30. A non-transitory computer-readable medium storing code for wireless communication at a user equipment (UE), the code comprising instructions executable by a processor to:
identify that the UE is operating in dual connectivity with a master cell group and a secondary cell group; determine a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; allocate a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power; allocate the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and communicate with the master cell group and with the secondary cell group in accordance with the power allocations.
|
Methods, systems, and devices for wireless communication are described. Generally, the described techniques provide for efficiently performing dynamic power control with minimal complexity in a dual connectivity mode. In particular, a user equipment (UE) may determine the reserved power (or maximum available power) for uplink transmissions on one or more cells in one cell group to a base station based on the total power available to the UE and the minimum reserved power for uplink transmissions on one or more cells in another cell group. Once the UE determines the reserved power for conflicting uplink transmissions on one or more cells in a cell group, the UE may allocate the reserved power to each uplink transmission on the one or more cells in the cell group (e.g., based on a priority of each of the uplink transmissions).1. A method for wireless communication at a user equipment (UE), comprising:
identifying that the UE is operating in dual connectivity with a master cell group and a secondary cell group; determining a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; allocating a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power and a channel type priority; allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and communicating with the master cell group and with the secondary cell group in accordance with the power allocations. 2. The method of claim 1, wherein the channel type priority comprises at least one of a non-ultra-reliable low-latency communication with the master cell group, an ultra-reliable low-latency communication with the secondary cell group, or an ultra-reliable low-latency communication with the master cell group. 3. The method of claim 1, further comprising:
identifying the secondary cell group minimum reserved transmission power for the transmissions from the UE to the secondary cell group during the transmission occasion; and determining the master cell group reserved transmission power, the master cell group reserved transmission power for allocation across component carriers of the master cell group during the transmission occasion. 4. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is less than or equal to a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; and setting the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being less than or equal to the difference. 5. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determining that no transmission is scheduled to the secondary cell group during the transmission occasion; and setting the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being greater than the difference and a lack of scheduled transmissions to the secondary cell group during the transmission occasion. 6. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determining that at least one transmission is scheduled to the secondary cell group during the transmission occasion; determining that a secondary cell group total scheduled transmission power is less than the secondary cell group minimum reserved transmission power; and setting the master cell group reserved transmission power equal to a difference between the total available transmission power and the secondary cell group total scheduled transmission power. 7. The method of claim 3, wherein determining the master cell group reserved transmission power comprises:
determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determining that at least one transmission is scheduled to the secondary cell group during the transmission occasion; determining that a secondary cell group total scheduled transmission power is greater than or equal to the secondary cell group minimum reserved transmission power; and setting the master cell group reserved transmission power equal to a difference between the total available transmission power and the secondary cell group minimum reserved transmission power. 8. The method of claim 3, further comprising:
identifying a master cell group minimum reserved transmission power for transmissions from the UE to the master cell group during the transmission occasion. 9. The method of claim 1, wherein allocating the master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion comprises:
allocating the master cell group reserved transmission power between scheduled transmissions to the master cell group based at least in part on a priority of the scheduled transmissions. 10. The method of claim 1, wherein allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion comprises:
allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group based at least in part on a priority of the scheduled transmissions. 11. The method of claim 1, wherein the scheduled transmissions to the master cell group include ultra-reliable low-latency communications, and wherein the scheduled transmissions to the secondary cell group do not include ultra-reliable low-latency communications. 12. The method of claim 1, further comprising:
identifying the secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; determining a secondary cell group ultra-reliable low-latency communications total scheduled transmission power during the transmission occasion; and determining that a master cell group total scheduled transmission power is less than or equal to a difference between a total available transmission power and the secondary cell group minimum reserved transmission power. 13. The method of claim 12, wherein determining the secondary cell group reserved transmission power comprises:
scaling down a power of non-ultra-reliable low-latency communications with the secondary cell group during the transmission occasion; determining that a sum of the scaled down power of the non-ultra-reliable low-latency communications with the secondary cell group and the secondary cell group ultra-reliable low-latency communications is less than or equal to the secondary cell group minimum reserved transmission power; and setting the secondary cell group reserved transmission power to be equal to the secondary cell group minimum reserved transmission power. 14. The method of claim 12, wherein determining the secondary cell group reserved transmission power comprises:
scaling down a power of non-ultra-reliable low-latency communications with the secondary cell group during the transmission occasion; determining that a sum of the scaled down power of non-ultra-reliable low-latency communications with the secondary cell group and the secondary cell group ultra-reliable low-latency communications is greater than the secondary cell group minimum reserved transmission power; identifying that the scheduled transmissions to the master cell group do not include ultra-reliable low-latency communications; scaling down the master cell group reserved transmission power based at least in part on a lack of ultra-reliable low-latency communications being scheduled during the transmission occasion; and setting the secondary cell group reserved transmission power to be equal to at least the secondary cell group ultra-reliable low-latency communications total scheduled transmission power. 15. The method of claim 12, further comprising:
scaling down a power of non-ultra-reliable low-latency communications with the secondary cell group during the transmission occasion; determining that a sum of the scaled down power of non-ultra-reliable low-latency communications with the secondary cell group and the secondary cell group ultra-reliable low-latency communications is greater than the secondary cell group minimum reserved transmission power; identifying that the scheduled transmissions to the master cell group include ultra-reliable low-latency communications; and scaling down selected transmission powers in order so that ultra-reliable low-latency communications with the master cell group are prioritized. 16. The method of claim 15, wherein the order for scaling down the selected transmission powers comprises:
scaling down the secondary cell group reserved transmission power to be equal to the secondary cell group minimum reserved transmission power, followed by scaling down non-ultra-reliable low-latency communications with the master cell group, and followed by scaling down ultra-reliable low-latency communications with the master cell group. 17. The method of claim 15, wherein the order for scaling down the selected transmission powers comprises:
scaling down non-ultra-reliable low-latency communications with the master cell group, followed by scaling down ultra-reliable low-latency communications with the secondary cell group, and followed by scaling down ultra-reliable low-latency communications with the master cell group. 18. The method of claim 1, further comprising:
identifying the secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; determining a secondary cell group ultra-reliable low-latency communications total scheduled transmission power during the transmission occasion; determining that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; and scaling down communications with the master cell group so that the master cell group reserved transmission power is equal to the difference between the total available transmission power and the secondary cell group minimum reserved transmission power. 19. The method of claim 1, further comprising:
identifying a master cell group minimum reserved transmission power for non-ultra-reliable low-latency communications for non-ultra-reliable low-latency transmissions from the UE to the master cell group during the transmission occasion; identifying a master cell group minimum reserved transmission power for ultra-reliable low-latency communications for ultra-reliable low-latency transmissions from the UE to the master cell group during the transmission occasion; identifying the secondary cell group minimum reserved transmission power for non-ultra-reliable low-latency communications for non-ultra-reliable low-latency transmissions from the UE to the secondary cell group during the transmission occasion; and identifying a secondary cell group minimum reserved transmission power for ultra-reliable low-latency communications for ultra-reliable low-latency transmissions from the UE to the secondary cell group during the transmission occasion. 20. The method of claim 19, wherein the master cell group minimum reserved transmission power for non-ultra-reliable low-latency communications is independent from the master cell group minimum reserved transmission power for ultra-reliable low-latency communications, and wherein the secondary cell group minimum reserved transmission power for non-ultra-reliable low-latency communications is independent from the secondary cell group minimum reserved transmission power for ultra-reliable low-latency communications. 21. The method of claim 1, further comprising:
identifying that the UE is power-limited. 22. The method of claim 1, further comprising:
identifying that communications with the master cell group have a higher priority than communications with the secondary cell group. 23. The method of claim 22, wherein determining the secondary cell group reserved transmission power comprises:
scaling down the secondary cell group reserved transmission power based at least in part on the communications with the master cell group having the higher priority than the communications with the secondary cell group. 24. An apparatus for wireless communication at a user equipment (UE), comprising:
a processor, memory coupled with the processor; and instructions stored in the memory and executable by the processor to cause the apparatus to:
identify that the UE is operating in dual connectivity with a master cell group and a secondary cell group;
determine a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion;
allocate a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power;
allocate the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and
communicate with the master cell group and with the secondary cell group in accordance with the power allocations. 25. The apparatus of claim 24, wherein the instructions are further executable by the processor to cause the apparatus to:
identify the secondary cell group minimum reserved transmission power for the transmissions from the UE to the secondary cell group during the transmission occasion; and determine the master cell group reserved transmission power, the master cell group reserved transmission power for allocation across component carriers of the master cell group during the transmission occasion. 26. The apparatus of claim 25, wherein the instructions to determine the master cell group reserved transmission power are executable by the processor to cause the apparatus to:
determine that a master cell group total scheduled transmission power is less than or equal to a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; and set the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being less than or equal to the difference. 27. The apparatus of claim 25, wherein the instructions to determine the master cell group reserved transmission power are executable by the processor to cause the apparatus to:
determine that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determine that no transmission is scheduled to the secondary cell group during the transmission occasion; and set the master cell group reserved transmission power equal to the master cell group total scheduled transmission power based at least in part on the master cell group total scheduled transmission power being greater than the difference and a lack of scheduled transmissions to the secondary cell group during the transmission occasion. 28. The apparatus of claim 25, wherein the instructions to determine the master cell group reserved transmission power are executable by the processor to cause the apparatus to:
determine that a master cell group total scheduled transmission power is greater than a difference between a total available transmission power and the secondary cell group minimum reserved transmission power; determine that at least one transmission is scheduled to the secondary cell group during the transmission occasion; determine that a secondary cell group total scheduled transmission power is less than the secondary cell group minimum reserved transmission power; and set the master cell group reserved transmission power equal to a difference between the total available transmission power and the secondary cell group total scheduled transmission power. 29. An apparatus for wireless communication at a user equipment (UE), comprising:
means for identifying that the UE is operating in dual connectivity with a master cell group and a secondary cell group; means for determining a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; means for allocating a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power; means for allocating the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and means for communicating with the master cell group and with the secondary cell group in accordance with the power allocations. 30. A non-transitory computer-readable medium storing code for wireless communication at a user equipment (UE), the code comprising instructions executable by a processor to:
identify that the UE is operating in dual connectivity with a master cell group and a secondary cell group; determine a secondary cell group reserved transmission power for allocation across component carriers of the secondary cell group during a transmission occasion based at least in part on a secondary cell group minimum reserved transmission power for transmissions from the UE to the secondary cell group during the transmission occasion; allocate a master cell group reserved transmission power between scheduled transmissions to the master cell group during the transmission occasion based at least in part on the secondary cell group reserved transmission power; allocate the secondary cell group reserved transmission power between scheduled transmissions to the secondary cell group during the transmission occasion; and communicate with the master cell group and with the secondary cell group in accordance with the power allocations.
| 2,600
|
338,053
| 16,799,618
| 2,648
|
Systems and methods are disclosed for creating, editing, sharing and distributing high-quality, media-rich web-based communications. The communications are created in a layered fashion that integrates user-selected text, colors, background patterns, images, sound, music, video, or other media. The systems and methods are used to generate, edit, broadcast, and track electronic presentations, brochures, advertisements (such as banner advertisements on highly trafficked media websites), announcements, and interactive web pages, without the need for the user to understand complex programming languages.
|
1. An online advertisement generation system for autonomously generating and broadcasting a multi-media advertisement, the multi-media advertisement having a layered configuration for being rendered, the online advertisement generation system comprising:
a media repository for storing media rich communication content, the media rich communication content comprising:
a plurality of functionalized advertisement templates, and
a plurality of media assets having one or more multimedia codes embedded therein; and
an advertisement system server coupled to the media repository and configured for being coupled to a recipient device via an internet network connection, the recipient device having a graphical user interface for receiving a query having one or more keywords, the advertisement system server comprising:
an advertisement builder for identifying and extracting the keyword from the query, and being configured for accessing the media repository and selecting, based on the keyword, at least one of the plurality of functionalized advertisement templates and at least one of the plurality of media assets, the advertisement builder for layering the functionalized advertisement template into a collection of slides comprising a grouping of design layers, design elements, and content containers;
an advertisement generation engine for autonomously generating, in response to the keyword of the received query, the multi-media advertisement, the advertisement generation engine being configured for generating, via a container of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset;
a compiler associated with the advertisement generation engine, the compiler for integrating the at least one selected media asset with the at least one selected functionalized advertisement template;
a formatter, associated with the compiler, the formatter for formatting the multi-media advertisement according to an electronic distribution format specified on the graphical user interface of the recipient device; and
a distribution program for autonomously broadcasting, once the multi-media advertisement is generated and formatted, the online advertisement over the internet network connection, to the recipient device so as to be rendered at the graphical user interface thereof, the slides being displayable in an auto-play on or an auto-play off format. 2. The online advertisement generation system in accordance with claim 1, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system via the internet network connection, wherein multimedia code is extracted from the multimedia file during the uploading process. 3. The online advertisement generation system in accordance with claim 2, wherein one or more templates are functionalized during the uploading process to produce one or more functionalized advertisement templates. 4. The online advertisement generation system in accordance with claim 3, wherein the media asset is uploaded through the API and embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 5. The online advertisement generation system in accordance with claim 4, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 6. The online advertisement generation system in accordance with claim 5, wherein the compiler performs a compiling operation based on one or more of embedded multimedia code associated with the functionalized template and media asset. 7. The online advertisement generation system in accordance with claim 6, wherein the compiler is configured for grouping the design layers, the design elements, and the content containers into the collection of slides so as to generate and render the multi-media advertisement. 8. An online advertisement generation system for autonomously generating and broadcasting a multi-media advertisement, the multi-media advertisement having a layered configuration for being rendered, the online advertisement generation system comprising:
an advertisement system server configured for being coupled to a recipient device via an internet network connection, the recipient device having a graphical user interface for receiving a query having one or more keywords, the advertisement system server further being coupled with a media repository for storing media rich communication content, the media rich communication content comprising a plurality of functionalized advertisement templates, and a plurality of media assets having one or more multimedia codes embedded therein, the advertisement system server being configured for:
receiving, over the internet network connection, the query from the recipient device,
autonomously selecting, in response to the keyword of the received query, a functionalized advertisement template and a multimedia code embedded media asset,
generating, via the functionalized advertisement template calling the multimedia code embedded media asset, the multi-media advertisement, and
broadcasting, to the recipient device by the advertisement system server, the generated the multi-media advertisement, the advertisement system server comprising:
an advertisement builder for identifying and extracting the keyword from the query, and being configured for accessing the media repository and selecting, based on the keyword, at least one of the functionalized advertisement templates and at least one of the plurality of media assets, the advertisement builder for layering the functionalized advertisement template into a collection of slides comprising a grouping of design layers, design elements, and content containers; an advertisement generation engine, associated with the advertisement builder, for autonomously generating, in response to the keyword of the received query, the multi-media advertisement, the advertisement generation engine being configured for generating, via a container of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset; a compiler, associated with the advertisement generation engine, the compiler for integrating, the at least one selected media asset with the at least one selected functionalized advertisement template; a formatter, associated with the compiler, the formatter for formatting the multi-media advertisement according to an electronic distribution format specified on the graphical user interface of the recipient device; and a distribution program for autonomously broadcasting, once the multi-media advertisement is generated and formatted, the online advertisement over the internet network connection, the distribution program using the keyword for performing targeted broadcasting of the online advertisement to the recipient device. 9. The online advertisement generation system in accordance with claim 8, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system via the internet network connection, whereby multimedia code is extracted from the multimedia file during the uploading process. 10. The online advertisement generation system in accordance with claim 9, wherein one or more templates are formed and functionalized during the uploading process to produce one or more functionalized advertisement templates. 11. The online advertisement generation system in accordance with claim 10, wherein the media asset is uploaded through the API, and is embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 12. The online advertisement generation system in accordance with claim 11, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 13. The online advertisement generation system in accordance with claim 12, wherein the compiler performs a compiling operation, which compiling operation is based on one or more of embedded multimedia code associated with the functionalized template and media asset. 14. The online advertisement generation system in accordance with claim 13, wherein the compiler is configured for grouping the design layers, the design elements, and the content containers into the collection of slides so as to generate and render the multi-media advertisement. 15. The online advertisement generation system in accordance with claim 14, wherein the distribution program is configured for broadcasting the multi-media advertisement in a plurality of distribution formats. 16. An online advertisement generation system for autonomously generating and broadcasting one or more media rich communications, the one or more media rich communications having a layered configuration, the online advertisement generation system comprising:
a communications system server being configured to be coupled to a recipient device via a network connection, the recipient device having a graphical user interface, the graphical user interface being configured for receiving an input directed to a query, the query comprising data pertaining to one or more keywords, the communications system server being coupled with a media repository for storing media rich communication content, the media rich communication content including:
a plurality of functionalized communication templates, each functionalized communication template having a configuration and comprising a collection of slides comprising a grouping of distributed design layers, one or more of the design layers including one or more content containers; and
a plurality of media assets having one or more multimedia codes embedded therein,
the communications system server further being configured for receiving the query from the recipient device as well as for generating and broadcasting the one or more media rich communications to the recipient device in response to the received query, the communications system server having an advertisement generation engine for autonomously generating, in response to the data pertaining to the one or more keywords of the query, the media rich communication, the advertisement generation engine being configured for positioning the functionalized template out on the node and generating, via a container of a layer of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset, the advertisement generation engine comprising: a compiler for integrating the at least one selected media asset with the at least one selected functionalized advertisement template; and a distribution program, associated with the compiler, for autonomously broadcasting, once generated, the media rich communication over the network connection, the distribution program using the keyword for performing targeted broadcasting of the online advertisement to the recipient device. 17. The online advertisement generation system in accordance with claim 16, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system via the internet network connection, whereby multimedia code is extracted from the multimedia file during the uploading process. 18. The online advertisement generation system in accordance with claim 17, wherein one or more templates are functionalized during the uploading process to produce one or more functionalized advertisement templates. 19. The online advertisement generation system in accordance with claim 18, wherein the media asset is uploaded through the API, and is embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 20. The online advertisement generation system in accordance with claim 19, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 21. The online advertisement generation system in accordance with claim 20, wherein the compiler performs a compiling operation, which compiling operation is based on one or more of embedded multimedia code associated with the functionalized template and media asset. 22. The online advertisement generation system in accordance with claim 21, wherein the compiler is configured for grouping the design layers, design elements, and content containers into the collection of slides so as to generate and render the multi-media advertisement. 23. The online advertisement generation system in accordance with claim 22, wherein the distribution program is configured for broadcasting the multi-media advertisement in a plurality of distribution formats. 24. An online advertisement system server, comprising:
a server-side media repository, the server-side media repository for storing one or more functionalized advertisement templates, and media assets having one or more multimedia codes embedded therein; a server-side advertisement builder configured for identifying and extracting data from a data feed received by the system server from one or more recipient computing devices, the advertisement builder using the extracted data to access the server-side media repository and select, based on the extracted data, at least one of the plurality of functionalized advertisement templates and at least one of the plurality of media assets, the server-side advertisement builder for layering functionalized advertisement template into a collection of slides comprising a grouping of design layers, design elements, and content containers, and to generate one or more online advertisements, via a container of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset so as to generate the one or more online advertisements; and a server-side distribution program, the server side distribution program configured for retrieving the functionalized advertisement template from the server side media repository and positioning it at the node, and further configured for broadcasting one or more media assets over the network connection to the container of the functionalized advertisement template for integration therewith in a manner so as to generate the advertisement, the distribution program using keywords for performing targeted broadcasting, the targeted broadcasting being directed to the recipient computing device in a manner so as to be rendered at the graphical user interface thereof. 25. The online advertisement generation system in accordance with claim 24, wherein the system server further comprises a compiler for performing a compiler operation for integrating the at least one selected media asset with the at least one selected functionalized advertisement template. 26. The online advertisement generation system in accordance with claim 25, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system, whereby multimedia code is extracted from the multimedia file during the uploading process. 27. The online advertisement generation system in accordance with claim 26, wherein one or more templates are formed and functionalized during the uploading process to produce one or more functionalized advertisement templates. 28. The online advertisement generation system in accordance with claim 27, wherein the media asset is uploaded through the API, and is embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 29. The online advertisement generation system in accordance with claim 11, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 30. The online advertisement generation system in accordance with claim 29, wherein the compiler performs a compiling operation based on one or more of embedded multimedia code associated with the functionalized template and media asset.
|
Systems and methods are disclosed for creating, editing, sharing and distributing high-quality, media-rich web-based communications. The communications are created in a layered fashion that integrates user-selected text, colors, background patterns, images, sound, music, video, or other media. The systems and methods are used to generate, edit, broadcast, and track electronic presentations, brochures, advertisements (such as banner advertisements on highly trafficked media websites), announcements, and interactive web pages, without the need for the user to understand complex programming languages.1. An online advertisement generation system for autonomously generating and broadcasting a multi-media advertisement, the multi-media advertisement having a layered configuration for being rendered, the online advertisement generation system comprising:
a media repository for storing media rich communication content, the media rich communication content comprising:
a plurality of functionalized advertisement templates, and
a plurality of media assets having one or more multimedia codes embedded therein; and
an advertisement system server coupled to the media repository and configured for being coupled to a recipient device via an internet network connection, the recipient device having a graphical user interface for receiving a query having one or more keywords, the advertisement system server comprising:
an advertisement builder for identifying and extracting the keyword from the query, and being configured for accessing the media repository and selecting, based on the keyword, at least one of the plurality of functionalized advertisement templates and at least one of the plurality of media assets, the advertisement builder for layering the functionalized advertisement template into a collection of slides comprising a grouping of design layers, design elements, and content containers;
an advertisement generation engine for autonomously generating, in response to the keyword of the received query, the multi-media advertisement, the advertisement generation engine being configured for generating, via a container of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset;
a compiler associated with the advertisement generation engine, the compiler for integrating the at least one selected media asset with the at least one selected functionalized advertisement template;
a formatter, associated with the compiler, the formatter for formatting the multi-media advertisement according to an electronic distribution format specified on the graphical user interface of the recipient device; and
a distribution program for autonomously broadcasting, once the multi-media advertisement is generated and formatted, the online advertisement over the internet network connection, to the recipient device so as to be rendered at the graphical user interface thereof, the slides being displayable in an auto-play on or an auto-play off format. 2. The online advertisement generation system in accordance with claim 1, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system via the internet network connection, wherein multimedia code is extracted from the multimedia file during the uploading process. 3. The online advertisement generation system in accordance with claim 2, wherein one or more templates are functionalized during the uploading process to produce one or more functionalized advertisement templates. 4. The online advertisement generation system in accordance with claim 3, wherein the media asset is uploaded through the API and embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 5. The online advertisement generation system in accordance with claim 4, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 6. The online advertisement generation system in accordance with claim 5, wherein the compiler performs a compiling operation based on one or more of embedded multimedia code associated with the functionalized template and media asset. 7. The online advertisement generation system in accordance with claim 6, wherein the compiler is configured for grouping the design layers, the design elements, and the content containers into the collection of slides so as to generate and render the multi-media advertisement. 8. An online advertisement generation system for autonomously generating and broadcasting a multi-media advertisement, the multi-media advertisement having a layered configuration for being rendered, the online advertisement generation system comprising:
an advertisement system server configured for being coupled to a recipient device via an internet network connection, the recipient device having a graphical user interface for receiving a query having one or more keywords, the advertisement system server further being coupled with a media repository for storing media rich communication content, the media rich communication content comprising a plurality of functionalized advertisement templates, and a plurality of media assets having one or more multimedia codes embedded therein, the advertisement system server being configured for:
receiving, over the internet network connection, the query from the recipient device,
autonomously selecting, in response to the keyword of the received query, a functionalized advertisement template and a multimedia code embedded media asset,
generating, via the functionalized advertisement template calling the multimedia code embedded media asset, the multi-media advertisement, and
broadcasting, to the recipient device by the advertisement system server, the generated the multi-media advertisement, the advertisement system server comprising:
an advertisement builder for identifying and extracting the keyword from the query, and being configured for accessing the media repository and selecting, based on the keyword, at least one of the functionalized advertisement templates and at least one of the plurality of media assets, the advertisement builder for layering the functionalized advertisement template into a collection of slides comprising a grouping of design layers, design elements, and content containers; an advertisement generation engine, associated with the advertisement builder, for autonomously generating, in response to the keyword of the received query, the multi-media advertisement, the advertisement generation engine being configured for generating, via a container of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset; a compiler, associated with the advertisement generation engine, the compiler for integrating, the at least one selected media asset with the at least one selected functionalized advertisement template; a formatter, associated with the compiler, the formatter for formatting the multi-media advertisement according to an electronic distribution format specified on the graphical user interface of the recipient device; and a distribution program for autonomously broadcasting, once the multi-media advertisement is generated and formatted, the online advertisement over the internet network connection, the distribution program using the keyword for performing targeted broadcasting of the online advertisement to the recipient device. 9. The online advertisement generation system in accordance with claim 8, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system via the internet network connection, whereby multimedia code is extracted from the multimedia file during the uploading process. 10. The online advertisement generation system in accordance with claim 9, wherein one or more templates are formed and functionalized during the uploading process to produce one or more functionalized advertisement templates. 11. The online advertisement generation system in accordance with claim 10, wherein the media asset is uploaded through the API, and is embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 12. The online advertisement generation system in accordance with claim 11, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 13. The online advertisement generation system in accordance with claim 12, wherein the compiler performs a compiling operation, which compiling operation is based on one or more of embedded multimedia code associated with the functionalized template and media asset. 14. The online advertisement generation system in accordance with claim 13, wherein the compiler is configured for grouping the design layers, the design elements, and the content containers into the collection of slides so as to generate and render the multi-media advertisement. 15. The online advertisement generation system in accordance with claim 14, wherein the distribution program is configured for broadcasting the multi-media advertisement in a plurality of distribution formats. 16. An online advertisement generation system for autonomously generating and broadcasting one or more media rich communications, the one or more media rich communications having a layered configuration, the online advertisement generation system comprising:
a communications system server being configured to be coupled to a recipient device via a network connection, the recipient device having a graphical user interface, the graphical user interface being configured for receiving an input directed to a query, the query comprising data pertaining to one or more keywords, the communications system server being coupled with a media repository for storing media rich communication content, the media rich communication content including:
a plurality of functionalized communication templates, each functionalized communication template having a configuration and comprising a collection of slides comprising a grouping of distributed design layers, one or more of the design layers including one or more content containers; and
a plurality of media assets having one or more multimedia codes embedded therein,
the communications system server further being configured for receiving the query from the recipient device as well as for generating and broadcasting the one or more media rich communications to the recipient device in response to the received query, the communications system server having an advertisement generation engine for autonomously generating, in response to the data pertaining to the one or more keywords of the query, the media rich communication, the advertisement generation engine being configured for positioning the functionalized template out on the node and generating, via a container of a layer of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset, the advertisement generation engine comprising: a compiler for integrating the at least one selected media asset with the at least one selected functionalized advertisement template; and a distribution program, associated with the compiler, for autonomously broadcasting, once generated, the media rich communication over the network connection, the distribution program using the keyword for performing targeted broadcasting of the online advertisement to the recipient device. 17. The online advertisement generation system in accordance with claim 16, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system via the internet network connection, whereby multimedia code is extracted from the multimedia file during the uploading process. 18. The online advertisement generation system in accordance with claim 17, wherein one or more templates are functionalized during the uploading process to produce one or more functionalized advertisement templates. 19. The online advertisement generation system in accordance with claim 18, wherein the media asset is uploaded through the API, and is embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 20. The online advertisement generation system in accordance with claim 19, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 21. The online advertisement generation system in accordance with claim 20, wherein the compiler performs a compiling operation, which compiling operation is based on one or more of embedded multimedia code associated with the functionalized template and media asset. 22. The online advertisement generation system in accordance with claim 21, wherein the compiler is configured for grouping the design layers, design elements, and content containers into the collection of slides so as to generate and render the multi-media advertisement. 23. The online advertisement generation system in accordance with claim 22, wherein the distribution program is configured for broadcasting the multi-media advertisement in a plurality of distribution formats. 24. An online advertisement system server, comprising:
a server-side media repository, the server-side media repository for storing one or more functionalized advertisement templates, and media assets having one or more multimedia codes embedded therein; a server-side advertisement builder configured for identifying and extracting data from a data feed received by the system server from one or more recipient computing devices, the advertisement builder using the extracted data to access the server-side media repository and select, based on the extracted data, at least one of the plurality of functionalized advertisement templates and at least one of the plurality of media assets, the server-side advertisement builder for layering functionalized advertisement template into a collection of slides comprising a grouping of design layers, design elements, and content containers, and to generate one or more online advertisements, via a container of the functionalized advertisement template calling the media asset thereto via the embedded multimedia code of the media asset so as to generate the one or more online advertisements; and a server-side distribution program, the server side distribution program configured for retrieving the functionalized advertisement template from the server side media repository and positioning it at the node, and further configured for broadcasting one or more media assets over the network connection to the container of the functionalized advertisement template for integration therewith in a manner so as to generate the advertisement, the distribution program using keywords for performing targeted broadcasting, the targeted broadcasting being directed to the recipient computing device in a manner so as to be rendered at the graphical user interface thereof. 25. The online advertisement generation system in accordance with claim 24, wherein the system server further comprises a compiler for performing a compiler operation for integrating the at least one selected media asset with the at least one selected functionalized advertisement template. 26. The online advertisement generation system in accordance with claim 25, further comprising an application programming interface for uploading a multimedia file from the recipient device to the system, whereby multimedia code is extracted from the multimedia file during the uploading process. 27. The online advertisement generation system in accordance with claim 26, wherein one or more templates are formed and functionalized during the uploading process to produce one or more functionalized advertisement templates. 28. The online advertisement generation system in accordance with claim 27, wherein the media asset is uploaded through the API, and is embedded with multimedia code during an uploading process so as to produce a functionalized media asset with embedded coding. 29. The online advertisement generation system in accordance with claim 11, wherein functionalization of the one or more templates and media asset includes adding media rich code to the one or more templates and media asset, respectively. 30. The online advertisement generation system in accordance with claim 29, wherein the compiler performs a compiling operation based on one or more of embedded multimedia code associated with the functionalized template and media asset.
| 2,600
|
338,054
| 16,799,675
| 2,648
|
A method for integrating a further bus subscriber into a bus system, and a bus system, having a master module and subscribers disposed in series, includes the temporally consecutive method steps: in a first method step, the further bus subscriber transmits a data packet to the master module in order to log in to the master module, in a second method step, a bus subscriber disposed between the further bus subscriber and the master module stops the data packet and checks whether the bus system has already received a release, in a third method step, the first bus subscriber forwards the data packet to the master module if the bus system has not yet received a release, or in a third, in particular an alternative, method step, if the bus system has already received a release, the bus subscriber stores the data packet and waits until the release of the bus system is revoked and after the release has been revoked, forwards the stored data packet to the master module.
|
1. A method for operating a bus system that includes a master module and bus subscribers arranged in series and downstream of the master module, comprising:
initializing the bus system, including: sending, by the master module, a request to the bus subscribers to log into the master module; each active bus subscriber, in series order, logging into the master module after receiving the request, forwarding the request to an immediately-adjacent downstream bus subscriber, and waiting for a predetermined time period for the immediate-adjacent downstream bus subscriber to log into the master module; and stopping the initializing after the predetermined time period has elapsed without a bus subscriber logging into the master module and closing the bus system to a further bus subscriber; after closing the bus system, sending a data packet by the further bus subscriber to the master module; while the bus system is closed, stopping the data packet by a bus subscriber that is logged into the master module and is located upstream from the further bus subscriber; after the bus system is no longer closed, forwarding the stopped data packet to the master module, admitting the further bus subscriber to the bus system, and closing the bus system after the predetermined time period has elapsed without an additional bus subscriber logging into the master module. 2. The method according to claim 1, wherein the initializing includes automatically assigning, by the master module, a bus address to each logged-in bus subscriber. 3. The method according to claim 1, wherein the initializing includes assigning a bus address to each bus subscriber, each bus subscriber incrementing its assigned bus address and forwards the incremented bus address to a downstream bus subscriber to assign the incremented bus address to the downstream bus subscriber. 4. The method according to claim 1, wherein the initializing is aborted if a number of bus subscribers connected to the bus system exceeds a maximally allowed number of bus subscribers. 5. The method according to claim 1, wherein the master module aborts the initializing if the master module determines that a number of bus subscribers connected to the bus system exceeds a maximally allowed number of bus subscribers. 6. The method according to claim 1, wherein the bus subscribers and master module communicate with each other via a first data line and a second data line. 7. The method according to claim 6, wherein the master module transmits data packets to the bus subscribers via the first data line. 8. The method according to claim 6, wherein the master module receives data packets from the bus subscribers via the second data line. 9. The method according to claim 7, wherein the master module receives data packets from the bus subscribers via the second data line. 10. The method according to claim 1, further comprising closing the bus system by a control device superordinate to the master module. 11. The method according to claim 1, further comprising revoking closure of the bus system by a control device superordinate to the master module. 12. The method according to claim 10, further comprising revoking closure of the bus system by a control device superordinate to the master module. 13. The method according to claim 6, wherein at least one of the data lines includes at least one data cable. 14. The method according to claim 6, wherein the master module and each bus subscriber includes a first connector connected to the first data line and a second connector connected to the second data line. 15. The method according to claim 14, wherein the each data line includes a first connector plug part plug-connecting to a second connector plug part of the first connector. 16. The method according to claim 1, wherein the bus subscribers include drives, electronic components, and/or drive converters for electric motors of an industrial plant. 17. The method according to claim 1, further comprising forwarding, without interruption and without a time delay, a data packet through an inactive bus subscriber. 18. The method according to claim 1, further comprising shutting down all bus subscribers in response to detection of an error by the master module and/or a bus subscriber. 19. The method according to claim 18, wherein the shutting down includes interrupting a currently-transmitted data packet and transmitting an emergency signal. 20. A bus system, comprising:
a master module and bus subscribers arranged in series and connected to each other via at least one data line; wherein the bus system is adapted to perform the method recited in claim 1.
|
A method for integrating a further bus subscriber into a bus system, and a bus system, having a master module and subscribers disposed in series, includes the temporally consecutive method steps: in a first method step, the further bus subscriber transmits a data packet to the master module in order to log in to the master module, in a second method step, a bus subscriber disposed between the further bus subscriber and the master module stops the data packet and checks whether the bus system has already received a release, in a third method step, the first bus subscriber forwards the data packet to the master module if the bus system has not yet received a release, or in a third, in particular an alternative, method step, if the bus system has already received a release, the bus subscriber stores the data packet and waits until the release of the bus system is revoked and after the release has been revoked, forwards the stored data packet to the master module.1. A method for operating a bus system that includes a master module and bus subscribers arranged in series and downstream of the master module, comprising:
initializing the bus system, including: sending, by the master module, a request to the bus subscribers to log into the master module; each active bus subscriber, in series order, logging into the master module after receiving the request, forwarding the request to an immediately-adjacent downstream bus subscriber, and waiting for a predetermined time period for the immediate-adjacent downstream bus subscriber to log into the master module; and stopping the initializing after the predetermined time period has elapsed without a bus subscriber logging into the master module and closing the bus system to a further bus subscriber; after closing the bus system, sending a data packet by the further bus subscriber to the master module; while the bus system is closed, stopping the data packet by a bus subscriber that is logged into the master module and is located upstream from the further bus subscriber; after the bus system is no longer closed, forwarding the stopped data packet to the master module, admitting the further bus subscriber to the bus system, and closing the bus system after the predetermined time period has elapsed without an additional bus subscriber logging into the master module. 2. The method according to claim 1, wherein the initializing includes automatically assigning, by the master module, a bus address to each logged-in bus subscriber. 3. The method according to claim 1, wherein the initializing includes assigning a bus address to each bus subscriber, each bus subscriber incrementing its assigned bus address and forwards the incremented bus address to a downstream bus subscriber to assign the incremented bus address to the downstream bus subscriber. 4. The method according to claim 1, wherein the initializing is aborted if a number of bus subscribers connected to the bus system exceeds a maximally allowed number of bus subscribers. 5. The method according to claim 1, wherein the master module aborts the initializing if the master module determines that a number of bus subscribers connected to the bus system exceeds a maximally allowed number of bus subscribers. 6. The method according to claim 1, wherein the bus subscribers and master module communicate with each other via a first data line and a second data line. 7. The method according to claim 6, wherein the master module transmits data packets to the bus subscribers via the first data line. 8. The method according to claim 6, wherein the master module receives data packets from the bus subscribers via the second data line. 9. The method according to claim 7, wherein the master module receives data packets from the bus subscribers via the second data line. 10. The method according to claim 1, further comprising closing the bus system by a control device superordinate to the master module. 11. The method according to claim 1, further comprising revoking closure of the bus system by a control device superordinate to the master module. 12. The method according to claim 10, further comprising revoking closure of the bus system by a control device superordinate to the master module. 13. The method according to claim 6, wherein at least one of the data lines includes at least one data cable. 14. The method according to claim 6, wherein the master module and each bus subscriber includes a first connector connected to the first data line and a second connector connected to the second data line. 15. The method according to claim 14, wherein the each data line includes a first connector plug part plug-connecting to a second connector plug part of the first connector. 16. The method according to claim 1, wherein the bus subscribers include drives, electronic components, and/or drive converters for electric motors of an industrial plant. 17. The method according to claim 1, further comprising forwarding, without interruption and without a time delay, a data packet through an inactive bus subscriber. 18. The method according to claim 1, further comprising shutting down all bus subscribers in response to detection of an error by the master module and/or a bus subscriber. 19. The method according to claim 18, wherein the shutting down includes interrupting a currently-transmitted data packet and transmitting an emergency signal. 20. A bus system, comprising:
a master module and bus subscribers arranged in series and connected to each other via at least one data line; wherein the bus system is adapted to perform the method recited in claim 1.
| 2,600
|
338,055
| 16,799,679
| 2,648
|
There is provided a semiconductor module including: a base for semiconductor cooling; a stacked substrate provided above the base; a semiconductor chip provided above the stacked substrate; a coating layer provided on an upper surface of the semiconductor chip; and a sealing resin for sealing the semiconductor chip, in which the base is in contact with the sealing resin.
|
1. A semiconductor module comprising:
a base for semiconductor cooling; a stacked substrate provided above the base; a semiconductor chip provided above the stacked substrate; a coating layer provided on an upper surface of the semiconductor chip; and a sealing resin for sealing the semiconductor chip, wherein the base is in contact with the sealing resin. 2. The semiconductor module according to claim 1, wherein
the coating layer is provided on at least a part of an upper surface of the stacked substrate. 3. The semiconductor module according to claim 1, wherein
the semiconductor chip has an upper main electrode of the semiconductor chip, and the coating layer is provided in contact with an upper surface of the upper main electrode. 4. The semiconductor module according to claim 1, wherein
the coating layer includes at least one of polyimide or polyamide. 5. The semiconductor module according to claim 1, wherein
the semiconductor chip has a passivation film provided on the upper surface of the semiconductor chip, the passivation film includes polyimide, and the coating layer is provided on an upper surface of the passivation film. 6. The semiconductor module according to claim 1, further comprising:
a printed circuit board (PCB) provided above the semiconductor chip, wherein the coating layer is provided on an upper surface of the PCB, and the sealing resin seals the PCB. 7. The semiconductor module according to claim 6, wherein
the coating layer is provided on an upper surface of the base below the PCB, in a top plan view, and the sealing resin is injected between the coating layer immediately below the PCB and a lower surface of the PCB. 8. The semiconductor module according to claim 6, further comprising:
a housing that surrounds a whole side surface of the sealing resin, wherein the PCB has a connection pad for connecting the semiconductor chip to the PCB on the upper surface, the connection pad is provided apart from the housing, and the coating layer is provided on an upper surface of the connection pad. 9. The semiconductor module according to claim 1, further comprising:
a metal wiring plate provided on the upper surface of the semiconductor chip, wherein the coating layer is provided on the upper surface of the semiconductor chip, and at least one of an upper surface or a lower surface of the metal wiring plate. 10. The semiconductor module according to claim 9, wherein
the coating layer is provided on the lower surface of the metal wiring plate rather than on the upper surface of the metal wiring plate. 11. The semiconductor module according to claim 9, wherein
the coating layer is provided on the upper surface of the metal wiring plate rather than on the lower surface of the metal wiring plate. 12. A vehicle comprising the semiconductor module according to claim 1. 13. A method of manufacturing a semiconductor module, the method comprising:
providing a base for semiconductor cooling; providing a stacked substrate above the base; providing a semiconductor chip above the stacked substrate; providing a coating layer on an upper surface of the semiconductor chip; and sealing the semiconductor chip with a sealing resin, wherein the base is in contact with the sealing resin. 14. The method of manufacturing a semiconductor module according to claim 13, wherein
the providing of the coating layer includes applying the coating layer by spray application.
|
There is provided a semiconductor module including: a base for semiconductor cooling; a stacked substrate provided above the base; a semiconductor chip provided above the stacked substrate; a coating layer provided on an upper surface of the semiconductor chip; and a sealing resin for sealing the semiconductor chip, in which the base is in contact with the sealing resin.1. A semiconductor module comprising:
a base for semiconductor cooling; a stacked substrate provided above the base; a semiconductor chip provided above the stacked substrate; a coating layer provided on an upper surface of the semiconductor chip; and a sealing resin for sealing the semiconductor chip, wherein the base is in contact with the sealing resin. 2. The semiconductor module according to claim 1, wherein
the coating layer is provided on at least a part of an upper surface of the stacked substrate. 3. The semiconductor module according to claim 1, wherein
the semiconductor chip has an upper main electrode of the semiconductor chip, and the coating layer is provided in contact with an upper surface of the upper main electrode. 4. The semiconductor module according to claim 1, wherein
the coating layer includes at least one of polyimide or polyamide. 5. The semiconductor module according to claim 1, wherein
the semiconductor chip has a passivation film provided on the upper surface of the semiconductor chip, the passivation film includes polyimide, and the coating layer is provided on an upper surface of the passivation film. 6. The semiconductor module according to claim 1, further comprising:
a printed circuit board (PCB) provided above the semiconductor chip, wherein the coating layer is provided on an upper surface of the PCB, and the sealing resin seals the PCB. 7. The semiconductor module according to claim 6, wherein
the coating layer is provided on an upper surface of the base below the PCB, in a top plan view, and the sealing resin is injected between the coating layer immediately below the PCB and a lower surface of the PCB. 8. The semiconductor module according to claim 6, further comprising:
a housing that surrounds a whole side surface of the sealing resin, wherein the PCB has a connection pad for connecting the semiconductor chip to the PCB on the upper surface, the connection pad is provided apart from the housing, and the coating layer is provided on an upper surface of the connection pad. 9. The semiconductor module according to claim 1, further comprising:
a metal wiring plate provided on the upper surface of the semiconductor chip, wherein the coating layer is provided on the upper surface of the semiconductor chip, and at least one of an upper surface or a lower surface of the metal wiring plate. 10. The semiconductor module according to claim 9, wherein
the coating layer is provided on the lower surface of the metal wiring plate rather than on the upper surface of the metal wiring plate. 11. The semiconductor module according to claim 9, wherein
the coating layer is provided on the upper surface of the metal wiring plate rather than on the lower surface of the metal wiring plate. 12. A vehicle comprising the semiconductor module according to claim 1. 13. A method of manufacturing a semiconductor module, the method comprising:
providing a base for semiconductor cooling; providing a stacked substrate above the base; providing a semiconductor chip above the stacked substrate; providing a coating layer on an upper surface of the semiconductor chip; and sealing the semiconductor chip with a sealing resin, wherein the base is in contact with the sealing resin. 14. The method of manufacturing a semiconductor module according to claim 13, wherein
the providing of the coating layer includes applying the coating layer by spray application.
| 2,600
|
338,056
| 16,799,680
| 1,611
|
There is disclosed herein a composition for treating gastrointestinal or neurological disorders, constipation, functional constipation, irritable bowel syndrome, diverticulitis, travelers diarrhoea, chronic idiopathic nausea, IBD-associated constipation and diarrhoea, pseudo-obstruction, diabetic gastroparesis, cyclic vomiting, reflux oesophagitis, autism enteropathy, flatulence, halitosis, chronic fatigue, bloating, proctalgia fugax, Parkinsons disease, MS, Alzheimers Disease, Motor Neurone Disease or autism, the composition comprising: (i) at least two anti-clostridial agents selected from the group consisting of: vancomycin, vancomycin derivatives, a multi-valent polymer of vancomycin, am inoglycosides, nitroimidazoles, ansamysins, nifuroxazide, colchicine, prucalopride, prokinetic agent and 5-aminosalicylic acid; or (ii) at least one anti-clostridial agent selected from the above combined with an opioid blocking agent. There is also disclosed herein a method of treating various gastrointestinal or neurological disorders, constipation, functional constipation, irritable bowel syndrome, diverticulitis, travelers diarrhoea, chronic idiopathic nausea, IBD-associated constipation and diarrhoea, pseudo-obstruction, diabetic gastroparesis, cyclic vomiting, reflux oesophagitis, autism enteropathy, flatulence, halitosis, chronic fatigue, bloating, proctalgia fugax, Parkinsons disease, MS, Alzheimers Disease, Motor Neurone Disease or autism, the method comprising administering orally, via enema or by suppository: (i) a composition of the invention; (ii) at least two anti-clostridial agents selected from the group consisting of: vancomycin, vancomycin derivatives, a multi-valent polymer of vancomycin, am inoglycosides, nitroimidazoles, ansamysins, nifuroxazide, colchicine, prucalopride, prokinetic agent and 5-aminosalicylic acid; or (iii) at least one anti-clostridial agent selected from the above and an opioid blocking agent to a patient in need of such treatment.
|
1-24. (canceled) 25: A pharmaceutical composition or formulation comprising:
(a) colchicine; (b) a nitroimidazole; and (c) rifaximin. 26: The pharmaceutical composition or formulation of claim 25, further comprising a pharmaceutically acceptable carrier. 27: The pharmaceutical composition or formulation of claim 25, wherein the nitroimidazole is selected from the group consisting of metronidazole, tinidazole, nimorazole, secnidazole, ordinazole and mixtures thereof. 28: The pharmaceutical composition or formulation of claim 27, wherein the nitroimidazole is dosaged for administration in doses ranging from 0.01 mg per day to 5000 mg per day. 29: The pharmaceutical composition or formulation of claim 28, wherein the nitroimidazole is dosaged for administration in doses ranging from 50 mg per day to 500 mg per day. 30: The pharmaceutical composition or formulation of claim 25, wherein the colchicine is dosaged for administration in doses ranging from 0.005 mg to 5 mg per day. 31: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated in a single capsule or tablet. 32: The pharmaceutical composition or formulation of claim 33, wherein the capsule or tablet is enteric coated. 33: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated together as an enema formulation. 34: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated together as a suppository formulation. 35: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated together as an orally administered formulation.
|
There is disclosed herein a composition for treating gastrointestinal or neurological disorders, constipation, functional constipation, irritable bowel syndrome, diverticulitis, travelers diarrhoea, chronic idiopathic nausea, IBD-associated constipation and diarrhoea, pseudo-obstruction, diabetic gastroparesis, cyclic vomiting, reflux oesophagitis, autism enteropathy, flatulence, halitosis, chronic fatigue, bloating, proctalgia fugax, Parkinsons disease, MS, Alzheimers Disease, Motor Neurone Disease or autism, the composition comprising: (i) at least two anti-clostridial agents selected from the group consisting of: vancomycin, vancomycin derivatives, a multi-valent polymer of vancomycin, am inoglycosides, nitroimidazoles, ansamysins, nifuroxazide, colchicine, prucalopride, prokinetic agent and 5-aminosalicylic acid; or (ii) at least one anti-clostridial agent selected from the above combined with an opioid blocking agent. There is also disclosed herein a method of treating various gastrointestinal or neurological disorders, constipation, functional constipation, irritable bowel syndrome, diverticulitis, travelers diarrhoea, chronic idiopathic nausea, IBD-associated constipation and diarrhoea, pseudo-obstruction, diabetic gastroparesis, cyclic vomiting, reflux oesophagitis, autism enteropathy, flatulence, halitosis, chronic fatigue, bloating, proctalgia fugax, Parkinsons disease, MS, Alzheimers Disease, Motor Neurone Disease or autism, the method comprising administering orally, via enema or by suppository: (i) a composition of the invention; (ii) at least two anti-clostridial agents selected from the group consisting of: vancomycin, vancomycin derivatives, a multi-valent polymer of vancomycin, am inoglycosides, nitroimidazoles, ansamysins, nifuroxazide, colchicine, prucalopride, prokinetic agent and 5-aminosalicylic acid; or (iii) at least one anti-clostridial agent selected from the above and an opioid blocking agent to a patient in need of such treatment.1-24. (canceled) 25: A pharmaceutical composition or formulation comprising:
(a) colchicine; (b) a nitroimidazole; and (c) rifaximin. 26: The pharmaceutical composition or formulation of claim 25, further comprising a pharmaceutically acceptable carrier. 27: The pharmaceutical composition or formulation of claim 25, wherein the nitroimidazole is selected from the group consisting of metronidazole, tinidazole, nimorazole, secnidazole, ordinazole and mixtures thereof. 28: The pharmaceutical composition or formulation of claim 27, wherein the nitroimidazole is dosaged for administration in doses ranging from 0.01 mg per day to 5000 mg per day. 29: The pharmaceutical composition or formulation of claim 28, wherein the nitroimidazole is dosaged for administration in doses ranging from 50 mg per day to 500 mg per day. 30: The pharmaceutical composition or formulation of claim 25, wherein the colchicine is dosaged for administration in doses ranging from 0.005 mg to 5 mg per day. 31: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated in a single capsule or tablet. 32: The pharmaceutical composition or formulation of claim 33, wherein the capsule or tablet is enteric coated. 33: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated together as an enema formulation. 34: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated together as a suppository formulation. 35: The pharmaceutical composition or formulation of claim 25, wherein the colchicine, the nitroimidazole and the rifaximin are formulated together as an orally administered formulation.
| 1,600
|
338,057
| 16,799,673
| 2,664
|
A method is described to greatly improve the efficiency of and reduce the complexity of image compression when using single-sensor color imagers for video acquisition. The method in addition allows for this new image compression type to be compatible with existing video processing tools, improving the workflow for film and television production.
|
1.-21. (canceled) 22. A computerized method for compressing image data, comprising:
receiving raw sensor data captured by an imaging sensor, the raw sensor data comprising a plurality of imaging components, the plurality of imaging components comprising a first imaging component, a second imaging component, a third imaging component, and a fourth imaging component; determining a fifth imaging component based on a combination of the second imaging component and the third imaging component, the fifth imaging component comprising a first modified imaging component; determining a difference between the first imaging component and the fifth imaging component to produce a second modified imaging component; determining a difference between the fourth imaging component and the fifth imaging component to produce a third modified imaging component; encoding the first, second, and third modified imaging components. 23. The computerized method of claim 22, further comprising demosaicing a portion of the first, second, and third modified imaging components, the demosaicing comprising at least performing a de-Bayer operation. 24. The computerized method of claim 22, wherein:
the first imaging component comprises a red color component; the second imaging component comprises a first green color component; the third imaging component comprises a second green color component; and the fourth imaging component comprises a blue color component. 25. The computerized method of claim 22, wherein the encoding comprises algorithmically implementing at least one of a Discrete Cosine Transform (DCT)-based compression process or a wavelet-based compression process. 26. The computerized method of claim 22, wherein at least some of the plurality of imaging components comprise quarter-resolution images separated from a single full-resolution image associated with the raw sensor data. 27. The computerized method of claim 22, wherein the encoding comprises producing a preview image, the preview image comprising a quarter-resolution image. 28. The computerized method of claim 27, further comprising applying a real-time edit operation to the preview image. 29. The computerized method of claim 22, further comprising:
dividing a combination of (i) the difference between the first imaging component and the fifth imaging component and (ii) the fifth imaging component to produce a first image plane; dividing the fifth imaging component to produce a second image plane; dividing a combination of (i) the difference between the fourth imaging component and the fifth imaging component and (ii) the fifth imaging component to produce a third image plane; and interleaving the first, second, and third image planes to produce a decoded image. 30. The computerized method of claim 22, further comprising:
determining a difference between the two of the plurality of imaging components to produce a fourth modified imaging component; encoding the fourth modified imaging component. 31. A non-transitory computer-readable apparatus comprising a storage medium, the storage medium comprising a computer program having a plurality of instructions configured to, when executed by a processor apparatus, cause a computerized device to:
receive sensor data, the sensor data comprising a first imaging component, a second imaging component, a third imaging component, and a fourth imaging component; determine a fifth imaging component based at least on a sum of the second and third imaging components; determine a first modified image component based at least on a difference between the first imaging component and the fifth imaging component; determine a second modified image component based at least on a difference between the fourth imaging component and the fifth imaging component; and encode at least a portion of each of the first modified image component, the second modified image component, and the fifth imaging component. 32. The non-transitory computer-readable apparatus of claim 31, wherein:
the first imaging component comprises a red color component; the second imaging component comprises a first green color component; the third imaging component comprises a second green color component; and the fourth imaging component comprises a blue color component. 33. The non-transitory computer-readable apparatus of claim 31, wherein the plurality of instructions are further configured to, when executed by the processor apparatus, cause the computerized device to separate the received sensor data into the first, second, third, and fourth imaging components;
wherein the first, second, third, and fourth imaging components each comprises quarter-resolution images relative to one or more full-resolution images that are associated with the received sensor data. 34. The non-transitory computer-readable apparatus of claim 31, wherein the encode of the at least portion of the each of the first modified image component, the second modified image component, and the fifth imaging component is associated with reduced computational load relative to an encode of the one or more full-resolution images. 35. The non-transitory computer-readable apparatus of claim 31, wherein the plurality of instructions are further configured to, when executed by the processor apparatus, cause the computerized device to determine a third modified imaging component based on a difference between the second and third imaging components; and
wherein the encode comprises an encode of the third modified imaging component. 36. A computerized method for compressing high-definition image data, comprising:
receiving raw sensor data captured by an imaging sensor, the raw sensor data comprising a plurality of imaging components, the plurality of imaging components comprising a first imaging component, a second imaging component, a third imaging component, and a fourth imaging component, where the first, second, third, and fourth imaging components are associated with a source image having a native resolution; determining a fifth imaging component based at least on a combination of the second and third imaging components; decoding each of the first imaging component, the fourth imaging component, and the fifth imaging component to generate respective first, second, and third image data; and providing a preview version of the source image based at least on the first, second, and third image data. 37. The computerized method of claim 36, wherein the decoding of each of the first, fourth, and fifth imaging components comprises dividing each of the first, fourth, and fifth imaging components by a factor of two. 38. The computerized method of claim 37, further comprising:
reversing the dividing to recover the first, fourth, and fifth imaging components; and interleaving the recovered first, second, third, and fourth imaging components to generate the source image having the native resolution. 39. The computerized method of claim 36, wherein the preview version of the source image comprises a resolution that is one-fourth of that of the native resolution. 40. The computerized method of claim 39, further comprising converting the preview version to an imaging having the native resolution, the converting comprising applying at least one of (i) a bi-linear interpolation process or (ii) a pixel duplication process. 41. The computerized method of claim 36, wherein:
the first imaging component comprises a red color component; the second imaging component comprises a first green color component; the third imaging component comprises a second green color component; and the fourth imaging component comprises a blue color component.
|
A method is described to greatly improve the efficiency of and reduce the complexity of image compression when using single-sensor color imagers for video acquisition. The method in addition allows for this new image compression type to be compatible with existing video processing tools, improving the workflow for film and television production.1.-21. (canceled) 22. A computerized method for compressing image data, comprising:
receiving raw sensor data captured by an imaging sensor, the raw sensor data comprising a plurality of imaging components, the plurality of imaging components comprising a first imaging component, a second imaging component, a third imaging component, and a fourth imaging component; determining a fifth imaging component based on a combination of the second imaging component and the third imaging component, the fifth imaging component comprising a first modified imaging component; determining a difference between the first imaging component and the fifth imaging component to produce a second modified imaging component; determining a difference between the fourth imaging component and the fifth imaging component to produce a third modified imaging component; encoding the first, second, and third modified imaging components. 23. The computerized method of claim 22, further comprising demosaicing a portion of the first, second, and third modified imaging components, the demosaicing comprising at least performing a de-Bayer operation. 24. The computerized method of claim 22, wherein:
the first imaging component comprises a red color component; the second imaging component comprises a first green color component; the third imaging component comprises a second green color component; and the fourth imaging component comprises a blue color component. 25. The computerized method of claim 22, wherein the encoding comprises algorithmically implementing at least one of a Discrete Cosine Transform (DCT)-based compression process or a wavelet-based compression process. 26. The computerized method of claim 22, wherein at least some of the plurality of imaging components comprise quarter-resolution images separated from a single full-resolution image associated with the raw sensor data. 27. The computerized method of claim 22, wherein the encoding comprises producing a preview image, the preview image comprising a quarter-resolution image. 28. The computerized method of claim 27, further comprising applying a real-time edit operation to the preview image. 29. The computerized method of claim 22, further comprising:
dividing a combination of (i) the difference between the first imaging component and the fifth imaging component and (ii) the fifth imaging component to produce a first image plane; dividing the fifth imaging component to produce a second image plane; dividing a combination of (i) the difference between the fourth imaging component and the fifth imaging component and (ii) the fifth imaging component to produce a third image plane; and interleaving the first, second, and third image planes to produce a decoded image. 30. The computerized method of claim 22, further comprising:
determining a difference between the two of the plurality of imaging components to produce a fourth modified imaging component; encoding the fourth modified imaging component. 31. A non-transitory computer-readable apparatus comprising a storage medium, the storage medium comprising a computer program having a plurality of instructions configured to, when executed by a processor apparatus, cause a computerized device to:
receive sensor data, the sensor data comprising a first imaging component, a second imaging component, a third imaging component, and a fourth imaging component; determine a fifth imaging component based at least on a sum of the second and third imaging components; determine a first modified image component based at least on a difference between the first imaging component and the fifth imaging component; determine a second modified image component based at least on a difference between the fourth imaging component and the fifth imaging component; and encode at least a portion of each of the first modified image component, the second modified image component, and the fifth imaging component. 32. The non-transitory computer-readable apparatus of claim 31, wherein:
the first imaging component comprises a red color component; the second imaging component comprises a first green color component; the third imaging component comprises a second green color component; and the fourth imaging component comprises a blue color component. 33. The non-transitory computer-readable apparatus of claim 31, wherein the plurality of instructions are further configured to, when executed by the processor apparatus, cause the computerized device to separate the received sensor data into the first, second, third, and fourth imaging components;
wherein the first, second, third, and fourth imaging components each comprises quarter-resolution images relative to one or more full-resolution images that are associated with the received sensor data. 34. The non-transitory computer-readable apparatus of claim 31, wherein the encode of the at least portion of the each of the first modified image component, the second modified image component, and the fifth imaging component is associated with reduced computational load relative to an encode of the one or more full-resolution images. 35. The non-transitory computer-readable apparatus of claim 31, wherein the plurality of instructions are further configured to, when executed by the processor apparatus, cause the computerized device to determine a third modified imaging component based on a difference between the second and third imaging components; and
wherein the encode comprises an encode of the third modified imaging component. 36. A computerized method for compressing high-definition image data, comprising:
receiving raw sensor data captured by an imaging sensor, the raw sensor data comprising a plurality of imaging components, the plurality of imaging components comprising a first imaging component, a second imaging component, a third imaging component, and a fourth imaging component, where the first, second, third, and fourth imaging components are associated with a source image having a native resolution; determining a fifth imaging component based at least on a combination of the second and third imaging components; decoding each of the first imaging component, the fourth imaging component, and the fifth imaging component to generate respective first, second, and third image data; and providing a preview version of the source image based at least on the first, second, and third image data. 37. The computerized method of claim 36, wherein the decoding of each of the first, fourth, and fifth imaging components comprises dividing each of the first, fourth, and fifth imaging components by a factor of two. 38. The computerized method of claim 37, further comprising:
reversing the dividing to recover the first, fourth, and fifth imaging components; and interleaving the recovered first, second, third, and fourth imaging components to generate the source image having the native resolution. 39. The computerized method of claim 36, wherein the preview version of the source image comprises a resolution that is one-fourth of that of the native resolution. 40. The computerized method of claim 39, further comprising converting the preview version to an imaging having the native resolution, the converting comprising applying at least one of (i) a bi-linear interpolation process or (ii) a pixel duplication process. 41. The computerized method of claim 36, wherein:
the first imaging component comprises a red color component; the second imaging component comprises a first green color component; the third imaging component comprises a second green color component; and the fourth imaging component comprises a blue color component.
| 2,600
|
338,058
| 16,799,587
| 2,664
|
A portable electronic device for instant messaging is disclosed. One aspect of the invention involves a graphical user interface (GUI) on a portable electronic device with a touch screen display. The GUI has a set of messages exchanged between a user of the device and another person. The set of messages are displayed in a chronological order. In response to detecting a scrolling gesture comprising a substantially vertical movement of a user contact with the touch screen display, the display of messages are scrolled in accordance with a direction of the scrolling gesture. The detecting of the scrolling gesture is substantially independent of a horizontal position of the user contact with the touch screen display.
|
1. (canceled) 2. An electronic device, comprising:
a touch screen display; one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying, on the touch screen display, a message compose region that includes:
a text box for displaying characters of a message entered by a user; and
a virtual keyboard having a plurality of keys for entering characters in the text box;
while displaying the message compose region, detecting an input at a first location on the touch screen display; and
in response to detecting movement of the input from the first location on the touch screen display to a second location on the virtual keyboard, moving a displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard. 3. The electronic device of claim 2, wherein the insertion marker is displayed in the text box prior to detection of the input at the first location on the touch screen display. 4. The electronic device of claim 2, wherein moving the displayed insertion marker includes expanding a size of the insertion marker. 5. The electronic device of claim 2, wherein the input maintains contact with the touch screen display during the movement of the input from the first location to the second location. 6. The electronic device of claim 2, wherein the first location on the touch screen display corresponds to a location within the text box. 7. The electronic device of claim 2, the one or more programs further including instructions for:
after moving the displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard:
in response to detecting movement of the input from the second location on the virtual keyboard to a third location on the virtual keyboard, moving the displayed insertion marker in the text box as the input moves to the third location on the virtual keyboard. 8. The electronic device of claim 2, wherein:
the detected movement of the input has a horizontal component, and the displayed insertion marker moves in accordance with the horizontal component. 9. A non-transitory computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device with a touch screen display, the one or more programs including instructions for:
displaying, on the touch screen display, a message compose region that includes:
a text box for displaying characters of a message entered by a user; and
a virtual keyboard having a plurality of keys for entering characters in the text box;
while displaying the message compose region, detecting an input at a first location on the touch screen display; and in response to detecting movement of the input from the first location on the touch screen display to a second location on the virtual keyboard, moving a displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard. 10. The non-transitory computer-readable storage medium of claim 9, wherein the insertion marker is displayed in the text box prior to detection of the input at the first location on the touch screen display. 11. The non-transitory computer-readable storage medium of claim 9, wherein moving the displayed insertion marker includes expanding a size of the insertion marker. 12. The non-transitory computer-readable storage medium of claim 9, wherein the input maintains contact with the touch screen display during the movement of the input from the first location to the second location. 13. The non-transitory computer-readable storage medium of claim 9, wherein the first location on the touch screen display corresponds to a location within the text box. 14. The non-transitory computer-readably storage medium of claim 9, the one or more programs further including instructions for:
after moving the displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard:
in response to detecting movement of the input from the second location on the virtual keyboard to a third location on the virtual keyboard, moving the displayed insertion marker in the text box as the input moves to the third location on the virtual keyboard. 15. The non-transitory computer-readable storage medium of claim 9, wherein:
the detected movement of the input has a horizontal component, and the displayed insertion marker moves in accordance with the horizontal component. 16. A method, comprising:
at an electronic device with a touch screen display:
displaying, on the touch screen display, a message compose region that includes:
a text box for displaying characters of a message entered by a user; and
a virtual keyboard having a plurality of keys for entering characters in the text box;
while displaying the message compose region, detecting an input at a first location on the touch screen display; and
in response to detecting movement of the input from the first location on the touch screen display to a second location on the virtual keyboard, moving a displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard. 17. The method of claim 16, wherein the insertion marker is displayed in the text box prior to detection of the input at the first location on the touch screen display. 18. The method of claim 16, wherein moving the displayed insertion marker includes expanding a size of the insertion marker. 19. The method of claim 16, wherein the input maintains contact with the touch screen display during the movement of the input from the first location to the second location. 20. The method of claim 16, wherein the first location on the touch screen display corresponds to a location within the text box. 21. The method of claim 16, further comprising:
after moving the displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard:
in response to detecting movement of the input from the second location on the virtual keyboard to a third location on the virtual keyboard, moving the displayed insertion marker in the text box as the input moves to the third location on the virtual keyboard. 27. The method of claim 16, wherein:
the detected movement of the input has a horizontal component, and the displayed insertion marker moves in accordance with the horizontal component.
|
A portable electronic device for instant messaging is disclosed. One aspect of the invention involves a graphical user interface (GUI) on a portable electronic device with a touch screen display. The GUI has a set of messages exchanged between a user of the device and another person. The set of messages are displayed in a chronological order. In response to detecting a scrolling gesture comprising a substantially vertical movement of a user contact with the touch screen display, the display of messages are scrolled in accordance with a direction of the scrolling gesture. The detecting of the scrolling gesture is substantially independent of a horizontal position of the user contact with the touch screen display.1. (canceled) 2. An electronic device, comprising:
a touch screen display; one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying, on the touch screen display, a message compose region that includes:
a text box for displaying characters of a message entered by a user; and
a virtual keyboard having a plurality of keys for entering characters in the text box;
while displaying the message compose region, detecting an input at a first location on the touch screen display; and
in response to detecting movement of the input from the first location on the touch screen display to a second location on the virtual keyboard, moving a displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard. 3. The electronic device of claim 2, wherein the insertion marker is displayed in the text box prior to detection of the input at the first location on the touch screen display. 4. The electronic device of claim 2, wherein moving the displayed insertion marker includes expanding a size of the insertion marker. 5. The electronic device of claim 2, wherein the input maintains contact with the touch screen display during the movement of the input from the first location to the second location. 6. The electronic device of claim 2, wherein the first location on the touch screen display corresponds to a location within the text box. 7. The electronic device of claim 2, the one or more programs further including instructions for:
after moving the displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard:
in response to detecting movement of the input from the second location on the virtual keyboard to a third location on the virtual keyboard, moving the displayed insertion marker in the text box as the input moves to the third location on the virtual keyboard. 8. The electronic device of claim 2, wherein:
the detected movement of the input has a horizontal component, and the displayed insertion marker moves in accordance with the horizontal component. 9. A non-transitory computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device with a touch screen display, the one or more programs including instructions for:
displaying, on the touch screen display, a message compose region that includes:
a text box for displaying characters of a message entered by a user; and
a virtual keyboard having a plurality of keys for entering characters in the text box;
while displaying the message compose region, detecting an input at a first location on the touch screen display; and in response to detecting movement of the input from the first location on the touch screen display to a second location on the virtual keyboard, moving a displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard. 10. The non-transitory computer-readable storage medium of claim 9, wherein the insertion marker is displayed in the text box prior to detection of the input at the first location on the touch screen display. 11. The non-transitory computer-readable storage medium of claim 9, wherein moving the displayed insertion marker includes expanding a size of the insertion marker. 12. The non-transitory computer-readable storage medium of claim 9, wherein the input maintains contact with the touch screen display during the movement of the input from the first location to the second location. 13. The non-transitory computer-readable storage medium of claim 9, wherein the first location on the touch screen display corresponds to a location within the text box. 14. The non-transitory computer-readably storage medium of claim 9, the one or more programs further including instructions for:
after moving the displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard:
in response to detecting movement of the input from the second location on the virtual keyboard to a third location on the virtual keyboard, moving the displayed insertion marker in the text box as the input moves to the third location on the virtual keyboard. 15. The non-transitory computer-readable storage medium of claim 9, wherein:
the detected movement of the input has a horizontal component, and the displayed insertion marker moves in accordance with the horizontal component. 16. A method, comprising:
at an electronic device with a touch screen display:
displaying, on the touch screen display, a message compose region that includes:
a text box for displaying characters of a message entered by a user; and
a virtual keyboard having a plurality of keys for entering characters in the text box;
while displaying the message compose region, detecting an input at a first location on the touch screen display; and
in response to detecting movement of the input from the first location on the touch screen display to a second location on the virtual keyboard, moving a displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard. 17. The method of claim 16, wherein the insertion marker is displayed in the text box prior to detection of the input at the first location on the touch screen display. 18. The method of claim 16, wherein moving the displayed insertion marker includes expanding a size of the insertion marker. 19. The method of claim 16, wherein the input maintains contact with the touch screen display during the movement of the input from the first location to the second location. 20. The method of claim 16, wherein the first location on the touch screen display corresponds to a location within the text box. 21. The method of claim 16, further comprising:
after moving the displayed insertion marker in the text box as the input moves to the second location on the virtual keyboard:
in response to detecting movement of the input from the second location on the virtual keyboard to a third location on the virtual keyboard, moving the displayed insertion marker in the text box as the input moves to the third location on the virtual keyboard. 27. The method of claim 16, wherein:
the detected movement of the input has a horizontal component, and the displayed insertion marker moves in accordance with the horizontal component.
| 2,600
|
338,059
| 16,799,662
| 2,664
|
The present invention generally relates to novel bispecific antigen binding molecules for T cell activation and re-direction to specific target cells. In addition, the present invention relates to polynucleotides encoding such bispecific antigen binding molecules, and vectors and host cells comprising such polynucleotides. The invention further relates to methods for producing the bispecific antigen binding molecules of the invention, and to methods of using these bispecific antigen binding molecules in the treatment of disease.
|
1. A T cell activating bispecific antigen binding molecule comprising
(a) a first Fab molecule which specifically binds to a first antigen (b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other, wherein the first antigen is an activating T cell antigen and the second antigen is a target cell antigen, or the first antigen is a target cell antigen and the second antigen is an activating T cell antigen; and wherein i) in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index); or ii) in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 2. The T cell activating bispecific antigen binding molecule of claim 1, wherein the first antigen is a target cell antigen and the second antigen is an activating T cell antigen. 3. The T cell activating bispecific antigen binding molecule of claim 1, wherein the activating T cell antigen is CD3, particularly CD3 epsilon. 4. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 5. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 6. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat) and the amino acid at position 123 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 7. The T cell activating bispecific antigen binding molecule according to claim 6, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 8. The T cell activating bispecific antigen binding molecule according to claim 6, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the ammo acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 9. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 10. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 11. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat) and the amino acid at position 123 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 12. The T cell activating bispecific antigen binding molecule according to claim 11, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 13. The T cell activating bispecific antigen binding molecule according to claim 11, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 14. The T cell activating bispecific antigen binding molecule according to claim 1, further comprisng
c) a third Fab molecule which specifically binds to the first antigen. 15. The T cell activating bispecific antigen binding molecule according to claim 14, wherein the third Fab molecule is identical to the first Fab molecule. 16. The T cell activating bispecific antigen binding molecule according to claim 14, wherein the first and the third Fab molecule specifically bind to a target cell antigen, and the second Fab molecule specifically binds to an activating T cell antigen, particularly CD3, more particularly CD3 epsilon. 17. The T cell activating bispecific antigen binding molecule according to claim 1, additionally compnsmg
d) an Fc domain composed of a first and a second subunit capable of stable association. 18. The T cell activating bispecific antigen binding molecule according to claim 1, wherein the first and the second Fab molecule are fused to each other, optionally via a peptide linker. 19. The T cell activating bispecific antigen binding molecule according to claim 1, wherein (i) the second Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the first Fab molecule; or (ii) the first Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule. 20. The T cell activating bispecific antigen binding molecule of claim 19, wherein the Fab light chain of the first Fab molecule and the Fab light chain of the second Fab molecule are fused to each other, optionally via a peptide linker. 21. The T cell activating bispecific antigen binding molecule according to claim 17, wherein (i) the second Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the first or the second subunit of the Fc domain; (ii) the first Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the first or the second subunit of the Fc domain; (iii) the first and the second Fab molecule are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain; and/or (iv) the third Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the first or second subunit of the Fc domain. 22. The T cell activating bispecific antigen binding molecule of claim 1 7, wherein the second and the third Fab molecule are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain, and the first Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule. 23. The T cell activating bispecific antigen binding molecule according to claim 17, wherein the first and the third Fab molecule are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain, and the second Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the first Fab molecule. 24. The T cell activating bispecific antigen binding molecule according to claim 23, wherein the first and the third Fab molecule and the Fc domain are part of an immunoglobulin molecule, particularly an IgG class immunoglobulin. 25. A T cell activating bispecific antigen binding molecule comprising
a) a first Fab molecule which specifically binds to a first antigen; b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other; c) a third Fab molecule which specifically binds to the first antigen; and d) an Fc domain composed of a first and a second subunit capable of stable association; wherein the first antigen is a target cell antigen and the second antigen is an activating T cell antigen, particularly CD3, more particularly CD3 epsilon; wherein the third Fab molecule under c) is identical to the first Fab molecule under a); wherein in the constant domain CL of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) or lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index); and wherein (i) the first Fab molecule under a) is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule under b), and the second Fab molecule under b) and the third Fab molecule under c) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under d), or (ii) the second Fab molecule under b) is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the first Fab molecule under a), and the first Fab molecule under a) and the third Fab molecule under c) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under d). 26. A T cell activating bispecific antigen binding molecule comprising
a) a first Fab molecule which specifically binds to a first antigen; b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other; and c) an Fc domain composed of a first and a second subunit capable of stable association; wherein (i) the first antigen is a target cell antigen and the second antigen is an activating T cell antigen, particularly CD3, more particularly CD3 epsilon; or (ii) the second antigen is a target cell antigen and the first antigen is an activating T cell antigen, particularly CD3, more particularly CD3 epsilon; wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) or lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index); and wherein the first Fab molecule under a) and the second Fab molecule under b) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under c). 27. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the activating T cell antigen is CD3, particularly CD3 epsilon, and the Fab molecule which specifically binds to the activating T cell antigen comprises the heavy chain complementarity determining region (CDR) 1 of SEQ ID NO: 4, the heavy chain CDR 2 of SEQ ID NO: 5, the heavy chain CDR 3 of SEQ ID NO: 6, the light chain CDR 1 of SEQ ID NO: 8, the light chain CDR 2 of SEQ ID NO: 9 and the light chain CDR 3 of SEQ ID NO: 10. 28. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the activating T cell antigen is CD3, particularly CD3 epsilon, and the Fab molecule which specifically binds to the activating T cell antigen comprises a heavy chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 3 and a light chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 7. 29. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the target cell antigen is CD20 and the Fab molecule which specifically binds to the target cell antigen comprises the heavy chain complementarity determining region (CDR) 1 of SEQ ID NO: 46, the heavy chain CDR 2 of SEQ ID NO: 47, the heavy chain CDR 3 of SEQ ID NO: 48, the light chain CDR 1 of SEQ ID NO: 49, the light chain CDR 2 of SEQ ID NO: 50 and the light chain CDR 3 of SEQ ID NO: 51. 30. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the target cell antigen is CD20 and the Fab molecule which specifically binds to the target cell antigen comprises a heavy chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 30 and a light chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 31. 31. A T cell activating bispecific antigen binding molecule comprising
a) a first Fab molecule which specifically binds to a first antigen; b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other; c) a third Fab molecule which specifically binds to the first antigen; and d) an Fc domain composed of a first and a second subunit capable of stable association; wherein (i) the first antigen is CD20 and the second antigen is CD3, particularly CD3 epsilon; (ii) the first Fab molecule under a) and the third Fab molecule under c) each comprise the heavy chain complementarity determining region (CDR) 1 of SEQ ID NO: 46, the heavy chain CDR 2 of SEQ ID NO: 47, the heavy chain CDR 3 of SEQ ID NO: 48, the light chain CDR 1 of SEQ ID NO: 49, the light chain CDR 2 of SEQ ID NO: 50 and the light chain CDR 3 of SEQ ID NO: 51, and the second Fab molecule under b) comprises the heavy chain CDR 1 of SEQ ID NO: 4, the heavy chain CDR 2 of SEQ ID NO: 5, the heavy chain CDR 3 of SEQ ID NO: 6, the light chain CDR 1 of SEQ ID NO: 8, the light chain CDR 2 of SEQ ID NO: 9 and the light chain CDR 3 of SEQ ID NO: 10; (iii) in the constant domain CL of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by lysine (K) or arginine (R), particularly by arginine (R) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index); and (iv) the first Fab molecule under a) is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule under b), and the second Fab molecule under b) and the third Fab molecule under c) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under d). 32. The T cell activating bispecific antigen binding molecule of claim 31, wherein the first Fab molecule under a) and the third Fab molecule under c) each comprise a heavy chain variable region comprising the amino acid sequence of SEQ ID NO: 30 and a light chain variable region comprising the amino acid sequence of SEQ ID NO: 31. 33. The T cell activating bispecific antigen binding molecule of claim 31, wherein the second Fab molecule under b) comprises a heavy chain variable region comprising the amino acid sequence of SEQ ID NO: 3 and a light chain variable region comprising the amino acid sequence of SEQ ID NO: 7. 34. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain is an IgG, specifically an IgG1 or IgG4, Fc domain. 35. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain is a human Fc domain. 36. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain comprises a modification promoting the association of the first and the second subunit of the Fc domain. 37. The T cell activating bispecific antigen binding molecule of claim 34, wherein in the CH3 domain of the first subunit of the Fc domain an amino acid residue is replaced with an amino acid residue having a larger side chain volume, thereby generating a protuberance within the CH3 domain of the first subunit which is positionable in a cavity within the CH3 domain of the second subunit, and in the CH3 domain of the second subunit of the Fc domain an amino acid residue is replaced with an amino acid residue having a smaller side chain volume, thereby generating a cavity within the CH3 domain of the second subunit within which the protuberance within the CH3 domain of the first subunit is positionable. 38. The T cell activating bispecific antigen binding molecule of claim 37, wherein said amino acid residue having a larger side chain volume is selected from the group consisting of arginine (R), phenylalanine (F), tyrosine (Y), and tryptophan (W), and said amino acid residue having a smaller side chain volume is selected from the group consisting of alanine (A), serine (S), threonine (T), and valine (V). 39. The T cell activating bispecific antigen binding molecule of claim 37, wherein in the CH3 domain of the first subunit of the Fc domain the threonine residue at position 366 is replaced with a tryptophan residue (T366W), and in the CH3 domain of the second subunit of the Fc domain the tyrosine residue at position 407 is replaced with a valine residue (Y407V), and optionally in the second subunit of the Fc domain additionally the threonine residue at position 366 is replaced with a serine residue (T366S) and the leucine residue at position 368 is replaced with an alanine residue (L368A) (numberings according to Kabat EU index). 40. The T cell activating bispecific antigen binding molecule of claim 37, wherein in the first subunit of the Fc domain additionally the serine residue at position 354 is replaced with a cysteine residue (S354C) or the glutamic acid residue at position 356 is replaced with a cysteine residue (E356C), and in the second subunit of the Fc domain additionally the tyrosine residue at position 349 is replaced by a cysteine residue (Y349C) (numberings according to Kabat EU index). 41. The T cell activating bispecific antigen binding molecule of claim 37, wherein the first subunit of the Fc domain comprises amino acid substitutions S354C and T366W, and the second subunit of the Fc domain comprises amino acid substitutions Y349C, T366S, L368A and Y407V (numbering according to Kabat EU index). 42. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain exhibits reduced binding affinity to an Fc receptor and/or reduced effector function, as compared to a native IgG1 Fc domain. 43. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain comprises one or more amino acid substitution that reduces binding to an Fc receptor and/or effector function. 44. The T cell activating bispecific antigen binding molecule according to claim 43, wherein said one or more amino acid substitution is at one or more position selected from the group of L234, L235, and P329 (Kabat EU index numbering). 45. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein each subunit of the Fc domain comprises three amino acid substitutions that reduce binding to an activating Fc receptor and/or effector function wherein said amino acid substitutions are L234A, L235A and P329G (Kabat EU index numbering). 46. The T cell activating bispecific antigen binding molecule of claim 42, wherein the Fc receptor is an Fcγ receptor. 47. The T cell activating bispecific antigen binding molecule of claim 42, wherein the effector function is antibody-dependent cell-mediated cytotoxicity (ADCC). 48. One or more isolated polynucleotide encoding the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31. 49. A host cell comprising the polynucleotide(s) of claim 48. 50. A method of producing a T cell activating bispecific antigen binding molecule capable of specific binding to CD3 and a target cell antigen, comprising the steps of a) culturing the host cell of claim 49 under conditions suitable for the expression of the T cell activating bispecific antigen binding molecule and b) recovering the T cell activating bispecific antigen binding molecule. 51. A T cell activating bispecific antigen binding molecule produced by the method of claim 50. 52. A pharmaceutical composition comprising the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31 and a pharmaceutically acceptable carrier. 53. A method of treating a disease in an individual, comprising administering to said individual a therapeutically effective amount of a composition comprising the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31 in a pharmaceutically acceptable form. 54. The method of claim 53, wherein said disease is cancer. 55. A method for inducing lysis of a target cell, comprising contacting a target cell with the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31 in the presence of a T cell.
|
The present invention generally relates to novel bispecific antigen binding molecules for T cell activation and re-direction to specific target cells. In addition, the present invention relates to polynucleotides encoding such bispecific antigen binding molecules, and vectors and host cells comprising such polynucleotides. The invention further relates to methods for producing the bispecific antigen binding molecules of the invention, and to methods of using these bispecific antigen binding molecules in the treatment of disease.1. A T cell activating bispecific antigen binding molecule comprising
(a) a first Fab molecule which specifically binds to a first antigen (b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other, wherein the first antigen is an activating T cell antigen and the second antigen is a target cell antigen, or the first antigen is a target cell antigen and the second antigen is an activating T cell antigen; and wherein i) in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index); or ii) in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 2. The T cell activating bispecific antigen binding molecule of claim 1, wherein the first antigen is a target cell antigen and the second antigen is an activating T cell antigen. 3. The T cell activating bispecific antigen binding molecule of claim 1, wherein the activating T cell antigen is CD3, particularly CD3 epsilon. 4. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 5. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 6. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat) and the amino acid at position 123 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 7. The T cell activating bispecific antigen binding molecule according to claim 6, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 8. The T cell activating bispecific antigen binding molecule according to claim 6, wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the ammo acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 9. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 or the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 10. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 11. The T cell activating bispecific antigen binding molecule according to claim 1, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat) and the amino acid at position 123 is substituted independently by lysine (K), arginine (R) or histidine (H) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted independently by glutamic acid (E), or aspartic acid (D) (numbering according to Kabat EU index). 12. The T cell activating bispecific antigen binding molecule according to claim 11, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 13. The T cell activating bispecific antigen binding molecule according to claim 11, wherein in the constant domain CL of the second Fab molecule under b) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the second Fab molecule under b) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index). 14. The T cell activating bispecific antigen binding molecule according to claim 1, further comprisng
c) a third Fab molecule which specifically binds to the first antigen. 15. The T cell activating bispecific antigen binding molecule according to claim 14, wherein the third Fab molecule is identical to the first Fab molecule. 16. The T cell activating bispecific antigen binding molecule according to claim 14, wherein the first and the third Fab molecule specifically bind to a target cell antigen, and the second Fab molecule specifically binds to an activating T cell antigen, particularly CD3, more particularly CD3 epsilon. 17. The T cell activating bispecific antigen binding molecule according to claim 1, additionally compnsmg
d) an Fc domain composed of a first and a second subunit capable of stable association. 18. The T cell activating bispecific antigen binding molecule according to claim 1, wherein the first and the second Fab molecule are fused to each other, optionally via a peptide linker. 19. The T cell activating bispecific antigen binding molecule according to claim 1, wherein (i) the second Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the first Fab molecule; or (ii) the first Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule. 20. The T cell activating bispecific antigen binding molecule of claim 19, wherein the Fab light chain of the first Fab molecule and the Fab light chain of the second Fab molecule are fused to each other, optionally via a peptide linker. 21. The T cell activating bispecific antigen binding molecule according to claim 17, wherein (i) the second Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the first or the second subunit of the Fc domain; (ii) the first Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the first or the second subunit of the Fc domain; (iii) the first and the second Fab molecule are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain; and/or (iv) the third Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the first or second subunit of the Fc domain. 22. The T cell activating bispecific antigen binding molecule of claim 1 7, wherein the second and the third Fab molecule are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain, and the first Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule. 23. The T cell activating bispecific antigen binding molecule according to claim 17, wherein the first and the third Fab molecule are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain, and the second Fab molecule is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the first Fab molecule. 24. The T cell activating bispecific antigen binding molecule according to claim 23, wherein the first and the third Fab molecule and the Fc domain are part of an immunoglobulin molecule, particularly an IgG class immunoglobulin. 25. A T cell activating bispecific antigen binding molecule comprising
a) a first Fab molecule which specifically binds to a first antigen; b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other; c) a third Fab molecule which specifically binds to the first antigen; and d) an Fc domain composed of a first and a second subunit capable of stable association; wherein the first antigen is a target cell antigen and the second antigen is an activating T cell antigen, particularly CD3, more particularly CD3 epsilon; wherein the third Fab molecule under c) is identical to the first Fab molecule under a); wherein in the constant domain CL of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) or lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index); and wherein (i) the first Fab molecule under a) is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule under b), and the second Fab molecule under b) and the third Fab molecule under c) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under d), or (ii) the second Fab molecule under b) is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the first Fab molecule under a), and the first Fab molecule under a) and the third Fab molecule under c) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under d). 26. A T cell activating bispecific antigen binding molecule comprising
a) a first Fab molecule which specifically binds to a first antigen; b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other; and c) an Fc domain composed of a first and a second subunit capable of stable association; wherein (i) the first antigen is a target cell antigen and the second antigen is an activating T cell antigen, particularly CD3, more particularly CD3 epsilon; or (ii) the second antigen is a target cell antigen and the first antigen is an activating T cell antigen, particularly CD3, more particularly CD3 epsilon; wherein in the constant domain CL of the first Fab molecule under a) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by arginine (R) or lysine (K) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index); and wherein the first Fab molecule under a) and the second Fab molecule under b) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under c). 27. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the activating T cell antigen is CD3, particularly CD3 epsilon, and the Fab molecule which specifically binds to the activating T cell antigen comprises the heavy chain complementarity determining region (CDR) 1 of SEQ ID NO: 4, the heavy chain CDR 2 of SEQ ID NO: 5, the heavy chain CDR 3 of SEQ ID NO: 6, the light chain CDR 1 of SEQ ID NO: 8, the light chain CDR 2 of SEQ ID NO: 9 and the light chain CDR 3 of SEQ ID NO: 10. 28. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the activating T cell antigen is CD3, particularly CD3 epsilon, and the Fab molecule which specifically binds to the activating T cell antigen comprises a heavy chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 3 and a light chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 7. 29. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the target cell antigen is CD20 and the Fab molecule which specifically binds to the target cell antigen comprises the heavy chain complementarity determining region (CDR) 1 of SEQ ID NO: 46, the heavy chain CDR 2 of SEQ ID NO: 47, the heavy chain CDR 3 of SEQ ID NO: 48, the light chain CDR 1 of SEQ ID NO: 49, the light chain CDR 2 of SEQ ID NO: 50 and the light chain CDR 3 of SEQ ID NO: 51. 30. The T cell activating bispecific antigen binding molecule according to claim 1, 25 or 26, wherein the target cell antigen is CD20 and the Fab molecule which specifically binds to the target cell antigen comprises a heavy chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 30 and a light chain variable region comprising an amino acid sequence that is at least about 95%, 96%, 97%, 98%, 99% or 100% identical to the amino acid sequence of SEQ ID NO: 31. 31. A T cell activating bispecific antigen binding molecule comprising
a) a first Fab molecule which specifically binds to a first antigen; b) a second Fab molecule which specifically binds to a second antigen, and wherein the variable domains VL and VH of the Fab light chain and the Fab heavy chain are replaced by each other; c) a third Fab molecule which specifically binds to the first antigen; and d) an Fc domain composed of a first and a second subunit capable of stable association; wherein (i) the first antigen is CD20 and the second antigen is CD3, particularly CD3 epsilon; (ii) the first Fab molecule under a) and the third Fab molecule under c) each comprise the heavy chain complementarity determining region (CDR) 1 of SEQ ID NO: 46, the heavy chain CDR 2 of SEQ ID NO: 47, the heavy chain CDR 3 of SEQ ID NO: 48, the light chain CDR 1 of SEQ ID NO: 49, the light chain CDR 2 of SEQ ID NO: 50 and the light chain CDR 3 of SEQ ID NO: 51, and the second Fab molecule under b) comprises the heavy chain CDR 1 of SEQ ID NO: 4, the heavy chain CDR 2 of SEQ ID NO: 5, the heavy chain CDR 3 of SEQ ID NO: 6, the light chain CDR 1 of SEQ ID NO: 8, the light chain CDR 2 of SEQ ID NO: 9 and the light chain CDR 3 of SEQ ID NO: 10; (iii) in the constant domain CL of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 124 is substituted by lysine (K) (numbering according to Kabat) and the amino acid at position 123 is substituted by lysine (K) or arginine (R), particularly by arginine (R) (numbering according to Kabat), and wherein in the constant domain CH1 of the first Fab molecule under a) and the third Fab molecule under c) the amino acid at position 147 is substituted by glutamic acid (E) (numbering according to Kabat EU index) and the amino acid at position 213 is substituted by glutamic acid (E) (numbering according to Kabat EU index); and (iv) the first Fab molecule under a) is fused at the C-terminus of the Fab heavy chain to the N-terminus of the Fab heavy chain of the second Fab molecule under b), and the second Fab molecule under b) and the third Fab molecule under c) are each fused at the C-terminus of the Fab heavy chain to the N-terminus of one of the subunits of the Fc domain under d). 32. The T cell activating bispecific antigen binding molecule of claim 31, wherein the first Fab molecule under a) and the third Fab molecule under c) each comprise a heavy chain variable region comprising the amino acid sequence of SEQ ID NO: 30 and a light chain variable region comprising the amino acid sequence of SEQ ID NO: 31. 33. The T cell activating bispecific antigen binding molecule of claim 31, wherein the second Fab molecule under b) comprises a heavy chain variable region comprising the amino acid sequence of SEQ ID NO: 3 and a light chain variable region comprising the amino acid sequence of SEQ ID NO: 7. 34. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain is an IgG, specifically an IgG1 or IgG4, Fc domain. 35. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain is a human Fc domain. 36. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain comprises a modification promoting the association of the first and the second subunit of the Fc domain. 37. The T cell activating bispecific antigen binding molecule of claim 34, wherein in the CH3 domain of the first subunit of the Fc domain an amino acid residue is replaced with an amino acid residue having a larger side chain volume, thereby generating a protuberance within the CH3 domain of the first subunit which is positionable in a cavity within the CH3 domain of the second subunit, and in the CH3 domain of the second subunit of the Fc domain an amino acid residue is replaced with an amino acid residue having a smaller side chain volume, thereby generating a cavity within the CH3 domain of the second subunit within which the protuberance within the CH3 domain of the first subunit is positionable. 38. The T cell activating bispecific antigen binding molecule of claim 37, wherein said amino acid residue having a larger side chain volume is selected from the group consisting of arginine (R), phenylalanine (F), tyrosine (Y), and tryptophan (W), and said amino acid residue having a smaller side chain volume is selected from the group consisting of alanine (A), serine (S), threonine (T), and valine (V). 39. The T cell activating bispecific antigen binding molecule of claim 37, wherein in the CH3 domain of the first subunit of the Fc domain the threonine residue at position 366 is replaced with a tryptophan residue (T366W), and in the CH3 domain of the second subunit of the Fc domain the tyrosine residue at position 407 is replaced with a valine residue (Y407V), and optionally in the second subunit of the Fc domain additionally the threonine residue at position 366 is replaced with a serine residue (T366S) and the leucine residue at position 368 is replaced with an alanine residue (L368A) (numberings according to Kabat EU index). 40. The T cell activating bispecific antigen binding molecule of claim 37, wherein in the first subunit of the Fc domain additionally the serine residue at position 354 is replaced with a cysteine residue (S354C) or the glutamic acid residue at position 356 is replaced with a cysteine residue (E356C), and in the second subunit of the Fc domain additionally the tyrosine residue at position 349 is replaced by a cysteine residue (Y349C) (numberings according to Kabat EU index). 41. The T cell activating bispecific antigen binding molecule of claim 37, wherein the first subunit of the Fc domain comprises amino acid substitutions S354C and T366W, and the second subunit of the Fc domain comprises amino acid substitutions Y349C, T366S, L368A and Y407V (numbering according to Kabat EU index). 42. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain exhibits reduced binding affinity to an Fc receptor and/or reduced effector function, as compared to a native IgG1 Fc domain. 43. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein the Fc domain comprises one or more amino acid substitution that reduces binding to an Fc receptor and/or effector function. 44. The T cell activating bispecific antigen binding molecule according to claim 43, wherein said one or more amino acid substitution is at one or more position selected from the group of L234, L235, and P329 (Kabat EU index numbering). 45. The T cell activating bispecific antigen binding molecule according to claim 17, 25, 26 or 31, wherein each subunit of the Fc domain comprises three amino acid substitutions that reduce binding to an activating Fc receptor and/or effector function wherein said amino acid substitutions are L234A, L235A and P329G (Kabat EU index numbering). 46. The T cell activating bispecific antigen binding molecule of claim 42, wherein the Fc receptor is an Fcγ receptor. 47. The T cell activating bispecific antigen binding molecule of claim 42, wherein the effector function is antibody-dependent cell-mediated cytotoxicity (ADCC). 48. One or more isolated polynucleotide encoding the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31. 49. A host cell comprising the polynucleotide(s) of claim 48. 50. A method of producing a T cell activating bispecific antigen binding molecule capable of specific binding to CD3 and a target cell antigen, comprising the steps of a) culturing the host cell of claim 49 under conditions suitable for the expression of the T cell activating bispecific antigen binding molecule and b) recovering the T cell activating bispecific antigen binding molecule. 51. A T cell activating bispecific antigen binding molecule produced by the method of claim 50. 52. A pharmaceutical composition comprising the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31 and a pharmaceutically acceptable carrier. 53. A method of treating a disease in an individual, comprising administering to said individual a therapeutically effective amount of a composition comprising the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31 in a pharmaceutically acceptable form. 54. The method of claim 53, wherein said disease is cancer. 55. A method for inducing lysis of a target cell, comprising contacting a target cell with the T cell activating bispecific antigen binding molecule of claim 1, 25, 26 or 31 in the presence of a T cell.
| 2,600
|
338,060
| 16,799,665
| 2,848
|
A waterproof casing for packaging a circuit board is provided. The circuit board comprises an antenna. The waterproof casing comprises a metallic casing, a non-metallic end cover and a sealing gasket. The metallic casing comprises an accommodation space and a side opening in communication with each other. The accommodation space is configured to accommodate the circuit board. The antenna is adjacent to the side opening. The non-metallic end cover covers the side opening and combined with the metallic casing to form a sealed box. The non-metallic end cover comprises a ring-shaped install portion disposed on a surface thereof and extending outwardly from the surface. The ring-shaped install portion is disposed in the accommodation space as the non-metallic end cover covers the side opening. The sealing gasket is disposed around the ring-shaped install portion. A joint between the metallic casing and the non-metallic end cover is sealed by the sealing gasket.
|
1. A waterproof casing for packaging a circuit board, the circuit board comprising an antenna, the waterproof casing comprising:
a metallic casing comprising an accommodation space and a side opening in communication with each other, wherein the accommodation space is configured to accommodate at least part of the circuit board, and the antenna is adjacent to the side opening; a non-metallic end cover covering the side opening and combined with the metallic casing to form a sealed box, wherein the non-metallic end cover comprises a ring-shaped install portion disposed on a surface thereof and extending outwardly from the surface thereof, wherein the ring-shaped install portion is disposed in the accommodation space as the non-metallic end cover covers the side opening; and a sealing gasket disposed around the ring-shaped install portion of the non-metallic end cover, wherein a joint between the metallic casing and the non-metallic end cover is sealed by the sealing gasket. 2. The waterproof casing according to claim 1, wherein the non-metallic end cover is made of polycarbonate-siloxane copolymer material. 3. The waterproof casing according to claim 1, wherein the antenna disposed on the circuit board is in parallel with the surface of the non-metallic end cover. 4. The waterproof casing according to claim 1, further comprising at least one fixing member, wherein the non-metallic end cover comprises at least one first through hole, the sealing gasket comprises at least one second through hole, and the metallic casing comprises at least one third through hole, wherein the at least one first through hole, the at least one second through hole and the at least one third through hole are aligned to each other, wherein each of the at least one fixing member is penetrated through the corresponding first through hole, the corresponding second through hole and the corresponding third through hole, and the fixing member is fixed within the corresponding third through hole, so that the non-metallic end cover and the sealing gasket are fixed to the metallic casing. 5. The waterproof casing according to claim 1, wherein the ring-shaped install portion comprises a surrounding groove, and the surrounding groove is concavely formed on an outer surface of the ring-shaped install portion, wherein the sealing gasket comprises an engaging part, the engaging part of the sealing gasket is disposed within and engaged with the surrounding groove, so that the sealing gasket is fixed on the ring-shaped install portion.
|
A waterproof casing for packaging a circuit board is provided. The circuit board comprises an antenna. The waterproof casing comprises a metallic casing, a non-metallic end cover and a sealing gasket. The metallic casing comprises an accommodation space and a side opening in communication with each other. The accommodation space is configured to accommodate the circuit board. The antenna is adjacent to the side opening. The non-metallic end cover covers the side opening and combined with the metallic casing to form a sealed box. The non-metallic end cover comprises a ring-shaped install portion disposed on a surface thereof and extending outwardly from the surface. The ring-shaped install portion is disposed in the accommodation space as the non-metallic end cover covers the side opening. The sealing gasket is disposed around the ring-shaped install portion. A joint between the metallic casing and the non-metallic end cover is sealed by the sealing gasket.1. A waterproof casing for packaging a circuit board, the circuit board comprising an antenna, the waterproof casing comprising:
a metallic casing comprising an accommodation space and a side opening in communication with each other, wherein the accommodation space is configured to accommodate at least part of the circuit board, and the antenna is adjacent to the side opening; a non-metallic end cover covering the side opening and combined with the metallic casing to form a sealed box, wherein the non-metallic end cover comprises a ring-shaped install portion disposed on a surface thereof and extending outwardly from the surface thereof, wherein the ring-shaped install portion is disposed in the accommodation space as the non-metallic end cover covers the side opening; and a sealing gasket disposed around the ring-shaped install portion of the non-metallic end cover, wherein a joint between the metallic casing and the non-metallic end cover is sealed by the sealing gasket. 2. The waterproof casing according to claim 1, wherein the non-metallic end cover is made of polycarbonate-siloxane copolymer material. 3. The waterproof casing according to claim 1, wherein the antenna disposed on the circuit board is in parallel with the surface of the non-metallic end cover. 4. The waterproof casing according to claim 1, further comprising at least one fixing member, wherein the non-metallic end cover comprises at least one first through hole, the sealing gasket comprises at least one second through hole, and the metallic casing comprises at least one third through hole, wherein the at least one first through hole, the at least one second through hole and the at least one third through hole are aligned to each other, wherein each of the at least one fixing member is penetrated through the corresponding first through hole, the corresponding second through hole and the corresponding third through hole, and the fixing member is fixed within the corresponding third through hole, so that the non-metallic end cover and the sealing gasket are fixed to the metallic casing. 5. The waterproof casing according to claim 1, wherein the ring-shaped install portion comprises a surrounding groove, and the surrounding groove is concavely formed on an outer surface of the ring-shaped install portion, wherein the sealing gasket comprises an engaging part, the engaging part of the sealing gasket is disposed within and engaged with the surrounding groove, so that the sealing gasket is fixed on the ring-shaped install portion.
| 2,800
|
338,061
| 16,799,717
| 2,848
|
The technology in accordance with embodiments of the present technology provides a hybrid fiber reinforced material comprising a plurality of conditioned bamboo fibers, a plurality of carbon fibers arranged with the plurality of conditioned bamboo fibers, and a resin matrix encapsulating the arrangement of conditioned bamboo fibers and carbon fibers. The encapsulated arrangement can be formed when heated a first time into a first shape and cooled a first time. The encapsulated arrangement can be reformable into a second shape different than the first shape when heated a second time and cooled a second time.
|
1. A hybrid fiber reinforced material, comprising:
a plurality of conditioned bamboo fibers; a plurality of carbon fibers arranged with the plurality of conditioned bamboo fibers; and a resin matrix encapsulating the arrangement of conditioned bamboo fibers and carbon fibers. 2. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers each comprise up to approximately 20% by weight of the material. 3. The material of claim 1 wherein the conditioned bamboo fibers are arranged in a random pattern relative to each other. 4. The material of claim 1 wherein the conditioned bamboo fibers are arranged in a parallel orientation relative to each other. 5. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed as pellets. 6. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed as extruded sheets. 7. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed as sheets. 8. The material of claim 1 wherein the conditioned bamboo fibers comprise a matt of interconnected bamboo fibers 9. The material of claim 1 wherein the conditioned bamboo fibers have a length in the range of 0.25″-12.0″ 10. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers have substantially the same length. 11. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers have different lengths. 12. The material of claim 1 wherein the resin matrix is a poly propylene or vinyl Ester resin. 13. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed in a first shape and are configured to be heated and remolded into a second shape different than the first shape. 14. A reformable hybrid fiber reinforced material comprising:
conditioned bamboo fibers arranged with a plurality of carbon fibers; and a resin matrix encapsulating the arrangement of conditioned bamboo fibers and carbon fibers, wherein the encapsulated arrangement is formed when heated a first time into a first shape and cooled a first time; and wherein the encapsulated arrangement is reformable into a second shape different than the first shape when heated a second time and cooled a second time. 15. The material of claim 14 wherein the conditioned bamboo fibers and the carbon fibers each comprise up to approximately 20% by weight of the material. 16. The material of claim 14 wherein the conditioned bamboo fibers are arranged in a random pattern relative to each other. 17. The material of claim 14 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers in the first shape are in sheet format. 18. The material of claim 14 wherein the conditioned bamboo fibers comprise a matt of interconnected bamboo fibers 19. The material of claim 14 wherein the conditioned bamboo fibers have a length in the range of 0.25″-12.0″ 20. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers have substantially the same length.
|
The technology in accordance with embodiments of the present technology provides a hybrid fiber reinforced material comprising a plurality of conditioned bamboo fibers, a plurality of carbon fibers arranged with the plurality of conditioned bamboo fibers, and a resin matrix encapsulating the arrangement of conditioned bamboo fibers and carbon fibers. The encapsulated arrangement can be formed when heated a first time into a first shape and cooled a first time. The encapsulated arrangement can be reformable into a second shape different than the first shape when heated a second time and cooled a second time.1. A hybrid fiber reinforced material, comprising:
a plurality of conditioned bamboo fibers; a plurality of carbon fibers arranged with the plurality of conditioned bamboo fibers; and a resin matrix encapsulating the arrangement of conditioned bamboo fibers and carbon fibers. 2. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers each comprise up to approximately 20% by weight of the material. 3. The material of claim 1 wherein the conditioned bamboo fibers are arranged in a random pattern relative to each other. 4. The material of claim 1 wherein the conditioned bamboo fibers are arranged in a parallel orientation relative to each other. 5. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed as pellets. 6. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed as extruded sheets. 7. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed as sheets. 8. The material of claim 1 wherein the conditioned bamboo fibers comprise a matt of interconnected bamboo fibers 9. The material of claim 1 wherein the conditioned bamboo fibers have a length in the range of 0.25″-12.0″ 10. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers have substantially the same length. 11. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers have different lengths. 12. The material of claim 1 wherein the resin matrix is a poly propylene or vinyl Ester resin. 13. The material of claim 1 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers are formed in a first shape and are configured to be heated and remolded into a second shape different than the first shape. 14. A reformable hybrid fiber reinforced material comprising:
conditioned bamboo fibers arranged with a plurality of carbon fibers; and a resin matrix encapsulating the arrangement of conditioned bamboo fibers and carbon fibers, wherein the encapsulated arrangement is formed when heated a first time into a first shape and cooled a first time; and wherein the encapsulated arrangement is reformable into a second shape different than the first shape when heated a second time and cooled a second time. 15. The material of claim 14 wherein the conditioned bamboo fibers and the carbon fibers each comprise up to approximately 20% by weight of the material. 16. The material of claim 14 wherein the conditioned bamboo fibers are arranged in a random pattern relative to each other. 17. The material of claim 14 wherein the resin encapsulated conditioned bamboo fibers and carbon fibers in the first shape are in sheet format. 18. The material of claim 14 wherein the conditioned bamboo fibers comprise a matt of interconnected bamboo fibers 19. The material of claim 14 wherein the conditioned bamboo fibers have a length in the range of 0.25″-12.0″ 20. The material of claim 1 wherein the conditioned bamboo fibers and the carbon fibers have substantially the same length.
| 2,800
|
338,062
| 16,799,720
| 2,848
|
A system and method for automatic beamforming comprising detecting a target location set by a user, configuring a strength, a propagation delay and a steering angle of the sound beam based on the user-defined target location and steering the sound beam to the user-defined target location.
|
1. A method, comprising:
detecting at least one object in a listening environment; identifying a designated user from the at least one detected object, the user is distinguished from any other objects in the listening environment, is an object to be tracked, and is designated to have sole ability to set a target location in the listening environment; detecting the target location for the listening environment set by the designated user; configuring a strength, a propagation delay and a steering angle of a sound beam based on the target location set by the designated user; setting the target location to a location set by the designated user; and steering the sound beam to the user-defined target location. 2. (canceled) 3. The method of claim 1, wherein identifying the user further comprises detecting a first gesture made by the user. 4. The method of claim 3, wherein setting the target location further comprises detecting a second gesture made by the user and setting the target location to a position at which the second gesture was detected. 5. The method of claim 4, wherein the first gesture is different than the second gesture. 6. A method, comprising:
detecting at least one moving object in a listening environment from a sensor; identifying a user from the detected at least one moving object, the user is designated to have sole ability to set a target location in the listening environment; tracking the user; setting the target location; detecting the target location set by the user; configuring a sound beam based on the target location; and steering the sound beam to the target location. 7. The method as claimed in claim 6, wherein identifying a user includes detecting a first gesture made by the user. 8. The method as claimed in claim 7, wherein detecting a target location includes detecting a second gesture made by the user. 9. The method of claim 8, wherein setting the target location includes setting to a position that the second gesture was detected. 10. The method of claim 9, wherein the first gesture is different than the second gesture. 11. A system, comprising:
a processor; a pair of beamforming loudspeakers in communication with the processor; a sensor in communication with the processor; the processor including computer-readable instructions stored in a non-transitory memory for:
detecting at least one moving object in a listening environment from the sensor;
identifying a designated user from the detected at least one moving object, the user is distinguished from any other objects in the listening environment and is designated as the only source in the listening environment able to set a target location;
tracking the user;
setting the target location;
detecting the target location set by the user;
configuring a sound beam based on the target location; and
steering the sound beam to the target location. 12. The system of claim 11, wherein the processor includes further instructions for detecting a first gesture made by the user to identify the user. 13. The system of claim 12, wherein the processor includes further instructions for detecting a second gesture made by the user to detect the target location. 14. The system of claim 13, wherein the first gesture is different than the second gesture.
|
A system and method for automatic beamforming comprising detecting a target location set by a user, configuring a strength, a propagation delay and a steering angle of the sound beam based on the user-defined target location and steering the sound beam to the user-defined target location.1. A method, comprising:
detecting at least one object in a listening environment; identifying a designated user from the at least one detected object, the user is distinguished from any other objects in the listening environment, is an object to be tracked, and is designated to have sole ability to set a target location in the listening environment; detecting the target location for the listening environment set by the designated user; configuring a strength, a propagation delay and a steering angle of a sound beam based on the target location set by the designated user; setting the target location to a location set by the designated user; and steering the sound beam to the user-defined target location. 2. (canceled) 3. The method of claim 1, wherein identifying the user further comprises detecting a first gesture made by the user. 4. The method of claim 3, wherein setting the target location further comprises detecting a second gesture made by the user and setting the target location to a position at which the second gesture was detected. 5. The method of claim 4, wherein the first gesture is different than the second gesture. 6. A method, comprising:
detecting at least one moving object in a listening environment from a sensor; identifying a user from the detected at least one moving object, the user is designated to have sole ability to set a target location in the listening environment; tracking the user; setting the target location; detecting the target location set by the user; configuring a sound beam based on the target location; and steering the sound beam to the target location. 7. The method as claimed in claim 6, wherein identifying a user includes detecting a first gesture made by the user. 8. The method as claimed in claim 7, wherein detecting a target location includes detecting a second gesture made by the user. 9. The method of claim 8, wherein setting the target location includes setting to a position that the second gesture was detected. 10. The method of claim 9, wherein the first gesture is different than the second gesture. 11. A system, comprising:
a processor; a pair of beamforming loudspeakers in communication with the processor; a sensor in communication with the processor; the processor including computer-readable instructions stored in a non-transitory memory for:
detecting at least one moving object in a listening environment from the sensor;
identifying a designated user from the detected at least one moving object, the user is distinguished from any other objects in the listening environment and is designated as the only source in the listening environment able to set a target location;
tracking the user;
setting the target location;
detecting the target location set by the user;
configuring a sound beam based on the target location; and
steering the sound beam to the target location. 12. The system of claim 11, wherein the processor includes further instructions for detecting a first gesture made by the user to identify the user. 13. The system of claim 12, wherein the processor includes further instructions for detecting a second gesture made by the user to detect the target location. 14. The system of claim 13, wherein the first gesture is different than the second gesture.
| 2,800
|
338,063
| 16,799,714
| 3,791
|
A magnetic stimulation device having planar coil structure is disclosed. It contains a power supply module, a current control module, a plurality of planar coil modules and a plurality of electrical connection modules. In the planar coil module of the present invention, the coil structure has a flat and thin design and can be modularized. Compared with the existing magnetic stimulation devices, the overall structure of the present invention is light, thin, short, convenient to carry and use, and can be installed on clothing or built in a mobile device to provide a convenient magnetic stimulation treatment.
|
1. A magnetic stimulation device having coil structure, comprising:
a power supply module, providing electric power; a current control module, electrically connected with the power supply module, comprising:
a signal generator, generating a current waveform signal; and
a current switch, electrically connected with the signal generator, adjusting a waveform of the current from the power supply module with the current waveform signal to form an adjusted output current; and
at least one planar coil module, comprising:
a first insulating substrate; and
a planar coil, formed on the first insulating substrate where two ends of the planar coil and the current switch form a loop, receiving the adjusted output current to generate a corresponding varying intensity magnetic field,
wherein, if the number of the planar coil module is one, the planar coil is directly electrically connected with the current switch; if the number of the planar coil module planar coil module is more than one, end points of the planar coils of adjacent two planar coil modules are connected and unconnected endpoints of the planar coils of the first and the last planar coil modules are directly electrically connected with the current switch. 2. The magnetic stimulation device having coil structure according to claim 1, wherein the planar coil module further comprises a ferrite core, located on location of the strongest magnetic field intensity generated by current of the planar coil module, enhancing the overall magnetic permeability of the planar coil module. 3. The magnetic stimulation device having coil structure according to claim 1, wherein the current control module further comprises a current limiter, electrically connected between the power supply module and the current switch, limiting the current from the power supply module. 4. The magnetic stimulation device having coil structure according to claim 1, wherein the power supply module comprises at least one primary battery, at least one secondary battery or a power supply. 5. The magnetic stimulation device having coil structure according to claim 1, wherein the signal generator is a waveform generator, a pulse generator or a clock generator. 6. The magnetic stimulation device having coil structure according to claim 1, wherein a waveform of the current waveform signal is a sine wave, a half sine wave, a pulse wave or a fixed waveform. 7. The magnetic stimulation device having coil structure according to claim 1, wherein the planar coil is made by etching metal foil, winding metal wire or printing conductive adhesive. 8. The magnetic stimulation device having coil structure according to claim 1, wherein a material of the first insulating substrate is bakelite, cotton paper, epoxy resin, glass cloth, glass fiber, phenolic resin, glass, polyimide or polyester. 9. The magnetic stimulation device having coil structure according to claim 1, further comprising a plurality of electrical connection modules, electrically connected with the planar coil module and the current switch to form a loop, wherein each electrical connection module comprises:
a second insulating substrate; at least one wire, formed on the second insulating substrate; and a waterproof protective layer, covering the at least one wire and the second insulating substrate to protect the at least one wire and avoid damages from external water. 10. The magnetic stimulation device having coil structure according to claim 9, wherein a material of the second insulating substrate is polyimide or polyester. 11. The magnetic stimulation device having coil structure according to claim 9, wherein a material of the waterproof protective layer is polyimide film or polyethylene terephthalate film. 12. The magnetic stimulation device having coil structure according to claim 1, wherein the planar coil is formed around a specific pattern. 13. The magnetic stimulation device having coil structure according to claim 1, wherein an electric stimulation magnetic field of the planar coil module generated by the adjusted output current ranges from 0 to 1000 Gauss. 14. A magnetic stimulation device having coil structure, comprising:
a power supply module, providing electric power; a current control module, electrically connected with the power supply module, comprising:
a signal generator, generating a current waveform signal; and
a current switch, electrically connected with the signal generator, adjusting a waveform of the current from the power supply module with the current waveform signal to form an adjusted output current; and
at least one planar coil module, comprising:
at least one first insulating substrate; and
a plurality of planar coils, parallel to one another, wherein adjacent two planar coils are electrically connected and formed on two sides of the same first insulating substrate,
wherein, if the number of the planar coil module is one, end points of the outermost two planar coils are directly electrically connected with the current switch to form a loop; if the number of the planar coil module is more than one, end points of the outermost planar coils of adjacent two planar coil modules are connected and unconnected endpoints of the outermost planar coils of the first and the last planar coil modules are directly electrically connected with the current switch; the planar coil receives the adjusted output current to generate a corresponding varying intensity magnetic field, the current in the plurality of planar coils of the same planar coil module flows in the same rotational direction, and locations of the strongest magnetic field intensity generated by current of every planar coils are substantially aligned. 15. The magnetic stimulation device having coil structure according to claim 14, wherein the planar coil module further comprises a ferrite core, located on location of the strongest magnetic field intensity generated by current of the planar coil module, enhancing the overall magnetic permeability of the planar coil module. 16. The magnetic stimulation device having coil structure according to claim 14, wherein the current control module further comprises a current limiter, electrically connected between the power supply module and the current switch, limiting the current from the power supply module. 17. The magnetic stimulation device having coil structure according to claim 14, wherein adjacent two planar coils are electrically connected by plating through a via hole formed on the first insulating substrate. 18. The magnetic stimulation device having coil structure according to claim 14, wherein the power supply module comprises at least one primary battery, at least one secondary battery or a power supply. 19. The magnetic stimulation device having coil structure according to claim 14, wherein the signal generator is a waveform generator, a pulse generator or a clock generator. 20. The magnetic stimulation device having coil structure according to claim 14, wherein a waveform of the current waveform signal is a sine wave, a half sine wave, a pulse wave or a fixed waveform. 21. The magnetic stimulation device having coil structure according to claim 14, wherein the planar coil is made by etching metal foil, winding metal wire or printing conductive adhesive. 22. The magnetic stimulation device having coil structure according to claim 14, wherein a material of the first insulating substrate is bakelite, cotton paper, epoxy resin, glass cloth, glass fiber, phenolic resin, glass, polyimide or polyester. 23. The magnetic stimulation device having coil structure according to claim 14, further comprising a plurality of electrical connection modules, electrically connected with the planar coil module and the current switch to form a loop, wherein each electrical connection module comprises:
a second insulating substrate; at least one wire, formed on the second insulating substrate; and a waterproof protective layer, covering the at least one wire and the second insulating substrate to protect the at least one wire and avoid damages from external water. 24. The magnetic stimulation device having coil structure according to claim 23, wherein a material of the second insulating substrate is polyimide or polyester. 25. The magnetic stimulation device having coil structure according to claim 23, wherein a material of the waterproof protective layer is polyimide film or polyethylene terephthalate film. 26. The magnetic stimulation device having coil structure according to claim 14, wherein the planar coil is formed around a specific pattern. 27. The magnetic stimulation device having coil structure according to claim 14, wherein an electric stimulation magnetic field of the planar coil module generated by the adjusted output current ranges from 0 to 1000 Gauss.
|
A magnetic stimulation device having planar coil structure is disclosed. It contains a power supply module, a current control module, a plurality of planar coil modules and a plurality of electrical connection modules. In the planar coil module of the present invention, the coil structure has a flat and thin design and can be modularized. Compared with the existing magnetic stimulation devices, the overall structure of the present invention is light, thin, short, convenient to carry and use, and can be installed on clothing or built in a mobile device to provide a convenient magnetic stimulation treatment.1. A magnetic stimulation device having coil structure, comprising:
a power supply module, providing electric power; a current control module, electrically connected with the power supply module, comprising:
a signal generator, generating a current waveform signal; and
a current switch, electrically connected with the signal generator, adjusting a waveform of the current from the power supply module with the current waveform signal to form an adjusted output current; and
at least one planar coil module, comprising:
a first insulating substrate; and
a planar coil, formed on the first insulating substrate where two ends of the planar coil and the current switch form a loop, receiving the adjusted output current to generate a corresponding varying intensity magnetic field,
wherein, if the number of the planar coil module is one, the planar coil is directly electrically connected with the current switch; if the number of the planar coil module planar coil module is more than one, end points of the planar coils of adjacent two planar coil modules are connected and unconnected endpoints of the planar coils of the first and the last planar coil modules are directly electrically connected with the current switch. 2. The magnetic stimulation device having coil structure according to claim 1, wherein the planar coil module further comprises a ferrite core, located on location of the strongest magnetic field intensity generated by current of the planar coil module, enhancing the overall magnetic permeability of the planar coil module. 3. The magnetic stimulation device having coil structure according to claim 1, wherein the current control module further comprises a current limiter, electrically connected between the power supply module and the current switch, limiting the current from the power supply module. 4. The magnetic stimulation device having coil structure according to claim 1, wherein the power supply module comprises at least one primary battery, at least one secondary battery or a power supply. 5. The magnetic stimulation device having coil structure according to claim 1, wherein the signal generator is a waveform generator, a pulse generator or a clock generator. 6. The magnetic stimulation device having coil structure according to claim 1, wherein a waveform of the current waveform signal is a sine wave, a half sine wave, a pulse wave or a fixed waveform. 7. The magnetic stimulation device having coil structure according to claim 1, wherein the planar coil is made by etching metal foil, winding metal wire or printing conductive adhesive. 8. The magnetic stimulation device having coil structure according to claim 1, wherein a material of the first insulating substrate is bakelite, cotton paper, epoxy resin, glass cloth, glass fiber, phenolic resin, glass, polyimide or polyester. 9. The magnetic stimulation device having coil structure according to claim 1, further comprising a plurality of electrical connection modules, electrically connected with the planar coil module and the current switch to form a loop, wherein each electrical connection module comprises:
a second insulating substrate; at least one wire, formed on the second insulating substrate; and a waterproof protective layer, covering the at least one wire and the second insulating substrate to protect the at least one wire and avoid damages from external water. 10. The magnetic stimulation device having coil structure according to claim 9, wherein a material of the second insulating substrate is polyimide or polyester. 11. The magnetic stimulation device having coil structure according to claim 9, wherein a material of the waterproof protective layer is polyimide film or polyethylene terephthalate film. 12. The magnetic stimulation device having coil structure according to claim 1, wherein the planar coil is formed around a specific pattern. 13. The magnetic stimulation device having coil structure according to claim 1, wherein an electric stimulation magnetic field of the planar coil module generated by the adjusted output current ranges from 0 to 1000 Gauss. 14. A magnetic stimulation device having coil structure, comprising:
a power supply module, providing electric power; a current control module, electrically connected with the power supply module, comprising:
a signal generator, generating a current waveform signal; and
a current switch, electrically connected with the signal generator, adjusting a waveform of the current from the power supply module with the current waveform signal to form an adjusted output current; and
at least one planar coil module, comprising:
at least one first insulating substrate; and
a plurality of planar coils, parallel to one another, wherein adjacent two planar coils are electrically connected and formed on two sides of the same first insulating substrate,
wherein, if the number of the planar coil module is one, end points of the outermost two planar coils are directly electrically connected with the current switch to form a loop; if the number of the planar coil module is more than one, end points of the outermost planar coils of adjacent two planar coil modules are connected and unconnected endpoints of the outermost planar coils of the first and the last planar coil modules are directly electrically connected with the current switch; the planar coil receives the adjusted output current to generate a corresponding varying intensity magnetic field, the current in the plurality of planar coils of the same planar coil module flows in the same rotational direction, and locations of the strongest magnetic field intensity generated by current of every planar coils are substantially aligned. 15. The magnetic stimulation device having coil structure according to claim 14, wherein the planar coil module further comprises a ferrite core, located on location of the strongest magnetic field intensity generated by current of the planar coil module, enhancing the overall magnetic permeability of the planar coil module. 16. The magnetic stimulation device having coil structure according to claim 14, wherein the current control module further comprises a current limiter, electrically connected between the power supply module and the current switch, limiting the current from the power supply module. 17. The magnetic stimulation device having coil structure according to claim 14, wherein adjacent two planar coils are electrically connected by plating through a via hole formed on the first insulating substrate. 18. The magnetic stimulation device having coil structure according to claim 14, wherein the power supply module comprises at least one primary battery, at least one secondary battery or a power supply. 19. The magnetic stimulation device having coil structure according to claim 14, wherein the signal generator is a waveform generator, a pulse generator or a clock generator. 20. The magnetic stimulation device having coil structure according to claim 14, wherein a waveform of the current waveform signal is a sine wave, a half sine wave, a pulse wave or a fixed waveform. 21. The magnetic stimulation device having coil structure according to claim 14, wherein the planar coil is made by etching metal foil, winding metal wire or printing conductive adhesive. 22. The magnetic stimulation device having coil structure according to claim 14, wherein a material of the first insulating substrate is bakelite, cotton paper, epoxy resin, glass cloth, glass fiber, phenolic resin, glass, polyimide or polyester. 23. The magnetic stimulation device having coil structure according to claim 14, further comprising a plurality of electrical connection modules, electrically connected with the planar coil module and the current switch to form a loop, wherein each electrical connection module comprises:
a second insulating substrate; at least one wire, formed on the second insulating substrate; and a waterproof protective layer, covering the at least one wire and the second insulating substrate to protect the at least one wire and avoid damages from external water. 24. The magnetic stimulation device having coil structure according to claim 23, wherein a material of the second insulating substrate is polyimide or polyester. 25. The magnetic stimulation device having coil structure according to claim 23, wherein a material of the waterproof protective layer is polyimide film or polyethylene terephthalate film. 26. The magnetic stimulation device having coil structure according to claim 14, wherein the planar coil is formed around a specific pattern. 27. The magnetic stimulation device having coil structure according to claim 14, wherein an electric stimulation magnetic field of the planar coil module generated by the adjusted output current ranges from 0 to 1000 Gauss.
| 3,700
|
338,064
| 16,799,712
| 3,791
|
A keyboard device includes a membrane circuit board and a key structure over the membrane circuit board. The key structure includes a keycap, a plunger structure, a key pedestal and an elastic element. The plunger structure is arranged between the keycap and the elastic element. At least a portion of the keycap is disposed within a pedestal dust-storage chamber of the key pedestal. At least a portion of the plunger structure is disposed within a guiding chamber of the key pedestal. Due to the relative location between the keycap, the plunger structure and the key pedestal, the path of the dust to enter the guiding chamber is extended or blocked. Consequently, the dust-proof efficacy is enhanced.
|
1. A key structure, comprising:
a keycap; a plunger structure comprising a post part and a plunger dust-storage chamber, wherein the plunger dust-storage chamber opens to an upward side, and the post part is connected between the keycap and the plunger dust-storage chamber; a key pedestal comprising an outer wall, a vertical partition wall and a horizontal partition wall, wherein a pedestal dust-storage chamber and a guiding chamber are defined by the outer wall, the vertical partition wall and the horizontal partition wall collaboratively, wherein a first end of the vertical partition wall is connected with the horizontal partition wall, and a second end of the vertical partition wall is bent toward the plunger dust-storage chamber; and an elastic element located under the plunger structure, and comprising a contacting part, wherein while the keycap is depressed, the keycap is moved downwardly within the pedestal dust-storage chamber, the plunger structure is moved downwardly within the guiding chamber, and the elastic element is compressed, so that a membrane switch of a keyboard device is triggered by the contacting part. 2. The key structure according to claim 1, wherein the keycap comprises a keycap skirt part, wherein the keycap skirt part is protruded downwardly from a lateral edge of the keycap, and at least a portion of the keycap skirt part is disposed within the pedestal dust-storage chamber. 3. The key structure according to claim 2, wherein a bottom surface of the keycap skirt part is located at a level lower than a top surface of the vertical partition wall. 4. The key structure according to claim 1, wherein the post part has an opening, and the keycap comprises a keycap coupling part, wherein the keycap coupling part is protruded downwardly from a bottom surface of the keycap, and the keycap coupling part is inserted into the post part through the opening, so that the keycap and the plunger structure are combined together. 5. The key structure according to claim 4, wherein one of the post part and the keycap coupling part comprises a hook, and the other of the post part and the keycap coupling part comprises a perforation corresponding to the hook, wherein the hook is engaged with the perforation, so that the keycap and the plunger structure are combined together. 6. The key structure according to claim 1, wherein the plunger structure further comprises a lateral wing part, and the lateral wing part is protruded from the plunger structure along a lateral direction and located under the horizontal partition wall, wherein at least a portion of the plunger structure is limited within the guiding chamber according to an interference between the lateral wing part and the horizontal partition wall. 7. The key structure according to claim 1, wherein the plunger structure is enclosed by the vertical partition wall, and the post part is inserted upwardly into the pedestal dust-storage chamber through the guiding chamber. 8. The key structure according to claim 1, wherein the second end of the vertical partition wall is further inserted into the plunger dust-storage chamber. 9. The key structure according to claim 1, wherein the plunger structure is made of thermoplastic material. 10. A keyboard device, comprising:
a membrane circuit board comprising a membrane switch; and a key structure corresponding to the membrane switch, wherein the key structure comprises: a keycap; a plunger structure comprising a post part and a plunger dust-storage chamber, wherein the plunger dust-storage chamber opens to an upward side, and the post part is connected between the keycap and the plunger dust-storage chamber; a key pedestal comprising an outer wall, a vertical partition wall and a horizontal partition wall, wherein a pedestal dust-storage chamber and a guiding chamber are defined by the outer wall, the vertical partition wall and the horizontal partition wall collaboratively, wherein a first end of the vertical partition wall is connected with the horizontal partition wall, and a second end of the vertical partition wall is bent toward the plunger dust-storage chamber; and an elastic element located under the plunger structure, and comprising a contacting part, wherein while the keycap is depressed, the keycap is moved downwardly within the pedestal dust-storage chamber, the plunger structure is moved downwardly within the guiding chamber, and the elastic element is compressed, so that the membrane switch is triggered by the contacting part. 11. The keyboard device according to claim 10, wherein the keycap comprises a keycap skirt part, wherein the keycap skirt part is protruded downwardly from a lateral edge of the keycap, and at least a portion of the keycap skirt part is disposed within the pedestal dust-storage chamber. 12. The keyboard device according to claim 11, wherein a bottom surface of the keycap skirt part is located at a level lower than a top surface of the vertical partition wall. 13. The keyboard device according to claim 10, wherein the post part has an opening, and the keycap comprises a keycap coupling part, wherein the keycap coupling part is protruded downwardly from a bottom surface of the keycap, and the keycap coupling part is inserted into the post part through the opening, so that the keycap and the plunger structure are combined together. 14. The keyboard device according to claim 13, wherein one of the post part and the keycap coupling part comprises a hook, and the other of the post part and the keycap coupling part comprises a perforation corresponding to the hook, wherein the hook is engaged with the perforation, so that the keycap and the plunger structure are combined together. 15. The keyboard device according to claim 10, wherein the plunger structure further comprises a lateral wing part, and the lateral wing part is protruded from the plunger structure along a lateral direction and located under the horizontal partition wall, wherein at least a portion of the plunger structure is limited within the guiding chamber according to an interference between the lateral wing part and the horizontal partition wall. 16. The keyboard device according to claim 10, wherein the plunger structure is enclosed by the vertical partition wall, and the post part is inserted upwardly into the pedestal dust-storage chamber through the guiding chamber. 17. The keyboard device according to claim 10, wherein the second end of the vertical partition wall is further inserted into the plunger dust-storage chamber. 18. The keyboard device according to claim 10, wherein the plunger structure is made of thermoplastic material. 19. The keyboard device according to claim 10, further comprising a base plate, wherein the membrane circuit board and the key structure are supported by the base plate.
|
A keyboard device includes a membrane circuit board and a key structure over the membrane circuit board. The key structure includes a keycap, a plunger structure, a key pedestal and an elastic element. The plunger structure is arranged between the keycap and the elastic element. At least a portion of the keycap is disposed within a pedestal dust-storage chamber of the key pedestal. At least a portion of the plunger structure is disposed within a guiding chamber of the key pedestal. Due to the relative location between the keycap, the plunger structure and the key pedestal, the path of the dust to enter the guiding chamber is extended or blocked. Consequently, the dust-proof efficacy is enhanced.1. A key structure, comprising:
a keycap; a plunger structure comprising a post part and a plunger dust-storage chamber, wherein the plunger dust-storage chamber opens to an upward side, and the post part is connected between the keycap and the plunger dust-storage chamber; a key pedestal comprising an outer wall, a vertical partition wall and a horizontal partition wall, wherein a pedestal dust-storage chamber and a guiding chamber are defined by the outer wall, the vertical partition wall and the horizontal partition wall collaboratively, wherein a first end of the vertical partition wall is connected with the horizontal partition wall, and a second end of the vertical partition wall is bent toward the plunger dust-storage chamber; and an elastic element located under the plunger structure, and comprising a contacting part, wherein while the keycap is depressed, the keycap is moved downwardly within the pedestal dust-storage chamber, the plunger structure is moved downwardly within the guiding chamber, and the elastic element is compressed, so that a membrane switch of a keyboard device is triggered by the contacting part. 2. The key structure according to claim 1, wherein the keycap comprises a keycap skirt part, wherein the keycap skirt part is protruded downwardly from a lateral edge of the keycap, and at least a portion of the keycap skirt part is disposed within the pedestal dust-storage chamber. 3. The key structure according to claim 2, wherein a bottom surface of the keycap skirt part is located at a level lower than a top surface of the vertical partition wall. 4. The key structure according to claim 1, wherein the post part has an opening, and the keycap comprises a keycap coupling part, wherein the keycap coupling part is protruded downwardly from a bottom surface of the keycap, and the keycap coupling part is inserted into the post part through the opening, so that the keycap and the plunger structure are combined together. 5. The key structure according to claim 4, wherein one of the post part and the keycap coupling part comprises a hook, and the other of the post part and the keycap coupling part comprises a perforation corresponding to the hook, wherein the hook is engaged with the perforation, so that the keycap and the plunger structure are combined together. 6. The key structure according to claim 1, wherein the plunger structure further comprises a lateral wing part, and the lateral wing part is protruded from the plunger structure along a lateral direction and located under the horizontal partition wall, wherein at least a portion of the plunger structure is limited within the guiding chamber according to an interference between the lateral wing part and the horizontal partition wall. 7. The key structure according to claim 1, wherein the plunger structure is enclosed by the vertical partition wall, and the post part is inserted upwardly into the pedestal dust-storage chamber through the guiding chamber. 8. The key structure according to claim 1, wherein the second end of the vertical partition wall is further inserted into the plunger dust-storage chamber. 9. The key structure according to claim 1, wherein the plunger structure is made of thermoplastic material. 10. A keyboard device, comprising:
a membrane circuit board comprising a membrane switch; and a key structure corresponding to the membrane switch, wherein the key structure comprises: a keycap; a plunger structure comprising a post part and a plunger dust-storage chamber, wherein the plunger dust-storage chamber opens to an upward side, and the post part is connected between the keycap and the plunger dust-storage chamber; a key pedestal comprising an outer wall, a vertical partition wall and a horizontal partition wall, wherein a pedestal dust-storage chamber and a guiding chamber are defined by the outer wall, the vertical partition wall and the horizontal partition wall collaboratively, wherein a first end of the vertical partition wall is connected with the horizontal partition wall, and a second end of the vertical partition wall is bent toward the plunger dust-storage chamber; and an elastic element located under the plunger structure, and comprising a contacting part, wherein while the keycap is depressed, the keycap is moved downwardly within the pedestal dust-storage chamber, the plunger structure is moved downwardly within the guiding chamber, and the elastic element is compressed, so that the membrane switch is triggered by the contacting part. 11. The keyboard device according to claim 10, wherein the keycap comprises a keycap skirt part, wherein the keycap skirt part is protruded downwardly from a lateral edge of the keycap, and at least a portion of the keycap skirt part is disposed within the pedestal dust-storage chamber. 12. The keyboard device according to claim 11, wherein a bottom surface of the keycap skirt part is located at a level lower than a top surface of the vertical partition wall. 13. The keyboard device according to claim 10, wherein the post part has an opening, and the keycap comprises a keycap coupling part, wherein the keycap coupling part is protruded downwardly from a bottom surface of the keycap, and the keycap coupling part is inserted into the post part through the opening, so that the keycap and the plunger structure are combined together. 14. The keyboard device according to claim 13, wherein one of the post part and the keycap coupling part comprises a hook, and the other of the post part and the keycap coupling part comprises a perforation corresponding to the hook, wherein the hook is engaged with the perforation, so that the keycap and the plunger structure are combined together. 15. The keyboard device according to claim 10, wherein the plunger structure further comprises a lateral wing part, and the lateral wing part is protruded from the plunger structure along a lateral direction and located under the horizontal partition wall, wherein at least a portion of the plunger structure is limited within the guiding chamber according to an interference between the lateral wing part and the horizontal partition wall. 16. The keyboard device according to claim 10, wherein the plunger structure is enclosed by the vertical partition wall, and the post part is inserted upwardly into the pedestal dust-storage chamber through the guiding chamber. 17. The keyboard device according to claim 10, wherein the second end of the vertical partition wall is further inserted into the plunger dust-storage chamber. 18. The keyboard device according to claim 10, wherein the plunger structure is made of thermoplastic material. 19. The keyboard device according to claim 10, further comprising a base plate, wherein the membrane circuit board and the key structure are supported by the base plate.
| 3,700
|
338,065
| 16,799,710
| 3,791
|
Optical analytical devices and their methods of use are provided. The devices are useful in the analysis of highly multiplexed optical reactions in large numbers at high densities, including biochemical reactions, such as nucleic acid sequencing reactions. The devices include integrated illumination elements and optical waveguides for illumination of the optical reactions. The devices further provide for the efficient coupling of optical excitation energy from the waveguides to the optical reactions. Optical signals emitted from the reactions can thus be measured with high sensitivity and discrimination using features such as spectra, amplitude, and time resolution, or combinations thereof. The devices of the invention are well suited for miniaturization and high throughput.
|
1-60. (canceled) 61. A method of nucleic acid sequencing comprising:
providing an analytical device comprising;
a substrate comprising;
a plurality of illumination volumes, each illumination volume comprising a nucleic acid synthesis complex comprising at least one polymerase enzyme, at least one template nucleic acid, at least one primer sequence that is complementary to a portion of the at least one template sequence, and at least one labeled nucleotide;
a plurality of discrete light sources, at least one discrete light source disposed below at least one illumination volume and optically coupled to the at least one illumination volume; and
a plurality of detector elements, at least one detector element disposed below the at least one illumination volume and optically coupled to the at least one illumination volume;
illuminating the at least one illumination volume with the at least one discrete light source; and detecting light emitted from the at least one illumination volume by the at least one detector element, wherein light detected by the at least one detector element indicates incorporation of the at least one labeled nucleotide into the at least one primer sequence. 62. The method of claim 61 wherein each illumination volume comprises a plurality of different labeled nucleotides. 63. The method of claim 61 wherein the at least one labeled nucleotide comprises a fluorescent label. 64. The method of claim 61, wherein the discrete light sources are semiconductor laser diodes, light-emitting diodes, solid-state lasers, or vertical cavity surface-emitting lasers. 65. The method of claim 61, wherein the discrete light sources are diode light sources. 66. The method of claim 65, wherein the diode light sources comprise an electrically pumped p-n junction. 67. The method of claim 61, wherein the illumination volumes are illuminated by light emitted from a top surface of the discrete light sources. 68. The method of claim 67, wherein the light is emitted in a cone shape from the top surface of the discrete light sources. 69. The method of claim 61, wherein the illumination volumes are illuminated by an evanescent field emanating from a top surface of the discrete light sources. 70. The method of claim 61, wherein the discrete light sources are arranged in a strip structure. 71. The method of claim 61, wherein the analytical device comprises at least 1,000 illumination volumes. 72. The method of claim 61, wherein the analytical device comprises at least 10,000 illumination volumes. 73. The method of claim 61, wherein the analytical device comprises at least 1 million illumination volumes. 74. The method of claim 61, wherein each illumination volume comprises four different nucleotides, and wherein each nucleotide is labeled with a different spectrally distinguishable fluorescent label. 75. The method of claim 61, wherein each illumination volume comprises four different nucleotides, each nucleotide labeled with a spectrally distinguishable fluorescent label the one or more labeled nucleotides comprise four labeled nucleotides, each distinguishable by signal intensity, excitation spectrum, or both. 76. The method of claim 61, wherein each illumination volume is contained in a nanowell. 77. The method of claim 76, wherein the nanowell is a zero mode waveguide.
|
Optical analytical devices and their methods of use are provided. The devices are useful in the analysis of highly multiplexed optical reactions in large numbers at high densities, including biochemical reactions, such as nucleic acid sequencing reactions. The devices include integrated illumination elements and optical waveguides for illumination of the optical reactions. The devices further provide for the efficient coupling of optical excitation energy from the waveguides to the optical reactions. Optical signals emitted from the reactions can thus be measured with high sensitivity and discrimination using features such as spectra, amplitude, and time resolution, or combinations thereof. The devices of the invention are well suited for miniaturization and high throughput.1-60. (canceled) 61. A method of nucleic acid sequencing comprising:
providing an analytical device comprising;
a substrate comprising;
a plurality of illumination volumes, each illumination volume comprising a nucleic acid synthesis complex comprising at least one polymerase enzyme, at least one template nucleic acid, at least one primer sequence that is complementary to a portion of the at least one template sequence, and at least one labeled nucleotide;
a plurality of discrete light sources, at least one discrete light source disposed below at least one illumination volume and optically coupled to the at least one illumination volume; and
a plurality of detector elements, at least one detector element disposed below the at least one illumination volume and optically coupled to the at least one illumination volume;
illuminating the at least one illumination volume with the at least one discrete light source; and detecting light emitted from the at least one illumination volume by the at least one detector element, wherein light detected by the at least one detector element indicates incorporation of the at least one labeled nucleotide into the at least one primer sequence. 62. The method of claim 61 wherein each illumination volume comprises a plurality of different labeled nucleotides. 63. The method of claim 61 wherein the at least one labeled nucleotide comprises a fluorescent label. 64. The method of claim 61, wherein the discrete light sources are semiconductor laser diodes, light-emitting diodes, solid-state lasers, or vertical cavity surface-emitting lasers. 65. The method of claim 61, wherein the discrete light sources are diode light sources. 66. The method of claim 65, wherein the diode light sources comprise an electrically pumped p-n junction. 67. The method of claim 61, wherein the illumination volumes are illuminated by light emitted from a top surface of the discrete light sources. 68. The method of claim 67, wherein the light is emitted in a cone shape from the top surface of the discrete light sources. 69. The method of claim 61, wherein the illumination volumes are illuminated by an evanescent field emanating from a top surface of the discrete light sources. 70. The method of claim 61, wherein the discrete light sources are arranged in a strip structure. 71. The method of claim 61, wherein the analytical device comprises at least 1,000 illumination volumes. 72. The method of claim 61, wherein the analytical device comprises at least 10,000 illumination volumes. 73. The method of claim 61, wherein the analytical device comprises at least 1 million illumination volumes. 74. The method of claim 61, wherein each illumination volume comprises four different nucleotides, and wherein each nucleotide is labeled with a different spectrally distinguishable fluorescent label. 75. The method of claim 61, wherein each illumination volume comprises four different nucleotides, each nucleotide labeled with a spectrally distinguishable fluorescent label the one or more labeled nucleotides comprise four labeled nucleotides, each distinguishable by signal intensity, excitation spectrum, or both. 76. The method of claim 61, wherein each illumination volume is contained in a nanowell. 77. The method of claim 76, wherein the nanowell is a zero mode waveguide.
| 3,700
|
338,066
| 16,799,707
| 3,791
|
Disclosed are methods for the reduction, prevention or treatment of cardiovascular events and/or cardiovascular diseases, including acute cardiovascular disease or chronic cardiovascular disease using anti-IL-1β binding molecules (e.g., IL-1β binding antibodies and fragments thereof). The present disclosure also relates to methods for prevention or treatment of cardiovascular events and/or cardiovascular diseases, including by reducing a cardiovascular event or disease.
|
1. A method of reducing a cardiovascular event in a subject, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof, wherein the subject is a subject with a history of a previous cardiovascular event or a history of at least one risk factor for cardiovascular disease, and wherein the cardiovascular event is myocardial infarction, stroke, cardiovascular death, congestive heart failure, cardiac arrest, acute coronary syndrome, angina, or a revascularization procedure. 2-17. (canceled) 18. A method of reducing mortality following a cardiovascular event in a subject, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof. 19-38. (canceled) 39. A method of reducing a cardiovascular event in a subject with a history of at least one risk factor for cardiovascular disease, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof, and wherein said risk factor is not Type 2 diabetes, obesity, hyperglycemia, dyslipidemia, hyperlipidemia, chronic renal failure, high blood glucose, chronic kidney disease, hypertension, atherosclerosis or metabolic syndrome. 40-57. (canceled) 58. A method of treating a cardiovascular event in a subject, wherein the cardiovascular event is myocardial infarction, stroke, congestive heart failure, acute coronary syndrome or angina, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof and at least one other pharmaceutical composition comprising an active agent other than an IL-1β antibody or fragment. 59. (canceled) 60. A method for treating a cardiovascular event in a subject, wherein the cardiovascular event is myocardial infarction, stroke, congestive heart failure, acute coronary syndrome or angina, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof and a revascularization procedure. 61. (canceled) 62. A method of reducing restenosis in a subject following a revascularization procedure, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof. 63-64. (canceled) 65. A method of treating acute hypertension in a subject comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof and one or more antihypertensive agents. 66-107. (canceled)
|
Disclosed are methods for the reduction, prevention or treatment of cardiovascular events and/or cardiovascular diseases, including acute cardiovascular disease or chronic cardiovascular disease using anti-IL-1β binding molecules (e.g., IL-1β binding antibodies and fragments thereof). The present disclosure also relates to methods for prevention or treatment of cardiovascular events and/or cardiovascular diseases, including by reducing a cardiovascular event or disease.1. A method of reducing a cardiovascular event in a subject, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof, wherein the subject is a subject with a history of a previous cardiovascular event or a history of at least one risk factor for cardiovascular disease, and wherein the cardiovascular event is myocardial infarction, stroke, cardiovascular death, congestive heart failure, cardiac arrest, acute coronary syndrome, angina, or a revascularization procedure. 2-17. (canceled) 18. A method of reducing mortality following a cardiovascular event in a subject, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof. 19-38. (canceled) 39. A method of reducing a cardiovascular event in a subject with a history of at least one risk factor for cardiovascular disease, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof, and wherein said risk factor is not Type 2 diabetes, obesity, hyperglycemia, dyslipidemia, hyperlipidemia, chronic renal failure, high blood glucose, chronic kidney disease, hypertension, atherosclerosis or metabolic syndrome. 40-57. (canceled) 58. A method of treating a cardiovascular event in a subject, wherein the cardiovascular event is myocardial infarction, stroke, congestive heart failure, acute coronary syndrome or angina, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof and at least one other pharmaceutical composition comprising an active agent other than an IL-1β antibody or fragment. 59. (canceled) 60. A method for treating a cardiovascular event in a subject, wherein the cardiovascular event is myocardial infarction, stroke, congestive heart failure, acute coronary syndrome or angina, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof and a revascularization procedure. 61. (canceled) 62. A method of reducing restenosis in a subject following a revascularization procedure, comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof. 63-64. (canceled) 65. A method of treating acute hypertension in a subject comprising administering to said subject a therapeutically effective amount of an anti-IL-1β binding antibody or binding fragment thereof and one or more antihypertensive agents. 66-107. (canceled)
| 3,700
|
338,067
| 16,799,704
| 3,791
|
A system and method for determining location of a touch event on or in proximity to a touch sensitive device is disclosed. The touch sensitive device includes row conductors and column conductors that each only transmit or receive signals during a given frame. Each of the orthogonal row signals is transmitted on a respective one of at least some of the row conductors. Signals are received on each of the column conductors an amount of each of the row signals present on each of the plurality of column conductors is detected. Orthogonal column signals are transmitted on the column conductors. Signals are received on each of the row conductors and an amount of each of the orthogonal column signals present on each of the row conductors is detected. The detected amount of each of the orthogonal row signals and the detected amount of each of the orthogonal column signals is used to determine a location of a touch event on or in proximity to the touch sensitive device. At least one of the transmitting and receiving steps avoids simultaneously transmitting and receiving on at least one of the row conductors or column conductors.
|
1. A method of identifying touch in a touch sensitive device that samples during first and second alternating time periods, the method comprising:
during a first time period,
simultaneously transmitting each of a first plurality of orthogonal signals on each of an A set of conductors;
sampling a B frame from a B set of conductors;
during a second time period,
simultaneously transmitting each of a second plurality of orthogonal signals on each of the B set of conductors;
sampling an A frame from of the A set of conductors;
processing the A frame to create data corresponding to the A frame; processing the B frame to create data corresponding to the B frame; post processing the data corresponding to the A and the B frame to identify touch. 2. The method of claim 1, further comprising, reporting results after the step of post processing. 3. The method of claim 2, wherein during one of the first and second time periods processing occurs and reporting occurs simultaneously. 4. The method of claim 1, wherein during one of the first time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling a B frame from the B set of conductors. 5. The method of claim 1, wherein during one of the second time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling an A frame from the A set of conductors. 6. A touch sensitive device that samples during first and second alternating time periods comprising:
A set of conductors adapted to:
have a first plurality of frequency orthogonal signals simultaneously transmitted on each of the A set of conductors during the first time period, and
have sampled an A frame of time domain data from the A set of conductors during the second time period;
B set of conductors adapted to:
have a second plurality of frequency orthogonal signals simultaneously transmitted on each of the B set of conductors during the second time period, and
have sampled a B frame of time domain data from the B set of conductors during the first time period; and
processing system adapted to
create frequency domain data corresponding to the A frame;
create frequency domain data corresponding to the B frame; and
post process the frequency domain data corresponding to the A frame and the B frame to identify touch. 7. A touch sensitive device that samples during first and second alternating time periods comprising:
A set of conductors adapted to:
have a first plurality of orthogonal signals simultaneously transmitted on each of the A set of conductors during the first time period, and
have sampled an A frame from the A set of conductors during the second time period;
B set of conductors adapted to:
have a second plurality of orthogonal signals simultaneously transmitted on each of the B set of conductors during the second time period, and
have sampled a B frame from the B set of conductors during the first time period; and
processing system adapted to
create data corresponding to the A frame;
create data corresponding to the B frame; and
post process the data corresponding to the A frame and the B frame to identify touch. 8. The touch sensitive device of claim 7, wherein the processing system is adapted to after post processing the data during one of the first and second time periods, report results of the processing. 9. The touch sensitive device of claim 8, wherein the processing system is adapted to during one of the first and second alternating time periods to create data corresponding to the A frame or B frame and report simultaneously. 10. The touch sensitive device of claim 7, wherein the processing system is adapted to during one of the first time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling a B frame from the B set of conductors. 11. The touch sensitive device of claim 7, wherein the processing system is adapted to during one of the second time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling an A frame from the A set of conductors.
|
A system and method for determining location of a touch event on or in proximity to a touch sensitive device is disclosed. The touch sensitive device includes row conductors and column conductors that each only transmit or receive signals during a given frame. Each of the orthogonal row signals is transmitted on a respective one of at least some of the row conductors. Signals are received on each of the column conductors an amount of each of the row signals present on each of the plurality of column conductors is detected. Orthogonal column signals are transmitted on the column conductors. Signals are received on each of the row conductors and an amount of each of the orthogonal column signals present on each of the row conductors is detected. The detected amount of each of the orthogonal row signals and the detected amount of each of the orthogonal column signals is used to determine a location of a touch event on or in proximity to the touch sensitive device. At least one of the transmitting and receiving steps avoids simultaneously transmitting and receiving on at least one of the row conductors or column conductors.1. A method of identifying touch in a touch sensitive device that samples during first and second alternating time periods, the method comprising:
during a first time period,
simultaneously transmitting each of a first plurality of orthogonal signals on each of an A set of conductors;
sampling a B frame from a B set of conductors;
during a second time period,
simultaneously transmitting each of a second plurality of orthogonal signals on each of the B set of conductors;
sampling an A frame from of the A set of conductors;
processing the A frame to create data corresponding to the A frame; processing the B frame to create data corresponding to the B frame; post processing the data corresponding to the A and the B frame to identify touch. 2. The method of claim 1, further comprising, reporting results after the step of post processing. 3. The method of claim 2, wherein during one of the first and second time periods processing occurs and reporting occurs simultaneously. 4. The method of claim 1, wherein during one of the first time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling a B frame from the B set of conductors. 5. The method of claim 1, wherein during one of the second time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling an A frame from the A set of conductors. 6. A touch sensitive device that samples during first and second alternating time periods comprising:
A set of conductors adapted to:
have a first plurality of frequency orthogonal signals simultaneously transmitted on each of the A set of conductors during the first time period, and
have sampled an A frame of time domain data from the A set of conductors during the second time period;
B set of conductors adapted to:
have a second plurality of frequency orthogonal signals simultaneously transmitted on each of the B set of conductors during the second time period, and
have sampled a B frame of time domain data from the B set of conductors during the first time period; and
processing system adapted to
create frequency domain data corresponding to the A frame;
create frequency domain data corresponding to the B frame; and
post process the frequency domain data corresponding to the A frame and the B frame to identify touch. 7. A touch sensitive device that samples during first and second alternating time periods comprising:
A set of conductors adapted to:
have a first plurality of orthogonal signals simultaneously transmitted on each of the A set of conductors during the first time period, and
have sampled an A frame from the A set of conductors during the second time period;
B set of conductors adapted to:
have a second plurality of orthogonal signals simultaneously transmitted on each of the B set of conductors during the second time period, and
have sampled a B frame from the B set of conductors during the first time period; and
processing system adapted to
create data corresponding to the A frame;
create data corresponding to the B frame; and
post process the data corresponding to the A frame and the B frame to identify touch. 8. The touch sensitive device of claim 7, wherein the processing system is adapted to after post processing the data during one of the first and second time periods, report results of the processing. 9. The touch sensitive device of claim 8, wherein the processing system is adapted to during one of the first and second alternating time periods to create data corresponding to the A frame or B frame and report simultaneously. 10. The touch sensitive device of claim 7, wherein the processing system is adapted to during one of the first time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling a B frame from the B set of conductors. 11. The touch sensitive device of claim 7, wherein the processing system is adapted to during one of the second time periods processing the B frame to create data corresponding to the B frame during the prior first time period and processing the A frame to create data corresponding to the A frame during the prior second time period are processed while sampling an A frame from the A set of conductors.
| 3,700
|
338,068
| 16,799,678
| 3,791
|
A method for generating preview information related to data migrated to archival storage media. In an embodiment, the method includes one or more computer processors identifying data designated for archival. The method further includes identifying a set of preferences associated with generating a set of preview data corresponding to the data designated for archival. The method further includes determining metadata related to the data designated for archival based on the identified set of preferences. The method further includes archiving the data designated for archival. The method further includes responding to archiving the data designated for archival by determining information associated with archiving the designated data. The method further includes generating a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data.
|
1. A method comprising:
identifying, by one or more computer processors, data designated for archival; identifying, by one or more computer processors, a set of preferences associated with generating a set of preview data corresponding to the data designated for archival; determining, by one or more computer processors, metadata related to the data designated for archival based on the identified set of preferences; archiving, by one or more computer processors, the data designated for archival; responsive to archiving the data designated for archival, determining, by one or more computer processors, information associated with archiving the designated data; and generating, by one or more computer processors, a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data. 2. The method of claim 1, wherein the metadata related to the data designated for archival includes one or more items selected from the group consisting of a number of files within a group of files, a name corresponding to a file of the group of files, a size corresponding to the group of files, and a creation date corresponding to each file of the group of files. 3. The method of claim 1, wherein information associated with archiving the designated data includes one or more items selected from the group consisting of an ID corresponding to an archival storage media utilized to store the archived designated data, data compression information, and a location along the archival media storage volume that indicates where the archived designated data is stored, and wherein the archival storage media is based on magnetic tape technology. 4. The method of claim 1, further comprising:
presenting, by one or more computer processors, to a user, the set of preview data corresponding to the archived designated data; determining, by one or more computer processors, whether the user verifies the set of preview data corresponding to the archived designated data; and responsive to determining that the user verifies the set of preview data corresponding to the archived designated data, updating, by one or more computer processors, a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 5. The method of claim 4:
wherein the preview dataset is based on a data structure that maps respective portions of the metadata that correspond to the plurality of archived data at a beginning of the preview dataset; and wherein the preview dataset includes respective relative byte location (RBL) information corresponding to other information of a set of preview information respectively distributed within the preview dataset at RBL locations respectively associated with the plurality of preview data corresponding to the plurality of archived data. 6. The method of claim 1, further comprising:
presenting, by one or more computer processors, to a user, the set of preview data corresponding to the archived designated data; determining, by one or more computer processors, that the user indicates to update the set of preview data corresponding to the archived designated data; receiving, by one or more computer processors, from the user, one or more additional elements of information to include among the set of preview data; and updating, by one or more computer processors, a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 7. The method of claim 6, wherein one or more additional elements of information to include among the set of preview data are selected from the group consisting of a code snippet from within the data designated for archival, a text excerpt from within the data designated for archival, a comment input by the user. 8. A computer program product, the computer program product comprising:
one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions readable/executable by one or more computer processors:
program instructions to identify data designated for archival;
program instructions to identify a set of preferences associated with generating a set of preview data corresponding to the data designated for archival;
program instructions to determine metadata related to the data designated for archival based on the identified set of preferences;
program instructions to archive the data designated for archival;
responsive to archiving the data designated for archival, program instructions to determine information associated with archiving the designated data; and
program instructions to generate a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data. 9. The computer program product of claim 8, wherein the metadata related to the data designated for archival includes one or more items selected from the group consisting of a number of files within a group of files, a name corresponding to a file of the group of files, a size corresponding to the group of files, and a creation date corresponding to each file of the group of files. 10. The computer program product of claim 8, wherein information associated with archiving the designated data includes one or more items selected from the group consisting of an ID corresponding to an archival storage media utilized to store the archived designated data, data compression information, and a location along the archival media storage volume that indicates where the archived designated data is stored, and wherein the archival storage media is based on magnetic tape technology. 11. The computer program product of claim 8, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine whether the user verifies the set of preview data corresponding to the archived designated data; and responsive to determining that the user verifies the set of preview data corresponding to the archived designated data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 12. The computer program product of claim 10:
wherein the preview dataset is based on a data structure that maps respective portions of the metadata that correspond to the plurality of archived data at a beginning of the preview dataset; and wherein the preview dataset includes respective relative byte location (RBL) information corresponding to other information of a set of preview information respectively distributed within the preview dataset at RBL locations respectively associated with the plurality of preview data corresponding to the plurality of archived data. 13. The computer program product of claim 8, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine that the user indicates to update the set of preview data corresponding to the archived designated data; program instructions to receive from the user, one or more additional elements of information to include among the set of preview data; and responsive to receiving the one or more additional elements of information to include among the set of preview data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 14. The computer program product of claim 11, wherein one or more additional elements of information to include among the set of preview data are selected from the group consisting of a code snippet from within the data designated for archival, a text excerpt from within the data designated for archival, a comment input by the user. 15. A computer system, the computer system comprising:
one or more computer processors; one or more computer readable storage media; and program instructions stored on the computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
program instructions to identify data designated for archival;
program instructions to identify a set of preferences associated with generating a set of preview data corresponding to the data designated for archival;
program instructions to determine metadata related to the data designated for archival based on the identified set of preferences;
program instructions to archive the data designated for archival;
responsive to archiving the data designated for archival, program instructions to determine information associated with archiving the designated data; and
program instructions to generate a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data. 16. The computer system of claim 15, wherein the metadata related to the data designated for archival includes one or more items selected from the group consisting of a number of files within a group of files, a name corresponding to a file of the group of files, a size corresponding to the group of files, and a creation date corresponding to each file of the group of files. 17. The computer system of claim 15, wherein information associated with archiving the designated data includes one or more items selected from the group consisting of an ID corresponding to an archival storage media utilized to store the archived designated data, data compression information, and a location along the archival media storage volume that indicates where the archived designated data is stored, and wherein the archival storage media is based on magnetic tape technology. 18. The computer system of claim 15, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine whether the user verifies the set of preview data corresponding to the archived designated data; and responsive to determining that the user verifies the set of preview data corresponding to the archived designated data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 19. The computer system of claim 18:
wherein the preview dataset is based on a data structure that maps respective portions of the metadata that correspond to the plurality of archived data at a beginning of the preview dataset; and wherein the preview dataset includes respective relative byte location (RBL) information corresponding to other information of a set of preview information respectively distributed within the preview dataset at RBL locations respectively associated with the plurality of preview data corresponding to the plurality of archived data. 20. The computer system of claim 15, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine that the user indicates to update the set of preview data corresponding to the archived designated data; program instructions to receive from the user, one or more additional elements of information to include among the set of preview data; and responsive to receiving the one or more additional elements of information to include among the set of preview data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data.
|
A method for generating preview information related to data migrated to archival storage media. In an embodiment, the method includes one or more computer processors identifying data designated for archival. The method further includes identifying a set of preferences associated with generating a set of preview data corresponding to the data designated for archival. The method further includes determining metadata related to the data designated for archival based on the identified set of preferences. The method further includes archiving the data designated for archival. The method further includes responding to archiving the data designated for archival by determining information associated with archiving the designated data. The method further includes generating a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data.1. A method comprising:
identifying, by one or more computer processors, data designated for archival; identifying, by one or more computer processors, a set of preferences associated with generating a set of preview data corresponding to the data designated for archival; determining, by one or more computer processors, metadata related to the data designated for archival based on the identified set of preferences; archiving, by one or more computer processors, the data designated for archival; responsive to archiving the data designated for archival, determining, by one or more computer processors, information associated with archiving the designated data; and generating, by one or more computer processors, a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data. 2. The method of claim 1, wherein the metadata related to the data designated for archival includes one or more items selected from the group consisting of a number of files within a group of files, a name corresponding to a file of the group of files, a size corresponding to the group of files, and a creation date corresponding to each file of the group of files. 3. The method of claim 1, wherein information associated with archiving the designated data includes one or more items selected from the group consisting of an ID corresponding to an archival storage media utilized to store the archived designated data, data compression information, and a location along the archival media storage volume that indicates where the archived designated data is stored, and wherein the archival storage media is based on magnetic tape technology. 4. The method of claim 1, further comprising:
presenting, by one or more computer processors, to a user, the set of preview data corresponding to the archived designated data; determining, by one or more computer processors, whether the user verifies the set of preview data corresponding to the archived designated data; and responsive to determining that the user verifies the set of preview data corresponding to the archived designated data, updating, by one or more computer processors, a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 5. The method of claim 4:
wherein the preview dataset is based on a data structure that maps respective portions of the metadata that correspond to the plurality of archived data at a beginning of the preview dataset; and wherein the preview dataset includes respective relative byte location (RBL) information corresponding to other information of a set of preview information respectively distributed within the preview dataset at RBL locations respectively associated with the plurality of preview data corresponding to the plurality of archived data. 6. The method of claim 1, further comprising:
presenting, by one or more computer processors, to a user, the set of preview data corresponding to the archived designated data; determining, by one or more computer processors, that the user indicates to update the set of preview data corresponding to the archived designated data; receiving, by one or more computer processors, from the user, one or more additional elements of information to include among the set of preview data; and updating, by one or more computer processors, a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 7. The method of claim 6, wherein one or more additional elements of information to include among the set of preview data are selected from the group consisting of a code snippet from within the data designated for archival, a text excerpt from within the data designated for archival, a comment input by the user. 8. A computer program product, the computer program product comprising:
one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions readable/executable by one or more computer processors:
program instructions to identify data designated for archival;
program instructions to identify a set of preferences associated with generating a set of preview data corresponding to the data designated for archival;
program instructions to determine metadata related to the data designated for archival based on the identified set of preferences;
program instructions to archive the data designated for archival;
responsive to archiving the data designated for archival, program instructions to determine information associated with archiving the designated data; and
program instructions to generate a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data. 9. The computer program product of claim 8, wherein the metadata related to the data designated for archival includes one or more items selected from the group consisting of a number of files within a group of files, a name corresponding to a file of the group of files, a size corresponding to the group of files, and a creation date corresponding to each file of the group of files. 10. The computer program product of claim 8, wherein information associated with archiving the designated data includes one or more items selected from the group consisting of an ID corresponding to an archival storage media utilized to store the archived designated data, data compression information, and a location along the archival media storage volume that indicates where the archived designated data is stored, and wherein the archival storage media is based on magnetic tape technology. 11. The computer program product of claim 8, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine whether the user verifies the set of preview data corresponding to the archived designated data; and responsive to determining that the user verifies the set of preview data corresponding to the archived designated data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 12. The computer program product of claim 10:
wherein the preview dataset is based on a data structure that maps respective portions of the metadata that correspond to the plurality of archived data at a beginning of the preview dataset; and wherein the preview dataset includes respective relative byte location (RBL) information corresponding to other information of a set of preview information respectively distributed within the preview dataset at RBL locations respectively associated with the plurality of preview data corresponding to the plurality of archived data. 13. The computer program product of claim 8, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine that the user indicates to update the set of preview data corresponding to the archived designated data; program instructions to receive from the user, one or more additional elements of information to include among the set of preview data; and responsive to receiving the one or more additional elements of information to include among the set of preview data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 14. The computer program product of claim 11, wherein one or more additional elements of information to include among the set of preview data are selected from the group consisting of a code snippet from within the data designated for archival, a text excerpt from within the data designated for archival, a comment input by the user. 15. A computer system, the computer system comprising:
one or more computer processors; one or more computer readable storage media; and program instructions stored on the computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
program instructions to identify data designated for archival;
program instructions to identify a set of preferences associated with generating a set of preview data corresponding to the data designated for archival;
program instructions to determine metadata related to the data designated for archival based on the identified set of preferences;
program instructions to archive the data designated for archival;
responsive to archiving the data designated for archival, program instructions to determine information associated with archiving the designated data; and
program instructions to generate a set of preview data corresponding to the archived designated data based, at least in part, on the determined metadata and the information associated with archiving the designated data. 16. The computer system of claim 15, wherein the metadata related to the data designated for archival includes one or more items selected from the group consisting of a number of files within a group of files, a name corresponding to a file of the group of files, a size corresponding to the group of files, and a creation date corresponding to each file of the group of files. 17. The computer system of claim 15, wherein information associated with archiving the designated data includes one or more items selected from the group consisting of an ID corresponding to an archival storage media utilized to store the archived designated data, data compression information, and a location along the archival media storage volume that indicates where the archived designated data is stored, and wherein the archival storage media is based on magnetic tape technology. 18. The computer system of claim 15, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine whether the user verifies the set of preview data corresponding to the archived designated data; and responsive to determining that the user verifies the set of preview data corresponding to the archived designated data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data. 19. The computer system of claim 18:
wherein the preview dataset is based on a data structure that maps respective portions of the metadata that correspond to the plurality of archived data at a beginning of the preview dataset; and wherein the preview dataset includes respective relative byte location (RBL) information corresponding to other information of a set of preview information respectively distributed within the preview dataset at RBL locations respectively associated with the plurality of preview data corresponding to the plurality of archived data. 20. The computer system of claim 15, further comprising:
program instructions to present, to a user, the set of preview data corresponding to the archived designated data; program instructions to determine that the user indicates to update the set of preview data corresponding to the archived designated data; program instructions to receive from the user, one or more additional elements of information to include among the set of preview data; and responsive to receiving the one or more additional elements of information to include among the set of preview data, program instructions to update a preview dataset to include the set of preview data corresponding to the archived designated data, wherein the preview dataset includes a plurality of sets of preview data that correspond to a plurality of archived data.
| 3,700
|
338,069
| 16,799,687
| 3,791
|
A system, method, and machine-readable storage medium for restoring a data object for a specified active time period are provided. In some embodiments, the method includes receiving, by a storage device from a client, a request specifying an active time period for a data object to remain stored on an accessible tier. The method also includes determining, by the storage device, that the active time period has elapsed. The method further includes responsive to a determination that the active time period has elapsed, sending, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier. Data objects that are stored on the accessible tier are accessible by the client, and data objects that are stored on the archive tier are inaccessible by the client.
|
1. A method comprising:
receiving, by a storage device from a client, a request specifying an active time period for a data object to remain stored on an accessible tier; determining, by the storage device, that the active time period has elapsed; and responsive to determining that the active time period has elapsed, sending, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier, wherein data objects that are stored on the accessible tier are accessible by the client and data objects that are stored on the archive tier are inaccessible by the client. 2. The method of claim 1, further comprising:
tracking, by the storage device, the data object in accordance with the active time period while the data object remains stored on the accessible tier. 3. The method of claim 1, further comprising:
sending, by the storage device to the client, a message specifying that the data object is inaccessible by the client in response to determining that the data object is inaccessible by the client, wherein the sending a message includes sending the message before receiving the request from the client specifying the active time period. 4. The method of claim 1, further comprising:
responsive to receiving a restore request from the client, sending, by the storage device, a request to the server to move the data object from the archive tier to the accessible tier. 5. The method of claim 1, further comprising:
sending, by the storage device, a request to the server to move the data object from the archive tier to the accessible tier. 6. The method of claim 1, further comprising:
sending, by the storage device to the client, a message specifying that the data object is inaccessible by the client, wherein the request specifying the active time period further includes a restore request for the data object to be restored. 7. The method of claim 1, further comprising:
scanning, by the storage device, metadata specifying a location type of the data object, a restore start timestamp indicating a start time of a restore of the data object, and a restore expiry timestamp indicating the active time period specified for the data object, the metadata being stored on a distributed datastore remote from the storage device. 8. The method of claim 1, further comprising:
determining, by the storage device, a re-tier timestamp based on a restore start timestamp and a restore expiry timestamp, the restore start timestamp indicating a start time of a restore of the data object, and the restore expiry timestamp indicating the active time period specified for the data object. 9. The method of claim 1, further comprising:
determining that a current timestamp has passed a re-tier timestamp, the re-tier timestamp being based on a restore start timestamp and a restore expiry timestamp, wherein determining that the active time period has elapsed includes in response to determining that the current timestamp has passed the re-tier timestamp, determining, by the storage device, that the active time period has elapsed. 10. A non-transitory machine-readable medium having stored thereon instructions for performing a method of restoring a data object, comprising machine executable code which when executed by at least one machine, causes the machine to:
receive, by a storage device from a client, a restore request identifying a data object for a restore and specifying an active time period for the data object to remain accessible via a cloud endpoint to the client; determine, by the storage device, that the active time period has elapsed; and responsive to a determination that the active time period has elapsed, send, by the storage device, a request to the cloud endpoint to move the data object to an archive tier, wherein data objects that are stored on the archive tier are inaccessible by the client. 11. The non-transitory machine-readable medium of claim 10, wherein the client and the storage device communicate using a first protocol, and the storage device and the cloud endpoint communicate using a second protocol different from the first protocol. 12. The non-transitory machine-readable medium of claim 10, wherein the cloud endpoint includes a plurality of tiers including an accessible tier and the archive tier, and wherein data objects that are restored are moved from the archive tier to the accessible tier for at least the active time period specified in the restore request. 13. The non-transitory machine-readable medium of claim 10, further comprising code, which causes the machine to:
track, by the storage device, the data object in accordance with the active time period while the data object remains accessible via the cloud endpoint. 14. The non-transitory machine-readable medium of claim 10, wherein an information lifecycle management (ILM) rule specifies archival of a restored data object when the restored data object has been accessible for at least the active time period specified in the restore request. 15. The non-transitory machine-readable medium of claim 10, further comprising code, which causes the machine to:
scan, by the storage device, metadata specifying a location type of the data object, a restore start timestamp indicating a start time of a restore of the data object, and a restore expiry timestamp indicating the active time period specified for the data object, the metadata being stored on a distributed datastore remote from the storage device. 16. The non-transitory machine-readable medium of claim 10, further comprising code, which causes the machine to:
determine, by the storage device, a re-tier timestamp based on a restore start timestamp indicating a start time of a restore of the data object and a restore expiry timestamp indicating the active time period specified for the data object, wherein the active time period has elapsed if a current timestamp has passed the re-tier timestamp. 17. A computing device comprising:
a memory containing a machine-readable medium comprising machine executable code having stored thereon instructions for performing a method of restoring a data object; and a processor coupled to the memory, the processor configured to execute the machine executable code to:
receive, by a storage device from a client, a restore request to restore a data object to an accessible tier and specifying an active time period for the data object to remain stored on the accessible tier;
determine, by the storage device, whether the restored data object has been stored on the accessible tier for at least the specified active time period; and
responsive to a determination that the restored data object has been stored on the accessible tier for at least the specified active time period, send, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier, wherein data objects that are stored on the accessible tier are accessible by the client and data objects that are stored on the archive tier are inaccessible by the client. 18. The computing device of claim 17, wherein the server includes a plurality of tiers including the accessible tier and the archive tier, and wherein data objects that are restored are moved from the archive tier to the accessible tier. 19. The computing device of claim 17, wherein an information lifecycle management (ILM) rule specifies archival of the restored data object when the restored data object has been stored on the accessible tier for at least the active time period specified in the restore request. 20. The computing device of claim 17, wherein the processor is configured to execute the machine executable code to:
track, by the storage device, the data object in accordance with the active time period while the data object remains stored on the accessible tier.
|
A system, method, and machine-readable storage medium for restoring a data object for a specified active time period are provided. In some embodiments, the method includes receiving, by a storage device from a client, a request specifying an active time period for a data object to remain stored on an accessible tier. The method also includes determining, by the storage device, that the active time period has elapsed. The method further includes responsive to a determination that the active time period has elapsed, sending, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier. Data objects that are stored on the accessible tier are accessible by the client, and data objects that are stored on the archive tier are inaccessible by the client.1. A method comprising:
receiving, by a storage device from a client, a request specifying an active time period for a data object to remain stored on an accessible tier; determining, by the storage device, that the active time period has elapsed; and responsive to determining that the active time period has elapsed, sending, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier, wherein data objects that are stored on the accessible tier are accessible by the client and data objects that are stored on the archive tier are inaccessible by the client. 2. The method of claim 1, further comprising:
tracking, by the storage device, the data object in accordance with the active time period while the data object remains stored on the accessible tier. 3. The method of claim 1, further comprising:
sending, by the storage device to the client, a message specifying that the data object is inaccessible by the client in response to determining that the data object is inaccessible by the client, wherein the sending a message includes sending the message before receiving the request from the client specifying the active time period. 4. The method of claim 1, further comprising:
responsive to receiving a restore request from the client, sending, by the storage device, a request to the server to move the data object from the archive tier to the accessible tier. 5. The method of claim 1, further comprising:
sending, by the storage device, a request to the server to move the data object from the archive tier to the accessible tier. 6. The method of claim 1, further comprising:
sending, by the storage device to the client, a message specifying that the data object is inaccessible by the client, wherein the request specifying the active time period further includes a restore request for the data object to be restored. 7. The method of claim 1, further comprising:
scanning, by the storage device, metadata specifying a location type of the data object, a restore start timestamp indicating a start time of a restore of the data object, and a restore expiry timestamp indicating the active time period specified for the data object, the metadata being stored on a distributed datastore remote from the storage device. 8. The method of claim 1, further comprising:
determining, by the storage device, a re-tier timestamp based on a restore start timestamp and a restore expiry timestamp, the restore start timestamp indicating a start time of a restore of the data object, and the restore expiry timestamp indicating the active time period specified for the data object. 9. The method of claim 1, further comprising:
determining that a current timestamp has passed a re-tier timestamp, the re-tier timestamp being based on a restore start timestamp and a restore expiry timestamp, wherein determining that the active time period has elapsed includes in response to determining that the current timestamp has passed the re-tier timestamp, determining, by the storage device, that the active time period has elapsed. 10. A non-transitory machine-readable medium having stored thereon instructions for performing a method of restoring a data object, comprising machine executable code which when executed by at least one machine, causes the machine to:
receive, by a storage device from a client, a restore request identifying a data object for a restore and specifying an active time period for the data object to remain accessible via a cloud endpoint to the client; determine, by the storage device, that the active time period has elapsed; and responsive to a determination that the active time period has elapsed, send, by the storage device, a request to the cloud endpoint to move the data object to an archive tier, wherein data objects that are stored on the archive tier are inaccessible by the client. 11. The non-transitory machine-readable medium of claim 10, wherein the client and the storage device communicate using a first protocol, and the storage device and the cloud endpoint communicate using a second protocol different from the first protocol. 12. The non-transitory machine-readable medium of claim 10, wherein the cloud endpoint includes a plurality of tiers including an accessible tier and the archive tier, and wherein data objects that are restored are moved from the archive tier to the accessible tier for at least the active time period specified in the restore request. 13. The non-transitory machine-readable medium of claim 10, further comprising code, which causes the machine to:
track, by the storage device, the data object in accordance with the active time period while the data object remains accessible via the cloud endpoint. 14. The non-transitory machine-readable medium of claim 10, wherein an information lifecycle management (ILM) rule specifies archival of a restored data object when the restored data object has been accessible for at least the active time period specified in the restore request. 15. The non-transitory machine-readable medium of claim 10, further comprising code, which causes the machine to:
scan, by the storage device, metadata specifying a location type of the data object, a restore start timestamp indicating a start time of a restore of the data object, and a restore expiry timestamp indicating the active time period specified for the data object, the metadata being stored on a distributed datastore remote from the storage device. 16. The non-transitory machine-readable medium of claim 10, further comprising code, which causes the machine to:
determine, by the storage device, a re-tier timestamp based on a restore start timestamp indicating a start time of a restore of the data object and a restore expiry timestamp indicating the active time period specified for the data object, wherein the active time period has elapsed if a current timestamp has passed the re-tier timestamp. 17. A computing device comprising:
a memory containing a machine-readable medium comprising machine executable code having stored thereon instructions for performing a method of restoring a data object; and a processor coupled to the memory, the processor configured to execute the machine executable code to:
receive, by a storage device from a client, a restore request to restore a data object to an accessible tier and specifying an active time period for the data object to remain stored on the accessible tier;
determine, by the storage device, whether the restored data object has been stored on the accessible tier for at least the specified active time period; and
responsive to a determination that the restored data object has been stored on the accessible tier for at least the specified active time period, send, by the storage device, a request to a server storing the data object to move the data object from the accessible tier to an archive tier, wherein data objects that are stored on the accessible tier are accessible by the client and data objects that are stored on the archive tier are inaccessible by the client. 18. The computing device of claim 17, wherein the server includes a plurality of tiers including the accessible tier and the archive tier, and wherein data objects that are restored are moved from the archive tier to the accessible tier. 19. The computing device of claim 17, wherein an information lifecycle management (ILM) rule specifies archival of the restored data object when the restored data object has been stored on the accessible tier for at least the active time period specified in the restore request. 20. The computing device of claim 17, wherein the processor is configured to execute the machine executable code to:
track, by the storage device, the data object in accordance with the active time period while the data object remains stored on the accessible tier.
| 3,700
|
338,070
| 16,799,625
| 3,791
|
Systems and methods are described to enable a DNS service to encode information into a network address to be advertised by the DNS service. Information encoded by a DNS service may include, for example, an identifier of a content set to which the network address corresponds (e.g., a domain name) and validity information, such as a digital signature, that verifies the validity of the network address. On receiving a request to communicate with the network address, a destination device associated with the network address may decode the encoded information within the network address to assist in processing the request. In some instances, the encoded information may be used to identify malicious network transmissions, such as transmissions forming part of a network attack, potentially without reliance on other data, such as separate mappings or contents of the data transmission.
|
1. A system comprising:
a data store storing computer-executable instructions; and a processor configured to execute the computer-executable instructions to:
obtain a request for a network address of a host device providing content associated with a domain name, wherein the request identifies the domain name, and wherein the domain name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device;
encode an identifier of the digital certificate the into the network address of the host device;
return the network address of the host device in response to the request;
receive a network request associated with the network address of the host device;
decode the network address of the host device to identify the digital certificate; and
initiate the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device. 2. The system of claim 1, wherein the network address is formatted as an Internet Protocol version 6 (IPv6) address. 3. The system of claim 1, wherein the network address comprises a first portion corresponding to routing information on a publically addressable network, and a second portion including the identifier of the digital certificate. 4. The system of claim 1, wherein the computer-executable instructions further cause the processor to:
encode into the network address validity information; and detect that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel. 5. The system of claim 4, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value. 6. The system of claim 4, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key. 7. A computer-implemented method comprising:
obtaining a request for a network address of a host device providing content associated with a domain name, wherein the request identifies the domain name, and wherein the domain name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device; encoding an identifier of the digital certificate the into the network address of the host device; returning the network address of the host device in response to the request; receiving a network request associated with the network address of the host device; decoding the network address of the host device to identify the digital certificate; and initiating the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device. 8. The computer-implemented method of claim 7 further comprising encoding into the network address at least one of the domain name, security information associated with the domain name, timing information of the request for the network address, information specifying a source of the request for the network address, or validity information indicating a validity of the network address generated based at least in part on the request for the network address. 9. The computer-implemented method of claim 7 further comprising:
encoding into the network address validity information; and
detecting that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel. 10. The computer-implemented method of claim 9, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value. 11. The computer-implemented method of claim 9, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key. 12. The computer-implemented method of claim 7, further comprising encoding into the network address a domain name, wherein encoding into the network address a domain name comprises:
hashing the domain name according to a hash function to result in a hash value; and including the hash value as a portion of the network address. 13. The computer-implemented method of claim 12, wherein the hash function is a cryptographic hash function. 14. Non-transitory computer-readable media comprising computer-executable instructions that, when executed, cause a computing system to:
obtain a request for a network address of a host device providing content associated with a domain name, wherein the request identifies the domain name, and wherein the domain name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device; encode an identifier of the digital certificate the into the network address of the host device; return the network address of the host device in response to the request; receive a network request associated with the network address of the host device; decode the network address of the host device to identify the digital certificate; and initiate the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device. 15. The non-transitory computer-readable media of claim 14, wherein the computer-executable instructions further cause the computing system to:
encode into the network address validity information; and detect that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel. 16. The non-transitory computer-readable media of claim 15, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value. 17. The non-transitory computer-readable media of claim 15, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key. 18. The non-transitory computer-readable media of claim 15, wherein the identifier of the digital certificate is encoded into the network address according to one or more encoding rules that specify individual bits of the network addresses used to encode the identifier of the digital certificate. 19. The non-transitory computer-readable media of claim 18, wherein the computer-executable instructions further cause the computing system to identify the one or more encoding rules, prior to encoding the identifier of the digital certificate the into the network address, based at least in part on a current time and a security level associated with the domain name. 20. The non-transitory computer-readable media of claim 18, wherein the computer-executable instructions further cause the computing system to:
encode an identifier of the one or more encoding rules into the network address; identify the one or more encoding rules based on the identifier of the one or more encoding rules encoded into the network address; and decode the network address of the host device based at least in part on the one or more encoding rules as identified based on the identifier of the one or more encoding rules encoded into the network address.
|
Systems and methods are described to enable a DNS service to encode information into a network address to be advertised by the DNS service. Information encoded by a DNS service may include, for example, an identifier of a content set to which the network address corresponds (e.g., a domain name) and validity information, such as a digital signature, that verifies the validity of the network address. On receiving a request to communicate with the network address, a destination device associated with the network address may decode the encoded information within the network address to assist in processing the request. In some instances, the encoded information may be used to identify malicious network transmissions, such as transmissions forming part of a network attack, potentially without reliance on other data, such as separate mappings or contents of the data transmission.1. A system comprising:
a data store storing computer-executable instructions; and a processor configured to execute the computer-executable instructions to:
obtain a request for a network address of a host device providing content associated with a domain name, wherein the request identifies the domain name, and wherein the domain name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device;
encode an identifier of the digital certificate the into the network address of the host device;
return the network address of the host device in response to the request;
receive a network request associated with the network address of the host device;
decode the network address of the host device to identify the digital certificate; and
initiate the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device. 2. The system of claim 1, wherein the network address is formatted as an Internet Protocol version 6 (IPv6) address. 3. The system of claim 1, wherein the network address comprises a first portion corresponding to routing information on a publically addressable network, and a second portion including the identifier of the digital certificate. 4. The system of claim 1, wherein the computer-executable instructions further cause the processor to:
encode into the network address validity information; and detect that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel. 5. The system of claim 4, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value. 6. The system of claim 4, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key. 7. A computer-implemented method comprising:
obtaining a request for a network address of a host device providing content associated with a domain name, wherein the request identifies the domain name, and wherein the domain name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device; encoding an identifier of the digital certificate the into the network address of the host device; returning the network address of the host device in response to the request; receiving a network request associated with the network address of the host device; decoding the network address of the host device to identify the digital certificate; and initiating the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device. 8. The computer-implemented method of claim 7 further comprising encoding into the network address at least one of the domain name, security information associated with the domain name, timing information of the request for the network address, information specifying a source of the request for the network address, or validity information indicating a validity of the network address generated based at least in part on the request for the network address. 9. The computer-implemented method of claim 7 further comprising:
encoding into the network address validity information; and
detecting that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel. 10. The computer-implemented method of claim 9, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value. 11. The computer-implemented method of claim 9, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key. 12. The computer-implemented method of claim 7, further comprising encoding into the network address a domain name, wherein encoding into the network address a domain name comprises:
hashing the domain name according to a hash function to result in a hash value; and including the hash value as a portion of the network address. 13. The computer-implemented method of claim 12, wherein the hash function is a cryptographic hash function. 14. Non-transitory computer-readable media comprising computer-executable instructions that, when executed, cause a computing system to:
obtain a request for a network address of a host device providing content associated with a domain name, wherein the request identifies the domain name, and wherein the domain name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device; encode an identifier of the digital certificate the into the network address of the host device; return the network address of the host device in response to the request; receive a network request associated with the network address of the host device; decode the network address of the host device to identify the digital certificate; and initiate the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device. 15. The non-transitory computer-readable media of claim 14, wherein the computer-executable instructions further cause the computing system to:
encode into the network address validity information; and detect that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel. 16. The non-transitory computer-readable media of claim 15, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value. 17. The non-transitory computer-readable media of claim 15, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key. 18. The non-transitory computer-readable media of claim 15, wherein the identifier of the digital certificate is encoded into the network address according to one or more encoding rules that specify individual bits of the network addresses used to encode the identifier of the digital certificate. 19. The non-transitory computer-readable media of claim 18, wherein the computer-executable instructions further cause the computing system to identify the one or more encoding rules, prior to encoding the identifier of the digital certificate the into the network address, based at least in part on a current time and a security level associated with the domain name. 20. The non-transitory computer-readable media of claim 18, wherein the computer-executable instructions further cause the computing system to:
encode an identifier of the one or more encoding rules into the network address; identify the one or more encoding rules based on the identifier of the one or more encoding rules encoded into the network address; and decode the network address of the host device based at least in part on the one or more encoding rules as identified based on the identifier of the one or more encoding rules encoded into the network address.
| 3,700
|
338,071
| 16,799,700
| 3,791
|
An induction cooker has a temperature sensor mount that includes a reciprocating sensor holder and a flexible diaphragm.
|
1. An induction cooker device comprising:
a chassis having an underside portion that is provided with one or more openings; and a fan that is adapted to draw air along an airflow path that extends from the one or more openings along an enclosed channel to a discharge vent. 2. The induction cooker device of claim 2, wherein the fan includes a discharge opening connected to the airflow path such that air is drawn through the discharge opening along the airflow path to the discharge vent. 3. The induction cooker device of claim 1, wherein the discharge vent is provided by an end wall of the chassis. 4. The induction cooker device of claim 3, wherein the enclosed channel includes a channel opening that is located adjacent to the end wall of the chassis. 5. The induction cooker device of claim 1, wherein the enclosed channel is provided by an upper component and a lower component, with the upper component forming a cover that, together with the lower component, forms the airflow path. 6. The induction cooker device of claim 5, wherein the lower component includes spaced apart fins that extend in the direction of the airflow path. 7. The induction cooker device of claim 6, wherein the lower component is formed from aluminum. 8. The induction cooker device of claim 6, further including one or more semiconductors mounted to the lower component. 9. The induction cooker device of claim 8, wherein a cooling airflow path associated with an induction coil assembly of the device does not co-mingle or share an air path with the airflow path associated with the semiconductors. 10. The induction cooker device of claim 2, further including an adaptor that connects the discharge opening of the fan with the air flow path. 11. The induction cooker device of claim 10, wherein the adaptor is formed from an elastomeric material to seal the air flow path. 12. The induction cooker device of claim 1, wherein the component includes an auxiliary outlet port that is formed at an angle relative to the direction of the air flow path. 13. An induction cooker comprising:
a chassis within which is formed a vent opening; a cooling fan that draws air through the vent opening; the cooling fan discharging the air into an enclosed channel having a component and a cover; the component being a heat sink onto which is mounted one or more semiconductor components; and the enclosed channel leading from the fan to a discharge vent. 14. The cooker of claim 13, wherein:
the heat sink has spaced apart fins that extend in the direction of an air flow in the enclosed channel. 15. An induction cooking device, comprising:
an induction coil assembly mounted to a chassis component; the induction coil assembly comprising a substrate that supports an induction element, the substrate having through openings through which extend fasteners that attach the substrate to the chassis component; and the opening being elongated in a radial direction to allow the substrate to expand in a radial direction.
|
An induction cooker has a temperature sensor mount that includes a reciprocating sensor holder and a flexible diaphragm.1. An induction cooker device comprising:
a chassis having an underside portion that is provided with one or more openings; and a fan that is adapted to draw air along an airflow path that extends from the one or more openings along an enclosed channel to a discharge vent. 2. The induction cooker device of claim 2, wherein the fan includes a discharge opening connected to the airflow path such that air is drawn through the discharge opening along the airflow path to the discharge vent. 3. The induction cooker device of claim 1, wherein the discharge vent is provided by an end wall of the chassis. 4. The induction cooker device of claim 3, wherein the enclosed channel includes a channel opening that is located adjacent to the end wall of the chassis. 5. The induction cooker device of claim 1, wherein the enclosed channel is provided by an upper component and a lower component, with the upper component forming a cover that, together with the lower component, forms the airflow path. 6. The induction cooker device of claim 5, wherein the lower component includes spaced apart fins that extend in the direction of the airflow path. 7. The induction cooker device of claim 6, wherein the lower component is formed from aluminum. 8. The induction cooker device of claim 6, further including one or more semiconductors mounted to the lower component. 9. The induction cooker device of claim 8, wherein a cooling airflow path associated with an induction coil assembly of the device does not co-mingle or share an air path with the airflow path associated with the semiconductors. 10. The induction cooker device of claim 2, further including an adaptor that connects the discharge opening of the fan with the air flow path. 11. The induction cooker device of claim 10, wherein the adaptor is formed from an elastomeric material to seal the air flow path. 12. The induction cooker device of claim 1, wherein the component includes an auxiliary outlet port that is formed at an angle relative to the direction of the air flow path. 13. An induction cooker comprising:
a chassis within which is formed a vent opening; a cooling fan that draws air through the vent opening; the cooling fan discharging the air into an enclosed channel having a component and a cover; the component being a heat sink onto which is mounted one or more semiconductor components; and the enclosed channel leading from the fan to a discharge vent. 14. The cooker of claim 13, wherein:
the heat sink has spaced apart fins that extend in the direction of an air flow in the enclosed channel. 15. An induction cooking device, comprising:
an induction coil assembly mounted to a chassis component; the induction coil assembly comprising a substrate that supports an induction element, the substrate having through openings through which extend fasteners that attach the substrate to the chassis component; and the opening being elongated in a radial direction to allow the substrate to expand in a radial direction.
| 3,700
|
338,072
| 16,799,711
| 3,791
|
A drive system for a tissue resection device that drives a cutting tube in a rotating and reciprocating motion simultaneously. The cutting tube moves within an outer tube having a window at a distal end thereof. When activation of the device ceases, the device remains powered until the cutting tube assumes an extended position, thereby closing the window.
|
1. A reciprocating drive system for a cutting tube comprising:
a power source; a motor connected to the power source and having a drive shaft extending therefrom; a first spur gear attached to the drive shaft; a worm connected to the drive shaft; a cutting tube adjacent the drive shaft and parallel thereto; a second spur gear surrounding the cutting tube and meshed with the first spur gear; a worm gear positioned under the worm and meshed therewith such that rotation of the worm around a first axis results in rotation of the worm gear around a second axis perpendicular to the first axis; and, a crank attached at one end to the worm gear and at a second end to a collar attached to the cutting tube; wherein rotation of the drive shaft causes rotation of the cutting tube via the first and second spur gears and simultaneously causes reciprocating translation of the cutting tube along a longitudinal axis thereof. 2. The reciprocating drive system of claim 1 further comprising a first switch connected to a toggle and electrically located between the power source and the motor such that the motor cannot receive current from the power source unless the first switch is closed. 3. The reciprocating drive system of claim 2 further comprising a second switch connected to an activation button and electrically located between the first switch and the motor such that the motor cannot receive current from the power source unless the first switch and second switches are closed. 4. The reciprocating drive system of claim 3 wherein the second switch is closed by depressing the activation button. 5. The reciprocating drive system of claim 3 further comprising a third switch electrically located between the first switch and the motor such that the motor cannot receive current from the power source unless the first switch and at least one of the second and third switches are closed. 6. The reciprocating drive system of claim 5 wherein the third switch is biased closed and is opened by a sleeve attached to the cutting tube and reciprocating therewith. 7. The reciprocating drive system of claim 6 wherein the sleeve is positioned on the cutting tube and relative to the third switch such that the third switch is opened with the cutting tube is in an extended position. 8. A method of resecting tissue comprising:
introducing a shaft of a tissue resection device into a target area, the shaft having a closed distal end, a first lumen extending through the shaft and ending proximal the distal end, the lumen carrying a cutting tube therein, the cutting tube attached to a drive system that simultaneously rotates and reciprocates the cutting tube within the shaft; drawing tissue to be resected into a window formed in the side of the shaft by applying suction to a second lumen that extends through the cutting tube; and, resecting the tissue by allowing the suction to hold the tissue in the window as the cutting tube translates from a retracted position in which the window is unobstructed to an extended position in which the cutting tube blocks the window, the tissue being cut by relative movement between a distal end of the cutting tube and an edge of the window. 9. The method of claim 8 wherein introducing the shaft of the tissue resection device into the target area comprises inserting the shaft through the working channel of a hysteroscope. 10. The method of claim 8 further comprising stopping suction to the window after a desired amount of tissue has been resected. 11. The method of claim 10 wherein stopping suction to the window comprises placing the cutting tube in the extended position, thereby blocking the window. 12. The method of claim 11 wherein placing the cutting tube in the extended position comprises releasing an activation button supplying current to a motor driving the cutting tube resulting in all current to the motor flowing through a safety switch that opens only when the cutting tube is in the extended position. 13. A tissue resection device comprising:
a power source; a single motor connected to the power source; an outer tube having a first lumen, a closed distal end, and a window through a sidewall thereof leading to the lumen, the window being located proximal of the closed distal end; and, an inner tube within the first lumen and having a second lumen extending between an open distal end and an open proximal end, wherein the open proximal end is connected to a suction source; wherein the inner tube is connected to the motor such that when the single motor receives current from the power source, the inner tube rotates and reciprocates simultaneously within the outer tube. 14. The device of claim 13 further comprising a first mechanism connecting the single motor and the inner tube that transfers rotational movement from a drive shaft of the single motor to the inner tube. 15. The device of claim 14 wherein the first mechanism comprises a first spur gear attached to the drive shaft and a second spur gear attached to the inner tube, wherein the first spur gear is meshed with the second spur gear. 16. The device of claim 13 further comprising a second mechanism connecting the single motor and the inner tube that converts rotational movement from a drive shaft of the single motor into reciprocating movement of the inner tube. 17. The device of claim 16 wherein the second mechanism comprises a worm attached to the drive shaft and a worm gear attached to the inner tube via a crank. 18. The device of claim 17 wherein the crank has a first end attached to the worm gear and a non-centric location and a second end attached to a collar on the inner tube. 19. The device of claim 13 further comprising a first switch and a second switch electrically connected in series between the power source and the single motor. 20. The device of claim 19 further comprising a third switch connected in parallel with the second switch between the first switch and the single motor.
|
A drive system for a tissue resection device that drives a cutting tube in a rotating and reciprocating motion simultaneously. The cutting tube moves within an outer tube having a window at a distal end thereof. When activation of the device ceases, the device remains powered until the cutting tube assumes an extended position, thereby closing the window.1. A reciprocating drive system for a cutting tube comprising:
a power source; a motor connected to the power source and having a drive shaft extending therefrom; a first spur gear attached to the drive shaft; a worm connected to the drive shaft; a cutting tube adjacent the drive shaft and parallel thereto; a second spur gear surrounding the cutting tube and meshed with the first spur gear; a worm gear positioned under the worm and meshed therewith such that rotation of the worm around a first axis results in rotation of the worm gear around a second axis perpendicular to the first axis; and, a crank attached at one end to the worm gear and at a second end to a collar attached to the cutting tube; wherein rotation of the drive shaft causes rotation of the cutting tube via the first and second spur gears and simultaneously causes reciprocating translation of the cutting tube along a longitudinal axis thereof. 2. The reciprocating drive system of claim 1 further comprising a first switch connected to a toggle and electrically located between the power source and the motor such that the motor cannot receive current from the power source unless the first switch is closed. 3. The reciprocating drive system of claim 2 further comprising a second switch connected to an activation button and electrically located between the first switch and the motor such that the motor cannot receive current from the power source unless the first switch and second switches are closed. 4. The reciprocating drive system of claim 3 wherein the second switch is closed by depressing the activation button. 5. The reciprocating drive system of claim 3 further comprising a third switch electrically located between the first switch and the motor such that the motor cannot receive current from the power source unless the first switch and at least one of the second and third switches are closed. 6. The reciprocating drive system of claim 5 wherein the third switch is biased closed and is opened by a sleeve attached to the cutting tube and reciprocating therewith. 7. The reciprocating drive system of claim 6 wherein the sleeve is positioned on the cutting tube and relative to the third switch such that the third switch is opened with the cutting tube is in an extended position. 8. A method of resecting tissue comprising:
introducing a shaft of a tissue resection device into a target area, the shaft having a closed distal end, a first lumen extending through the shaft and ending proximal the distal end, the lumen carrying a cutting tube therein, the cutting tube attached to a drive system that simultaneously rotates and reciprocates the cutting tube within the shaft; drawing tissue to be resected into a window formed in the side of the shaft by applying suction to a second lumen that extends through the cutting tube; and, resecting the tissue by allowing the suction to hold the tissue in the window as the cutting tube translates from a retracted position in which the window is unobstructed to an extended position in which the cutting tube blocks the window, the tissue being cut by relative movement between a distal end of the cutting tube and an edge of the window. 9. The method of claim 8 wherein introducing the shaft of the tissue resection device into the target area comprises inserting the shaft through the working channel of a hysteroscope. 10. The method of claim 8 further comprising stopping suction to the window after a desired amount of tissue has been resected. 11. The method of claim 10 wherein stopping suction to the window comprises placing the cutting tube in the extended position, thereby blocking the window. 12. The method of claim 11 wherein placing the cutting tube in the extended position comprises releasing an activation button supplying current to a motor driving the cutting tube resulting in all current to the motor flowing through a safety switch that opens only when the cutting tube is in the extended position. 13. A tissue resection device comprising:
a power source; a single motor connected to the power source; an outer tube having a first lumen, a closed distal end, and a window through a sidewall thereof leading to the lumen, the window being located proximal of the closed distal end; and, an inner tube within the first lumen and having a second lumen extending between an open distal end and an open proximal end, wherein the open proximal end is connected to a suction source; wherein the inner tube is connected to the motor such that when the single motor receives current from the power source, the inner tube rotates and reciprocates simultaneously within the outer tube. 14. The device of claim 13 further comprising a first mechanism connecting the single motor and the inner tube that transfers rotational movement from a drive shaft of the single motor to the inner tube. 15. The device of claim 14 wherein the first mechanism comprises a first spur gear attached to the drive shaft and a second spur gear attached to the inner tube, wherein the first spur gear is meshed with the second spur gear. 16. The device of claim 13 further comprising a second mechanism connecting the single motor and the inner tube that converts rotational movement from a drive shaft of the single motor into reciprocating movement of the inner tube. 17. The device of claim 16 wherein the second mechanism comprises a worm attached to the drive shaft and a worm gear attached to the inner tube via a crank. 18. The device of claim 17 wherein the crank has a first end attached to the worm gear and a non-centric location and a second end attached to a collar on the inner tube. 19. The device of claim 13 further comprising a first switch and a second switch electrically connected in series between the power source and the single motor. 20. The device of claim 19 further comprising a third switch connected in parallel with the second switch between the first switch and the single motor.
| 3,700
|
338,073
| 16,799,705
| 3,791
|
A plumbing fixture assembly including a fluid flow detection system for monitoring fluid flow and flow characteristics through plumbing fixtures without contacting the fluid. The fluid flow detection system communicates collected data related to the plumbing fixtures to a water management system, which analyzes the data and provides information to a user through a portal and user interface. The fluid flow detection system also tracks users of the plumbing fixtures for compliance with a hand washing routine. The hand washing compliance data is communicated to the water management system as well.
|
1. A faucet comprising:
a spout in fluid communication with a fluid source; a handle configured to control flow of fluid from the fluid source through the spout; a magnet positioned on the handle; a first sensor configured to detect a position of the magnet as the handle is moved; a controller in communication with the first sensor, wherein the controller is configured to determine at least one flow condition of the faucet upon activation of the handle to generate fluid flow through the spout, the at least one flow condition based on a position of the magnet; and a user interface in connection with the controller, wherein the user interface is configured to display the at least one flow condition. 2. The faucet of claim 1, wherein the sensor is configured to detect an angular position of the magnet. 3. The faucet of claim 1, wherein the sensor is configured to detect a linear position of the magnet. 4. The faucet of claim 1, wherein the controller includes calibration data based on a maximum faucet flow and the position of the magnet. 5. The faucet of claim 1, wherein is magnet is a two-pole ring magnet. 6. The faucet of claim 1, further comprising a soap dispenser, wherein the soap dispenser includes a second sensor configured to detect the dispensing of soap from the soap dispenser. 7. The faucet of claim 1, further comprising a timer configured to record a duration of time the handle is maintained at a position. 8. The faucet of claim 1, wherein the sensor is positioned on a main body of the faucet adjacent the magnet. 9. The faucet of claim 1, further comprising a plurality of LEDs in communication with the controller, wherein the LEDs direct a user to a hand washing routine. 10. The faucet of claim 9, wherein the LEDs are configured to illuminate in accordance with the hand washing routine. 11. A plumbing fixture assembly comprising:
a plumbing fixture including a handle; a first sensor positioned on the handle; a soap dispenser including a second sensor to activate the soap dispenser; a controller in communication with the first sensor and the second sensor, the controller including
a memory configured to store instructions, and
a processor coupled to the memory and configured, via execution of the instructions, to:
determine whether a hand-washing activity is in compliance with a predetermined hand washing routine based on the first sensor detecting how long the handle is maintained at an ON position and whether the second sensor is triggered after the handle turned to an ON position; and
a user interface in communication with the controller, wherein the user interface is configured to display whether the hand-washing activity is in compliance with the hand washing routine. 12. The plumbing fixture assembly of claim 11, further comprising a magnet positioned on the handle, and wherein the first sensor is configured to detect an angular position of the magnet as the handle moves. 13. The plumbing fixture assembly of claim 11, further comprising an identification system configured to detect the presence of a user of the plumbing fixture. 14. The plumbing fixture assembly of claim 11, further comprising a linear potentiometer coupled to the handle, and wherein the sensor is configured to detect a resistance value generated by the linear potentiometer. 15. The plumbing fixture assembly of claim 11, wherein the controller is configured to calculate at least one flow condition based on the first sensor. 16. A method of detecting flow through a faucet, the method comprising:
detecting an angular position of a magnet disposed on a handle of the faucet; determining, with a controller, whether water is flowing through the faucet based on the position of the magnet; determining, with the controller, a predicted rate of flow through the faucet when water is flowing through the faucet; and displaying the predicted rate of flow on a user interface. 17. The method of claim 16, further comprising:
detecting a temperature of at least one water supply for the faucet; calculating a predicted temperature based on a temperature of the at least one water supply and the position of the magnet; and displaying the predicted temperature on the user interface. 18. The method of claim 16, wherein the flow rate through the faucet is not directly measured. 19. The method of claim 16, further comprising calibrating the controller based on a maximum faucet flow and the position of the magnet. 20. The method of claim 16, wherein the position of the magnet is a discrete position over a continuous range of positions.
|
A plumbing fixture assembly including a fluid flow detection system for monitoring fluid flow and flow characteristics through plumbing fixtures without contacting the fluid. The fluid flow detection system communicates collected data related to the plumbing fixtures to a water management system, which analyzes the data and provides information to a user through a portal and user interface. The fluid flow detection system also tracks users of the plumbing fixtures for compliance with a hand washing routine. The hand washing compliance data is communicated to the water management system as well.1. A faucet comprising:
a spout in fluid communication with a fluid source; a handle configured to control flow of fluid from the fluid source through the spout; a magnet positioned on the handle; a first sensor configured to detect a position of the magnet as the handle is moved; a controller in communication with the first sensor, wherein the controller is configured to determine at least one flow condition of the faucet upon activation of the handle to generate fluid flow through the spout, the at least one flow condition based on a position of the magnet; and a user interface in connection with the controller, wherein the user interface is configured to display the at least one flow condition. 2. The faucet of claim 1, wherein the sensor is configured to detect an angular position of the magnet. 3. The faucet of claim 1, wherein the sensor is configured to detect a linear position of the magnet. 4. The faucet of claim 1, wherein the controller includes calibration data based on a maximum faucet flow and the position of the magnet. 5. The faucet of claim 1, wherein is magnet is a two-pole ring magnet. 6. The faucet of claim 1, further comprising a soap dispenser, wherein the soap dispenser includes a second sensor configured to detect the dispensing of soap from the soap dispenser. 7. The faucet of claim 1, further comprising a timer configured to record a duration of time the handle is maintained at a position. 8. The faucet of claim 1, wherein the sensor is positioned on a main body of the faucet adjacent the magnet. 9. The faucet of claim 1, further comprising a plurality of LEDs in communication with the controller, wherein the LEDs direct a user to a hand washing routine. 10. The faucet of claim 9, wherein the LEDs are configured to illuminate in accordance with the hand washing routine. 11. A plumbing fixture assembly comprising:
a plumbing fixture including a handle; a first sensor positioned on the handle; a soap dispenser including a second sensor to activate the soap dispenser; a controller in communication with the first sensor and the second sensor, the controller including
a memory configured to store instructions, and
a processor coupled to the memory and configured, via execution of the instructions, to:
determine whether a hand-washing activity is in compliance with a predetermined hand washing routine based on the first sensor detecting how long the handle is maintained at an ON position and whether the second sensor is triggered after the handle turned to an ON position; and
a user interface in communication with the controller, wherein the user interface is configured to display whether the hand-washing activity is in compliance with the hand washing routine. 12. The plumbing fixture assembly of claim 11, further comprising a magnet positioned on the handle, and wherein the first sensor is configured to detect an angular position of the magnet as the handle moves. 13. The plumbing fixture assembly of claim 11, further comprising an identification system configured to detect the presence of a user of the plumbing fixture. 14. The plumbing fixture assembly of claim 11, further comprising a linear potentiometer coupled to the handle, and wherein the sensor is configured to detect a resistance value generated by the linear potentiometer. 15. The plumbing fixture assembly of claim 11, wherein the controller is configured to calculate at least one flow condition based on the first sensor. 16. A method of detecting flow through a faucet, the method comprising:
detecting an angular position of a magnet disposed on a handle of the faucet; determining, with a controller, whether water is flowing through the faucet based on the position of the magnet; determining, with the controller, a predicted rate of flow through the faucet when water is flowing through the faucet; and displaying the predicted rate of flow on a user interface. 17. The method of claim 16, further comprising:
detecting a temperature of at least one water supply for the faucet; calculating a predicted temperature based on a temperature of the at least one water supply and the position of the magnet; and displaying the predicted temperature on the user interface. 18. The method of claim 16, wherein the flow rate through the faucet is not directly measured. 19. The method of claim 16, further comprising calibrating the controller based on a maximum faucet flow and the position of the magnet. 20. The method of claim 16, wherein the position of the magnet is a discrete position over a continuous range of positions.
| 3,700
|
338,074
| 16,799,667
| 3,791
|
A restocking system includes a first compartment for storing consumable items; a restocking suggestion unit configured to receive restocking suggestions from a remotely located server; an output interface configured to output the restocking suggestions to a user; and a first hardware button located in an interior of the first compartment. The first hardware button is configured to: after a first restocking suggestion is output by the output interface, prompt the user to provide a confirmation input regarding the first restocking suggestion; send a respective confirmation signal to the remotely located server if the first hardware button is activated by the user within a preset time window after the first restocking suggestion is output; and send a respective rejection signal to the remotely located server if the first hardware button is not activated within the preset time window. A corresponding restocking method is also disclosed.
|
1. A restocking system, comprising:
a first compartment for storing a plurality of consumable items; a restocking suggestion unit that is configured to receive restocking suggestions from a remotely located server over a network communication interface; an output interface configured to output the restocking suggestions to a user; and a first hardware button that is located in an interior of the first compartment, wherein the first hardware button is configured to:
after a first restocking suggestion from the remotely located server is output by the output interface, prompt the user to provide a confirmation input regarding the first restocking suggestion;
send a respective confirmation signal to the remotely located server in accordance with a determination that the first hardware button is activated by the user within a preset time window after the first restocking suggestion is output by the output interface; and
send a respective rejection signal to the remotely located server in accordance with a determination that the first hardware button is not activated within the preset time window after the first restocking suggestion is output by the output interface. 2. The restocking system of claim 1, including:
a voice input interface configured to capture voice inputs uttered by the user before the voice inputs are sent by a network communication unit to the remotely located server. 3. The restocking system of claim 1, wherein:
the first compartment is an enclosed compartment of a refrigerator; the enclosed compartment of the refrigerator has a door with an interior side facing an interior of the enclosed compartment when the door is in a closed state, and with an exterior side facing an exterior of the enclosed compartment when the door is in an open state; and the first hardware button is located on the interior side of the door within the interior of the enclosed compartment when the door is in the closed state. 4. The restocking system of claim 1, wherein the first hardware button includes a visual feedback component that is configured to generate a respective light pattern corresponding to a selected one of a plurality of confirmation request types in accordance with a suggestion type of the first restocking suggestion. 5. The restocking system of claim 1, including:
a second hardware button that is located adjacent to the first hardware button in the interior of the first compartment, wherein the second hardware button is configured to:
send a rejection signal to the remotely located digital assistant server in response to the second hardware button being activated by the user. 6. The restocking system of claim 1, wherein the output interface includes:
a touch-screen display that is configured to display a confirmation of the first restocking suggestion in accordance with user activation of the first hardware button. 7. The restocking system of claim 8, wherein the restocking suggestion unit is configured to:
cause display of the first restocking suggestion on the touch-screen display in accordance with a determination that the first compartment is in a closed state; and cause the first hardware button to generate a visual prompt for the confirmation input regarding the first restocking suggestion in accordance with a determination that the first compartment has switched from the closed state to an open state. 8. The restocking system of claim 1, including:
a second compartment that is distinct from the first compartment, wherein: the restocking suggestion unit is configured to cause the output interface to output a respective restocking suggestion with regard to an item stored in the first compartment in accordance with a determination that the first compartment is opened; and cause the output interface to output a respective restocking suggestion with regard to an item stored in the second compartment in accordance with a determination that the second compartment is opened. 9. The restocking system of claim 1, including:
a user presence detection unit, wherein the user presence detection unit is configured to detect a user's presence in a vicinity of the first compartment, wherein the user presence detection unit is configured to trigger the output interface to output the first restocking suggestion that has been received from the remotely located server. 10. The restocking system of claim 1, wherein the first hardware button has a built-in fingerprint sensor, and wherein the restocking system further includes an authentication unit that is configured to:
in accordance with a determination that the first restocking suggestion is of a first suggestion type that requires user authentication, transmit a fingerprint captured by the built-in fingerprint sensor to the remotely located server for authentication. 11. A method of providing restocking suggestions, comprising:
at an appliance including one or more processors, memory, and a first compartment for storing a plurality of consumable items:
outputting a first restocking suggestion through an output interface;
after the first restocking suggestion is output by the output interface, providing a first prompt, via a first hardware button that is located in an interior of the first compartment, to request a confirmation input from a user regarding the first restocking suggestion;
while providing the first prompt, detecting activation of the first hardware button by the user; and
in response to detecting the activation of the first hardware button while the first prompt is provided, sending a respective confirmation signal regarding the first restocking suggestion to a remotely located server. 12. The method of claim 11, including:
while providing the first prompt via the first hardware button, receiving a voice input rejecting the first restocking suggestion through a voice input interface; and in response to detecting a user's voice input rejecting the first voice-based restocking suggestion, ceasing to providing the first prompt via the first hardware button. 13. The method of claim 11, wherein:
the first compartment is an enclosed compartment of a refrigerator; the enclosed compartment of the refrigerator has a door with an interior side facing an interior of the enclosed compartment when the door is in a closed state, and with an exterior side facing an exterior of the enclosed compartment when the door is in an open state; and the first hardware button is located on an interior side of the door within the interior of the enclosed compartment when the door is in the closed state. 14. The method of claim 11, including:
generating a respective light pattern on the first hardware button that corresponds to a selected one of a plurality of confirmation request types in accordance with a suggestion type of the first voice-based restocking suggestion. 15. The method of claim 11, wherein:
the respective confirmation signal is sent to the remotely located server in accordance with a determination that the first hardware button is activated by the user within a preset time window after the first restocking suggestion is output by the output interface. 16. The method of claim 11, including:
displaying a confirmation of the first restocking suggestion in accordance with user activation of the first hardware button. 17. The method of claim 16, including:
displaying the first restocking suggestion on a touch-screen display in accordance with a determination that the first compartment is in a closed state; and generating a light prompt for the confirmation input regarding the first restocking suggestion using the first hardware button in accordance with a determination that the first compartment has switched from the closed state to an open state. 18. The method of claim 11, wherein the appliance includes a second compartment different from the first compartment, and the method includes:
outputting a respective restocking suggestion with regard to an item stored in the first compartment in accordance with a determination that the first compartment is opened; and outputting a respective restocking suggestion with regard to an item stored in the second compartment in accordance with a determination that the second compartment is opened. 19. The method of claim 11, including:
detecting presence of a user in a vicinity of the appliance, wherein outputting the first restocking suggestion is triggered in response to detecting the presence of the user in the vicinity of the appliance. 20. The method of claim 11, including:
capturing a fingerprint through the first hardware button when a touch input is detected on the first hardware button; and sending the fingerprint to the remotely located server in accordance with a determination that the first hardware button is activated by the touch input.
|
A restocking system includes a first compartment for storing consumable items; a restocking suggestion unit configured to receive restocking suggestions from a remotely located server; an output interface configured to output the restocking suggestions to a user; and a first hardware button located in an interior of the first compartment. The first hardware button is configured to: after a first restocking suggestion is output by the output interface, prompt the user to provide a confirmation input regarding the first restocking suggestion; send a respective confirmation signal to the remotely located server if the first hardware button is activated by the user within a preset time window after the first restocking suggestion is output; and send a respective rejection signal to the remotely located server if the first hardware button is not activated within the preset time window. A corresponding restocking method is also disclosed.1. A restocking system, comprising:
a first compartment for storing a plurality of consumable items; a restocking suggestion unit that is configured to receive restocking suggestions from a remotely located server over a network communication interface; an output interface configured to output the restocking suggestions to a user; and a first hardware button that is located in an interior of the first compartment, wherein the first hardware button is configured to:
after a first restocking suggestion from the remotely located server is output by the output interface, prompt the user to provide a confirmation input regarding the first restocking suggestion;
send a respective confirmation signal to the remotely located server in accordance with a determination that the first hardware button is activated by the user within a preset time window after the first restocking suggestion is output by the output interface; and
send a respective rejection signal to the remotely located server in accordance with a determination that the first hardware button is not activated within the preset time window after the first restocking suggestion is output by the output interface. 2. The restocking system of claim 1, including:
a voice input interface configured to capture voice inputs uttered by the user before the voice inputs are sent by a network communication unit to the remotely located server. 3. The restocking system of claim 1, wherein:
the first compartment is an enclosed compartment of a refrigerator; the enclosed compartment of the refrigerator has a door with an interior side facing an interior of the enclosed compartment when the door is in a closed state, and with an exterior side facing an exterior of the enclosed compartment when the door is in an open state; and the first hardware button is located on the interior side of the door within the interior of the enclosed compartment when the door is in the closed state. 4. The restocking system of claim 1, wherein the first hardware button includes a visual feedback component that is configured to generate a respective light pattern corresponding to a selected one of a plurality of confirmation request types in accordance with a suggestion type of the first restocking suggestion. 5. The restocking system of claim 1, including:
a second hardware button that is located adjacent to the first hardware button in the interior of the first compartment, wherein the second hardware button is configured to:
send a rejection signal to the remotely located digital assistant server in response to the second hardware button being activated by the user. 6. The restocking system of claim 1, wherein the output interface includes:
a touch-screen display that is configured to display a confirmation of the first restocking suggestion in accordance with user activation of the first hardware button. 7. The restocking system of claim 8, wherein the restocking suggestion unit is configured to:
cause display of the first restocking suggestion on the touch-screen display in accordance with a determination that the first compartment is in a closed state; and cause the first hardware button to generate a visual prompt for the confirmation input regarding the first restocking suggestion in accordance with a determination that the first compartment has switched from the closed state to an open state. 8. The restocking system of claim 1, including:
a second compartment that is distinct from the first compartment, wherein: the restocking suggestion unit is configured to cause the output interface to output a respective restocking suggestion with regard to an item stored in the first compartment in accordance with a determination that the first compartment is opened; and cause the output interface to output a respective restocking suggestion with regard to an item stored in the second compartment in accordance with a determination that the second compartment is opened. 9. The restocking system of claim 1, including:
a user presence detection unit, wherein the user presence detection unit is configured to detect a user's presence in a vicinity of the first compartment, wherein the user presence detection unit is configured to trigger the output interface to output the first restocking suggestion that has been received from the remotely located server. 10. The restocking system of claim 1, wherein the first hardware button has a built-in fingerprint sensor, and wherein the restocking system further includes an authentication unit that is configured to:
in accordance with a determination that the first restocking suggestion is of a first suggestion type that requires user authentication, transmit a fingerprint captured by the built-in fingerprint sensor to the remotely located server for authentication. 11. A method of providing restocking suggestions, comprising:
at an appliance including one or more processors, memory, and a first compartment for storing a plurality of consumable items:
outputting a first restocking suggestion through an output interface;
after the first restocking suggestion is output by the output interface, providing a first prompt, via a first hardware button that is located in an interior of the first compartment, to request a confirmation input from a user regarding the first restocking suggestion;
while providing the first prompt, detecting activation of the first hardware button by the user; and
in response to detecting the activation of the first hardware button while the first prompt is provided, sending a respective confirmation signal regarding the first restocking suggestion to a remotely located server. 12. The method of claim 11, including:
while providing the first prompt via the first hardware button, receiving a voice input rejecting the first restocking suggestion through a voice input interface; and in response to detecting a user's voice input rejecting the first voice-based restocking suggestion, ceasing to providing the first prompt via the first hardware button. 13. The method of claim 11, wherein:
the first compartment is an enclosed compartment of a refrigerator; the enclosed compartment of the refrigerator has a door with an interior side facing an interior of the enclosed compartment when the door is in a closed state, and with an exterior side facing an exterior of the enclosed compartment when the door is in an open state; and the first hardware button is located on an interior side of the door within the interior of the enclosed compartment when the door is in the closed state. 14. The method of claim 11, including:
generating a respective light pattern on the first hardware button that corresponds to a selected one of a plurality of confirmation request types in accordance with a suggestion type of the first voice-based restocking suggestion. 15. The method of claim 11, wherein:
the respective confirmation signal is sent to the remotely located server in accordance with a determination that the first hardware button is activated by the user within a preset time window after the first restocking suggestion is output by the output interface. 16. The method of claim 11, including:
displaying a confirmation of the first restocking suggestion in accordance with user activation of the first hardware button. 17. The method of claim 16, including:
displaying the first restocking suggestion on a touch-screen display in accordance with a determination that the first compartment is in a closed state; and generating a light prompt for the confirmation input regarding the first restocking suggestion using the first hardware button in accordance with a determination that the first compartment has switched from the closed state to an open state. 18. The method of claim 11, wherein the appliance includes a second compartment different from the first compartment, and the method includes:
outputting a respective restocking suggestion with regard to an item stored in the first compartment in accordance with a determination that the first compartment is opened; and outputting a respective restocking suggestion with regard to an item stored in the second compartment in accordance with a determination that the second compartment is opened. 19. The method of claim 11, including:
detecting presence of a user in a vicinity of the appliance, wherein outputting the first restocking suggestion is triggered in response to detecting the presence of the user in the vicinity of the appliance. 20. The method of claim 11, including:
capturing a fingerprint through the first hardware button when a touch input is detected on the first hardware button; and sending the fingerprint to the remotely located server in accordance with a determination that the first hardware button is activated by the touch input.
| 3,700
|
338,075
| 16,799,725
| 3,791
|
Methods and apparatuses are described for enterprise access control governance in a computerized information technology (IT) architecture. A server determines access control entitlements for each of a plurality of users of the IT architecture, and converts the access control entitlements for each user into a multidimensional vector. The server generates a vector space comprising a plurality of nodes, each node in the vector space corresponding to a multidimensional vector associated with the access control entitlements. The server determines clusters of nodes in the vector space by using a similarity measure based upon dimensions of the vector. The server identifies a job role associated with each of the clusters of nodes in the vector space based upon access control entitlements that are common to the nodes. The server locates outlier nodes in the vector space positioned at least a predetermined distance away from at least one of the clusters. The server determines differences between the entitlements for each of the outlier nodes and the entitlements for a node in the nearest one or more clusters and adjusts the existing entitlements for the each user associated with the outlier nodes based upon the determined difference.
|
1. A system for enterprise access control governance in a computerized information technology (IT) architecture, the system comprising a server computing device having a memory that stores computer-executable instructions and a processor that executes the computer-executable instructions to:
determine a set of access control entitlements for each of a plurality of users of the computerized IT architecture; convert each set of access control entitlements for each of the plurality of users into a multidimensional vector; generate a vector space comprising a plurality of nodes, each node in the vector space corresponding to a multidimensional vector associated with the access control entitlements; determine one or more clusters of nodes in the vector space by using a similarity measure to compare each node in the vector space to the other nodes, the similarity measure based upon one or more dimensions of the multidimensional vector; identify a job role associated with each of the one or more clusters of nodes in the vector space based upon one or more access control entitlements that are common to at least a portion of the nodes in each cluster; locate one or more outlier nodes in the vector space, the one or more outlier nodes positioned at least a predetermined distance away from at least one of the one or more clusters in the vector space; determine at least one difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters; adjust the set of existing access control entitlements for the each of the users associated with the one or more outlier nodes based upon the determined difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters. 2. The system of claim 1, wherein the difference comprises an entitlement in the set of access control entitlements for the one or more outlier nodes that is not included in the set of access control entitlements for at least one node in the nearest one or more clusters. 3. The system of claim 1, wherein the difference comprises an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters that is not included in the set of access control entitlements for the one or more outlier nodes. 4. The system of claim 1, wherein the difference comprises a difference between a value assigned to an entitlement in the set of access control entitlements for the one or more outlier nodes and a value assigned to an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters. 5. The system of claim 1, wherein the server computing device identifies one or more access control security risks based upon the difference. 6. The system of claim 5, wherein the server computing device executes access control workflow instructions in an information technology access control system to adjust the set of access control entitlements for the one or more outlier nodes based upon the identified access control security risks. 7. The system of claim 6, wherein the access control workflow instructions comprise one or more of: adding new entitlements to the set of access control entitlements for the one or more outlier nodes, changing one or more values of an entitlement in the set of access control entitlements for the one or more outlier nodes, or removing one or more entitlements from the set of access control entitlements for the one or more outlier nodes. 8. The system of claim 1, wherein the job role comprises one or more job role attributes, including: a job function, a title, a manager to which the job role is assigned, a business unit to which the job role is assigned, and an organization to which the job role is assigned. 9. The system of claim 1, wherein each entitlement in the set of access control entitlements comprises one or more entitlement attributes, including: a name of the entitlement, a description of the entitlement, one or more privileged access flags, an application to which the entitlement is assigned, and a computing system to which the entitlement is assigned. 10. The system of claim 1, wherein the similarity measure is a cosine similarity based upon a normalized dot product of (i) a dimension of the multidimensional vector for a first node and (ii) the corresponding dimension of the multidimensional vector for each other node. 11. The system of claim 10, wherein the server computing device generates a one-dimensional distance matrix based upon the similarity measure and scales the one-dimensional distance matrix to a multidimensional distance matrix using a distance-preserving manifold learning method. 12. The system of claim 1, wherein the server computing device uses k-means clustering to identify the one or more clusters. 13. The system of claim 1, wherein the server computing device generates a two-dimensional graphical representation of the vector space that depicts the one or more clusters and the one or more outlier nodes color-coded according to the identified job role. 14. A computerized method of enterprise access control governance in a computerized information technology (IT) architecture, the method comprising:
determining, by a server computing device, a set of access control entitlements for each of a plurality of users of the computerized IT architecture; converting, by the server computing device, each set of access control entitlements for each of the plurality of users into a multidimensional vector; generating, by the server computing device, a vector space comprising a plurality of nodes, each node in the vector space corresponding to a multidimensional vector associated with the access control entitlements; determining, by the server computing device, one or more clusters of nodes in the vector space by using a similarity measure to compare each node in the vector space to the other nodes, the similarity measure based upon one or more dimensions of the multidimensional vector; identifying, by the server computing device, a job role associated with each of the one or more clusters of nodes in the vector space based upon one or more access control entitlements that are common to at least a portion of the nodes in each cluster; locating, by the server computing device, one or more outlier nodes in the vector space, the one or more outlier nodes positioned at least a predetermined distance away from at least one of the one or more clusters in the vector space; determining, by the server computing device, at least one difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters; and adjusting, by the server computing device, the set of existing access control entitlements for the each of the users associated with the one or more outlier nodes based upon the determined difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters. 15. The method of claim 14, wherein the difference comprises an entitlement in the set of access control entitlements for the one or more outlier nodes that is not included in the set of access control entitlements for at least one node in the nearest one or more clusters. 16. The method of claim 14, wherein the difference comprises an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters that is not included in the set of access control entitlements for the one or more outlier nodes. 17. The method of claim 14, wherein the difference comprises a difference between a value assigned to an entitlement in the set of access control entitlements for the one or more outlier nodes and a value assigned to an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters. 18. The method of claim 14, wherein the server computing device identifies one or more access control security risks based upon the difference. 19. The method of claim 18, wherein the server computing device executes access control workflow instructions in an information technology access control system to adjust the set of access control entitlements for the one or more outlier nodes based upon the identified access control security risks. 20. The method of claim 19, wherein the access control workflow instructions comprise one or more of: adding new entitlements to the set of access control entitlements for the one or more outlier nodes, changing one or more values of an entitlement in the set of access control entitlements for the one or more outlier nodes, or removing one or more entitlements from the set of access control entitlements for the one or more outlier nodes. 21. The method of claim 14, wherein the job role comprises one or more job role attributes, including: a job function, a title, a manager to which the job role is assigned, a business unit to which the job role is assigned, and an organization to which the job role is assigned. 22. The method of claim 14, wherein each entitlement in the set of access control entitlements comprises one or more entitlement attributes, including: a name of the entitlement, a description of the entitlement, one or more privileged access flags, an application to which the entitlement is assigned, and a computing system to which the entitlement is assigned. 23. The method of claim 14, wherein the similarity measure is a cosine similarity based upon a normalized dot product of (i) a dimension of the multidimensional vector for a first node and (ii) the corresponding dimension of the multidimensional vector for each other node. 24. The method of claim 23, wherein the server computing device generates a one-dimensional distance matrix based upon the similarity measure and scales the one-dimensional distance matrix to a multidimensional distance matrix using a distance-preserving manifold learning method. 25. The method of claim 14, wherein the server computing device uses k-means clustering to identify the one or more clusters. 26. The method of claim 14, wherein the server computing device generates a two-dimensional graphical representation of the vector space that depicts the one or more clusters and the one or more outlier nodes color-coded according to the identified job role.
|
Methods and apparatuses are described for enterprise access control governance in a computerized information technology (IT) architecture. A server determines access control entitlements for each of a plurality of users of the IT architecture, and converts the access control entitlements for each user into a multidimensional vector. The server generates a vector space comprising a plurality of nodes, each node in the vector space corresponding to a multidimensional vector associated with the access control entitlements. The server determines clusters of nodes in the vector space by using a similarity measure based upon dimensions of the vector. The server identifies a job role associated with each of the clusters of nodes in the vector space based upon access control entitlements that are common to the nodes. The server locates outlier nodes in the vector space positioned at least a predetermined distance away from at least one of the clusters. The server determines differences between the entitlements for each of the outlier nodes and the entitlements for a node in the nearest one or more clusters and adjusts the existing entitlements for the each user associated with the outlier nodes based upon the determined difference.1. A system for enterprise access control governance in a computerized information technology (IT) architecture, the system comprising a server computing device having a memory that stores computer-executable instructions and a processor that executes the computer-executable instructions to:
determine a set of access control entitlements for each of a plurality of users of the computerized IT architecture; convert each set of access control entitlements for each of the plurality of users into a multidimensional vector; generate a vector space comprising a plurality of nodes, each node in the vector space corresponding to a multidimensional vector associated with the access control entitlements; determine one or more clusters of nodes in the vector space by using a similarity measure to compare each node in the vector space to the other nodes, the similarity measure based upon one or more dimensions of the multidimensional vector; identify a job role associated with each of the one or more clusters of nodes in the vector space based upon one or more access control entitlements that are common to at least a portion of the nodes in each cluster; locate one or more outlier nodes in the vector space, the one or more outlier nodes positioned at least a predetermined distance away from at least one of the one or more clusters in the vector space; determine at least one difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters; adjust the set of existing access control entitlements for the each of the users associated with the one or more outlier nodes based upon the determined difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters. 2. The system of claim 1, wherein the difference comprises an entitlement in the set of access control entitlements for the one or more outlier nodes that is not included in the set of access control entitlements for at least one node in the nearest one or more clusters. 3. The system of claim 1, wherein the difference comprises an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters that is not included in the set of access control entitlements for the one or more outlier nodes. 4. The system of claim 1, wherein the difference comprises a difference between a value assigned to an entitlement in the set of access control entitlements for the one or more outlier nodes and a value assigned to an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters. 5. The system of claim 1, wherein the server computing device identifies one or more access control security risks based upon the difference. 6. The system of claim 5, wherein the server computing device executes access control workflow instructions in an information technology access control system to adjust the set of access control entitlements for the one or more outlier nodes based upon the identified access control security risks. 7. The system of claim 6, wherein the access control workflow instructions comprise one or more of: adding new entitlements to the set of access control entitlements for the one or more outlier nodes, changing one or more values of an entitlement in the set of access control entitlements for the one or more outlier nodes, or removing one or more entitlements from the set of access control entitlements for the one or more outlier nodes. 8. The system of claim 1, wherein the job role comprises one or more job role attributes, including: a job function, a title, a manager to which the job role is assigned, a business unit to which the job role is assigned, and an organization to which the job role is assigned. 9. The system of claim 1, wherein each entitlement in the set of access control entitlements comprises one or more entitlement attributes, including: a name of the entitlement, a description of the entitlement, one or more privileged access flags, an application to which the entitlement is assigned, and a computing system to which the entitlement is assigned. 10. The system of claim 1, wherein the similarity measure is a cosine similarity based upon a normalized dot product of (i) a dimension of the multidimensional vector for a first node and (ii) the corresponding dimension of the multidimensional vector for each other node. 11. The system of claim 10, wherein the server computing device generates a one-dimensional distance matrix based upon the similarity measure and scales the one-dimensional distance matrix to a multidimensional distance matrix using a distance-preserving manifold learning method. 12. The system of claim 1, wherein the server computing device uses k-means clustering to identify the one or more clusters. 13. The system of claim 1, wherein the server computing device generates a two-dimensional graphical representation of the vector space that depicts the one or more clusters and the one or more outlier nodes color-coded according to the identified job role. 14. A computerized method of enterprise access control governance in a computerized information technology (IT) architecture, the method comprising:
determining, by a server computing device, a set of access control entitlements for each of a plurality of users of the computerized IT architecture; converting, by the server computing device, each set of access control entitlements for each of the plurality of users into a multidimensional vector; generating, by the server computing device, a vector space comprising a plurality of nodes, each node in the vector space corresponding to a multidimensional vector associated with the access control entitlements; determining, by the server computing device, one or more clusters of nodes in the vector space by using a similarity measure to compare each node in the vector space to the other nodes, the similarity measure based upon one or more dimensions of the multidimensional vector; identifying, by the server computing device, a job role associated with each of the one or more clusters of nodes in the vector space based upon one or more access control entitlements that are common to at least a portion of the nodes in each cluster; locating, by the server computing device, one or more outlier nodes in the vector space, the one or more outlier nodes positioned at least a predetermined distance away from at least one of the one or more clusters in the vector space; determining, by the server computing device, at least one difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters; and adjusting, by the server computing device, the set of existing access control entitlements for the each of the users associated with the one or more outlier nodes based upon the determined difference between the set of access control entitlements for each of the one or more outlier nodes and the set of access control entitlements for at least one node in the nearest one or more clusters. 15. The method of claim 14, wherein the difference comprises an entitlement in the set of access control entitlements for the one or more outlier nodes that is not included in the set of access control entitlements for at least one node in the nearest one or more clusters. 16. The method of claim 14, wherein the difference comprises an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters that is not included in the set of access control entitlements for the one or more outlier nodes. 17. The method of claim 14, wherein the difference comprises a difference between a value assigned to an entitlement in the set of access control entitlements for the one or more outlier nodes and a value assigned to an entitlement in the set of access control entitlements for at least one node in the nearest one or more clusters. 18. The method of claim 14, wherein the server computing device identifies one or more access control security risks based upon the difference. 19. The method of claim 18, wherein the server computing device executes access control workflow instructions in an information technology access control system to adjust the set of access control entitlements for the one or more outlier nodes based upon the identified access control security risks. 20. The method of claim 19, wherein the access control workflow instructions comprise one or more of: adding new entitlements to the set of access control entitlements for the one or more outlier nodes, changing one or more values of an entitlement in the set of access control entitlements for the one or more outlier nodes, or removing one or more entitlements from the set of access control entitlements for the one or more outlier nodes. 21. The method of claim 14, wherein the job role comprises one or more job role attributes, including: a job function, a title, a manager to which the job role is assigned, a business unit to which the job role is assigned, and an organization to which the job role is assigned. 22. The method of claim 14, wherein each entitlement in the set of access control entitlements comprises one or more entitlement attributes, including: a name of the entitlement, a description of the entitlement, one or more privileged access flags, an application to which the entitlement is assigned, and a computing system to which the entitlement is assigned. 23. The method of claim 14, wherein the similarity measure is a cosine similarity based upon a normalized dot product of (i) a dimension of the multidimensional vector for a first node and (ii) the corresponding dimension of the multidimensional vector for each other node. 24. The method of claim 23, wherein the server computing device generates a one-dimensional distance matrix based upon the similarity measure and scales the one-dimensional distance matrix to a multidimensional distance matrix using a distance-preserving manifold learning method. 25. The method of claim 14, wherein the server computing device uses k-means clustering to identify the one or more clusters. 26. The method of claim 14, wherein the server computing device generates a two-dimensional graphical representation of the vector space that depicts the one or more clusters and the one or more outlier nodes color-coded according to the identified job role.
| 3,700
|
338,076
| 16,799,727
| 3,791
|
An artificial intelligence device includes a microphone configured to acquire speech including a plurality of languages, and a processor configured to generate, from the speech, text data corresponding to the speech, generate a plurality of pieces of separated data acquired by separating the text data for each language, perform natural language understanding processing corresponding to a language of each of the plurality of pieces of separated data to generate a natural language understanding processing result for each of the plurality of pieces of separated data, acquire command information about a command to be instructed by the speech and slot information about an entity subjected to the command, based on the natural language understanding processing result, perform an operation corresponding to the speech based on the command information and the slot information, and generate a response based on a result of performing the operation.
|
1. A method comprising:
acquiring speech including a plurality of languages; generating, from the speech, text data corresponding to the acquired speech; generating a plurality of separated data acquired by separating the generated text data according to each language of the plurality of languages; performing natural language processing for each of the plurality of separated data based on each corresponding language to generate a natural language processing result for the plurality of separated data; acquiring command information and slot information based on the natural language processing result, wherein the command information corresponds to a command that is instructed based on the speech and the slot information corresponds to a subject of the command information; causing an operation to be performed corresponding to the speech based on the acquired command information and the acquired slot information; and generating a response based on performance of the operation. 2. The method of claim 1, wherein the plurality of languages includes a first language and a second language, and
wherein the plurality of separated data includes first separated data for the first language and second separated data for the second language. 3. The method of claim 1, wherein the separated data comprise at least one of a language type, a text corresponding to the acquired speech, a main intent, a non-intent, intent information, or subject information. 4. The method of claim 1, wherein the natural language processing result is generated by acquiring at least one of intent information or subject information about each of the plurality of separated data. 5. The method of claim 4, wherein the natural language processing result is generated by determining main intent in the intent information included in the plurality of separated data, wherein the main intent is information indicating whether the separated data corresponds to a primary purpose of the speech. 6. The method of claim 5, wherein the natural language processing result is further generated by updating subject information included in the separated data based on the main intent. 7. The method of claim 5, wherein the slot information are acquired by acquiring slot information corresponding to the main intent based on the subject information. 8. The method of claim 1, wherein causing the operation to be performed comprises:
determining an external device configured to perform the operation corresponding to the command information based on the slot information; transmitting the command information to the external device; and receiving, from the external device, a result of performing the operation corresponding to the command information. 9. The method of claim 5, wherein generating the response further comprises generating a natural language response based on a language type of the separated data corresponding to the main intent. 10. The method of claim 1, further comprising determining the plurality of languages included in the generated text data based on a code range for each language of a character encoding system. 11. An artificial intelligence device comprising:
a microphone configured to acquire speech including a plurality of languages; and a processor configured to: generate, from the speech, text data corresponding to the acquired speech; generate a plurality of pieces of separated data acquired by separating the generated text data according to each language of the plurality of languages; perform natural language processing for each of the plurality of separated data based on each corresponding language to generate a natural language processing result for the plurality of separated data; acquire command information and slot information based on the natural language processing result, wherein the command information corresponds to a command that is instructed based on the speech and the slot information corresponds to a subject of the command information; causing an operation to be performed corresponding to the speech based on the acquired command information and the acquired slot information; and generate a response based on performance of the operation. 12. The artificial intelligence device according to claim 11, wherein the plurality of languages includes a first language and a second language, and wherein the plurality of separated data includes first separated data for the first language and second separated data for the second language. 13. The artificial intelligence device according to claim 11, wherein the separated data comprise at least one of a language type, a text corresponding to the acquired speech, a main intent, a non-intent, intent information, or subject information. 14. The artificial intelligence device according to claim 11, wherein the natural language processing result is generated by acquiring at least one of intent information or subject information about each of the plurality of separated data. 15. The artificial intelligence device according to claim 14, wherein the natural language processing result is generated by determining main intent in the intent information included in the plurality of pieces of separated data, wherein the main intent is information indicating whether the separated data corresponds to a primary purpose of the speech. 16. The artificial intelligence device according to claim 15, wherein the natural language processing result is further generated by updating subject information included in the separated data based on the main intent. 17. The artificial intelligence device according to claim 15, wherein the slot information are acquired by acquiring slot information corresponding to the main intent based on the subject information. 18. The artificial intelligence device according to claim 11, wherein the causing the operation to be performed comprises:
determining an external device configured to perform the operation corresponding to the command information based on the slot information; transmitting the command information to the external device; and receiving, from the external device, a result of performing the operation corresponding to the command information. 19. The artificial intelligence device according to claim 15, wherein generating the response further comprises generating a natural language response based on a language type of the separated data corresponding to the main intent. 20. The artificial intelligence device according to claim 11, wherein the processor is further configured to determine the plurality of languages included in the generated text data based on a code range for each language of a character encoding system.
|
An artificial intelligence device includes a microphone configured to acquire speech including a plurality of languages, and a processor configured to generate, from the speech, text data corresponding to the speech, generate a plurality of pieces of separated data acquired by separating the text data for each language, perform natural language understanding processing corresponding to a language of each of the plurality of pieces of separated data to generate a natural language understanding processing result for each of the plurality of pieces of separated data, acquire command information about a command to be instructed by the speech and slot information about an entity subjected to the command, based on the natural language understanding processing result, perform an operation corresponding to the speech based on the command information and the slot information, and generate a response based on a result of performing the operation.1. A method comprising:
acquiring speech including a plurality of languages; generating, from the speech, text data corresponding to the acquired speech; generating a plurality of separated data acquired by separating the generated text data according to each language of the plurality of languages; performing natural language processing for each of the plurality of separated data based on each corresponding language to generate a natural language processing result for the plurality of separated data; acquiring command information and slot information based on the natural language processing result, wherein the command information corresponds to a command that is instructed based on the speech and the slot information corresponds to a subject of the command information; causing an operation to be performed corresponding to the speech based on the acquired command information and the acquired slot information; and generating a response based on performance of the operation. 2. The method of claim 1, wherein the plurality of languages includes a first language and a second language, and
wherein the plurality of separated data includes first separated data for the first language and second separated data for the second language. 3. The method of claim 1, wherein the separated data comprise at least one of a language type, a text corresponding to the acquired speech, a main intent, a non-intent, intent information, or subject information. 4. The method of claim 1, wherein the natural language processing result is generated by acquiring at least one of intent information or subject information about each of the plurality of separated data. 5. The method of claim 4, wherein the natural language processing result is generated by determining main intent in the intent information included in the plurality of separated data, wherein the main intent is information indicating whether the separated data corresponds to a primary purpose of the speech. 6. The method of claim 5, wherein the natural language processing result is further generated by updating subject information included in the separated data based on the main intent. 7. The method of claim 5, wherein the slot information are acquired by acquiring slot information corresponding to the main intent based on the subject information. 8. The method of claim 1, wherein causing the operation to be performed comprises:
determining an external device configured to perform the operation corresponding to the command information based on the slot information; transmitting the command information to the external device; and receiving, from the external device, a result of performing the operation corresponding to the command information. 9. The method of claim 5, wherein generating the response further comprises generating a natural language response based on a language type of the separated data corresponding to the main intent. 10. The method of claim 1, further comprising determining the plurality of languages included in the generated text data based on a code range for each language of a character encoding system. 11. An artificial intelligence device comprising:
a microphone configured to acquire speech including a plurality of languages; and a processor configured to: generate, from the speech, text data corresponding to the acquired speech; generate a plurality of pieces of separated data acquired by separating the generated text data according to each language of the plurality of languages; perform natural language processing for each of the plurality of separated data based on each corresponding language to generate a natural language processing result for the plurality of separated data; acquire command information and slot information based on the natural language processing result, wherein the command information corresponds to a command that is instructed based on the speech and the slot information corresponds to a subject of the command information; causing an operation to be performed corresponding to the speech based on the acquired command information and the acquired slot information; and generate a response based on performance of the operation. 12. The artificial intelligence device according to claim 11, wherein the plurality of languages includes a first language and a second language, and wherein the plurality of separated data includes first separated data for the first language and second separated data for the second language. 13. The artificial intelligence device according to claim 11, wherein the separated data comprise at least one of a language type, a text corresponding to the acquired speech, a main intent, a non-intent, intent information, or subject information. 14. The artificial intelligence device according to claim 11, wherein the natural language processing result is generated by acquiring at least one of intent information or subject information about each of the plurality of separated data. 15. The artificial intelligence device according to claim 14, wherein the natural language processing result is generated by determining main intent in the intent information included in the plurality of pieces of separated data, wherein the main intent is information indicating whether the separated data corresponds to a primary purpose of the speech. 16. The artificial intelligence device according to claim 15, wherein the natural language processing result is further generated by updating subject information included in the separated data based on the main intent. 17. The artificial intelligence device according to claim 15, wherein the slot information are acquired by acquiring slot information corresponding to the main intent based on the subject information. 18. The artificial intelligence device according to claim 11, wherein the causing the operation to be performed comprises:
determining an external device configured to perform the operation corresponding to the command information based on the slot information; transmitting the command information to the external device; and receiving, from the external device, a result of performing the operation corresponding to the command information. 19. The artificial intelligence device according to claim 15, wherein generating the response further comprises generating a natural language response based on a language type of the separated data corresponding to the main intent. 20. The artificial intelligence device according to claim 11, wherein the processor is further configured to determine the plurality of languages included in the generated text data based on a code range for each language of a character encoding system.
| 3,700
|
338,077
| 16,799,744
| 3,624
|
An Internet-based agenda data analysis system may include at least one processor configured to maintain a list of user-selectable agenda issues, present to a user via a user interface, the list of user-selectable agenda issues, and receive via the user interface, based on a selection from the list, agenda issues of interest to an organization. The processor may be configured to access information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an alignment position of each policymaker on each of the agenda issues is determinable, calculate alignment position data from the individual policymaker data, the alignment position data corresponding to relative positions of each of the plurality of policymakers on each of the plurality of selected issues, and transform the alignment position data into a graphical display that presents the alignment positions of multiple policymakers.
|
1-20. (canceled) 21. An Internet-based agenda data analysis system, the system comprising:
at least one processor configured to: maintain a list of user-selectable agenda issues; present to a user via a user interface, the list of user-selectable agenda issues, wherein each of the listed user-selectable agenda issues is configured to be selected by the user via input received from the user; receive via the user interface, based on the input received from the user, agenda issues of interest to an organization, the agenda issues having been selected from the list of user-selectable agenda issues; access information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an influence factor of each policymaker on each of the agenda issues selected as being of interest to the organization is determinable; calculate an influence factor model using the individual policymaker data, the influence factor model producing influence factor data corresponding to relative influence factors of each of the plurality of policymakers on each of the plurality of selected agenda issues selected as being of interest to the organization, the influence factor data comprising a measure of how likely each of the plurality of policymakers is to affect the position of each of the plurality of policymakers on each of the plurality of selected agenda issues, the position comprising a stance or political position of a policymaker on the selected agenda issues, and not an indicator of an outcome of a particular policymaking; and transform the influence factor data into a graphical display that presents the influence factors of multiple policymakers on each of the agenda issues selected as being of interest to the organization. 22. The system of claim 21, wherein the at least one processor is further configured to receive via the user interface, an indication of the at least one influence factor of the at least one of the plurality of policymakers on each selected issue. 23. The system of claim 21, wherein the at least one processor is further configured to receive via the user interface, an indication of the organization's position on each selected issue. 24. The system of claim 21, wherein the at least one processor is further configured to predict an indication of the organization's position on each selected issue. 25. The system of claim 21, wherein the at least one processor is further configured to present to the user at least one control to adjust weighting of each user-selected agenda issue, wherein the weighting is based on an overall stance of the organization related to the agenda issue. 26. The system of claim 24, wherein the at least one processor is further configured to calculate a confidence score for the organization's predicted position. 27. The system of claim 21, wherein the graphical display includes influence factor coordinates displayed in graphical form, and each displayed coordinate represents a single policymaker's influence factor on a single issue. 28. The system of claim 27, wherein the graphical display includes alignment position coordinates displayed in graphical form, the alignment position coordinates comprising a measure of how each of the plurality of policymakers is oriented relative to the organization's position. 29. The system of claim 27, wherein the at least one processor is further configured, after the influence factor coordinates are displayed in graphical form, to adjust relative positions of the coordinates based on subsequent user manipulation of the at least one weighting control. 30. The system of claim 27, wherein the at least one processor is further configured, after the influence factor coordinates are displayed in graphical form, to subsequently access updated individual policymaker data, and to adjust relative positions of the coordinates based on updated individual policymaker data. 31. The system of claim 30, wherein the at least one processor is further configured to update the influence factor model with the updated individual policymaker data of the at least one influence factor of the at least one of the plurality of policymakers. 32. The system of claim 27, wherein each displayed coordinate is interactive, enabling a user who engages with the coordinate to view policymaker information. 33. The system of claim 32, wherein the policymaker information includes at least one of voting history information of each of the legislators and party affiliation of each of the legislators. 34. The system of claim 32, wherein the policymaker information includes at least one of regulation information of each of the regulators or government officials and party affiliation of each of the regulators or government officials. 35. The system of claim 21, wherein the agenda issues include legislative agenda issues, and the plurality of policymakers include legislators. 36. The system of claim 21, wherein the agenda issues include regulatory agenda issues, and the plurality of policymakers include regulators or government officials. 37. The system of claim 21, wherein the agenda issues related to one or more government bodies. 38. The system of claim 21, wherein the influence factor of each policymaker represents an extent or magnitude to which the policymaker will affect a position of other policymakers. 39. An Internet-based agenda data analysis method, the method comprising:
maintaining a list of user-selectable agenda issues; presenting to a user via a user interface, the list of user-selectable agenda issues, wherein each of the listed user-selectable agenda issues is configured to be selected by the user via input received from the user; receiving via the user interface, based on the input received from the user, agenda issues of interest to an organization, the agenda issues having been selected from the list of user-selectable agenda issues; accessing information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an influence factor of each policymaker on each of the agenda issues selected as being of interest to the organization is determinable; calculating an influence factor model using the individual policymaker data, the influence factor model producing influence factor data corresponding to relative influence factors of each of the plurality of policymakers on each of the plurality of selected agenda issues selected as being of interest to the organization, the influence factor data comprising a measure of how likely each of the plurality of policymakers is to affect the position of each of the plurality of policymakers on each of the plurality of selected agenda issues, the position comprising a stance or political position of a policymaker on the selected agenda issues, and not an indicator of an outcome of a particular policymaking; and transforming the influence factor data into a graphical display that presents the influence factors of multiple policymakers on each of the agenda issues selected as being of interest to the organization. 40. A non-transitory computer-readable medium comprising instructions that, when executed by at least one processor, cause the at least one processor to perform operations including:
maintaining a list of user-selectable agenda issues; presenting to a user via a user interface, the list of user-selectable agenda issues, wherein each of the listed user-selectable agenda issues is configured to be selected by the user via input received from the user; receiving via the user interface, based on the input received from the user, agenda issues of interest to an organization, the agenda issues having been selected from the list of user-selectable agenda issues; accessing information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an influence factor of each policymaker on each of the agenda issues selected as being of interest to the organization is determinable; calculating an influence factor model using the individual policymaker data, the influence factor model producing influence factor data corresponding to relative influence factors of each of the plurality of policymakers on each of the plurality of selected agenda issues selected as being of interest to the organization, the influence factor data comprising a measure of how likely each of the plurality of policymakers is to affect the position of each of the plurality of policymakers on each of the plurality of selected agenda issues, the position comprising a stance or political position of a policymaker on the selected agenda issues, and not an indicator of an outcome of a particular policymaking; and transforming the influence factor data into a graphical display that presents the influence factors of multiple policymakers on each of the agenda issues selected as being of interest to the organization.
|
An Internet-based agenda data analysis system may include at least one processor configured to maintain a list of user-selectable agenda issues, present to a user via a user interface, the list of user-selectable agenda issues, and receive via the user interface, based on a selection from the list, agenda issues of interest to an organization. The processor may be configured to access information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an alignment position of each policymaker on each of the agenda issues is determinable, calculate alignment position data from the individual policymaker data, the alignment position data corresponding to relative positions of each of the plurality of policymakers on each of the plurality of selected issues, and transform the alignment position data into a graphical display that presents the alignment positions of multiple policymakers.1-20. (canceled) 21. An Internet-based agenda data analysis system, the system comprising:
at least one processor configured to: maintain a list of user-selectable agenda issues; present to a user via a user interface, the list of user-selectable agenda issues, wherein each of the listed user-selectable agenda issues is configured to be selected by the user via input received from the user; receive via the user interface, based on the input received from the user, agenda issues of interest to an organization, the agenda issues having been selected from the list of user-selectable agenda issues; access information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an influence factor of each policymaker on each of the agenda issues selected as being of interest to the organization is determinable; calculate an influence factor model using the individual policymaker data, the influence factor model producing influence factor data corresponding to relative influence factors of each of the plurality of policymakers on each of the plurality of selected agenda issues selected as being of interest to the organization, the influence factor data comprising a measure of how likely each of the plurality of policymakers is to affect the position of each of the plurality of policymakers on each of the plurality of selected agenda issues, the position comprising a stance or political position of a policymaker on the selected agenda issues, and not an indicator of an outcome of a particular policymaking; and transform the influence factor data into a graphical display that presents the influence factors of multiple policymakers on each of the agenda issues selected as being of interest to the organization. 22. The system of claim 21, wherein the at least one processor is further configured to receive via the user interface, an indication of the at least one influence factor of the at least one of the plurality of policymakers on each selected issue. 23. The system of claim 21, wherein the at least one processor is further configured to receive via the user interface, an indication of the organization's position on each selected issue. 24. The system of claim 21, wherein the at least one processor is further configured to predict an indication of the organization's position on each selected issue. 25. The system of claim 21, wherein the at least one processor is further configured to present to the user at least one control to adjust weighting of each user-selected agenda issue, wherein the weighting is based on an overall stance of the organization related to the agenda issue. 26. The system of claim 24, wherein the at least one processor is further configured to calculate a confidence score for the organization's predicted position. 27. The system of claim 21, wherein the graphical display includes influence factor coordinates displayed in graphical form, and each displayed coordinate represents a single policymaker's influence factor on a single issue. 28. The system of claim 27, wherein the graphical display includes alignment position coordinates displayed in graphical form, the alignment position coordinates comprising a measure of how each of the plurality of policymakers is oriented relative to the organization's position. 29. The system of claim 27, wherein the at least one processor is further configured, after the influence factor coordinates are displayed in graphical form, to adjust relative positions of the coordinates based on subsequent user manipulation of the at least one weighting control. 30. The system of claim 27, wherein the at least one processor is further configured, after the influence factor coordinates are displayed in graphical form, to subsequently access updated individual policymaker data, and to adjust relative positions of the coordinates based on updated individual policymaker data. 31. The system of claim 30, wherein the at least one processor is further configured to update the influence factor model with the updated individual policymaker data of the at least one influence factor of the at least one of the plurality of policymakers. 32. The system of claim 27, wherein each displayed coordinate is interactive, enabling a user who engages with the coordinate to view policymaker information. 33. The system of claim 32, wherein the policymaker information includes at least one of voting history information of each of the legislators and party affiliation of each of the legislators. 34. The system of claim 32, wherein the policymaker information includes at least one of regulation information of each of the regulators or government officials and party affiliation of each of the regulators or government officials. 35. The system of claim 21, wherein the agenda issues include legislative agenda issues, and the plurality of policymakers include legislators. 36. The system of claim 21, wherein the agenda issues include regulatory agenda issues, and the plurality of policymakers include regulators or government officials. 37. The system of claim 21, wherein the agenda issues related to one or more government bodies. 38. The system of claim 21, wherein the influence factor of each policymaker represents an extent or magnitude to which the policymaker will affect a position of other policymakers. 39. An Internet-based agenda data analysis method, the method comprising:
maintaining a list of user-selectable agenda issues; presenting to a user via a user interface, the list of user-selectable agenda issues, wherein each of the listed user-selectable agenda issues is configured to be selected by the user via input received from the user; receiving via the user interface, based on the input received from the user, agenda issues of interest to an organization, the agenda issues having been selected from the list of user-selectable agenda issues; accessing information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an influence factor of each policymaker on each of the agenda issues selected as being of interest to the organization is determinable; calculating an influence factor model using the individual policymaker data, the influence factor model producing influence factor data corresponding to relative influence factors of each of the plurality of policymakers on each of the plurality of selected agenda issues selected as being of interest to the organization, the influence factor data comprising a measure of how likely each of the plurality of policymakers is to affect the position of each of the plurality of policymakers on each of the plurality of selected agenda issues, the position comprising a stance or political position of a policymaker on the selected agenda issues, and not an indicator of an outcome of a particular policymaking; and transforming the influence factor data into a graphical display that presents the influence factors of multiple policymakers on each of the agenda issues selected as being of interest to the organization. 40. A non-transitory computer-readable medium comprising instructions that, when executed by at least one processor, cause the at least one processor to perform operations including:
maintaining a list of user-selectable agenda issues; presenting to a user via a user interface, the list of user-selectable agenda issues, wherein each of the listed user-selectable agenda issues is configured to be selected by the user via input received from the user; receiving via the user interface, based on the input received from the user, agenda issues of interest to an organization, the agenda issues having been selected from the list of user-selectable agenda issues; accessing information scraped from the Internet to determine, for a plurality of policymakers, individual policymaker data from which an influence factor of each policymaker on each of the agenda issues selected as being of interest to the organization is determinable; calculating an influence factor model using the individual policymaker data, the influence factor model producing influence factor data corresponding to relative influence factors of each of the plurality of policymakers on each of the plurality of selected agenda issues selected as being of interest to the organization, the influence factor data comprising a measure of how likely each of the plurality of policymakers is to affect the position of each of the plurality of policymakers on each of the plurality of selected agenda issues, the position comprising a stance or political position of a policymaker on the selected agenda issues, and not an indicator of an outcome of a particular policymaking; and transforming the influence factor data into a graphical display that presents the influence factors of multiple policymakers on each of the agenda issues selected as being of interest to the organization.
| 3,600
|
338,078
| 16,799,745
| 3,624
|
Examples described herein relate to a work scheduler that includes at least one processor and at least one queue. In some examples, the work scheduler receives a request to allocate a region of memory and based on availability of a memory segment associated with a central cache to satisfy the request to allocate a region of memory, provide a memory allocation using an available memory segment entry associated with the central cache from the at least one queue. In some examples, the work scheduler assigns a workload to a processor and controls when to pre-fetch content relevant to the workload to store in a cache or memory accessible to the processor based on a position of the workload in a work queue associated with the processor.
|
1. An apparatus comprising:
a work scheduler comprising at least one processor and at least one queue, wherein the work scheduler is to:
receive a request to allocate a region of memory and
based on availability of a memory segment associated with a memory segment cache to at least meet the request to allocate a region of memory, provide a memory allocation using an available memory segment entry associated with the memory segment cache from the at least one queue. 2. The apparatus of claim 1, wherein the work scheduler is to:
based on unavailability of a memory segment associated with the memory segment cache to satisfy the request to allocate a region of memory, provide a portion of a memory segment associated with a page heap in response to the request to allocate a region of memory. 3. The apparatus of claim 1, wherein the at least one queue is to receive one or more memory allocation requests from multiple devices for performance by the work scheduler. 4. The apparatus of claim 1, wherein the at least one queue is to store at least one memory segment entry associated with the memory segment cache and the at least one queue is to store at least one memory segment entry associated with a page heap. 5. The apparatus of claim 1, wherein a processor is to perform clean up to combine contiguous memory segments associated with the memory segment cache into larger memory segments for association with the memory segment cache or a page heap. 6. The apparatus of claim 5, wherein the processor is to perform garbage collection is to attempt to combine contiguous memory segments periodically or based on a size of the memory segment cache being above a threshold level. 7. The apparatus of claim 1, comprising a central processing unit (CPU) to offload memory allocation to the work scheduler. 8. The apparatus of claim 1, further comprising a server, data center, or rack. 9. An apparatus comprising:
a work scheduler circuitry comprising at least one processor and at least one work queue, the work scheduler is to:
assign a workload to a processor and
control when to fetch content relevant to the workload to store in a cache or memory accessible to the processor based on a position of an identifier of the workload in a work queue associated with the processor. 10. The apparatus of claim 9, wherein the work scheduler is to pre-fetch content relevant to the workload by access to a look-up table to determine one or more memory locations of content associated with the workload. 11. The apparatus of claim 9, wherein the content relevant to the workload includes one or more of: data, packet payload, packet context, connection context, a software environment, cryptographic keys, or instructions executed to process the data. 12. The apparatus of claim 9, wherein the work scheduler is to update a position of an identifier of the workload in the work queue based on completion of another workload identified in the work queue. 13. The apparatus of claim 9, wherein based on a position of the identifier of the workload being near or at a head of the work queue, the work scheduler is to cause a prefetch of the content relevant to the workload to store in the cache or memory accessible to the processor. 14. The apparatus of claim 9, wherein a processor is to indicate which content in the cache or memory to not evict based at least in part on a position indicator for the identifier of the workload in the work queue. 15. The apparatus of claim 14, wherein the processor is to prevent the content relevant to the workload from being evicted from the cache or memory based on the workload being near or at a head of the work queue. 16. The apparatus of claim 9, comprising a central processing unit (CPU) to offload data processing scheduling to the work scheduler. 17. The apparatus of claim 9, further comprising a server, data center, or rack. 18. A method comprising:
allocating at least one entry in a queue of a queue management device, the at least one entry comprising a memory segment allocation from a memory segment cache or a page heap; and receiving, at the queue management device, a request to allocate a region of memory. 19. The method of claim 18, comprising:
based on at least one entry in the queue comprising a memory segment having a size that meets or exceeds a size of the region of memory, allocating the memory segment in response to the request to allocate a region of memory. 20. The method of claim 18, comprising:
dividing a first memory segment into smaller memory segments and providing entries in the queue associated with the smaller memory segments. 21. The method of claim 18, comprising:
combining contiguous memory segments into a second memory segment and providing an entry in the queue associated with the second memory segment. 22. A method comprising:
assigning, using a queue manager device, a workload to a processor; causing pre-fetch of content relevant to the workload to a memory accessible to the processor based on a position of an identifier of the workload in a work queue associated with the processor; and adjusting an ability to evict at least a portion of the content relevant to the workload from the memory based on a change in position of the identifier of the workload in the work queue. 23. The method of claim 22, wherein the content relevant to the workload includes one or more of: data, flow data, packet payload, packet context, connection context, a software environment, cryptographic keys, or instructions executed to process the data. 24. The method of claim 21, comprising:
updating a position of the identifier of the workload in the work queue based on completion of another workload identified in the work queue. 25. The method of claim 21, comprising:
reassigning the workload to another work queue based on load balancing of work among the processor and at least one other processor.
|
Examples described herein relate to a work scheduler that includes at least one processor and at least one queue. In some examples, the work scheduler receives a request to allocate a region of memory and based on availability of a memory segment associated with a central cache to satisfy the request to allocate a region of memory, provide a memory allocation using an available memory segment entry associated with the central cache from the at least one queue. In some examples, the work scheduler assigns a workload to a processor and controls when to pre-fetch content relevant to the workload to store in a cache or memory accessible to the processor based on a position of the workload in a work queue associated with the processor.1. An apparatus comprising:
a work scheduler comprising at least one processor and at least one queue, wherein the work scheduler is to:
receive a request to allocate a region of memory and
based on availability of a memory segment associated with a memory segment cache to at least meet the request to allocate a region of memory, provide a memory allocation using an available memory segment entry associated with the memory segment cache from the at least one queue. 2. The apparatus of claim 1, wherein the work scheduler is to:
based on unavailability of a memory segment associated with the memory segment cache to satisfy the request to allocate a region of memory, provide a portion of a memory segment associated with a page heap in response to the request to allocate a region of memory. 3. The apparatus of claim 1, wherein the at least one queue is to receive one or more memory allocation requests from multiple devices for performance by the work scheduler. 4. The apparatus of claim 1, wherein the at least one queue is to store at least one memory segment entry associated with the memory segment cache and the at least one queue is to store at least one memory segment entry associated with a page heap. 5. The apparatus of claim 1, wherein a processor is to perform clean up to combine contiguous memory segments associated with the memory segment cache into larger memory segments for association with the memory segment cache or a page heap. 6. The apparatus of claim 5, wherein the processor is to perform garbage collection is to attempt to combine contiguous memory segments periodically or based on a size of the memory segment cache being above a threshold level. 7. The apparatus of claim 1, comprising a central processing unit (CPU) to offload memory allocation to the work scheduler. 8. The apparatus of claim 1, further comprising a server, data center, or rack. 9. An apparatus comprising:
a work scheduler circuitry comprising at least one processor and at least one work queue, the work scheduler is to:
assign a workload to a processor and
control when to fetch content relevant to the workload to store in a cache or memory accessible to the processor based on a position of an identifier of the workload in a work queue associated with the processor. 10. The apparatus of claim 9, wherein the work scheduler is to pre-fetch content relevant to the workload by access to a look-up table to determine one or more memory locations of content associated with the workload. 11. The apparatus of claim 9, wherein the content relevant to the workload includes one or more of: data, packet payload, packet context, connection context, a software environment, cryptographic keys, or instructions executed to process the data. 12. The apparatus of claim 9, wherein the work scheduler is to update a position of an identifier of the workload in the work queue based on completion of another workload identified in the work queue. 13. The apparatus of claim 9, wherein based on a position of the identifier of the workload being near or at a head of the work queue, the work scheduler is to cause a prefetch of the content relevant to the workload to store in the cache or memory accessible to the processor. 14. The apparatus of claim 9, wherein a processor is to indicate which content in the cache or memory to not evict based at least in part on a position indicator for the identifier of the workload in the work queue. 15. The apparatus of claim 14, wherein the processor is to prevent the content relevant to the workload from being evicted from the cache or memory based on the workload being near or at a head of the work queue. 16. The apparatus of claim 9, comprising a central processing unit (CPU) to offload data processing scheduling to the work scheduler. 17. The apparatus of claim 9, further comprising a server, data center, or rack. 18. A method comprising:
allocating at least one entry in a queue of a queue management device, the at least one entry comprising a memory segment allocation from a memory segment cache or a page heap; and receiving, at the queue management device, a request to allocate a region of memory. 19. The method of claim 18, comprising:
based on at least one entry in the queue comprising a memory segment having a size that meets or exceeds a size of the region of memory, allocating the memory segment in response to the request to allocate a region of memory. 20. The method of claim 18, comprising:
dividing a first memory segment into smaller memory segments and providing entries in the queue associated with the smaller memory segments. 21. The method of claim 18, comprising:
combining contiguous memory segments into a second memory segment and providing an entry in the queue associated with the second memory segment. 22. A method comprising:
assigning, using a queue manager device, a workload to a processor; causing pre-fetch of content relevant to the workload to a memory accessible to the processor based on a position of an identifier of the workload in a work queue associated with the processor; and adjusting an ability to evict at least a portion of the content relevant to the workload from the memory based on a change in position of the identifier of the workload in the work queue. 23. The method of claim 22, wherein the content relevant to the workload includes one or more of: data, flow data, packet payload, packet context, connection context, a software environment, cryptographic keys, or instructions executed to process the data. 24. The method of claim 21, comprising:
updating a position of the identifier of the workload in the work queue based on completion of another workload identified in the work queue. 25. The method of claim 21, comprising:
reassigning the workload to another work queue based on load balancing of work among the processor and at least one other processor.
| 3,600
|
338,079
| 16,799,703
| 3,624
|
The invention relates to chimeric or humanised anti-CD303 antibodies to nucleic acids coding for the heavy and light chains of these antibodies, expression vectors, host cells, transgenic non-human animals or transgenic plants expressing said antibodies, as well as to the uses thereof in the treatment or prevention of blastic plasmacytoid dendritic cell neoplasms (BPDCN) or inflammatory diseases, in particular autoimmune diseases, involving plasmacytoid dendritic cells.
|
1.-30. (canceled) 31. A monoclonal antibody directed against the ectodomain of human CD303 antigen (SEQ ID NO: 130), or a functional fragment or a derivative thereof, wherein:
a) the monoclonal antibody competes for binding to the human CD303 antigen with at least one antibody selected from:
i) an antibody whose heavy chain variable region comprises SEQ ID NO: 43 and whose light chain variable region comprises SEQ ID NO: 48;
ii) an antibody whose heavy chain variable region comprises SEQ ID NO: 44 and whose light chain variable region comprises SEQ ID NO: 49;
iii) an antibody whose heavy chain variable region comprises SEQ ID NO: 45 and whose light chain variable region comprises SEQ ID NO: 50;
iv) an antibody whose heavy chain variable region comprises SEQ ID NO: 46 and whose light chain variable region comprises SEQ ID NO: 51;
v) an antibody whose heavy chain variable region comprises SEQ ID NO: 47 and whose light chain variable region comprises SEQ ID NO: 52; and
b) the light and heavy chain constant regions of the monoclonal antibody are constant regions from a non-murine species. 32. The antibody, functional fragment or derivative thereof according to claim 31, wherein its heavy chains comprise three CDR-H (heavy-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences, and its light chains comprise three CDR-L (light-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences:
i) CDR1-H-family 1: SEQ ID NO: 1, CDR2-H-family 1: SEQ ID NO: 2, CDR3-H-family 1: SEQ ID NO: 3, CDR1-L-family 1: SEQ ID NO: 4, CDR2-L-family 1: SEQ ID NO: 5, CDR3-L-family 1: SEQ ID NO: 6; or ii) CDR1-H-family 2: SEQ ID NO: 7, CDR2-H-family 2: SEQ ID NO: 8, CDR3-H-family 2: SEQ ID NO: 9, CDR1-L-family 2: SEQ ID NO: 10, CDR2-L-family 2: SEQ ID NO: 11, CDR3-L-family 2: SEQ ID NO: 12. 33. The antibody, functional fragment or derivative thereof according to claim 32, wherein the heavy chains comprise three CDR-H (heavy-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences, and the light chains comprise three CDR-L (light-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences:
i) CDR1-H-122A2: SEQ ID NO: 13, CDR2-H-122A2: SEQ ID NO: 14, CDR3-H-122A2: SEQ ID NO: 15, CDR1-L-122A2: SEQ ID NO: 16, CDR2-L-122A2: SEQ ID NO: 17, CDR3-L-122A2: SEQ ID NO: 18; ii) CDR1-H-102E9: SEQ ID NO: 19, CDR2-H-102E9: SEQ ID NO: 20, CDR3-H-102E9: SEQ ID NO: 21, CDR1-L-102E9: SEQ ID NO: 22, CDR2-L-102E9: SEQ ID NO: 23, CDR3-L-102E9: SEQ ID NO: 24; iii) CDR1-H-104C12: SEQ ID NO: 25, CDR2-H-104C12: SEQ ID NO: 26, CDR3-H-104C12: SEQ ID NO: 27, CDR1-L-104C12: SEQ ID NO: 28, CDR2-L-104C12: SEQ ID NO: 29, CDR3-L-104C12: SEQ ID NO: 30; iv) CDR1-H-114D11: SEQ ID NO: 31, CDR2-H-114D11: SEQ ID NO: 32, CDR3-H-114D11: SEQ ID NO: 33, CDR1-L-114D11: SEQ ID NO: 34, CDR2-L-114D11: SEQ ID NO: 35, CDR3-L-114D11: SEQ ID NO: 36; or v) CDR1-H-104E10: SEQ ID NO: 37, CDR2-H-104E10: SEQ ID NO: 38, CDR3-H-104E10: SEQ ID NO: 39, CDR1-L-104E10: SEQ ID NO: 40, CDR2-L-104E10: SEQ ID NO: 41, CDR3-L-104E10: SEQ ID NO: 42. 34. The antibody, functional fragment or derivative thereof according to claim 31, wherein its heavy chains comprise a variable region having a sequence selected from SEQ ID NOs: 43 to 47, 131 to 133, and 138 to 140, or having a sequence with at least 80% identity with one of SEQ ID NOs: 43 to 47, 131 to 133, and 138 to 140. 35. The antibody, functional fragment or derivative thereof according to claim 34, wherein its light chains comprise a variable region having a sequence selected from SEQ ID NOs: 48 to 52, 134 to 137, and 141 to 143, or having a sequence with at least 80% identity with one of SEQ ID NOs: 48 to 52, 134 to 137, and 141 to 143. 36. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is a chimeric antibody. 37. The antibody, functional fragment or derivative thereof according to claim 36, wherein it is a chimeric antibody whose heavy and light chains constant region is of human origin. 38. The antibody, functional fragment or derivative thereof according to claim 37, wherein it has heavy and light chains comprising the following amino acid sequences or sequences having at least 80% identity with the following sequences:
i) antibody 122A2: heavy chain: SEQ ID NO: 55, light chain: SEQ ID NO: 60, ii) antibody 102E9: heavy chain: SEQ ID NO: 56, light chain: SEQ ID NO: 61, iii) antibody 104C12: heavy chain: SEQ ID NO: 57, light chain: SEQ ID NO: 62, iv) antibody 114D11: heavy chain: SEQ ID NO: 58, light chain: SEQ ID NO: 63, or v) antibody 104E10: heavy chain: SEQ ID NO: 59, light chain: SEQ ID NO: 64. 39. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is a humanized antibody. 40. The antibody, functional fragment or derivative thereof according to claim 39, wherein its heavy chains comprise a variable region having a sequence selected from SEQ ID NOs: 131 to 133 and 138 to 140 or having a sequence with at least 80% identity with one of SEQ ID NOs: 131 to 133. 41. The antibody, functional fragment or derivative thereof according to claim 40, wherein its light chains comprise a variable region having a sequence selected from SEQ ID NOs: 134 to 137 and 141 to 143 or having a sequence with at least 80% identity with one of SEQ ID NOs: 134 to 137 and 141 to 143. 42. The antibody, functional fragment or derivative thereof according to claim 39, wherein it has heavy and light chains with variable regions having the following amino acid sequences or having sequences with at least 80% identity with the following sequences:
i) antibody 122A2H5: heavy chain: SEQ ID NO: 131, light chain: SEQ ID NO: 134, ii) antibody 122A2H6: heavy chain: SEQ ID NO: 132, light chain: SEQ ID NO: 134, iii) antibody 122A2H7: heavy chain: SEQ ID NO: 133, light chain: SEQ ID NO: 134, iv) antibody 122A2H9: heavy chain: SEQ ID NO: 131, light chain: SEQ ID NO: 135, v) antibody 122A2H10: heavy chain: SEQ ID NO: 132, light chain: SEQ ID NO: 135, vi) antibody 122A2H14: heavy chain: SEQ ID NO: 132, light chain: SEQ ID NO: 136, vii) antibody 102E9H6: heavy chain: SEQ ID NO: 139, light chain: SEQ ID NO: 141, viii) antibody 102E9H7: heavy chain: SEQ ID NO: 140, light chain: SEQ ID NO: 141, ix) antibody 102E9H9: heavy chain: SEQ ID NO: 138, light chain: SEQ ID NO: 142, x) antibody 102E9H10: heavy chain: SEQ ID NO: 139, light chain: SEQ ID NO: 142. 43. The antibody, functional fragment or derivative thereof according to claim 42, wherein it has heavy and light chains comprising the following amino acid sequences or sequences having at least 80% identity with the following sequences:
i) antibody 122A2H5: heavy chain: SEQ ID NO: 150, light chain: SEQ ID NO: 153, ii) antibody 122A2H6: heavy chain: SEQ ID NO: 151, light chain: SEQ ID NO: 153, iii) antibody 122A2H7: heavy chain: SEQ ID NO: 152, light chain: SEQ ID NO: 153, iv) antibody 122A2H9: heavy chain: SEQ ID NO: 150, light chain: SEQ ID NO: 154, v) antibody 122A2H10: heavy chain: SEQ ID NO: 151, light chain: SEQ ID NO: 154, vi) antibody 122A2H14: heavy chain: SEQ ID NO: 151, light chain: SEQ ID NO: 155, vii) antibody 102E9H6: heavy chain: SEQ ID NO: 158, light chain: SEQ ID NO: 160, viii) antibody 102E9H7: heavy chain: SEQ ID NO: 159, light chain: SEQ ID NO: 160, ix) antibody 102E9H9: heavy chain: SEQ ID NO: 157, light chain: SEQ ID NO: 161, x) antibody 102E9H10: heavy chain: SEQ ID NO: 158, light chain: SEQ ID NO: 161. 44. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is of IgG isotype. 45. The antibody, functional fragment or derivative thereof according to claim 31, wherein its heavy chain and/or its light chain further comprise(s) a heterologous signal peptide of SEQ ID NO: 65. 46. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is produced in a cell line selected from: SP2/0; YB2/0; IR983F; human myeloma Namalwa; PERC6; CHO cell lines, notably CHO-K-1, CHO-Lec10, CHO-Lec1, CHO-Lec13, CHO Pro-5, CHO dhfr-, or the CHO cell line deleted for both alleles encoding the FUT8 gene and/or the GMD gene; Wil-2; Jurkat; Vero; MoIt-4; COS-7; 293-HEK; BHK; K6H6; NSO; SP2/0-Ag 14, P3X63Ag8.653, duck embryonic cell line EB66® (Valneva); rat hepatoma cell lines H4-II-E (DSM ACC3129) and H4-II-Es (DSM ACC3130), NM-H9D8 (DSM ACC2806), NM-H9D8-E6 (DSM ACC 2807) and NM H9D8-E6Q12 (DSM ACC 2856). 47. The antibody, functional fragment or derivative thereof according to claim 31, having:
a) fucose content less than or equal to 65%; b) oligomannose-type N-glycans content greater than or equal to 30%; or c) galactose content greater than or equal to 50%. 48. The antibody, functional fragment or derivative thereof according to claim 31, wherein:
a) the Fc fragment has the following mutations or combinations of mutations in their Fc fragment:
N315D/A330V/N361D/A378V/N434Y,
P230S/N315D/M428L/N434Y,
E294del/T307P/N434Y,
T307A/N315D/A330V/E382V/N389T/N434Y,
V259I/N315D/N434Y, or
T256N/A378V/S383N/N434Y,
wherein the numbering of Fc fragment amino acids is that of the EU index of Kabat; or b) it has a deletion of the amino acid at position 293 (Del293) or 294 (Del294) of the Fc fragment, where the numbering of Fc fragment amino acids is that of the EU index of Kabat. 49. The functional fragment according to claim 31, wherein it is selected from the fragments Fv, ScFv, Fab, F(ab′)2, Fab′, scFv-Fc and diabodies. 50. A nucleic acid encoding the heavy and/or light chain of an antibody, functional fragment or derivative thereof according to claim 31. 51. The nucleic acid according to claim 50, comprising at least one of SEQ ID NOs: 86 to 95, and 181 to 193. 52. A vector comprising a nucleic acid according to claim 50. 53. A host cell, transgenic non-human animal or transgenic plant comprising at least one nucleic acid according to claim 50 or a vector comprising the nucleic acid. 54. The host cell according to claim 53, selected from the following lines: SP2/0; YB2/0; IR983F; human myeloma Namalwa; PERC6; CHO cell lines, notably CHO-K-1, CHO-Lec10, CHO-Lec1, CHO-Lec13, CHO Pro-5, CHO dhfr-, or the CHO cell line deleted for both alleles encoding the FUT8 gene and/or the GMD gene; Wil-2; Jurkat; Vero; MoIt-4; COS-7; 293-HEK; BHK; K6H6; NSO; SP2/0-Ag 14, P3X63Ag8.653, duck embryonic cell line EB66® (Valneva); rat hepatoma cell lines H4-II-E (DSM ACC3129) and H4-II-Es (DSM ACC3130), NM-H9D8 (DSM ACC2806), NM-H9D8-E6 (DSM ACC 2807) and NM H9D8-E6Q12 (DSM ACC 2856). 55. A method for treating or preventing a hematopoietic tumor expressing the CD303 antigen in a patient, comprising administering to said patient an effective amount of an antibody, functional fragment or derivative thereof according to claim 31. 56. A method for treating or preventing inflammatory disease in a patient, comprising administering to said patient an effective amount of an antibody, functional fragment or derivative thereof according to claim 31. 57. A monoclonal antibody directed against the ectodomain of human CD303 antigen (SEQ ID NO: 130), or a functional fragment or a derivative thereof, wherein:
the monoclonal antibody has improved affinity for Fey receptor Ma (FcγRIIIa, CD16a) compared to antibodies directed against the ectodomain of the human CD303 antigen, produced in CHO cells; and the light and heavy chain constant regions of the monoclonal antibody are constant regions from a non-murine species.
|
The invention relates to chimeric or humanised anti-CD303 antibodies to nucleic acids coding for the heavy and light chains of these antibodies, expression vectors, host cells, transgenic non-human animals or transgenic plants expressing said antibodies, as well as to the uses thereof in the treatment or prevention of blastic plasmacytoid dendritic cell neoplasms (BPDCN) or inflammatory diseases, in particular autoimmune diseases, involving plasmacytoid dendritic cells.1.-30. (canceled) 31. A monoclonal antibody directed against the ectodomain of human CD303 antigen (SEQ ID NO: 130), or a functional fragment or a derivative thereof, wherein:
a) the monoclonal antibody competes for binding to the human CD303 antigen with at least one antibody selected from:
i) an antibody whose heavy chain variable region comprises SEQ ID NO: 43 and whose light chain variable region comprises SEQ ID NO: 48;
ii) an antibody whose heavy chain variable region comprises SEQ ID NO: 44 and whose light chain variable region comprises SEQ ID NO: 49;
iii) an antibody whose heavy chain variable region comprises SEQ ID NO: 45 and whose light chain variable region comprises SEQ ID NO: 50;
iv) an antibody whose heavy chain variable region comprises SEQ ID NO: 46 and whose light chain variable region comprises SEQ ID NO: 51;
v) an antibody whose heavy chain variable region comprises SEQ ID NO: 47 and whose light chain variable region comprises SEQ ID NO: 52; and
b) the light and heavy chain constant regions of the monoclonal antibody are constant regions from a non-murine species. 32. The antibody, functional fragment or derivative thereof according to claim 31, wherein its heavy chains comprise three CDR-H (heavy-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences, and its light chains comprise three CDR-L (light-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences:
i) CDR1-H-family 1: SEQ ID NO: 1, CDR2-H-family 1: SEQ ID NO: 2, CDR3-H-family 1: SEQ ID NO: 3, CDR1-L-family 1: SEQ ID NO: 4, CDR2-L-family 1: SEQ ID NO: 5, CDR3-L-family 1: SEQ ID NO: 6; or ii) CDR1-H-family 2: SEQ ID NO: 7, CDR2-H-family 2: SEQ ID NO: 8, CDR3-H-family 2: SEQ ID NO: 9, CDR1-L-family 2: SEQ ID NO: 10, CDR2-L-family 2: SEQ ID NO: 11, CDR3-L-family 2: SEQ ID NO: 12. 33. The antibody, functional fragment or derivative thereof according to claim 32, wherein the heavy chains comprise three CDR-H (heavy-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences, and the light chains comprise three CDR-L (light-chain CDR according to IMGT nomenclature) having the following amino acid sequences, or sequences having at least 80% identity with the following sequences:
i) CDR1-H-122A2: SEQ ID NO: 13, CDR2-H-122A2: SEQ ID NO: 14, CDR3-H-122A2: SEQ ID NO: 15, CDR1-L-122A2: SEQ ID NO: 16, CDR2-L-122A2: SEQ ID NO: 17, CDR3-L-122A2: SEQ ID NO: 18; ii) CDR1-H-102E9: SEQ ID NO: 19, CDR2-H-102E9: SEQ ID NO: 20, CDR3-H-102E9: SEQ ID NO: 21, CDR1-L-102E9: SEQ ID NO: 22, CDR2-L-102E9: SEQ ID NO: 23, CDR3-L-102E9: SEQ ID NO: 24; iii) CDR1-H-104C12: SEQ ID NO: 25, CDR2-H-104C12: SEQ ID NO: 26, CDR3-H-104C12: SEQ ID NO: 27, CDR1-L-104C12: SEQ ID NO: 28, CDR2-L-104C12: SEQ ID NO: 29, CDR3-L-104C12: SEQ ID NO: 30; iv) CDR1-H-114D11: SEQ ID NO: 31, CDR2-H-114D11: SEQ ID NO: 32, CDR3-H-114D11: SEQ ID NO: 33, CDR1-L-114D11: SEQ ID NO: 34, CDR2-L-114D11: SEQ ID NO: 35, CDR3-L-114D11: SEQ ID NO: 36; or v) CDR1-H-104E10: SEQ ID NO: 37, CDR2-H-104E10: SEQ ID NO: 38, CDR3-H-104E10: SEQ ID NO: 39, CDR1-L-104E10: SEQ ID NO: 40, CDR2-L-104E10: SEQ ID NO: 41, CDR3-L-104E10: SEQ ID NO: 42. 34. The antibody, functional fragment or derivative thereof according to claim 31, wherein its heavy chains comprise a variable region having a sequence selected from SEQ ID NOs: 43 to 47, 131 to 133, and 138 to 140, or having a sequence with at least 80% identity with one of SEQ ID NOs: 43 to 47, 131 to 133, and 138 to 140. 35. The antibody, functional fragment or derivative thereof according to claim 34, wherein its light chains comprise a variable region having a sequence selected from SEQ ID NOs: 48 to 52, 134 to 137, and 141 to 143, or having a sequence with at least 80% identity with one of SEQ ID NOs: 48 to 52, 134 to 137, and 141 to 143. 36. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is a chimeric antibody. 37. The antibody, functional fragment or derivative thereof according to claim 36, wherein it is a chimeric antibody whose heavy and light chains constant region is of human origin. 38. The antibody, functional fragment or derivative thereof according to claim 37, wherein it has heavy and light chains comprising the following amino acid sequences or sequences having at least 80% identity with the following sequences:
i) antibody 122A2: heavy chain: SEQ ID NO: 55, light chain: SEQ ID NO: 60, ii) antibody 102E9: heavy chain: SEQ ID NO: 56, light chain: SEQ ID NO: 61, iii) antibody 104C12: heavy chain: SEQ ID NO: 57, light chain: SEQ ID NO: 62, iv) antibody 114D11: heavy chain: SEQ ID NO: 58, light chain: SEQ ID NO: 63, or v) antibody 104E10: heavy chain: SEQ ID NO: 59, light chain: SEQ ID NO: 64. 39. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is a humanized antibody. 40. The antibody, functional fragment or derivative thereof according to claim 39, wherein its heavy chains comprise a variable region having a sequence selected from SEQ ID NOs: 131 to 133 and 138 to 140 or having a sequence with at least 80% identity with one of SEQ ID NOs: 131 to 133. 41. The antibody, functional fragment or derivative thereof according to claim 40, wherein its light chains comprise a variable region having a sequence selected from SEQ ID NOs: 134 to 137 and 141 to 143 or having a sequence with at least 80% identity with one of SEQ ID NOs: 134 to 137 and 141 to 143. 42. The antibody, functional fragment or derivative thereof according to claim 39, wherein it has heavy and light chains with variable regions having the following amino acid sequences or having sequences with at least 80% identity with the following sequences:
i) antibody 122A2H5: heavy chain: SEQ ID NO: 131, light chain: SEQ ID NO: 134, ii) antibody 122A2H6: heavy chain: SEQ ID NO: 132, light chain: SEQ ID NO: 134, iii) antibody 122A2H7: heavy chain: SEQ ID NO: 133, light chain: SEQ ID NO: 134, iv) antibody 122A2H9: heavy chain: SEQ ID NO: 131, light chain: SEQ ID NO: 135, v) antibody 122A2H10: heavy chain: SEQ ID NO: 132, light chain: SEQ ID NO: 135, vi) antibody 122A2H14: heavy chain: SEQ ID NO: 132, light chain: SEQ ID NO: 136, vii) antibody 102E9H6: heavy chain: SEQ ID NO: 139, light chain: SEQ ID NO: 141, viii) antibody 102E9H7: heavy chain: SEQ ID NO: 140, light chain: SEQ ID NO: 141, ix) antibody 102E9H9: heavy chain: SEQ ID NO: 138, light chain: SEQ ID NO: 142, x) antibody 102E9H10: heavy chain: SEQ ID NO: 139, light chain: SEQ ID NO: 142. 43. The antibody, functional fragment or derivative thereof according to claim 42, wherein it has heavy and light chains comprising the following amino acid sequences or sequences having at least 80% identity with the following sequences:
i) antibody 122A2H5: heavy chain: SEQ ID NO: 150, light chain: SEQ ID NO: 153, ii) antibody 122A2H6: heavy chain: SEQ ID NO: 151, light chain: SEQ ID NO: 153, iii) antibody 122A2H7: heavy chain: SEQ ID NO: 152, light chain: SEQ ID NO: 153, iv) antibody 122A2H9: heavy chain: SEQ ID NO: 150, light chain: SEQ ID NO: 154, v) antibody 122A2H10: heavy chain: SEQ ID NO: 151, light chain: SEQ ID NO: 154, vi) antibody 122A2H14: heavy chain: SEQ ID NO: 151, light chain: SEQ ID NO: 155, vii) antibody 102E9H6: heavy chain: SEQ ID NO: 158, light chain: SEQ ID NO: 160, viii) antibody 102E9H7: heavy chain: SEQ ID NO: 159, light chain: SEQ ID NO: 160, ix) antibody 102E9H9: heavy chain: SEQ ID NO: 157, light chain: SEQ ID NO: 161, x) antibody 102E9H10: heavy chain: SEQ ID NO: 158, light chain: SEQ ID NO: 161. 44. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is of IgG isotype. 45. The antibody, functional fragment or derivative thereof according to claim 31, wherein its heavy chain and/or its light chain further comprise(s) a heterologous signal peptide of SEQ ID NO: 65. 46. The antibody, functional fragment or derivative thereof according to claim 31, wherein it is produced in a cell line selected from: SP2/0; YB2/0; IR983F; human myeloma Namalwa; PERC6; CHO cell lines, notably CHO-K-1, CHO-Lec10, CHO-Lec1, CHO-Lec13, CHO Pro-5, CHO dhfr-, or the CHO cell line deleted for both alleles encoding the FUT8 gene and/or the GMD gene; Wil-2; Jurkat; Vero; MoIt-4; COS-7; 293-HEK; BHK; K6H6; NSO; SP2/0-Ag 14, P3X63Ag8.653, duck embryonic cell line EB66® (Valneva); rat hepatoma cell lines H4-II-E (DSM ACC3129) and H4-II-Es (DSM ACC3130), NM-H9D8 (DSM ACC2806), NM-H9D8-E6 (DSM ACC 2807) and NM H9D8-E6Q12 (DSM ACC 2856). 47. The antibody, functional fragment or derivative thereof according to claim 31, having:
a) fucose content less than or equal to 65%; b) oligomannose-type N-glycans content greater than or equal to 30%; or c) galactose content greater than or equal to 50%. 48. The antibody, functional fragment or derivative thereof according to claim 31, wherein:
a) the Fc fragment has the following mutations or combinations of mutations in their Fc fragment:
N315D/A330V/N361D/A378V/N434Y,
P230S/N315D/M428L/N434Y,
E294del/T307P/N434Y,
T307A/N315D/A330V/E382V/N389T/N434Y,
V259I/N315D/N434Y, or
T256N/A378V/S383N/N434Y,
wherein the numbering of Fc fragment amino acids is that of the EU index of Kabat; or b) it has a deletion of the amino acid at position 293 (Del293) or 294 (Del294) of the Fc fragment, where the numbering of Fc fragment amino acids is that of the EU index of Kabat. 49. The functional fragment according to claim 31, wherein it is selected from the fragments Fv, ScFv, Fab, F(ab′)2, Fab′, scFv-Fc and diabodies. 50. A nucleic acid encoding the heavy and/or light chain of an antibody, functional fragment or derivative thereof according to claim 31. 51. The nucleic acid according to claim 50, comprising at least one of SEQ ID NOs: 86 to 95, and 181 to 193. 52. A vector comprising a nucleic acid according to claim 50. 53. A host cell, transgenic non-human animal or transgenic plant comprising at least one nucleic acid according to claim 50 or a vector comprising the nucleic acid. 54. The host cell according to claim 53, selected from the following lines: SP2/0; YB2/0; IR983F; human myeloma Namalwa; PERC6; CHO cell lines, notably CHO-K-1, CHO-Lec10, CHO-Lec1, CHO-Lec13, CHO Pro-5, CHO dhfr-, or the CHO cell line deleted for both alleles encoding the FUT8 gene and/or the GMD gene; Wil-2; Jurkat; Vero; MoIt-4; COS-7; 293-HEK; BHK; K6H6; NSO; SP2/0-Ag 14, P3X63Ag8.653, duck embryonic cell line EB66® (Valneva); rat hepatoma cell lines H4-II-E (DSM ACC3129) and H4-II-Es (DSM ACC3130), NM-H9D8 (DSM ACC2806), NM-H9D8-E6 (DSM ACC 2807) and NM H9D8-E6Q12 (DSM ACC 2856). 55. A method for treating or preventing a hematopoietic tumor expressing the CD303 antigen in a patient, comprising administering to said patient an effective amount of an antibody, functional fragment or derivative thereof according to claim 31. 56. A method for treating or preventing inflammatory disease in a patient, comprising administering to said patient an effective amount of an antibody, functional fragment or derivative thereof according to claim 31. 57. A monoclonal antibody directed against the ectodomain of human CD303 antigen (SEQ ID NO: 130), or a functional fragment or a derivative thereof, wherein:
the monoclonal antibody has improved affinity for Fey receptor Ma (FcγRIIIa, CD16a) compared to antibodies directed against the ectodomain of the human CD303 antigen, produced in CHO cells; and the light and heavy chain constant regions of the monoclonal antibody are constant regions from a non-murine species.
| 3,600
|
338,080
| 16,799,708
| 1,772
|
The invention relates to a process for recovering methane from digester biogas or landfill gas. More specifically, the invention pertains to biomethane production that substantially removes carbon dioxide from a digester biogas or landfill gas using first, second, and third purification stages each comprising one or more membranes selective for carbon dioxide over methane. A retentate from the first stage is separated by the one more membranes of the second stage into a second state retentate, forming a biomethane product gas. A permeate from the first stage is separated by the one or more membranes of the third stage into a third stage retentate and a third stage permeate. Recovery of methane from the the biogas is boosted by feeding the third stage retentate to the first purification stage. The recovery may be optionally further boosted by compressing the second stage permeate with the biogas at a main compressor.
|
1. A installation for producing biomethane containing at least 94% methane, comprising:
a source of a biogas; a main compressor, an inlet of which is in fluid communicating with the source; a first purification stage comprising at least one membrane selective for carbon dioxide over methane, an inlet of the first purification stage being in fluid communication with an outlet of the main compressor; a second purification stage comprising at least one membrane selective for carbon dioxide over methane, an inlet of the second purification stage being in fluid communication with a retentate outlet of the first purification stage; and a high recovery module comprising a third purification stage comprising one or more membranes in parallel or in series that are selective for carbon dioxide over methane and a secondary compressor in fluid communication between a permeate outlet of the first purification stage and an inlet of the third purification stage, wherein a retentate outlet of the third purification stage is in fluid communication with the first purification stage inlet so as to allow a retentate stream from the third purification stage to be recycled to the first purification stage. 2. The installation of claim 1, wherein: a permeate outlet of the second purification stage is in fluid communication with the main compressor inlet so as to allow a permeate stream from the second purification stage to be recycled to the main compressor. 3. The installation of claim 1, further comprising a dehydration unit in fluid communication between the main compressor outlet and the first purification stage inlet that is adapted and configured to remove amounts of water from a combination stream received from the compressor outlet prior to the combination stream being fed to the first purification stage inlet. 4. The installation of claim 3, wherein said dehydration unit is a condenser or dehydration media. 5. The installation of claim 1, wherein the at least one membrane of the first purification stage comprises a porous polymeric substrate and at least one separation layer, the polymeric substrate being selected from the group consisting of polyimides, polysulfones, polyether ether ketones, and mixtures thereof. 6. The installation of claim 5, wherein said polymeric substrate is a polyether ether ketone. 7. The installation of claim 5, wherein the separation layer is made of a copolymer or block polymer of the formula: 8. The installation of claim 5, wherein the separation layer is made of repeating units of the following monomers: 9. The installation of claim 5, wherein the separation layer is made of a copolymer or block polymer of tetramethylene oxide, propylene oxide, and/or ethylene oxide. 10. The installation of claim 1, wherein the at least one membrane of the first purification stage is in the form of flat films or a plurality of hollow fibers. 11. The installation of claim 1, wherein the at least one membrane of the first purification stage is selectivity for H2S, CO6+ hydrocarbons, carbon dioxide, siloxane and water over methane. 12. The installation of claim 1, wherein said stream of said first gas mixture has a pressure drop of less than 50 psi from said feed gas. 13. The installation of claim 1, wherein each of said membranes of said second stage is made of cellulose acetate, a polysulfone, a polyimide, polyamide, or mixtures thereof. 14. The installation of claim 1, further comprising a H2S removal unit comprising a H2S scavenger media in fluid communication between the main compressor and the first purification stage, the H2S removal unit being adapted and configured to remove amount of H2S from a combination stream received from the compressor. 15. The installation of claim 1, further comprising a H2S removal unit comprising a H2S scavenger media in fluid communication downstream of a retentate outlet of the second stage purification unit, the H2S unit being adapted and configured to remove amounts of H2S from a second stage retentate stream produced by the second purification stage. 16. The installation of claim 1, wherein said at least one membrane of said third purification stage is the same as the membrane of the first purification stage. 17. The installation of claim 1, wherein said at least one membrane of the third purification stage is the same as the membrane of the second purification stage. 18. The installation of claim 1, wherein: the high recovery module further comprises a fourth purification stage comprising at least one membrane selective for carbon dioxide over methane; an inlet of the fourth purification being in downstream flow communication with a retentate outlet of the third purification stage; a permeate outlet of the second purification stage is in fluid communication with the main compressor inlet so as to allow a permeate stream from the second purification stage to be recycled to the main compressor; and a retentate outlet of the fourth purification stage is in fluid communication with the first purification stage inlet so as to allow a retentate stream from the fourth purification stage to be recycled to the first purification stage. 19. A method for increasing a recovery of methane in biomethane product gas produced by an existing installation for producing biomethane comprising a source of a biogas, a main compressor, a first purification stage comprising at least one membrane selective for carbon dioxide over methane, a second purification stage comprising at least one membrane selective for carbon dioxide over methane, an inlet of the main compressor being in fluid communication downstream of the source, an inlet of the first purification stage being in fluid communication downstream of an outlet of the main compressor, an inlet of the second purification stage being in fluid communication downstream of a retentate outlet of the first purification stage, a permeate outlet of the second purification stage being in fluid communication with the inlet of the main compressor, said method comprising the steps of:
providing a high recovery module comprising a secondary compressor and a third purification stage comprising one or more membranes in series or in parallel that are selective for carbon dioxide over methane; placing an inlet of the secondary compressor in downstream flow communication with a permeate outlet of the first purification stage; placing an inlet of the third purification stage in downstream flow communication with an outlet of the secondary compressor; and placing a retentate outlet of the third purification stage in fluid communication with the inlet of the first purification stage.
|
The invention relates to a process for recovering methane from digester biogas or landfill gas. More specifically, the invention pertains to biomethane production that substantially removes carbon dioxide from a digester biogas or landfill gas using first, second, and third purification stages each comprising one or more membranes selective for carbon dioxide over methane. A retentate from the first stage is separated by the one more membranes of the second stage into a second state retentate, forming a biomethane product gas. A permeate from the first stage is separated by the one or more membranes of the third stage into a third stage retentate and a third stage permeate. Recovery of methane from the the biogas is boosted by feeding the third stage retentate to the first purification stage. The recovery may be optionally further boosted by compressing the second stage permeate with the biogas at a main compressor.1. A installation for producing biomethane containing at least 94% methane, comprising:
a source of a biogas; a main compressor, an inlet of which is in fluid communicating with the source; a first purification stage comprising at least one membrane selective for carbon dioxide over methane, an inlet of the first purification stage being in fluid communication with an outlet of the main compressor; a second purification stage comprising at least one membrane selective for carbon dioxide over methane, an inlet of the second purification stage being in fluid communication with a retentate outlet of the first purification stage; and a high recovery module comprising a third purification stage comprising one or more membranes in parallel or in series that are selective for carbon dioxide over methane and a secondary compressor in fluid communication between a permeate outlet of the first purification stage and an inlet of the third purification stage, wherein a retentate outlet of the third purification stage is in fluid communication with the first purification stage inlet so as to allow a retentate stream from the third purification stage to be recycled to the first purification stage. 2. The installation of claim 1, wherein: a permeate outlet of the second purification stage is in fluid communication with the main compressor inlet so as to allow a permeate stream from the second purification stage to be recycled to the main compressor. 3. The installation of claim 1, further comprising a dehydration unit in fluid communication between the main compressor outlet and the first purification stage inlet that is adapted and configured to remove amounts of water from a combination stream received from the compressor outlet prior to the combination stream being fed to the first purification stage inlet. 4. The installation of claim 3, wherein said dehydration unit is a condenser or dehydration media. 5. The installation of claim 1, wherein the at least one membrane of the first purification stage comprises a porous polymeric substrate and at least one separation layer, the polymeric substrate being selected from the group consisting of polyimides, polysulfones, polyether ether ketones, and mixtures thereof. 6. The installation of claim 5, wherein said polymeric substrate is a polyether ether ketone. 7. The installation of claim 5, wherein the separation layer is made of a copolymer or block polymer of the formula: 8. The installation of claim 5, wherein the separation layer is made of repeating units of the following monomers: 9. The installation of claim 5, wherein the separation layer is made of a copolymer or block polymer of tetramethylene oxide, propylene oxide, and/or ethylene oxide. 10. The installation of claim 1, wherein the at least one membrane of the first purification stage is in the form of flat films or a plurality of hollow fibers. 11. The installation of claim 1, wherein the at least one membrane of the first purification stage is selectivity for H2S, CO6+ hydrocarbons, carbon dioxide, siloxane and water over methane. 12. The installation of claim 1, wherein said stream of said first gas mixture has a pressure drop of less than 50 psi from said feed gas. 13. The installation of claim 1, wherein each of said membranes of said second stage is made of cellulose acetate, a polysulfone, a polyimide, polyamide, or mixtures thereof. 14. The installation of claim 1, further comprising a H2S removal unit comprising a H2S scavenger media in fluid communication between the main compressor and the first purification stage, the H2S removal unit being adapted and configured to remove amount of H2S from a combination stream received from the compressor. 15. The installation of claim 1, further comprising a H2S removal unit comprising a H2S scavenger media in fluid communication downstream of a retentate outlet of the second stage purification unit, the H2S unit being adapted and configured to remove amounts of H2S from a second stage retentate stream produced by the second purification stage. 16. The installation of claim 1, wherein said at least one membrane of said third purification stage is the same as the membrane of the first purification stage. 17. The installation of claim 1, wherein said at least one membrane of the third purification stage is the same as the membrane of the second purification stage. 18. The installation of claim 1, wherein: the high recovery module further comprises a fourth purification stage comprising at least one membrane selective for carbon dioxide over methane; an inlet of the fourth purification being in downstream flow communication with a retentate outlet of the third purification stage; a permeate outlet of the second purification stage is in fluid communication with the main compressor inlet so as to allow a permeate stream from the second purification stage to be recycled to the main compressor; and a retentate outlet of the fourth purification stage is in fluid communication with the first purification stage inlet so as to allow a retentate stream from the fourth purification stage to be recycled to the first purification stage. 19. A method for increasing a recovery of methane in biomethane product gas produced by an existing installation for producing biomethane comprising a source of a biogas, a main compressor, a first purification stage comprising at least one membrane selective for carbon dioxide over methane, a second purification stage comprising at least one membrane selective for carbon dioxide over methane, an inlet of the main compressor being in fluid communication downstream of the source, an inlet of the first purification stage being in fluid communication downstream of an outlet of the main compressor, an inlet of the second purification stage being in fluid communication downstream of a retentate outlet of the first purification stage, a permeate outlet of the second purification stage being in fluid communication with the inlet of the main compressor, said method comprising the steps of:
providing a high recovery module comprising a secondary compressor and a third purification stage comprising one or more membranes in series or in parallel that are selective for carbon dioxide over methane; placing an inlet of the secondary compressor in downstream flow communication with a permeate outlet of the first purification stage; placing an inlet of the third purification stage in downstream flow communication with an outlet of the secondary compressor; and placing a retentate outlet of the third purification stage in fluid communication with the inlet of the first purification stage.
| 1,700
|
338,081
| 16,799,706
| 3,724
|
A cutter edge is pressed against a brittle-material substrate so that a protruding portion of the cutter edge is positioned between a first edge of the brittle-material substrate and a side portion of the cutter edge and that a side portion of the cutter edge is positioned between the protruding portion of the cutter edge and a second edge of the brittle-material substrate. A scribe line is formed by a scratch between a first position closer to the first edge of the first and second edges and a second position closer to the second edge of the first and second edges. After the formation of the scribe line, a crack is extended in a thickness direction from the second position toward the first position along the scribe line, thus forming a crack line.
|
1. A method for dividing a brittle-material substrate, the method comprising:
preparing a brittle-material substrate made of grass material and including a surface and having a thickness direction perpendicular to said surface, said surface being surrounded by a perimeter including first and second edges opposite to each other; pressing a cutter edge against said surface of said brittle-material substrate, said cutter edge including a protruding portion and a side portion extending from said protruding portion and having a convex shape; forming by plastic deformation, a scribe line having a groove shape involving no vertical crack, said scribe line being formed between a first position closer to said first edge and a second position closer to said second edge on said surface of said brittle-material substrate by causing said cutter edge pressed in said pressing to slide on said surface of said brittle-material substrate; after said forming a scribe line, forming a crack line by extending a crack of said brittle-material substrate in said thickness direction from said second position toward said first position along said scribe line; and dividing said brittle-material substrate along said crack line; 2. The method for dividing a brittle-material substrate according to claim 1, wherein
said cutter edge includes first to third surfaces adjacent to each other, a vertex at which said first to third surfaces meet, and a ridge formed by said second and third surfaces, and said protruding portion of said cutter edge comprises said vertex, and said side portion of said cutter edge comprises said ridge. 3. The method for dividing a brittle-material substrate according to claim 1, wherein
said cutter edge has a shape of a cone including a vertex and a conical surface, and said protruding portion of said cutter edge comprises said vertex, and said side portion of said cutter edge is formed along an imaginary line extending from said vertex on said conical surface. 4. The method for dividing a brittle-material substrate according to claim 1, wherein said forming a scribe line comprises
displacing said cutter edge from said first position to said second position, increasing a load to be applied to said cutter edge at said second position, and causing said cutter edge to which the increased load has been applied to slide beyond said second edge. 5. The method for dividing a brittle-material substrate according to claim 1, wherein said forming a crack line comprises applying a stress between said second position and said second edge after said forming a scribe line. 6. The method for dividing a brittle-material substrate according to claim 5, wherein said forming a scribe line is performed by forming a scribe line reaching said second edge. 7. The method for dividing a brittle-material substrate according to claim 5, wherein said applying a stress comprises causing said cutter edge pressed on said surface of said brittle-material substrate to slide between said second position and said second edge on said surface of said brittle-material substrate. 8. The method for dividing a brittle-material substrate according to claim 5, wherein said applying a stress comprises applying laser light between said second position and said second edge on said surface of said brittle-material substrate.
|
A cutter edge is pressed against a brittle-material substrate so that a protruding portion of the cutter edge is positioned between a first edge of the brittle-material substrate and a side portion of the cutter edge and that a side portion of the cutter edge is positioned between the protruding portion of the cutter edge and a second edge of the brittle-material substrate. A scribe line is formed by a scratch between a first position closer to the first edge of the first and second edges and a second position closer to the second edge of the first and second edges. After the formation of the scribe line, a crack is extended in a thickness direction from the second position toward the first position along the scribe line, thus forming a crack line.1. A method for dividing a brittle-material substrate, the method comprising:
preparing a brittle-material substrate made of grass material and including a surface and having a thickness direction perpendicular to said surface, said surface being surrounded by a perimeter including first and second edges opposite to each other; pressing a cutter edge against said surface of said brittle-material substrate, said cutter edge including a protruding portion and a side portion extending from said protruding portion and having a convex shape; forming by plastic deformation, a scribe line having a groove shape involving no vertical crack, said scribe line being formed between a first position closer to said first edge and a second position closer to said second edge on said surface of said brittle-material substrate by causing said cutter edge pressed in said pressing to slide on said surface of said brittle-material substrate; after said forming a scribe line, forming a crack line by extending a crack of said brittle-material substrate in said thickness direction from said second position toward said first position along said scribe line; and dividing said brittle-material substrate along said crack line; 2. The method for dividing a brittle-material substrate according to claim 1, wherein
said cutter edge includes first to third surfaces adjacent to each other, a vertex at which said first to third surfaces meet, and a ridge formed by said second and third surfaces, and said protruding portion of said cutter edge comprises said vertex, and said side portion of said cutter edge comprises said ridge. 3. The method for dividing a brittle-material substrate according to claim 1, wherein
said cutter edge has a shape of a cone including a vertex and a conical surface, and said protruding portion of said cutter edge comprises said vertex, and said side portion of said cutter edge is formed along an imaginary line extending from said vertex on said conical surface. 4. The method for dividing a brittle-material substrate according to claim 1, wherein said forming a scribe line comprises
displacing said cutter edge from said first position to said second position, increasing a load to be applied to said cutter edge at said second position, and causing said cutter edge to which the increased load has been applied to slide beyond said second edge. 5. The method for dividing a brittle-material substrate according to claim 1, wherein said forming a crack line comprises applying a stress between said second position and said second edge after said forming a scribe line. 6. The method for dividing a brittle-material substrate according to claim 5, wherein said forming a scribe line is performed by forming a scribe line reaching said second edge. 7. The method for dividing a brittle-material substrate according to claim 5, wherein said applying a stress comprises causing said cutter edge pressed on said surface of said brittle-material substrate to slide between said second position and said second edge on said surface of said brittle-material substrate. 8. The method for dividing a brittle-material substrate according to claim 5, wherein said applying a stress comprises applying laser light between said second position and said second edge on said surface of said brittle-material substrate.
| 3,700
|
338,082
| 16,799,718
| 3,724
|
Adaptive security profiles are supported on an electronic device. One or more security profiles may be automatically or selectively applied to the device based on the device's location and one or more geographic zone definitions. The security profiles may be used to determine the level of authentication or number of invalid authentication attempts for a particular feature or application or set of features or applications.
|
1. A method comprising:
at an electronic device with one or more processors and memory:
determining that one or more criteria have been satisfied; and
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within a predetermined distance of a respective device, generating a notification that indicates that the one or more criteria have been satisfied; and
in accordance with a determination that the electronic device is within the predetermined distance of the respective device, forgoing generating the notification that the one or more criteria have been satisfied. 2. The method of claim 1, wherein the determinations that the electronic device is or is not within the predetermined distance of the respective device are based on whether a wireless connection between the electronic device and the respective device is broken. 3. The method of claim 1, wherein the respective device is a tag. 4. The method of claim 1, further comprising:
determining a location of the electronic device, wherein generating the notification that indicates that the one or more criteria have been satisfied is further based on the location of the electronic device. 5. The method of claim 4, wherein generating the notification that indicates that the one or more criteria have been satisfied is further in accordance with a determination that the location of the electronic device is a first location, the method further comprising:
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within the predetermined distance of the respective device and that the location of the electronic device is a second location, different from the first location, forgoing generating the notification that the one or more criteria have been satisfied. 6. The method of claim 1, wherein the electronic device is paired with the respective device. 7. The method of claim 1, wherein whether the one or more criteria are satisfied is based on one or more user-specified settings. 8. An electronic device comprising:
one or more processors; and memory storing instructions, which when executed by the one or more processors, cause:
determining that one or more criteria have been satisfied; and
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within a predetermined distance of a respective device, generating a notification that indicates that the one or more criteria have been satisfied; and
in accordance with a determination that the electronic device is within the predetermined distance of the respective device, forgoing generating the notification that the one or more criteria have been satisfied. 9. The electronic device of claim 8, wherein the determinations that the electronic device is or is not within the predetermined distance of the respective device are based on whether a wireless connection between the electronic device and the respective device is broken. 10. The electronic device of claim 8, wherein the respective device is a tag. 11. The electronic device of claim 8, wherein the instructions further cause:
determining a location of the electronic device, wherein generating the notification that indicates that the one or more criteria have been satisfied is further based on the location of the electronic device. 12. The electronic device of claim 11, wherein generating the notification that indicates that the one or more criteria have been satisfied is further in accordance with a determination that the location of the electronic device is a first location, and the instructions further cause:
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within the predetermined distance of the respective device and that the location of the electronic device is a second location, different from the first location, forgoing generating the notification that the one or more criteria have been satisfied. 13. The electronic device of claim 8, wherein the electronic device is paired with the respective device. 14. The electronic device of claim 8, wherein whether the one or more criteria are satisfied is based on one or more user-specified settings. 15. A non-transitory computer-readable storage medium including instructions, which when executed by one or more processors of an electronic device, cause:
determining that one or more criteria have been satisfied; and in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within a predetermined distance of a respective device, generating a notification that indicates that the one or more criteria have been satisfied; and
in accordance with a determination that the electronic device is within the predetermined distance of the respective device, forgoing generating the notification that the one or more criteria have been satisfied. 16. The computer-readable storage medium of claim 15, wherein the determinations that the electronic device is or is not within the predetermined distance of the respective device are based on whether a wireless connection between the electronic device and the respective device is broken. 17. The computer-readable storage medium of claim 15, wherein the respective device is a tag. 18. The computer-readable storage medium of claim 15, wherein the instructions further cause:
determining a location of the electronic device, wherein generating the notification that indicates that the one or more criteria have been satisfied is further based on the location of the electronic device. 19. The computer-readable storage medium of claim 18, wherein generating the notification that indicates that the one or more criteria have been satisfied is further in accordance with a determination that the location of the electronic device is a first location, and the instructions further cause:
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within the predetermined distance of the respective device and that the location of the electronic device is a second location, different from the first location, forgoing generating the notification that the one or more criteria have been satisfied. 20. The computer-readable storage medium of claim 15, wherein the electronic device is paired with the respective device. 21. The computer-readable storage medium of claim 15, wherein whether the one or more criteria are satisfied is based on one or more user-specified settings.
|
Adaptive security profiles are supported on an electronic device. One or more security profiles may be automatically or selectively applied to the device based on the device's location and one or more geographic zone definitions. The security profiles may be used to determine the level of authentication or number of invalid authentication attempts for a particular feature or application or set of features or applications.1. A method comprising:
at an electronic device with one or more processors and memory:
determining that one or more criteria have been satisfied; and
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within a predetermined distance of a respective device, generating a notification that indicates that the one or more criteria have been satisfied; and
in accordance with a determination that the electronic device is within the predetermined distance of the respective device, forgoing generating the notification that the one or more criteria have been satisfied. 2. The method of claim 1, wherein the determinations that the electronic device is or is not within the predetermined distance of the respective device are based on whether a wireless connection between the electronic device and the respective device is broken. 3. The method of claim 1, wherein the respective device is a tag. 4. The method of claim 1, further comprising:
determining a location of the electronic device, wherein generating the notification that indicates that the one or more criteria have been satisfied is further based on the location of the electronic device. 5. The method of claim 4, wherein generating the notification that indicates that the one or more criteria have been satisfied is further in accordance with a determination that the location of the electronic device is a first location, the method further comprising:
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within the predetermined distance of the respective device and that the location of the electronic device is a second location, different from the first location, forgoing generating the notification that the one or more criteria have been satisfied. 6. The method of claim 1, wherein the electronic device is paired with the respective device. 7. The method of claim 1, wherein whether the one or more criteria are satisfied is based on one or more user-specified settings. 8. An electronic device comprising:
one or more processors; and memory storing instructions, which when executed by the one or more processors, cause:
determining that one or more criteria have been satisfied; and
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within a predetermined distance of a respective device, generating a notification that indicates that the one or more criteria have been satisfied; and
in accordance with a determination that the electronic device is within the predetermined distance of the respective device, forgoing generating the notification that the one or more criteria have been satisfied. 9. The electronic device of claim 8, wherein the determinations that the electronic device is or is not within the predetermined distance of the respective device are based on whether a wireless connection between the electronic device and the respective device is broken. 10. The electronic device of claim 8, wherein the respective device is a tag. 11. The electronic device of claim 8, wherein the instructions further cause:
determining a location of the electronic device, wherein generating the notification that indicates that the one or more criteria have been satisfied is further based on the location of the electronic device. 12. The electronic device of claim 11, wherein generating the notification that indicates that the one or more criteria have been satisfied is further in accordance with a determination that the location of the electronic device is a first location, and the instructions further cause:
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within the predetermined distance of the respective device and that the location of the electronic device is a second location, different from the first location, forgoing generating the notification that the one or more criteria have been satisfied. 13. The electronic device of claim 8, wherein the electronic device is paired with the respective device. 14. The electronic device of claim 8, wherein whether the one or more criteria are satisfied is based on one or more user-specified settings. 15. A non-transitory computer-readable storage medium including instructions, which when executed by one or more processors of an electronic device, cause:
determining that one or more criteria have been satisfied; and in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within a predetermined distance of a respective device, generating a notification that indicates that the one or more criteria have been satisfied; and
in accordance with a determination that the electronic device is within the predetermined distance of the respective device, forgoing generating the notification that the one or more criteria have been satisfied. 16. The computer-readable storage medium of claim 15, wherein the determinations that the electronic device is or is not within the predetermined distance of the respective device are based on whether a wireless connection between the electronic device and the respective device is broken. 17. The computer-readable storage medium of claim 15, wherein the respective device is a tag. 18. The computer-readable storage medium of claim 15, wherein the instructions further cause:
determining a location of the electronic device, wherein generating the notification that indicates that the one or more criteria have been satisfied is further based on the location of the electronic device. 19. The computer-readable storage medium of claim 18, wherein generating the notification that indicates that the one or more criteria have been satisfied is further in accordance with a determination that the location of the electronic device is a first location, and the instructions further cause:
in response to determining that the one or more criteria have been satisfied:
in accordance with a determination that the electronic device is not within the predetermined distance of the respective device and that the location of the electronic device is a second location, different from the first location, forgoing generating the notification that the one or more criteria have been satisfied. 20. The computer-readable storage medium of claim 15, wherein the electronic device is paired with the respective device. 21. The computer-readable storage medium of claim 15, wherein whether the one or more criteria are satisfied is based on one or more user-specified settings.
| 3,700
|
338,083
| 16,799,688
| 3,724
|
A carrier head for chemical mechanical polishing includes a base, an actuator, a substrate mounting surface, and a retainer. The retainer includes an inner section and an outer section connected by a flexure. A bottom of the inner section of the retainer provides an inner portion of a lower surface configured to contact a polishing pad. An inner surface of the inner section extends upwardly from an inner edge of the lower surface to circumferentially surround the substrate mounting surface. The inner section of the retainer is positioned to receive a controllable load from the actuator and is vertically movable relative to the base. A bottom of the outer section of the retainer provides an outer portion of the lower surface. The outer section of the retainer is vertically fixed to the base. The inner section of the retainer is vertically movable relative to the outer section of the retainer.
|
1. A carrier head for chemical mechanical polishing, comprising:
a base; an actuator; a substrate mounting surface; and a retainer having an inner section and an outer section connected by a flexure such that the inner section of the retainer is vertically movable relative to the outer section of the retainer,
wherein a bottom of the inner section of the retainer provides an inner portion of a lower surface configured to contact a polishing pad, and wherein an inner surface of the inner section extends upwardly from an inner edge of the lower surface to circumferentially surround the substrate mounting surface, wherein the inner section of the retainer is positioned to receive a controllable load from the actuator and is vertically movable relative to the base,
wherein a bottom of the outer section of the retainer provides an outer portion of the lower surface, wherein the outer section of the retainer is vertically fixed to the base. 2. The carrier head of claim 1, wherein the actuator comprises a pressurizable chamber. 3. The carrier head of claim 2, wherein the actuator comprises a membrane and the inner section is secured to the membrane. 4. The carrier head of claim 1, wherein the flexure is thinner than the inner section and the outer section. 5. The carrier head of claim 1, wherein a bottom of the flexure provides a middle portion of the lower surface positioned between the inner portion and the outer portion of the lower surface. 6. The carrier head of claim 5, wherein the middle portion of the lower surface is coplanar with the inner portion and outer portion of the lower surface when the flexure is not being flexed. 7. The carrier head of claim 1, wherein the inner section is taller than the outer section. 8. The carrier head of claim 1, wherein the inner section is narrower than the outer section. 9. The carrier head of claim 1, wherein the inner portion of the lower surface and the outer portion of the lower surface are coplanar when the when the flexure is not being flexed. 10. A retaining ring, comprising:
an inner section having a bottom that provides an inner portion of a lower surface of the retainer configured to contact a polishing pad, the inner section further having an inner surface extending upwardly from an inner edge of the lower surface and configured to circumferentially surround a substrate mounting surface; an outer section having a bottom that provides an outer portion of the lower surface, the outer section further having an outer surface extending upwardly from an outer edge of the lower surface; and a flexure coupling the inner section and the outer section such that the inner section is vertically movable relative to the outer section. 11. The retaining ring of claim 10, wherein the flexure is thinner than the inner section and the outer section. 12. The retaining ring of claim 10, wherein the flexure is adjacent to the bottom of the inner section and the outer section. 13. The retaining ring of claim 10 wherein the bottom of the flexure provides a middle portion of the lower surface. 14. The retaining ring of claim 13, wherein the middle portion of the lower surface is coplanar with the inner portion and the outer portion of the lower surface. 15. The retaining ring of claim 10, wherein the flexure is composed of the same material as the inner section and the outer section. 16. The retaining ring of claim 15, wherein the retainer is a single unitary body of homogenous composition. 17. The retaining ring of claim 10, wherein the inner section is taller than the outer section. 18. The retaining ring of claim 10, wherein the inner section is narrower than the outer section. 19. The retaining ring of claim 10, wherein the inner portion of the lower surface and the outer portion of the lower surface are coplanar. 20. A retaining ring, comprising:
an inner section having a bottom that provides an inner portion of a lower surface of the retainer configured to contact a polishing pad, the inner section further having an inner surface extending upwardly from an inner edge of the lower surface and configured to circumferentially surround a substrate mounting surface; an outer section that is narrower than the inner section and has a bottom that provides an outer portion of the lower surface, the outer section further having an outer surface extending upwardly from an outer edge of the lower surface; and a flexure coupling the inner section and the outer section such that the inner section is vertically movable relative to the outer section, wherein a bottom of the flexure provides a middle portion of the lower surface and the inner portion, middle portion are coplanar when the flexure is not being flexed.
|
A carrier head for chemical mechanical polishing includes a base, an actuator, a substrate mounting surface, and a retainer. The retainer includes an inner section and an outer section connected by a flexure. A bottom of the inner section of the retainer provides an inner portion of a lower surface configured to contact a polishing pad. An inner surface of the inner section extends upwardly from an inner edge of the lower surface to circumferentially surround the substrate mounting surface. The inner section of the retainer is positioned to receive a controllable load from the actuator and is vertically movable relative to the base. A bottom of the outer section of the retainer provides an outer portion of the lower surface. The outer section of the retainer is vertically fixed to the base. The inner section of the retainer is vertically movable relative to the outer section of the retainer.1. A carrier head for chemical mechanical polishing, comprising:
a base; an actuator; a substrate mounting surface; and a retainer having an inner section and an outer section connected by a flexure such that the inner section of the retainer is vertically movable relative to the outer section of the retainer,
wherein a bottom of the inner section of the retainer provides an inner portion of a lower surface configured to contact a polishing pad, and wherein an inner surface of the inner section extends upwardly from an inner edge of the lower surface to circumferentially surround the substrate mounting surface, wherein the inner section of the retainer is positioned to receive a controllable load from the actuator and is vertically movable relative to the base,
wherein a bottom of the outer section of the retainer provides an outer portion of the lower surface, wherein the outer section of the retainer is vertically fixed to the base. 2. The carrier head of claim 1, wherein the actuator comprises a pressurizable chamber. 3. The carrier head of claim 2, wherein the actuator comprises a membrane and the inner section is secured to the membrane. 4. The carrier head of claim 1, wherein the flexure is thinner than the inner section and the outer section. 5. The carrier head of claim 1, wherein a bottom of the flexure provides a middle portion of the lower surface positioned between the inner portion and the outer portion of the lower surface. 6. The carrier head of claim 5, wherein the middle portion of the lower surface is coplanar with the inner portion and outer portion of the lower surface when the flexure is not being flexed. 7. The carrier head of claim 1, wherein the inner section is taller than the outer section. 8. The carrier head of claim 1, wherein the inner section is narrower than the outer section. 9. The carrier head of claim 1, wherein the inner portion of the lower surface and the outer portion of the lower surface are coplanar when the when the flexure is not being flexed. 10. A retaining ring, comprising:
an inner section having a bottom that provides an inner portion of a lower surface of the retainer configured to contact a polishing pad, the inner section further having an inner surface extending upwardly from an inner edge of the lower surface and configured to circumferentially surround a substrate mounting surface; an outer section having a bottom that provides an outer portion of the lower surface, the outer section further having an outer surface extending upwardly from an outer edge of the lower surface; and a flexure coupling the inner section and the outer section such that the inner section is vertically movable relative to the outer section. 11. The retaining ring of claim 10, wherein the flexure is thinner than the inner section and the outer section. 12. The retaining ring of claim 10, wherein the flexure is adjacent to the bottom of the inner section and the outer section. 13. The retaining ring of claim 10 wherein the bottom of the flexure provides a middle portion of the lower surface. 14. The retaining ring of claim 13, wherein the middle portion of the lower surface is coplanar with the inner portion and the outer portion of the lower surface. 15. The retaining ring of claim 10, wherein the flexure is composed of the same material as the inner section and the outer section. 16. The retaining ring of claim 15, wherein the retainer is a single unitary body of homogenous composition. 17. The retaining ring of claim 10, wherein the inner section is taller than the outer section. 18. The retaining ring of claim 10, wherein the inner section is narrower than the outer section. 19. The retaining ring of claim 10, wherein the inner portion of the lower surface and the outer portion of the lower surface are coplanar. 20. A retaining ring, comprising:
an inner section having a bottom that provides an inner portion of a lower surface of the retainer configured to contact a polishing pad, the inner section further having an inner surface extending upwardly from an inner edge of the lower surface and configured to circumferentially surround a substrate mounting surface; an outer section that is narrower than the inner section and has a bottom that provides an outer portion of the lower surface, the outer section further having an outer surface extending upwardly from an outer edge of the lower surface; and a flexure coupling the inner section and the outer section such that the inner section is vertically movable relative to the outer section, wherein a bottom of the flexure provides a middle portion of the lower surface and the inner portion, middle portion are coplanar when the flexure is not being flexed.
| 3,700
|
338,084
| 16,799,652
| 3,724
|
Embodiments of this application disclose a resource scheduling method performed at a scheduling server. Virtual machine (VM) information of a to-be-created VM is obtained and common resource information is obtained. A preset resource information private copy is updated according to the common resource information. The resource information private copy includes host machine information corresponding to a preset host machine. Finally, according to the resource information private copy, at least one candidate host machine meeting the VM information is obtained, a target host machine is obtained from the at least one candidate host machine, and the VM is created on the target host machine. In the solution, the resource information private copy can be updated in time before the resource scheduling is performed, which ensures synchronization of the resource information private copy and the common resource information, so that a better resource scheduling result is achieved.
|
1. A resource scheduling method performed at a scheduling server having one or more processors and memory storing a plurality of programs to be executed by the one or more processors, the method comprising:
obtaining, by the scheduling server, virtual machine (VM) information corresponding to a to-be-created VM; obtaining, by the scheduling server, common resource information, the common resource information comprising host machine information corresponding to all host machines in a cloud computing system; updating, by the scheduling server, a preset resource information private copy according to the common resource information, the resource information private copy comprising host machine information corresponding to a preset host machine; obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information; and obtaining, by the scheduling server, a target host machine from the at least one candidate host machine, and creating the VM on the target host machine. 2. The resource scheduling method according to claim 1, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
synchronizing, by the scheduling server, the resource information private copy with the common resource information. 3. The resource scheduling method according to claim 1, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy. 4. The resource scheduling method according to claim 3, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information in a case that the resource information private copy is updated for the first time; copying, by the scheduling server, the target host machine information to the resource information private copy; obtaining, by the scheduling server, a current timestamp, and setting the current timestamp to a full update timestamp and an incremental update timestamp; and storing, by the scheduling server, the full update timestamp and the incremental update timestamp into the resource information private copy. 5. The resource scheduling method according to claim 3, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
obtaining, by the scheduling server, a time difference between a current timestamp and a previous full update timestamp in a case that the resource information private copy is not updated for the first time; determining, by the scheduling server, whether the time difference is greater than a preset full update threshold; performing, by the scheduling server, screening to obtain first target host machine information meeting the VM information from the common resource information in a case that the time difference is greater than the full update threshold; copying, by the scheduling server, the first target host machine information to the resource information private copy; setting, by the scheduling server, the current timestamp to a first full update timestamp and a first incremental update timestamp; and storing, by the scheduling server, the first full update timestamp and the first incremental update timestamp into the resource information private copy. 6. The resource scheduling method according to claim 5, wherein after the determining, by the scheduling server, whether the time difference is greater than a preset full update threshold, the method further comprises:
obtaining, by the scheduling server, updated host machine information of which an update timestamp is greater than a previous incremental update timestamp from the common resource information in a case that the time difference is less than or equal to the full update threshold; obtaining, by the scheduling server, second target host machine information meeting the VM information from the host machine information; adding, by the scheduling server, the second target host machine information to the resource information private copy; setting, by the scheduling server, the current timestamp to a second incremental update timestamp; and storing, by the scheduling server, the second incremental update timestamp into the resource information private copy. 7. The resource scheduling method according to claim 1, wherein the obtaining, by the scheduling server, a target host machine from the at least one candidate host machine comprises:
determining, by the scheduling server, priority values each host machine of the at least one candidate host machine in respective dimensions; performing ranking, by the scheduling server, in descending order of the priority values in the dimensions, to generate a candidate host machine list; deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines, and submitting the remaining resources to the common resource information until the remaining resource of one candidate host machine of the candidate host machines is successfully submitted, the resource requirement being comprised in the VM information corresponding to the VM; and setting, by the scheduling server in a case that the remaining resource corresponding to one candidate host machine of the candidate host machines is successfully submitted, the candidate host machine on which submission succeeds to the target host machine. 8. The resource scheduling method according to claim 7, wherein
before the deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines, the method further comprises: re-ranking, by the scheduling server, a preset quantity of top candidate host machines in the candidate host machine list, to generate a candidate host machine target list; and the deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines comprises: deducting, by the scheduling server, the resource requirement of the to-be-created VM from candidate host machines in the candidate host machine target list one by one according to rankings of the candidate host machines in the candidate host machine target list, to obtain remaining resources. 9. The resource scheduling method according to claim 8, wherein the re-ranking, by the scheduling server, a preset quantity of top candidate host machines in the candidate host machine list, to generate a candidate host machine target list comprises:
randomly re-ranking, by the scheduling server, the preset quantity of top candidate host machines in the candidate host machine list, to obtain the candidate host machine target list. 10. The resource scheduling method according to claim 7, wherein the submitting, by the scheduling server, the remaining resources to the common resource information until the remaining resource of one candidate host machine of the candidate host machines is successfully submitted comprises:
determining, by the scheduling server in a case of failing to submit the remaining resource of one candidate host machine, whether a quantity of submission times of the remaining resource of the candidate host machine exceeds a scheduling conflict threshold; obtaining, by the scheduling server, latest resource data of the candidate host machine, and re-determining the remaining resource corresponding to the candidate host machine in a case that the quantity of submission times of the remaining resource of the candidate host machine does not exceed the scheduling conflict threshold; and deducting, by the scheduling server, the resource requirement of the to-be-created VM from a next candidate host machine in the candidate host machine list to obtain a corresponding remaining resource, and submitting the corresponding remaining resource in a case that the quantity of submission times of the remaining resource of the candidate host machine exceeds the scheduling conflict threshold. 11. The resource scheduling method according to claim 1, wherein the obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information comprises:
filtering, by the scheduling server, the host machine in the resource information private copy according to a resource requirement in the VM information, to obtain the at least one candidate host machine. 12. A scheduling server comprising one or more processors, memory coupled to the one or more processors and a plurality of programs stored in the memory that, when executed by the one or more processors, cause the scheduling server to perform a plurality of operations comprising:
obtaining, by the scheduling server, virtual machine (VM) information corresponding to a to-be-created VM; obtaining, by the scheduling server, common resource information, the common resource information comprising host machine information corresponding to all host machines in a cloud computing system; updating, by the scheduling server, a preset resource information private copy according to the common resource information, the resource information private copy comprising host machine information corresponding to a preset host machine; obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information; and obtaining, by the scheduling server, a target host machine from the at least one candidate host machine, and creating the VM on the target host machine. 13. The scheduling server according to claim 12, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
synchronizing, by the scheduling server, the resource information private copy with the common resource information. 14. The scheduling server according to claim 12, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy. 15. The scheduling server according to claim 14, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information in a case that the resource information private copy is updated for the first time; copying, by the scheduling server, the target host machine information to the resource information private copy; obtaining, by the scheduling server, a current timestamp, and setting the current timestamp to a full update timestamp and an incremental update timestamp; and storing, by the scheduling server, the full update timestamp and the incremental update timestamp into the resource information private copy. 16. The scheduling server according to claim 14, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
obtaining, by the scheduling server, a time difference between a current timestamp and a previous full update timestamp in a case that the resource information private copy is not updated for the first time; determining, by the scheduling server, whether the time difference is greater than a preset full update threshold; performing, by the scheduling server, screening to obtain first target host machine information meeting the VM information from the common resource information in a case that the time difference is greater than the full update threshold; copying, by the scheduling server, the first target host machine information to the resource information private copy; setting, by the scheduling server, the current timestamp to a first full update timestamp and a first incremental update timestamp; and storing, by the scheduling server, the first full update timestamp and the first incremental update timestamp into the resource information private copy. 17. The scheduling server according to claim 12, wherein the obtaining, by the scheduling server, a target host machine from the at least one candidate host machine comprises:
determining, by the scheduling server, priority values each host machine of the at least one candidate host machine in respective dimensions; performing ranking, by the scheduling server, in descending order of the priority values in the dimensions, to generate a candidate host machine list; deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines, and submitting the remaining resources to the common resource information until the remaining resource of one candidate host machine of the candidate host machines is successfully submitted, the resource requirement being comprised in the VM information corresponding to the VM; and setting, by the scheduling server in a case that the remaining resource corresponding to one candidate host machine of the candidate host machines is successfully submitted, the candidate host machine on which submission succeeds to the target host machine. 18. A non-transitory computer readable storage medium storing a plurality of machine readable instructions in connection with a scheduling server having one or more processors, wherein the plurality of machine readable instructions, when executed by the one or more processors, cause the terminal to perform a plurality of operations including:
obtaining, by the scheduling server, virtual machine (VM) information corresponding to a to-be-created VM; obtaining, by the scheduling server, common resource information, the common resource information comprising host machine information corresponding to all host machines in a cloud computing system; updating, by the scheduling server, a preset resource information private copy according to the common resource information, the resource information private copy comprising host machine information corresponding to a preset host machine; obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information; and obtaining, by the scheduling server, a target host machine from the at least one candidate host machine, and creating the VM on the target host machine. 19. The non-transitory computer readable storage medium according to claim 18, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
synchronizing, by the scheduling server, the resource information private copy with the common resource information. 20. The non-transitory computer readable storage medium according to claim 18, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy.
|
Embodiments of this application disclose a resource scheduling method performed at a scheduling server. Virtual machine (VM) information of a to-be-created VM is obtained and common resource information is obtained. A preset resource information private copy is updated according to the common resource information. The resource information private copy includes host machine information corresponding to a preset host machine. Finally, according to the resource information private copy, at least one candidate host machine meeting the VM information is obtained, a target host machine is obtained from the at least one candidate host machine, and the VM is created on the target host machine. In the solution, the resource information private copy can be updated in time before the resource scheduling is performed, which ensures synchronization of the resource information private copy and the common resource information, so that a better resource scheduling result is achieved.1. A resource scheduling method performed at a scheduling server having one or more processors and memory storing a plurality of programs to be executed by the one or more processors, the method comprising:
obtaining, by the scheduling server, virtual machine (VM) information corresponding to a to-be-created VM; obtaining, by the scheduling server, common resource information, the common resource information comprising host machine information corresponding to all host machines in a cloud computing system; updating, by the scheduling server, a preset resource information private copy according to the common resource information, the resource information private copy comprising host machine information corresponding to a preset host machine; obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information; and obtaining, by the scheduling server, a target host machine from the at least one candidate host machine, and creating the VM on the target host machine. 2. The resource scheduling method according to claim 1, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
synchronizing, by the scheduling server, the resource information private copy with the common resource information. 3. The resource scheduling method according to claim 1, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy. 4. The resource scheduling method according to claim 3, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information in a case that the resource information private copy is updated for the first time; copying, by the scheduling server, the target host machine information to the resource information private copy; obtaining, by the scheduling server, a current timestamp, and setting the current timestamp to a full update timestamp and an incremental update timestamp; and storing, by the scheduling server, the full update timestamp and the incremental update timestamp into the resource information private copy. 5. The resource scheduling method according to claim 3, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
obtaining, by the scheduling server, a time difference between a current timestamp and a previous full update timestamp in a case that the resource information private copy is not updated for the first time; determining, by the scheduling server, whether the time difference is greater than a preset full update threshold; performing, by the scheduling server, screening to obtain first target host machine information meeting the VM information from the common resource information in a case that the time difference is greater than the full update threshold; copying, by the scheduling server, the first target host machine information to the resource information private copy; setting, by the scheduling server, the current timestamp to a first full update timestamp and a first incremental update timestamp; and storing, by the scheduling server, the first full update timestamp and the first incremental update timestamp into the resource information private copy. 6. The resource scheduling method according to claim 5, wherein after the determining, by the scheduling server, whether the time difference is greater than a preset full update threshold, the method further comprises:
obtaining, by the scheduling server, updated host machine information of which an update timestamp is greater than a previous incremental update timestamp from the common resource information in a case that the time difference is less than or equal to the full update threshold; obtaining, by the scheduling server, second target host machine information meeting the VM information from the host machine information; adding, by the scheduling server, the second target host machine information to the resource information private copy; setting, by the scheduling server, the current timestamp to a second incremental update timestamp; and storing, by the scheduling server, the second incremental update timestamp into the resource information private copy. 7. The resource scheduling method according to claim 1, wherein the obtaining, by the scheduling server, a target host machine from the at least one candidate host machine comprises:
determining, by the scheduling server, priority values each host machine of the at least one candidate host machine in respective dimensions; performing ranking, by the scheduling server, in descending order of the priority values in the dimensions, to generate a candidate host machine list; deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines, and submitting the remaining resources to the common resource information until the remaining resource of one candidate host machine of the candidate host machines is successfully submitted, the resource requirement being comprised in the VM information corresponding to the VM; and setting, by the scheduling server in a case that the remaining resource corresponding to one candidate host machine of the candidate host machines is successfully submitted, the candidate host machine on which submission succeeds to the target host machine. 8. The resource scheduling method according to claim 7, wherein
before the deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines, the method further comprises: re-ranking, by the scheduling server, a preset quantity of top candidate host machines in the candidate host machine list, to generate a candidate host machine target list; and the deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines comprises: deducting, by the scheduling server, the resource requirement of the to-be-created VM from candidate host machines in the candidate host machine target list one by one according to rankings of the candidate host machines in the candidate host machine target list, to obtain remaining resources. 9. The resource scheduling method according to claim 8, wherein the re-ranking, by the scheduling server, a preset quantity of top candidate host machines in the candidate host machine list, to generate a candidate host machine target list comprises:
randomly re-ranking, by the scheduling server, the preset quantity of top candidate host machines in the candidate host machine list, to obtain the candidate host machine target list. 10. The resource scheduling method according to claim 7, wherein the submitting, by the scheduling server, the remaining resources to the common resource information until the remaining resource of one candidate host machine of the candidate host machines is successfully submitted comprises:
determining, by the scheduling server in a case of failing to submit the remaining resource of one candidate host machine, whether a quantity of submission times of the remaining resource of the candidate host machine exceeds a scheduling conflict threshold; obtaining, by the scheduling server, latest resource data of the candidate host machine, and re-determining the remaining resource corresponding to the candidate host machine in a case that the quantity of submission times of the remaining resource of the candidate host machine does not exceed the scheduling conflict threshold; and deducting, by the scheduling server, the resource requirement of the to-be-created VM from a next candidate host machine in the candidate host machine list to obtain a corresponding remaining resource, and submitting the corresponding remaining resource in a case that the quantity of submission times of the remaining resource of the candidate host machine exceeds the scheduling conflict threshold. 11. The resource scheduling method according to claim 1, wherein the obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information comprises:
filtering, by the scheduling server, the host machine in the resource information private copy according to a resource requirement in the VM information, to obtain the at least one candidate host machine. 12. A scheduling server comprising one or more processors, memory coupled to the one or more processors and a plurality of programs stored in the memory that, when executed by the one or more processors, cause the scheduling server to perform a plurality of operations comprising:
obtaining, by the scheduling server, virtual machine (VM) information corresponding to a to-be-created VM; obtaining, by the scheduling server, common resource information, the common resource information comprising host machine information corresponding to all host machines in a cloud computing system; updating, by the scheduling server, a preset resource information private copy according to the common resource information, the resource information private copy comprising host machine information corresponding to a preset host machine; obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information; and obtaining, by the scheduling server, a target host machine from the at least one candidate host machine, and creating the VM on the target host machine. 13. The scheduling server according to claim 12, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
synchronizing, by the scheduling server, the resource information private copy with the common resource information. 14. The scheduling server according to claim 12, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy. 15. The scheduling server according to claim 14, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information in a case that the resource information private copy is updated for the first time; copying, by the scheduling server, the target host machine information to the resource information private copy; obtaining, by the scheduling server, a current timestamp, and setting the current timestamp to a full update timestamp and an incremental update timestamp; and storing, by the scheduling server, the full update timestamp and the incremental update timestamp into the resource information private copy. 16. The scheduling server according to claim 14, wherein the performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy comprises:
obtaining, by the scheduling server, a time difference between a current timestamp and a previous full update timestamp in a case that the resource information private copy is not updated for the first time; determining, by the scheduling server, whether the time difference is greater than a preset full update threshold; performing, by the scheduling server, screening to obtain first target host machine information meeting the VM information from the common resource information in a case that the time difference is greater than the full update threshold; copying, by the scheduling server, the first target host machine information to the resource information private copy; setting, by the scheduling server, the current timestamp to a first full update timestamp and a first incremental update timestamp; and storing, by the scheduling server, the first full update timestamp and the first incremental update timestamp into the resource information private copy. 17. The scheduling server according to claim 12, wherein the obtaining, by the scheduling server, a target host machine from the at least one candidate host machine comprises:
determining, by the scheduling server, priority values each host machine of the at least one candidate host machine in respective dimensions; performing ranking, by the scheduling server, in descending order of the priority values in the dimensions, to generate a candidate host machine list; deducting, by the scheduling server, a resource requirement of the to-be-created VM from candidate host machines one by one according to rankings of the candidate host machines in the candidate host machine list, to obtain remaining resources of the candidate host machines, and submitting the remaining resources to the common resource information until the remaining resource of one candidate host machine of the candidate host machines is successfully submitted, the resource requirement being comprised in the VM information corresponding to the VM; and setting, by the scheduling server in a case that the remaining resource corresponding to one candidate host machine of the candidate host machines is successfully submitted, the candidate host machine on which submission succeeds to the target host machine. 18. A non-transitory computer readable storage medium storing a plurality of machine readable instructions in connection with a scheduling server having one or more processors, wherein the plurality of machine readable instructions, when executed by the one or more processors, cause the terminal to perform a plurality of operations including:
obtaining, by the scheduling server, virtual machine (VM) information corresponding to a to-be-created VM; obtaining, by the scheduling server, common resource information, the common resource information comprising host machine information corresponding to all host machines in a cloud computing system; updating, by the scheduling server, a preset resource information private copy according to the common resource information, the resource information private copy comprising host machine information corresponding to a preset host machine; obtaining, by the scheduling server according to the resource information private copy, at least one candidate host machine meeting the VM information; and obtaining, by the scheduling server, a target host machine from the at least one candidate host machine, and creating the VM on the target host machine. 19. The non-transitory computer readable storage medium according to claim 18, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
synchronizing, by the scheduling server, the resource information private copy with the common resource information. 20. The non-transitory computer readable storage medium according to claim 18, wherein the updating, by the scheduling server, a preset resource information private copy according to the common resource information comprises:
performing, by the scheduling server, screening to obtain target host machine information meeting the VM information from the common resource information, and adding the target host machine information to the preset resource information private copy.
| 3,700
|
338,085
| 16,799,723
| 3,724
|
A projection system and a projection method are provided. The projection system includes a processing module, a projection module and a photographing module. The projection module is coupled to the processing module, and projects a first projection image including a first asymmetric graph. The photographing module is coupled to the processing module, and captures at least a part of the first projection image based on a photographing range, so as to output a first photographed image including at least one second asymmetric graph. The processing module analyzes the first photographed image to determine whether the at least one second asymmetric graph is consistent with a geometric configuration of the first asymmetric graph. The processing module determines an effective photographing area according to one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph in the first photographed image.
|
1. A projection system, comprising:
a processing module; a projection module, coupled to the processing module, and configured to project a first projection image, wherein the first projection image comprises a first asymmetric graph; and a photographing module, coupled to the processing module, and configured to capture at least a part of the first projection image based on a photographing range, so as to output a first photographed image, wherein the first photographed image comprises at least one second asymmetric graph, wherein the processing module analyzes the first photographed image to determine whether the at least one second asymmetric graph is consistent with a geometric configuration of the first asymmetric graph, and the processing module determines an effective photographing area according to one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph in the first photographed image. 2. The projection system as claimed in claim 1, wherein the effective photographing area comprises one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph, and the effective photographing area does not comprise other second asymmetric graphs that are not consistent with the geometric configuration of the first asymmetric graph. 3. The projection system as claimed in claim 1, wherein the projection module projects a second projection image, and the photographing module captures at least a part of the second projection image based on the photographing range to output a second photographed image, wherein the processing module compares the first photographed image with the second photographed image to determine whether the projection module re-projects the first projection image. 4. The projection system as claimed in claim 3, wherein the second projection image is a blank projection image. 5. The projection system as claimed in claim 1, wherein the first asymmetric graph comprises three first positioning grid points, and the three first positioning grid points are arranged in a right triangle, and a plurality of distances between the three first positioning grid points are unequal distances. 6. The projection system as claimed in claim 5, wherein the processing module analyzes the three first positioning grid points in the first photographed image to obtain three first grid point coordinates, and the processing module deduces a plurality of predetermined grid point coordinates corresponding to a plurality of predetermined positioning grid points in a whole projection range one by one according to the three first grid point coordinates, wherein the processing module determines a projection result of the projection module in the projection range according to the plurality of predetermined grid point coordinates. 7. The projection system as claimed in claim 6, wherein the projection module projects a full grid point projection image, and the photographing module captures at least a part of the full grid point projection image base on the effective photographing area to output a full grid point photographed image,
wherein the processing module sequentially compares a plurality of second grid point coordinates of a plurality of second positioning grid points of the full grid point photographed image with the plurality of predetermined grid point coordinates, so as to determine whether to adjust the predetermined grid point coordinates. 8. The projection system as claimed in claim 6, further comprising:
another projection module, coupled to the processing module, and configured to project another first projection image, the another first projection image comprises another first asymmetric graph, wherein the photographing module captures at least a part of the another first projection image based on the photographing range, so as to output another first photographed image, wherein the another first photographed image comprises at least one another second asymmetric graph, wherein the processing module analyzes the another first photographed image to determine whether the at least one another second asymmetric graph is consistent with another geometric configuration of the another first asymmetric graph, and the processing module determines another effective photographing area according to one of the at least one another second asymmetric graph that is consistent with the another geometric configuration of the another first asymmetric graph in the another first photographed image. 9. The projection system as claimed in claim 8, wherein the another first asymmetric graph comprises three other first positioning grid points, and the processing module analyzes the three other first positioning grid points in the another first photographed image to obtain three other first grid point coordinates, and the processing module deduces a plurality of other predetermined grid point coordinates corresponding to a plurality of other predetermined positioning grid points in another whole projection range one by one according to the three other first grid point coordinates, wherein the processing module determines a projection result of the another projection module in the another projection range according to the plurality of other predetermined grid point coordinates. 10. The projection system as claimed in claim 9, wherein the processing module determines a spliced projection range of the projection module and the another projection module according to the plurality of predetermined grid point coordinates and the plurality of other predetermined grid point coordinates, and an area of the spliced projection range is smaller than or equal to a sum of areas of the projection range and the another projection range. 11. A projection method, comprising:
projecting a first projection image, wherein the projection image comprises a first asymmetric graph; capturing at least a part of the first projection image based on a photographing range, so as to output a first photographed image, wherein the first photographed image comprises at least one second asymmetric graph; analyzing the first photographed image to determine whether the at least one second asymmetric graph is consistent with a geometric configuration of the first asymmetric graph; and determining an effective photographing area according to one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph in the first photographed image. 12. The projection method as claimed in claim 11, wherein the effective photographing area comprises one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph, and the effective photographing area does not comprise other second asymmetric graphs that are not consistent with the geometric configuration of the first asymmetric graph. 13. The projection method as claimed in claim 11, further comprising:
projecting a second projection image; capturing at least a part of the second projection image based on the photographing range to output a second photographed image; and comparing the first photographed image with the second photographed image to determine whether to re-project the first projection image. 14. The projection method as claimed in claim 13, wherein the second projection image is a blank projection image. 15. The projection method as claimed in claim 11, wherein the first asymmetric graph comprises three first positioning grid points, and the three first positioning grid points are arranged in a right triangle, and a plurality of distances between the three first positioning grid points are unequal distances. 16. The projection method as claimed in claim 15, further comprising:
analyzing the three first positioning grid points in the first photographed image to obtain three first grid point coordinates, deducing a plurality of predetermined grid point coordinates corresponding to a plurality of predetermined positioning grid points in a whole projection range one by one according to the three first grid point coordinates; and determining a projection result in the projection range according to the plurality of predetermined grid point coordinates. 17. The projection method as claimed in claim 16, further comprising:
projecting a full grid point projection image; capturing at least a part of the full grid point projection image base on the effective photographing area to output a full grid point photographed image; and sequentially comparing a plurality of second grid point coordinates of a plurality of second positioning grid points of the full grid point photographed image with the plurality of predetermined grid point coordinates, so as to determine whether to adjust the predetermined grid point coordinates. 18. The projection method as claimed in claim 16, further comprising:
projecting another first projection image, wherein the another first projection image comprises another first asymmetric graph; capturing at least a part of the another first projection image based on the photographing range, so as to output another first photographed image, wherein the another first photographed image comprises at least one another second asymmetric graph; analyzing the another first photographed image to determine whether the at least one another second asymmetric graph is consistent with another geometric configuration of the another first asymmetric graph; and determining another effective photographing area according to one of the at least one another second asymmetric graph that is consistent with the another geometric configuration of the another first asymmetric graph in the another first photographed image. 19. The projection method as claimed in claim 18, further comprising:
analyzing three other first positioning grid points in the another first photographed image to obtain three other first grid point coordinates; deducing a plurality of other predetermined grid point coordinates corresponding to a plurality of other predetermined positioning grid points in another whole projection range one by one according to the three other first grid point coordinates; and determining a projection result in the another projection range according to the plurality of other predetermined grid point coordinates. 20. The projection method as claimed in claim 19, further comprising:
determining a spliced projection range according to the plurality of predetermined grid point coordinates and the plurality of other predetermined grid point coordinates, wherein an area of the spliced projection range is smaller than or equal to a sum of areas of the projection range and the another projection range.
|
A projection system and a projection method are provided. The projection system includes a processing module, a projection module and a photographing module. The projection module is coupled to the processing module, and projects a first projection image including a first asymmetric graph. The photographing module is coupled to the processing module, and captures at least a part of the first projection image based on a photographing range, so as to output a first photographed image including at least one second asymmetric graph. The processing module analyzes the first photographed image to determine whether the at least one second asymmetric graph is consistent with a geometric configuration of the first asymmetric graph. The processing module determines an effective photographing area according to one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph in the first photographed image.1. A projection system, comprising:
a processing module; a projection module, coupled to the processing module, and configured to project a first projection image, wherein the first projection image comprises a first asymmetric graph; and a photographing module, coupled to the processing module, and configured to capture at least a part of the first projection image based on a photographing range, so as to output a first photographed image, wherein the first photographed image comprises at least one second asymmetric graph, wherein the processing module analyzes the first photographed image to determine whether the at least one second asymmetric graph is consistent with a geometric configuration of the first asymmetric graph, and the processing module determines an effective photographing area according to one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph in the first photographed image. 2. The projection system as claimed in claim 1, wherein the effective photographing area comprises one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph, and the effective photographing area does not comprise other second asymmetric graphs that are not consistent with the geometric configuration of the first asymmetric graph. 3. The projection system as claimed in claim 1, wherein the projection module projects a second projection image, and the photographing module captures at least a part of the second projection image based on the photographing range to output a second photographed image, wherein the processing module compares the first photographed image with the second photographed image to determine whether the projection module re-projects the first projection image. 4. The projection system as claimed in claim 3, wherein the second projection image is a blank projection image. 5. The projection system as claimed in claim 1, wherein the first asymmetric graph comprises three first positioning grid points, and the three first positioning grid points are arranged in a right triangle, and a plurality of distances between the three first positioning grid points are unequal distances. 6. The projection system as claimed in claim 5, wherein the processing module analyzes the three first positioning grid points in the first photographed image to obtain three first grid point coordinates, and the processing module deduces a plurality of predetermined grid point coordinates corresponding to a plurality of predetermined positioning grid points in a whole projection range one by one according to the three first grid point coordinates, wherein the processing module determines a projection result of the projection module in the projection range according to the plurality of predetermined grid point coordinates. 7. The projection system as claimed in claim 6, wherein the projection module projects a full grid point projection image, and the photographing module captures at least a part of the full grid point projection image base on the effective photographing area to output a full grid point photographed image,
wherein the processing module sequentially compares a plurality of second grid point coordinates of a plurality of second positioning grid points of the full grid point photographed image with the plurality of predetermined grid point coordinates, so as to determine whether to adjust the predetermined grid point coordinates. 8. The projection system as claimed in claim 6, further comprising:
another projection module, coupled to the processing module, and configured to project another first projection image, the another first projection image comprises another first asymmetric graph, wherein the photographing module captures at least a part of the another first projection image based on the photographing range, so as to output another first photographed image, wherein the another first photographed image comprises at least one another second asymmetric graph, wherein the processing module analyzes the another first photographed image to determine whether the at least one another second asymmetric graph is consistent with another geometric configuration of the another first asymmetric graph, and the processing module determines another effective photographing area according to one of the at least one another second asymmetric graph that is consistent with the another geometric configuration of the another first asymmetric graph in the another first photographed image. 9. The projection system as claimed in claim 8, wherein the another first asymmetric graph comprises three other first positioning grid points, and the processing module analyzes the three other first positioning grid points in the another first photographed image to obtain three other first grid point coordinates, and the processing module deduces a plurality of other predetermined grid point coordinates corresponding to a plurality of other predetermined positioning grid points in another whole projection range one by one according to the three other first grid point coordinates, wherein the processing module determines a projection result of the another projection module in the another projection range according to the plurality of other predetermined grid point coordinates. 10. The projection system as claimed in claim 9, wherein the processing module determines a spliced projection range of the projection module and the another projection module according to the plurality of predetermined grid point coordinates and the plurality of other predetermined grid point coordinates, and an area of the spliced projection range is smaller than or equal to a sum of areas of the projection range and the another projection range. 11. A projection method, comprising:
projecting a first projection image, wherein the projection image comprises a first asymmetric graph; capturing at least a part of the first projection image based on a photographing range, so as to output a first photographed image, wherein the first photographed image comprises at least one second asymmetric graph; analyzing the first photographed image to determine whether the at least one second asymmetric graph is consistent with a geometric configuration of the first asymmetric graph; and determining an effective photographing area according to one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph in the first photographed image. 12. The projection method as claimed in claim 11, wherein the effective photographing area comprises one of the at least one second asymmetric graph that is consistent with the geometric configuration of the first asymmetric graph, and the effective photographing area does not comprise other second asymmetric graphs that are not consistent with the geometric configuration of the first asymmetric graph. 13. The projection method as claimed in claim 11, further comprising:
projecting a second projection image; capturing at least a part of the second projection image based on the photographing range to output a second photographed image; and comparing the first photographed image with the second photographed image to determine whether to re-project the first projection image. 14. The projection method as claimed in claim 13, wherein the second projection image is a blank projection image. 15. The projection method as claimed in claim 11, wherein the first asymmetric graph comprises three first positioning grid points, and the three first positioning grid points are arranged in a right triangle, and a plurality of distances between the three first positioning grid points are unequal distances. 16. The projection method as claimed in claim 15, further comprising:
analyzing the three first positioning grid points in the first photographed image to obtain three first grid point coordinates, deducing a plurality of predetermined grid point coordinates corresponding to a plurality of predetermined positioning grid points in a whole projection range one by one according to the three first grid point coordinates; and determining a projection result in the projection range according to the plurality of predetermined grid point coordinates. 17. The projection method as claimed in claim 16, further comprising:
projecting a full grid point projection image; capturing at least a part of the full grid point projection image base on the effective photographing area to output a full grid point photographed image; and sequentially comparing a plurality of second grid point coordinates of a plurality of second positioning grid points of the full grid point photographed image with the plurality of predetermined grid point coordinates, so as to determine whether to adjust the predetermined grid point coordinates. 18. The projection method as claimed in claim 16, further comprising:
projecting another first projection image, wherein the another first projection image comprises another first asymmetric graph; capturing at least a part of the another first projection image based on the photographing range, so as to output another first photographed image, wherein the another first photographed image comprises at least one another second asymmetric graph; analyzing the another first photographed image to determine whether the at least one another second asymmetric graph is consistent with another geometric configuration of the another first asymmetric graph; and determining another effective photographing area according to one of the at least one another second asymmetric graph that is consistent with the another geometric configuration of the another first asymmetric graph in the another first photographed image. 19. The projection method as claimed in claim 18, further comprising:
analyzing three other first positioning grid points in the another first photographed image to obtain three other first grid point coordinates; deducing a plurality of other predetermined grid point coordinates corresponding to a plurality of other predetermined positioning grid points in another whole projection range one by one according to the three other first grid point coordinates; and determining a projection result in the another projection range according to the plurality of other predetermined grid point coordinates. 20. The projection method as claimed in claim 19, further comprising:
determining a spliced projection range according to the plurality of predetermined grid point coordinates and the plurality of other predetermined grid point coordinates, wherein an area of the spliced projection range is smaller than or equal to a sum of areas of the projection range and the another projection range.
| 3,700
|
338,086
| 16,799,682
| 2,654
|
A metamaterial comprising, a plurality of acoustic vector field sensors, each configured to sense an acoustic vector field of a fluid within a fluid-filled space in response to fluid waves, and producing an electrical signal corresponding to the sensed acoustic vector field; a processor configured to perform a time and space transform on the electrical signal; and at least one phased array transducer, configured to emit fluid waves according to a produced acoustic vector field pattern dependent on a result of the time and space transform, a within a portion of the fluid.
|
1. A metamaterial, comprising:
a plurality of vector flow sensors, each configured to sense primary fluid waves within a first portion of a fluid; a phased array transducer, configured to emit secondary fluid waves within a second portion of the fluid; and an automated control, configured to:
receive an electrical signal responsive to the sensed primary fluid waves from the fluid vector flow sensors;
perform a time and space transform on the electrical signal with an automated transform processor to determine a pattern of the primary fluid waves; and
control the phased array transducer in accordance with a result of the time and space transform, to emit secondary fluid waves which interfere with the primary fluid waves. 2. The metamaterial according to claim 1, wherein the phased array transducer has an emission pattern which does not directly the secondary fluid waves toward the plurality of fluid vector flow sensors. 3. The metamaterial according to claim 1, wherein the phased array transducer has an emission pattern which emits the secondary fluid waves at least one of directly and indirectly sensed by at least one of plurality of fluid vector flow sensors. 4. The metamaterial according to claim 1, wherein the time and space transform causes a transfer function of an acoustic wave from the plurality of acoustic vector field sensors to the control signal to approximate a metamaterial transfer function. 5. The metamaterial according to claim 1, wherein each respective vector flow sensor comprises at least one fiber extending under tension between attachments, having a portion which is displaced due to the primary fluid waves, and a sensor configured to detect the displacement. 6. The metamaterial according to claim 1, wherein each respective vector flow sensor comprises at least three sensing fibers disposed along different axes, each fiber being displaceable due to the primary fluid waves, to thereby detect a three-dimensional vector of fluid flow. 7. The metamaterial according to claim 1, wherein the metamaterial comprises a core, and phased array transducer is controlled to counteract an effect of the core on the primary fluid waves. 8. The metamaterial according to claim 1, wherein:
the plurality of fluid vector flow sensors surround a core which interferes with propagation of the primary fluid waves across the core; and the phased array transducer is controlled to negate the interference of propagation of the primary fluid waves across the core. 9. The metamaterial according to claim 1, wherein at least one fluid vector flow sensor comprises a conductive fiber suspended in a magnetic field, producing an electromagnetically induced voltage corresponding to the primary fluid waves. 10. A metamaterial method, employing a plurality of vector flow sensors, each configured to sense a movement of fluid in response to primary fluid waves, comprising:
receiving an electrical signal responsive to the movement of the fluid from the fluid vector flow sensors; performing a time and space transform on the electrical signal with an automated transform processor to determine a pattern of fluid movement; and emitting secondary fluid waves within a portion of the fluid with a phased array transducer, responsive to a result of the time and space transform, to interfere with the primary fluid waves. 11. The metamaterial method according to claim 10, wherein the phased array transducer has an emission pattern, and the fluid vector flow sensors do not receive a direct emission from the phased array transducer. 12. The metamaterial method according to claim 10, wherein the phased array transducer has an emission pattern, and the fluid vector flow sensors receive a direct emission from the phased array transducer. 13. The metamaterial method according to claim 10, wherein:
the fluid vector flow sensors surround a core which interferes with fluid wave propagation in the fluid surrounding the core; the fluid vector flow sensors are arranged in an array around the core to sense at least an axis of propagation of the fluid waves; the phased array transducer is disposed on at least an opposite side of the core from the fluid vector flow sensors; and the phased array is driven to emulate a core which is transparent with respect to the fluid waves. 14. The metamaterial method according to claim 10, wherein at least one fluid vector flow sensor comprises a conductive fiber suspended in a magnetic field, further comprising producing an electromagnetically induced voltage corresponding to the primary fluid waves. 15. The metamaterial method according to claim 10, wherein the time and space transform causes a transfer function of an acoustic wave from the plurality of acoustic vector field sensors to the control signal to approximate a metamaterial transfer function. 16. The metamaterial method according to claim 10, wherein each respective vector flow sensor comprises at least one fiber extending between attachments, further comprising displacing a portion of the at least one fiber due to the primary fluid waves, and a detecting a displacement of the at least one fiber. 17. The metamaterial method according to claim 10, wherein each respective vector flow sensor comprises at least three sensing fibers disposed along different axes, further comprising displacing the at least three fibers due to the primary fluid waves, and detecting a three-dimensional vector of fluid flow based on the displacement. 18. The metamaterial method according to claim 10, wherein the phased array transducer is provided around a core, further comprising controlling the phased array transducer to reduce an interference of the core on the primary fluid waves. 19. The metamaterial method according to claim 10, wherein the plurality of fluid vector flow sensors each comprises a conductive fiber suspended in a magnetic field, producing an electromagnetically induced voltage corresponding to the primary fluid waves. 20. A computer readable medium containing non-transitory instructions for controlling an active metamaterial control system which receives inputs from a plurality of fluid vector flow sensors, comprising instructions to:
receive an electrical signal from the plurality fluid vector flow sensors responsive to a fluid vector flow; perform a time and space transform on the electrical signal; and emit fluid waves within a portion of the fluid with a phased array transducer, responsive to a result of the time and space transform.
|
A metamaterial comprising, a plurality of acoustic vector field sensors, each configured to sense an acoustic vector field of a fluid within a fluid-filled space in response to fluid waves, and producing an electrical signal corresponding to the sensed acoustic vector field; a processor configured to perform a time and space transform on the electrical signal; and at least one phased array transducer, configured to emit fluid waves according to a produced acoustic vector field pattern dependent on a result of the time and space transform, a within a portion of the fluid.1. A metamaterial, comprising:
a plurality of vector flow sensors, each configured to sense primary fluid waves within a first portion of a fluid; a phased array transducer, configured to emit secondary fluid waves within a second portion of the fluid; and an automated control, configured to:
receive an electrical signal responsive to the sensed primary fluid waves from the fluid vector flow sensors;
perform a time and space transform on the electrical signal with an automated transform processor to determine a pattern of the primary fluid waves; and
control the phased array transducer in accordance with a result of the time and space transform, to emit secondary fluid waves which interfere with the primary fluid waves. 2. The metamaterial according to claim 1, wherein the phased array transducer has an emission pattern which does not directly the secondary fluid waves toward the plurality of fluid vector flow sensors. 3. The metamaterial according to claim 1, wherein the phased array transducer has an emission pattern which emits the secondary fluid waves at least one of directly and indirectly sensed by at least one of plurality of fluid vector flow sensors. 4. The metamaterial according to claim 1, wherein the time and space transform causes a transfer function of an acoustic wave from the plurality of acoustic vector field sensors to the control signal to approximate a metamaterial transfer function. 5. The metamaterial according to claim 1, wherein each respective vector flow sensor comprises at least one fiber extending under tension between attachments, having a portion which is displaced due to the primary fluid waves, and a sensor configured to detect the displacement. 6. The metamaterial according to claim 1, wherein each respective vector flow sensor comprises at least three sensing fibers disposed along different axes, each fiber being displaceable due to the primary fluid waves, to thereby detect a three-dimensional vector of fluid flow. 7. The metamaterial according to claim 1, wherein the metamaterial comprises a core, and phased array transducer is controlled to counteract an effect of the core on the primary fluid waves. 8. The metamaterial according to claim 1, wherein:
the plurality of fluid vector flow sensors surround a core which interferes with propagation of the primary fluid waves across the core; and the phased array transducer is controlled to negate the interference of propagation of the primary fluid waves across the core. 9. The metamaterial according to claim 1, wherein at least one fluid vector flow sensor comprises a conductive fiber suspended in a magnetic field, producing an electromagnetically induced voltage corresponding to the primary fluid waves. 10. A metamaterial method, employing a plurality of vector flow sensors, each configured to sense a movement of fluid in response to primary fluid waves, comprising:
receiving an electrical signal responsive to the movement of the fluid from the fluid vector flow sensors; performing a time and space transform on the electrical signal with an automated transform processor to determine a pattern of fluid movement; and emitting secondary fluid waves within a portion of the fluid with a phased array transducer, responsive to a result of the time and space transform, to interfere with the primary fluid waves. 11. The metamaterial method according to claim 10, wherein the phased array transducer has an emission pattern, and the fluid vector flow sensors do not receive a direct emission from the phased array transducer. 12. The metamaterial method according to claim 10, wherein the phased array transducer has an emission pattern, and the fluid vector flow sensors receive a direct emission from the phased array transducer. 13. The metamaterial method according to claim 10, wherein:
the fluid vector flow sensors surround a core which interferes with fluid wave propagation in the fluid surrounding the core; the fluid vector flow sensors are arranged in an array around the core to sense at least an axis of propagation of the fluid waves; the phased array transducer is disposed on at least an opposite side of the core from the fluid vector flow sensors; and the phased array is driven to emulate a core which is transparent with respect to the fluid waves. 14. The metamaterial method according to claim 10, wherein at least one fluid vector flow sensor comprises a conductive fiber suspended in a magnetic field, further comprising producing an electromagnetically induced voltage corresponding to the primary fluid waves. 15. The metamaterial method according to claim 10, wherein the time and space transform causes a transfer function of an acoustic wave from the plurality of acoustic vector field sensors to the control signal to approximate a metamaterial transfer function. 16. The metamaterial method according to claim 10, wherein each respective vector flow sensor comprises at least one fiber extending between attachments, further comprising displacing a portion of the at least one fiber due to the primary fluid waves, and a detecting a displacement of the at least one fiber. 17. The metamaterial method according to claim 10, wherein each respective vector flow sensor comprises at least three sensing fibers disposed along different axes, further comprising displacing the at least three fibers due to the primary fluid waves, and detecting a three-dimensional vector of fluid flow based on the displacement. 18. The metamaterial method according to claim 10, wherein the phased array transducer is provided around a core, further comprising controlling the phased array transducer to reduce an interference of the core on the primary fluid waves. 19. The metamaterial method according to claim 10, wherein the plurality of fluid vector flow sensors each comprises a conductive fiber suspended in a magnetic field, producing an electromagnetically induced voltage corresponding to the primary fluid waves. 20. A computer readable medium containing non-transitory instructions for controlling an active metamaterial control system which receives inputs from a plurality of fluid vector flow sensors, comprising instructions to:
receive an electrical signal from the plurality fluid vector flow sensors responsive to a fluid vector flow; perform a time and space transform on the electrical signal; and emit fluid waves within a portion of the fluid with a phased array transducer, responsive to a result of the time and space transform.
| 2,600
|
338,087
| 16,799,696
| 2,654
|
The present disclosure relates to transmitting and receiving improved wake-up signals (WUS) between a base station and a user equipment (UE). The UE can receive a configuration for discontinuous reception (DRX) or extended DRX (eDRX). The UE can also determine whether to monitor for a WUS during a DRX WUS time resource or an eDRX WUS time resource. In some aspects, the UE can determine whether to monitor for the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and a paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. The base station can configure the UE for DRX or eDRX. The base station can also determine whether to transmit a WUS during a DRX WUS time resource or an eDRX WUS time resource.
|
1. A method of wireless communication at a User Equipment (UE), comprising:
receiving a configuration for a reception cycle; and determining whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 2. The method of claim 1, further comprising:
defining a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and monitoring for a WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 3. The method of claim 2, wherein a common WUS is configured to wake-up each of the one or more sub-group UEs monitoring a same WUS resource. 4. The method of claim 2, wherein a common WUS for each of the one or more sub-group UEs in a same WUS resource is configured to be a group WUS or a non-group specific WUS. 5. The method of claim 2, wherein the one or more sub-group UEs include a first set of sub-group UEs and a second set of sub-group UEs;
wherein the WUS for the first set of sub-group UEs in a first WUS resource comprises at least one of a non-group specific WUS, a first common WUS, or a first group WUS, wherein the WUS for the second set of sub-group UEs in a second WUS resource comprises at least one of a second common WUS or a second group WUS. 6. The method of claim 5, wherein the non-group specific WUS indicates for at least one UE without grouping capability to wake-up for the PO or for multiple UEs from different sub-groups within a first group to wake-up for the PO,
wherein the first common WUS indicates for more than one first sub-group UE to wake-up for the PO without indicating for a UE without grouping capability to wake-up, and wherein the first group WUS indicates for at least one UE from a single sub-group from the first group to wake-up for the PO. 7. The method of claim 5, wherein the second common WUS indicates for multiple UEs from different sub-groups in a second group to wake-up for the PO, and
wherein the second group WUS indicates for at least one UE from a second, single sub-group within the second group to wake-up for the PO. 8. The method of claim 5, wherein the first set of sub-group UEs are assigned a UE group identification based on a first weighting factor, and the second set of sub-group UEs are assigned a UE group identification based on a second weighting factor. 9. The method of claim 2, wherein an amount of one or more sub-group UEs in a same WUS resource is equal to an amount of one or more sub-group UEs in each of the WUS resources or independently configured per WUS resource. 10. The method of claim 9, wherein the amount of one or more sub-group UEs in each of the WUS resources is equal to 1, 2, 4, or 8. 11. The method of claim 2, wherein an amount of UE groups per WUS resource is the same or independently configured for WUS resources using a different time gap between the WUS resources and an associated paging occasion. 12. The method of claim 2, wherein at least one of an amount of UE groups per WUS resource or a WUS resource pattern is the same or independently configured for WUS resources with a time gap between the WUS resources and an associated paging occasion. 13. The method of claim 1, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the UE determines whether to monitor for the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 14. The method of claim 13, wherein a first DRX WUS time resource is configured for a group of UEs having a DRX configuration to monitor at least one of a group-specific DRX WUS or a non-group-specific DRX WUS, and
wherein a second DRX WUS time resource is configured for a second group of UEs with a second configuration of DRX to monitor at least one of the group-specific DRX WUS or the non-group-specific DRX WUS. 15. The method of claim 13, wherein a first eDRX WUS time resource is configured for a group of UEs having a first eDRX configuration to monitor at least one of a group-specific WUS or a non-group-specific WUS, and
wherein a second eDRX WUS time resource is configured for a second group of UEs having a second eDRX configuration to monitor at least one of the group-specific WUS or the non-group-specific WUS. 16. The method of claim 13, further comprising:
monitoring for the WUS during the eDRX WUS time resource if the DRX WUS time resource overlaps the eDRX WUS time resource. 17. The method of claim 16, further comprising:
monitoring for the WUS during the DRX WUS time resource if the DRX WUS time resource does not overlap the eDRX WUS time resource. 18. The method of claim 16, wherein the eDRX WUS time resource is configured for a DRX UE to monitor at least one of a group-specific WUS or a non-group-specific WUS. 19. The method of claim 18, wherein an additional eDRX WUS time resource is configured for the DRX UE to monitor the at least one of the group-specific WUS or non-group-specific WUS. 20. The method of claim 16, wherein two eDRX WUS time resources are configured for a group of DRX UEs, the method further comprising:
determining which of the two eDRX WUS time resources to monitor for the WUS. 21. The method of claim 20, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, the method further comprising:
receiving an indication from a base station that indicates a correspondence between the group of DRX UEs and an eDRX UE group, wherein the UE determines to monitor for the WUS during the first time resources or the second time resources based on the eDRX UE group with the correspondence to the group of DRX UEs. 22. The method of claim 20, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, and
wherein the UE determines to monitor for the WUS during a first time resource or a second time resources based on a predefined relationship between a DRX UE group of the UE and a corresponding eDRX UE group. 23. The method of claim 22, wherein the predefined relationship is based on a number of UE groups per eDRX WUS resource. 24. The method of claim 22, wherein the predefined relationship is based on at least one of a maximum duration of a WUS, the DRX time gap, or the eDRX time gap. 25. The method of claim 22, wherein the predefined relationship is based on a number of UEs, which is dependent on a configured weighting factor for at least one of a first eDRX UE group corresponding to the first time resource or a second eDRX UE group corresponding to the second time resource. 26. An apparatus for wireless communication at a User Equipment (UE), comprising
a memory; and at least one processor coupled to the memory and configured to:
receive a configuration for a reception cycle; and
determine whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle;
wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 27. The apparatus of claim 26, wherein the at least one processor is further configured to:
define a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and monitor for the WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 28. The apparatus of claim 26, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the UE determines whether to monitor for the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 29. An apparatus for wireless communication at a User Equipment (UE), comprising:
means for receiving a configuration for a reception cycle; and means for determining whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 30. A computer-readable medium storing computer executable code for wireless communication at a User Equipment (UE), the code when executed by a processor cause the processor to:
receive a configuration for a reception cycle; and determine whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 31. A method of wireless communication at a base station, comprising
configuring a User Equipment (UE) for a reception cycle; and determining whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the base station determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 32. The method of claim 31, further comprising:
transmitting a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and configuring a WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 33. The method of claim 32, wherein a common WUS is configured to wake-up each of the one or more sub-group UEs monitoring a same WUS resource. 34. The method of claim 32, wherein a common WUS for each of the one or more sub-group UEs in a same WUS resource is configured to be a group WUS or a non-group specific WUS. 35. The method of claim 32, wherein the one or more sub-group UEs include a first set of sub-group UEs and a second set of sub-group UEs;
wherein the WUS for the first set of sub-group UEs in a first WUS resource comprises at least one of a non-group specific WUS, a first common WUS, or a first group WUS, wherein the WUS for the second set of sub-group UEs in a second WUS resource comprises at least one of a second common WUS or a second group WUS. 36. The method of claim 35, wherein the non-group specific WUS indicates for at least one UE without grouping capability to wake-up for the PO or for multiple UEs from different sub-groups within a first group to wake-up for the PO,
wherein the first common WUS indicates for more than one first sub-group UE to wake-up for the PO without indicating for a UE without grouping capability to wake-up, and wherein the first group WUS indicates for at least one UE from a single sub-group from the first group to wake-up for the PO. 37. The method of claim 35, wherein the second common WUS indicates for multiple UEs from different sub-groups in a second group to wake-up for the PO, and
wherein the second group WUS indicates for at least one UE from a second, single sub-group within the second group to wake-up for the PO. 38. The method of claim 35, wherein the first set of sub-group UEs are assigned a UE group identification based on a first weighting factor, and the second set of sub-group UEs are assigned a UE group identification based on a second weighting factor. 39. The method of claim 32, wherein an amount of one or more sub-group UEs in a same WUS resource is equal to an amount of one or more sub-group UEs in each of the WUS resources or independently configured per WUS resource. 40. The method of claim 39, wherein the amount of one or more sub-group UEs in each of the WUS resources is equal to 1, 2, 4, or 8. 41. The method of claim 32, wherein an amount of UE groups per WUS resource is the same or independently configured for WUS resources using a different time gap between the WUS resources and an associated paging occasion. 42. The method of claim 32, wherein at least one of an amount of UE groups per WUS resource or a WUS resource pattern is the same or independently configured for WUS resources with a time gap between the WUS resources and an associated paging occasion. 43. The method of claim 31, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the base station determines whether to transmit the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 44. The method of claim 43, wherein the base station configures a first DRX WUS time resource for a group of UEs having a DRX configuration to monitor at least one of a group-specific DRX WUS or a non-group-specific DRX WUS, and
wherein the base station configures a second DRX WUS time resource for a second group of UEs with a second configuration of DRX to monitor at least one of the group-specific DRX WUS or the non-group-specific DRX WUS. 45. The method of claim 43, wherein the base station configures a first eDRX WUS time resource for a group of UEs having a first eDRX configuration to monitor at least one of a group-specific WUS or a non-group-specific WUS, and
wherein the base station configures a second eDRX WUS time resource for a second group of UEs having a second eDRX configuration to monitor at least one of the group-specific WUS or non-group-specific WUS. 46. The method of claim 43, further comprising:
transmitting the WUS during the eDRX WUS time resource if the DRX WUS time resource overlaps the eDRX WUS time resource. 47. The method of claim 46, further comprising:
transmitting the WUS during the DRX WUS time resource if the DRX WUS time resource does not overlap the eDRX WUS time resource. 48. The method of claim 46, wherein the base station configures the eDRX WUS time resource for a DRX UE to monitor at least one of a group-specific WUS or a non-group-specific WUS. 49. The method of claim 48, wherein the base station configures an additional eDRX WUS time resource for the DRX UE to monitor the at least one of the group-specific WUS or the non-group-specific WUS. 50. The method of claim 46, wherein the base station configures two eDRX WUS time resources for a group of DRX UEs, the method further comprising:
determining which of the two eDRX WUS time resources to use to transmit the WUS. 51. The method of claim 50, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, the method further comprising:
transmitting an indication to the UE that indicates a correspondence between the group of DRX UEs and an eDRX UE group, wherein the base station transmits the WUS during a first time resource or a second time resource based on the eDRX UE group with the correspondence to the group of DRX UEs. 52. The method of claim 50, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, and
wherein the base station transmits the WUS during a first time resource or a second time resources based on a predefined relationship between a DRX UE group of the UE and a corresponding eDRX UE group. 53. The method of claim 52, wherein the predefined relationship is based on a number of UE groups per eDRX WUS resource. 54. The method of claim 52, wherein the predefined relationship is based on at least one of a maximum duration of a WUS, the DRX time gap, or the eDRX time gap. 55. The method of claim 52, wherein the predefined relationship is based on a number of UEs, which is dependent on a configured weighting factor for at least one of a first eDRX UE group corresponding to the first time resource or a second eDRX UE group corresponding to the second time resource. 56. An apparatus for wireless communication at a base station, comprising
a memory; and at least one processor coupled to the memory and configured to:
configure a User Equipment (UE) for a reception cycle; and
determine whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle,
wherein the apparatus determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 57. The apparatus of claim 56, wherein the at least one processor is further configured to:
transmit a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and configure the WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 58. The apparatus of claim 56, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the apparatus determines whether to transmit the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 59. An apparatus for wireless communication at a base station, comprising:
means for configuring a User Equipment (UE) for a reception cycle; and means for determining whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle, wherein the apparatus determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 60. A computer-readable medium storing computer executable code for wireless communication at a base station, the code when executed by a processor cause the processor to:
configure a User Equipment (UE) for a reception cycle; and determine whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle, wherein the base station determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion.
|
The present disclosure relates to transmitting and receiving improved wake-up signals (WUS) between a base station and a user equipment (UE). The UE can receive a configuration for discontinuous reception (DRX) or extended DRX (eDRX). The UE can also determine whether to monitor for a WUS during a DRX WUS time resource or an eDRX WUS time resource. In some aspects, the UE can determine whether to monitor for the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and a paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. The base station can configure the UE for DRX or eDRX. The base station can also determine whether to transmit a WUS during a DRX WUS time resource or an eDRX WUS time resource.1. A method of wireless communication at a User Equipment (UE), comprising:
receiving a configuration for a reception cycle; and determining whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 2. The method of claim 1, further comprising:
defining a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and monitoring for a WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 3. The method of claim 2, wherein a common WUS is configured to wake-up each of the one or more sub-group UEs monitoring a same WUS resource. 4. The method of claim 2, wherein a common WUS for each of the one or more sub-group UEs in a same WUS resource is configured to be a group WUS or a non-group specific WUS. 5. The method of claim 2, wherein the one or more sub-group UEs include a first set of sub-group UEs and a second set of sub-group UEs;
wherein the WUS for the first set of sub-group UEs in a first WUS resource comprises at least one of a non-group specific WUS, a first common WUS, or a first group WUS, wherein the WUS for the second set of sub-group UEs in a second WUS resource comprises at least one of a second common WUS or a second group WUS. 6. The method of claim 5, wherein the non-group specific WUS indicates for at least one UE without grouping capability to wake-up for the PO or for multiple UEs from different sub-groups within a first group to wake-up for the PO,
wherein the first common WUS indicates for more than one first sub-group UE to wake-up for the PO without indicating for a UE without grouping capability to wake-up, and wherein the first group WUS indicates for at least one UE from a single sub-group from the first group to wake-up for the PO. 7. The method of claim 5, wherein the second common WUS indicates for multiple UEs from different sub-groups in a second group to wake-up for the PO, and
wherein the second group WUS indicates for at least one UE from a second, single sub-group within the second group to wake-up for the PO. 8. The method of claim 5, wherein the first set of sub-group UEs are assigned a UE group identification based on a first weighting factor, and the second set of sub-group UEs are assigned a UE group identification based on a second weighting factor. 9. The method of claim 2, wherein an amount of one or more sub-group UEs in a same WUS resource is equal to an amount of one or more sub-group UEs in each of the WUS resources or independently configured per WUS resource. 10. The method of claim 9, wherein the amount of one or more sub-group UEs in each of the WUS resources is equal to 1, 2, 4, or 8. 11. The method of claim 2, wherein an amount of UE groups per WUS resource is the same or independently configured for WUS resources using a different time gap between the WUS resources and an associated paging occasion. 12. The method of claim 2, wherein at least one of an amount of UE groups per WUS resource or a WUS resource pattern is the same or independently configured for WUS resources with a time gap between the WUS resources and an associated paging occasion. 13. The method of claim 1, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the UE determines whether to monitor for the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 14. The method of claim 13, wherein a first DRX WUS time resource is configured for a group of UEs having a DRX configuration to monitor at least one of a group-specific DRX WUS or a non-group-specific DRX WUS, and
wherein a second DRX WUS time resource is configured for a second group of UEs with a second configuration of DRX to monitor at least one of the group-specific DRX WUS or the non-group-specific DRX WUS. 15. The method of claim 13, wherein a first eDRX WUS time resource is configured for a group of UEs having a first eDRX configuration to monitor at least one of a group-specific WUS or a non-group-specific WUS, and
wherein a second eDRX WUS time resource is configured for a second group of UEs having a second eDRX configuration to monitor at least one of the group-specific WUS or the non-group-specific WUS. 16. The method of claim 13, further comprising:
monitoring for the WUS during the eDRX WUS time resource if the DRX WUS time resource overlaps the eDRX WUS time resource. 17. The method of claim 16, further comprising:
monitoring for the WUS during the DRX WUS time resource if the DRX WUS time resource does not overlap the eDRX WUS time resource. 18. The method of claim 16, wherein the eDRX WUS time resource is configured for a DRX UE to monitor at least one of a group-specific WUS or a non-group-specific WUS. 19. The method of claim 18, wherein an additional eDRX WUS time resource is configured for the DRX UE to monitor the at least one of the group-specific WUS or non-group-specific WUS. 20. The method of claim 16, wherein two eDRX WUS time resources are configured for a group of DRX UEs, the method further comprising:
determining which of the two eDRX WUS time resources to monitor for the WUS. 21. The method of claim 20, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, the method further comprising:
receiving an indication from a base station that indicates a correspondence between the group of DRX UEs and an eDRX UE group, wherein the UE determines to monitor for the WUS during the first time resources or the second time resources based on the eDRX UE group with the correspondence to the group of DRX UEs. 22. The method of claim 20, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, and
wherein the UE determines to monitor for the WUS during a first time resource or a second time resources based on a predefined relationship between a DRX UE group of the UE and a corresponding eDRX UE group. 23. The method of claim 22, wherein the predefined relationship is based on a number of UE groups per eDRX WUS resource. 24. The method of claim 22, wherein the predefined relationship is based on at least one of a maximum duration of a WUS, the DRX time gap, or the eDRX time gap. 25. The method of claim 22, wherein the predefined relationship is based on a number of UEs, which is dependent on a configured weighting factor for at least one of a first eDRX UE group corresponding to the first time resource or a second eDRX UE group corresponding to the second time resource. 26. An apparatus for wireless communication at a User Equipment (UE), comprising
a memory; and at least one processor coupled to the memory and configured to:
receive a configuration for a reception cycle; and
determine whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle;
wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 27. The apparatus of claim 26, wherein the at least one processor is further configured to:
define a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and monitor for the WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 28. The apparatus of claim 26, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the UE determines whether to monitor for the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 29. An apparatus for wireless communication at a User Equipment (UE), comprising:
means for receiving a configuration for a reception cycle; and means for determining whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 30. A computer-readable medium storing computer executable code for wireless communication at a User Equipment (UE), the code when executed by a processor cause the processor to:
receive a configuration for a reception cycle; and determine whether to monitor for a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the UE determines whether to monitor for the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 31. A method of wireless communication at a base station, comprising
configuring a User Equipment (UE) for a reception cycle; and determining whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle; wherein the base station determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 32. The method of claim 31, further comprising:
transmitting a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and configuring a WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 33. The method of claim 32, wherein a common WUS is configured to wake-up each of the one or more sub-group UEs monitoring a same WUS resource. 34. The method of claim 32, wherein a common WUS for each of the one or more sub-group UEs in a same WUS resource is configured to be a group WUS or a non-group specific WUS. 35. The method of claim 32, wherein the one or more sub-group UEs include a first set of sub-group UEs and a second set of sub-group UEs;
wherein the WUS for the first set of sub-group UEs in a first WUS resource comprises at least one of a non-group specific WUS, a first common WUS, or a first group WUS, wherein the WUS for the second set of sub-group UEs in a second WUS resource comprises at least one of a second common WUS or a second group WUS. 36. The method of claim 35, wherein the non-group specific WUS indicates for at least one UE without grouping capability to wake-up for the PO or for multiple UEs from different sub-groups within a first group to wake-up for the PO,
wherein the first common WUS indicates for more than one first sub-group UE to wake-up for the PO without indicating for a UE without grouping capability to wake-up, and wherein the first group WUS indicates for at least one UE from a single sub-group from the first group to wake-up for the PO. 37. The method of claim 35, wherein the second common WUS indicates for multiple UEs from different sub-groups in a second group to wake-up for the PO, and
wherein the second group WUS indicates for at least one UE from a second, single sub-group within the second group to wake-up for the PO. 38. The method of claim 35, wherein the first set of sub-group UEs are assigned a UE group identification based on a first weighting factor, and the second set of sub-group UEs are assigned a UE group identification based on a second weighting factor. 39. The method of claim 32, wherein an amount of one or more sub-group UEs in a same WUS resource is equal to an amount of one or more sub-group UEs in each of the WUS resources or independently configured per WUS resource. 40. The method of claim 39, wherein the amount of one or more sub-group UEs in each of the WUS resources is equal to 1, 2, 4, or 8. 41. The method of claim 32, wherein an amount of UE groups per WUS resource is the same or independently configured for WUS resources using a different time gap between the WUS resources and an associated paging occasion. 42. The method of claim 32, wherein at least one of an amount of UE groups per WUS resource or a WUS resource pattern is the same or independently configured for WUS resources with a time gap between the WUS resources and an associated paging occasion. 43. The method of claim 31, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the base station determines whether to transmit the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 44. The method of claim 43, wherein the base station configures a first DRX WUS time resource for a group of UEs having a DRX configuration to monitor at least one of a group-specific DRX WUS or a non-group-specific DRX WUS, and
wherein the base station configures a second DRX WUS time resource for a second group of UEs with a second configuration of DRX to monitor at least one of the group-specific DRX WUS or the non-group-specific DRX WUS. 45. The method of claim 43, wherein the base station configures a first eDRX WUS time resource for a group of UEs having a first eDRX configuration to monitor at least one of a group-specific WUS or a non-group-specific WUS, and
wherein the base station configures a second eDRX WUS time resource for a second group of UEs having a second eDRX configuration to monitor at least one of the group-specific WUS or non-group-specific WUS. 46. The method of claim 43, further comprising:
transmitting the WUS during the eDRX WUS time resource if the DRX WUS time resource overlaps the eDRX WUS time resource. 47. The method of claim 46, further comprising:
transmitting the WUS during the DRX WUS time resource if the DRX WUS time resource does not overlap the eDRX WUS time resource. 48. The method of claim 46, wherein the base station configures the eDRX WUS time resource for a DRX UE to monitor at least one of a group-specific WUS or a non-group-specific WUS. 49. The method of claim 48, wherein the base station configures an additional eDRX WUS time resource for the DRX UE to monitor the at least one of the group-specific WUS or the non-group-specific WUS. 50. The method of claim 46, wherein the base station configures two eDRX WUS time resources for a group of DRX UEs, the method further comprising:
determining which of the two eDRX WUS time resources to use to transmit the WUS. 51. The method of claim 50, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, the method further comprising:
transmitting an indication to the UE that indicates a correspondence between the group of DRX UEs and an eDRX UE group, wherein the base station transmits the WUS during a first time resource or a second time resource based on the eDRX UE group with the correspondence to the group of DRX UEs. 52. The method of claim 50, wherein the UE belongs to the group of DRX UEs having a configured DRX time resource that overlaps in time with the eDRX WUS time resource, and
wherein the base station transmits the WUS during a first time resource or a second time resources based on a predefined relationship between a DRX UE group of the UE and a corresponding eDRX UE group. 53. The method of claim 52, wherein the predefined relationship is based on a number of UE groups per eDRX WUS resource. 54. The method of claim 52, wherein the predefined relationship is based on at least one of a maximum duration of a WUS, the DRX time gap, or the eDRX time gap. 55. The method of claim 52, wherein the predefined relationship is based on a number of UEs, which is dependent on a configured weighting factor for at least one of a first eDRX UE group corresponding to the first time resource or a second eDRX UE group corresponding to the second time resource. 56. An apparatus for wireless communication at a base station, comprising
a memory; and at least one processor coupled to the memory and configured to:
configure a User Equipment (UE) for a reception cycle; and
determine whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle,
wherein the apparatus determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 57. The apparatus of claim 56, wherein the at least one processor is further configured to:
transmit a UE group identification assigned to one or more sub-group UEs in a UE group, wherein the one or more sub-group UEs include the UE; and configure the WUS for the UE group for the one or more sub-group UEs assigned to the UE group to wake-up for the paging occasion. 58. The apparatus of claim 56, wherein the reception cycle is at least one of a discontinuous reception (DRX) cycle or an extended DRX (eDRX) cycle;
wherein the WUS time resource is at least one of a DRX WUS time resource or an eDRX WUS time resource; wherein the apparatus determines whether to transmit the WUS during the DRX WUS time resource or the eDRX WUS time resource based on a duration of a DRX time gap between DRX WUS resources and the paging occasion and an eDRX time gap between eDRX WUS resources and the paging occasion. 59. An apparatus for wireless communication at a base station, comprising:
means for configuring a User Equipment (UE) for a reception cycle; and means for determining whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle, wherein the apparatus determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion. 60. A computer-readable medium storing computer executable code for wireless communication at a base station, the code when executed by a processor cause the processor to:
configure a User Equipment (UE) for a reception cycle; and determine whether to transmit a wake up signal (WUS) during a WUS time resource of the reception cycle, wherein the base station determines whether to transmit the WUS during the WUS time resource based on a duration of a time gap between WUS resources and a paging occasion.
| 2,600
|
338,088
| 16,799,716
| 2,654
|
Various techniques include detecting noise in a network, identifying the type of noise in the network, localizing noise in the network, determining noise scores for network devices, and/or determining likelihoods that particular devices are causing noise and/or are in proximity of a point of entry of noise into the network.
|
1. A method for noise analysis in a network, comprising:
determining, for a first plurality of devices on the network, upstream SNR values for a plurality of upstream channels; identifying a noisy upstream channel based on whether channels of the plurality of upstream channels meet a noisy channel criteria; and identifying a plurality of suspect devices based on respective devices of the plurality of devices meeting a set of one or more suspect criteria, wherein the plurality of suspect devices is less than the first plurality of devices, and wherein the set of one or more suspect criteria includes a channel criterion that is met for a respective device when the respective device has communicated on the noisy upstream channel. 2. The method of claim 1, wherein the set of one or more suspect criteria includes a pre-equalizer criterion that is met for the respective device based on a pre-equalizer coefficient of the respective device. 3. The method of any of claims 1-2, wherein the set of one or more suspect criteria includes an upstream transmit power level criterion that is met for the respective device when a determined upstream transmit power level value for the respective device exceeds an upstream transmit power level threshold. 4. The method of any of claims 1-3, wherein the set of one or more suspect criteria includes an upstream transmit power level standard deviation criterion that is met for the respective device when a determined upstream transmit power level standard deviation value for the respective device exceeds an upstream transmit power level standard deviation threshold. 5. The method of any of claims 1-4, wherein the set of one or more suspect criteria includes an NMTER (non-main tap energy to total tap energy ratio) criterion that is met for the respective device when a determined NMTER value for the respective device exceeds an NMTER threshold. 6. The method of any of claims 1-5, wherein the set of one or more suspect criteria includes an NMTER (non-main tap energy to total tap energy ratio) standard deviation criterion that is met for the respective device when a determined NMTER standard deviation value for the respective device exceeds an NMTER standard deviation threshold. 7. The method of any of claims 1-6, wherein the set of one or more suspect criteria includes a power level-to-NMTER (non-main tap energy to total tap energy ratio) correlation criterion that is met for the respective device when a determined power level-to-NMTER correlation value for the respective device exceeds a power level-to-NMTER correlation threshold. 8. The method of any of claims 1-7, wherein the set of one or more suspect criteria includes an NMITE criterion that is met for the respective device when a determined NMITE value for the respective device exceeds an NMITE threshold. 9. The method of any of claims 1-8, wherein the set of one or more suspect criteria includes an SNR (signal-to-noise ratio) criterion that is met for the respective device when a determined SNR value for the respective device does not exceed an SNR threshold. 10. The method of any of claims 1-9, wherein the set of one or more suspect criteria includes an SNR (signal-to-noise ratio) standard deviation criterion that is met for the respective device when a determined SNR standard deviation value for the respective device exceeds an SNR standard deviation threshold. 11. The method of any of claims 1-10, wherein the set of one or more suspect criteria includes a CER (codeword error rate) criterion that is met for the respective device when a determined CER value for the respective device exceeds a CER threshold. 12. The method of any of claims 1-11, further comprising:
determining whether the quantity of devices of the plurality of suspect devices meets a quantity metric; in accordance with a determination that the quantity of devices of the plurality of suspect devices does not meet the quantity metric:
adjusting one or more of:
the upstream transmit power level threshold,
the upstream transmit power level standard deviation threshold,
the NMTER threshold,
the NMTER standard deviation threshold,
the NMITE threshold,
SNR threshold,
SNR standard deviation threshold, and
CER threshold; and
subsequent to the adjusting, updating the identified plurality of suspect devices based on respective devices of the plurality of devices meeting the set of one or more suspect criteria with at least one adjusted threshold value. 13. The method of any of claims 1-12, further comprising:
determining noise scores for the plurality of suspect devices, the noise scores indicating the likelihood of the devices causing noise above a noise threshold and/or the likelihood of the devices being in proximity of a point of entry of noise into the network; and providing the noise scores. 14. The method of claim 13, wherein determining noise scores for the plurality of suspect devices includes:
assigning weights to a plurality of network parameters for the plurality of suspect devices; and calculating weight-adjusted noise scores for the plurality of suspect devices, the weight-adjusted noise scores indicating the likelihood of the devices causing noise above a noise threshold and/or the likelihood of the devices being in proximity of a point of entry of noise into the network. 15. The method of claim 13, wherein determining noise scores for the plurality of suspect devices includes:
providing a plurality of network parameters for the plurality of suspect devices to a logistic regression model to calculate the noise scores for the plurality of devices. 16. The method of claim 13, wherein determining noise scores for the plurality of suspect devices includes:
providing a plurality of network parameters for the plurality of suspect devices to a neural network machine learning model to calculate the noise scores for the plurality of devices. 17. The method of any of claims 14-16, wherein the plurality of network parameters are selected from among: (a) Codeword Error Rate, (b) Micro Reflection Level, (c) CM Pre-Equalized Frequency Response, (d) CMTS CM Equalized Frequency Response, (e) Main Tap Ratio, (f) Non Main Tap Energy to Total Tap Energy Ratio, (g) Power Level, (h) Power Level to MTR Ratio, (i) Power Level to NMTER Ratio, (j) Power Level to TTE Total Tap Energy Ratio, (k) TTE Total Tap Energy, (l) Non Main Individual Tap Energy, (m) Signal to Noise Ratio, (n) SNR spike level above certain threshold over time, and (o) SNR spike count above certain threshold over time for a period of time. 18. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device (with an optional display), the one or more programs including instructions for performing the method of any of claims 1-17. 19. An electronic device, comprising:
(an optional display); one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 1-17. 20. A computer-readable storage medium storing one or more programs for noise analysis in a network, the one or more programs configured to be executed by one or more processors of an electronic device, and the one or more programs including instructions for:
determining, for a first plurality of devices on the network, upstream SNR values for a plurality of upstream channels; identifying a noisy upstream channel based on whether channels of the plurality of upstream channels meet a noisy channel criteria; and identifying a plurality of suspect devices based on respective devices of the plurality of devices meeting a set of one or more suspect criteria, wherein the plurality of suspect devices is less than the first plurality of devices, and wherein the set of one or more suspect criteria includes a channel criterion that is met for a respective device when the respective device has communicated on the noisy upstream channel. 21. An electronic device, comprising:
one or more processors; and memory storing one or more programs for noise analysis in a network, the one or more programs configured to be executed by the one or more processors, and the one or more programs including instructions for:
determining, for a first plurality of devices on the network, upstream SNR values for a plurality of upstream channels;
identifying a noisy upstream channel based on whether channels of the plurality of upstream channels meet a noisy channel criteria; and
identifying a plurality of suspect devices based on respective devices of the plurality of devices meeting a set of one or more suspect criteria, wherein the plurality of suspect devices is less than the first plurality of devices, and wherein the set of one or more suspect criteria includes a channel criterion that is met for a respective device when the respective device has communicated on the noisy upstream channel. 22. A method for noise localization in a network, comprising:
identifying one or more channels that are affected by upstream noise on the network; identifying a plurality of devices on the network that are attached to the one or more channels that are affected by upstream noise; displaying a map; subsequent to identifying the one or more channels that are affected by upstream noise:
determining, for at least two devices of the plurality of devices that are attached to the one or more channels, respective noise scores; and
subsequent to determining the respective noise scores, displaying, on the map, visual indications of the at least two devices of the plurality of devices that are attached to the one or more channels, wherein:
in accordance with a determination that the determined noise score of a respective device is within a first noise score range, the visual indication of the respective device has a first characteristic without having a second characteristic; and
in accordance with a determination that the determined noise score of the respective device is within a second noise score range, the visual indication of the respective device has the second characteristic without having the first characteristic. 23. The method of claim 22, wherein determining respective noise scores includes determining respective downstream noise scores for the respective devices. 24. The method of any of claims 22-23, wherein determining respective noise scores includes determining respective upstream noise scores for the respective devices. 25. The method of any of claims 22-24, wherein determining respective noise scores includes accessing SNR values for the respective devices. 26. The method of any of claims 22-25, wherein determining respective noise scores includes using a Noise Spectral Density for the respective devices. 27. The method of any of claims 22-26, wherein determining respective noise scores includes using a full band spectrum for the respective devices. 28. The method of any of claims 22-27, further comprising:
identifying a first area as including a first noise source. 29. The method of any of claims 22-28:
wherein the at least two respective devices are at least three respective devices of the plurality of devices that are attached to the one or more channels; and wherein displaying, on the map, visual indications of the at least two respective devices of the plurality of devices that are attached to the one or more channels includes:
in accordance with a determination that the determined noise score of the respective device is within a third noise score range, the visual indication of the respective device has a third characteristic without having the first characteristics and without having the second characteristic. 30. The method of any of claims 22-29, further comprising:
identifying a second area as including a second noise source. 31. The method of any of claims 22-30, wherein the visual indications of the respective devices of the plurality of devices that are attached to the one or more channels are based on values according to the proximity of the respective devices to a source noise. 32. The method of any of claims 22-31, further comprising:
determining, for at least the two devices of the plurality of devices that are attached to the one or more channels, respective noise scores for a plurality of times; and storing the respective noise scores for the plurality of times. 33. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device with a display, the one or more programs including instructions for performing the method of any of claims 22-32. 34. An electronic device, comprising:
a display; one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 22-32. 35. A computer-readable storage medium storing one or more programs for noise localization in a network, the one or more programs configured to be executed by one or more processors of an electronic device with a display, and the one or more programs including instructions for:
identifying one or more channels that are affected by upstream noise on the network; identifying a plurality of devices on the network that are attached to the one or more channels that are affected by upstream noise; displaying a map; subsequent to identifying the one or more channels that are affected by upstream noise:
determining, for at least two devices of the plurality of devices that are attached to the one or more channels, respective noise scores; and
subsequent to determining the respective noise scores, displaying, on the map, visual indications of the at least two devices of the plurality of devices that are attached to the one or more channels, wherein:
in accordance with a determination that the determined noise score of a respective device is within a first noise score range, the visual indication of the respective device has a first characteristic without having a second characteristic; and
in accordance with a determination that the determined noise score of the respective device is within a second noise score range, the visual indication of the respective device has the second characteristic without having the first characteristic. 36. An electronic device, comprising:
a display; one or more processors; and memory storing one or more programs for noise localization in a network, the one or more programs configured to be executed by the one or more processors, and the one or more programs including instructions for:
identifying one or more channels that are affected by upstream noise on the network;
identifying a plurality of devices on the network that are attached to the one or more channels that are affected by upstream noise;
displaying a map;
subsequent to identifying the one or more channels that are affected by upstream noise:
determining, for at least two devices of the plurality of devices that are attached to the one or more channels, respective noise scores; and
subsequent to determining the respective noise scores, displaying, on the map, visual indications of the at least two devices of the plurality of devices that are attached to the one or more channels, wherein:
in accordance with a determination that the determined noise score of a respective device is within a first noise score range, the visual indication of the respective device has a first characteristic without having a second characteristic; and
in accordance with a determination that the determined noise score of the respective device is within a second noise score range, the visual indication of the respective device has the second characteristic without having the first characteristic. 37. A method for analyzing a network, comprising:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices
while displaying the graphical representation of the network quality metric for the signal, receiving input selecting a first time that is within the first duration of time; and in response to receiving the input selecting the first time, updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on a respective noise score for the corresponding network devices at the selected first time. 38. The method of claim 37, wherein the respective noise score for a network device is determined based on a plurality of network parameters, the plurality of network parameters including a first network parameter obtained directly from the network device and a second network parameter obtained by analyzing variations in a network parameter of the network device over time. 39. The method of any of claims 37-38, wherein the respective noise score for a network device is determined based on a plurality of network parameters, the plurality of network parameters including a first network parameter obtained directly from the network device and a third network parameter obtained by analyzing variations in a network parameter of the network device over multiple channel frequencies. 40. The method of any of claims 37-39, wherein the respective noise score for a network device is determined based on a plurality of network parameters, the plurality of network parameters including a first network parameter obtained directly from the network device and a fourth network parameter obtained by analyzing a dependency or correlation between at least two network parameters of the network device. 41. The method of any of claims 37-40, wherein updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on the noise score for the corresponding network devices at the selected first time comprises:
determining a respective noise score for each of the plurality of network devices for the selected first time; determining whether the respective noise score for each respective network devices of the plurality of network devices meets a noise score criteria; updating the map of the area such that:
respective network devices of the plurality of network devices that meet the device noise score criteria are displayed using a first visual appearance, and
respective network devices of the plurality of network devices that do not meet the noise score criteria are displayed using a second visual appearance different from the first visual appearance. 42. The method of any of claims 37-41, wherein updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices includes changing the visual characteristic of at least some network devices and maintaining the visual characteristic of at least some network devices. 43. The method of any of claims 37-42, further comprising:
receiving selection of a network device of the plurality of network devices; and in response to receiving selection of the network device, concurrently displaying two or more of:
a MAC address of the network device,
a street address of the network device, and
an account number of the network device. 44. The method of any of claims 37-43, further comprising:
displaying, concurrently with the graphical representation of a network quality metric graphed against time for a signals, second graphical representation of the network quality metric graphed against a second duration of time, wherein the second duration of time includes the first duration of time, and wherein the second duration of time is longer than the first duration of time. 45. The method of any of claims 37-4, further comprising:
displaying, concurrently with the graphical representation of the network quality metric for the signal, a graphical representation of the network quality metric graphed against the first duration of time for a second signal. 46. The method of claim 45, wherein:
the graphical representation of the network quality metric for the signal is in a first color; and the graphical representation of the network quality metric for the second signal is in a second color, the second color being different from the first color. 47. The method of any of claims 37-46, further comprising:
while displaying the graphical representation of the network quality metric for the signal and the map of the area, receiving input selecting a second time that is within the first duration of time; and in response to receiving the input selecting the second time, displaying a second map of the area, concurrently with the first map of the area, that includes at least some of the displayed plurality of network devices with a visual characteristic based on the respective noise score for the corresponding network devices at the selected second time. 48. The method of any of claims 37-47, wherein a respective noise score for a respective network device is calculated based on a make of the network device. 49. The method of any of claims 37-48, further comprising:
determining a respective noise score for a respective network device for a time includes:
determining a noise score type that is currently selected;
in accordance with a determination that a first noise score type is currently selected:
using, based on the first noise score type, a first set of network parameters for the respective network device for the time to calculate the respective noise score;
in accordance with a determination that a second noise score type is currently selected:
using, based on the second noise score type, a second set of network parameters for the respective network device for the time to calculate the respective noise score. 50. The method of claim 49, further comprising:
subsequent to determining the respective noise score types for the respective devices and subsequent to updating the map of the area to change the visual characteristic of at least some of the displayed plurality of network devices based on the respective noise score for the corresponding network devices at the selected first time, receiving input to change the noise score type; and in response to receiving input to change the noise score type, updating the map of the area to change the visual characteristic of at least some of the displayed plurality of network devices based on the updated respective noise score for the corresponding network devices at the selected time. 51. A computer-readable storage medium comprising one or more programs configured to be executed by an electronic device with one or more processors (and optionally a display), the one or more programs including instructions for performing the method of any of claims 37-50. 52. An electronic device, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 37-50. 53. An electronic device, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signal, receiving input selecting a first time that is within the first duration of time; and
in response to receiving the input selecting the first time, updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on a respective noise score for the corresponding network devices at the selected first time. 54. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signal, receiving input selecting a first time that is within the first duration of time; and
in response to receiving the input selecting the first time, updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on a respective noise score for the corresponding network devices at the selected first time. 55. A method for analyzing a network, comprising:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signals, receiving first input selecting a first time that is within the first duration of time; and in response to receiving the first input, displaying a first visual indicator corresponding to the first time in the graphical representation of the network quality metric; while displaying the graphical representation of the network quality metric for the signals, receiving second input selecting a second time, different from the first time, that is within the first duration of time; in response to receiving the second input, displaying a second visual indicator corresponding to the second time in the graphical representation of the network quality metric; and subsequent to receiving the first input and the second input:
determining a change in a noise score for each of the plurality of network devices between the first time and the second time;
determining whether the respective change in the noise score for each respective network device of the plurality of network devices meets a noise score change criteria;
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that meet the noise score change criteria are displayed using a first visual appearance. 56. The method of claim 55, further comprising:
subsequent to receiving the first input and the second input:
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that do not meet the noise score change criteria are displayed using a second visual appearance different from the first visual appearance. 57. The method of any of claims 55-56, further comprising:
subsequent to receiving the first input and the second input:
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that do not meet the noise score change criteria are not displayed. 58. The method of any of claims 55-57,
wherein the noise score change criteria is met for a respective network device when a change in the noise score of the network device between the first time and the second time exceeds a threshold change value; and wherein the threshold change value is provided by user input. 59. The method of any of claims 55-58,
wherein the noise score change criteria is met for a respective network device when the respective network device is categorized has having an amount of change in the noise score of the network device between the first time and the second time that falls within a top number of network devices; and wherein the threshold change value is provided by user input. 60. The method of any of claims 55-59, wherein the visual appearance of respective network devices of the plurality of network devices are displayed using a variable value, wherein the variable value is based on a magnitude of the change in the noise score of the network device between the first time and the second time. 61. The method of any of claims 55-60, further comprising:
receiving selection of a network device of the plurality of network devices; and in response to receiving selection of the network devices, concurrently displaying two or more of:
a MAC address of the network device,
a street address of the network device, and
an account number of the network device. 62. The method of any of claims 55-61, further comprising:
displaying, concurrently with the graphical representation of the network quality metric graphed against time for the signal, second graphical representation of the network quality metric graphed against a second duration of time, wherein the second duration of time includes the first duration of time, and wherein the second duration of time is longer than the first duration of time. 63. The method of any of claims 55-62, further comprising:
displaying, concurrently with the graphical representation of the network quality metric for the signal, a graphical representation of the network quality metric graphed against the first duration of time for a second signal. 64. The method of claim 63, wherein:
the graphical representation of the network quality metric for the signal is in a first color; and the graphical representation of the network quality metric for the second signal is in a second color, the second color being different from the first color. 65. The method of any of claims 55-64, wherein a respective noise score for a respective network device is calculated based on a make of the network device. 66. The method of any of claims 55-65, further comprising:
determining a respective noise score for a respective network device for a time includes:
determining a noise score type that is currently selected;
in accordance with a determination that a first noise score type is currently selected:
using, based on the first noise score type, a first set of network parameters for the respective network device for the time to calculate the respective noise score;
in accordance with a determination that a second noise score type is currently selected:
using, based on the second noise score type, a second set of network parameters for the respective network device for the time to calculate the respective noise score. 67. The method of claim 66, further comprising:
subsequent to displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area, receiving input to change the noise score type; and in response to receiving input to change the noise score type:
determining updated respective noise scores for respective network devices for the first time and the second time; and
determining whether a respective change in the noise score for each respective network device of the plurality of network devices meets the noise score change criteria;
updating, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area to change the visual characteristic of at least some of the displayed plurality of network devices. 68. A (optionally non-transitory) computer-readable storage medium comprising one or more programs configured to be executed by an electronic device with one or more processors (and optionally a display), the one or more programs including instructions for performing the method of any of claims 55-67. 69. An electronic device, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 55-67. 70. A device for analyzing a network, comprising:
one or more processors; memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signals, receiving first input selecting a first time that is within the first duration of time; and
in response to receiving the first input, displaying a first visual indicator corresponding to the first time in the graphical representation of the network quality metric;
while displaying the graphical representation of the network quality metric for the signals, receiving second input selecting a second time, different from the first time, that is within the first duration of time; and
in response to receiving the second input, displaying a second visual indicator corresponding to the second time in the graphical representation of the network quality metric;
subsequent to receiving the first input and the second input:
determining a change in a noise score for each of the plurality of network devices between the first time and the second time;
determining whether the respective change in the noise score for each respective network device of the plurality of network devices meets a noise score change criteria;
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that meet the noise score change criteria are displayed using a first visual appearance. 71. A (optionally non-transitory) computer-readable storage medium storing one or more programs for analyzing a network, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signals, receiving first input selecting a first time that is within the first duration of time; and in response to receiving the first input, displaying a first visual indicator corresponding to the first time in the graphical representation of the network quality metric; while displaying the graphical representation of the network quality metric for the signals, receiving second input selecting a second time, different from the first time, that is within the first duration of time; and in response to receiving the second input, displaying a second visual indicator corresponding to the second time in the graphical representation of the network quality metric; subsequent to receiving the first input and the second input:
determining a change in a noise score for each of the plurality of network devices between the first time and the second time;
determining whether the respective change in the noise score for each respective network device of the plurality of network devices meets a noise score change criteria;
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that meet the noise score change criteria are displayed using a first visual appearance. 72. A method for analyzing a network, comprising:
determining a first time at which a first type of network impairment s negatively affecting the network; determining a second time at which the first type of network impairment is not negatively affecting the network or is negatively affecting the network less than at the first time; calculating, for each of a plurality of network devices of the network:
a first noise score for the first time using a first calculation;
a second noise score for the first time using a second calculation different from the first calculation;
a third noise score for the second time using the first calculation; and
a fourth noise score for the second time using the second calculation;
determining, for each of the plurality of network devices:
a first difference score by calculating a difference between the first noise score and the third noise score for the respective network device; and
a second difference score by calculating a difference between the second noise score and the fourth noise score for the respective network device;
identifying the first calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have first difference scores that exceed a threshold difference; and identifying the second calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have second difference scores that exceed the threshold difference. 73. A device for analyzing a network, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
determining a first time at which a first type of network impairment is negatively affecting the network;
determining a second time at which the first type of network impairment is not negatively affecting the network or is negatively affecting the network less than at the first time;
calculating, for each of a plurality of network devices of the network:
a first noise score for the first time using a first calculation;
a second noise score for the first time using a second calculation different from the first calculation;
a third noise score for the second time using the first calculation; and
a fourth noise score for the second time using the second calculation;
determining, for each of the plurality of network devices:
a first difference score by calculating a difference between the first noise score and the third noise score for the respective network device; and
a second difference score by calculating a difference between the second noise score and the fourth noise score for the respective network device;
identifying the first calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have first difference scores that exceed a threshold difference; and
identifying the second calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have second difference scores that exceed the threshold difference. 74. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of a device, the one or more programs including instructions for:
determining a first time at which a first type of network impairment is negatively affecting the network; determining a second time at which the first type of network impairment is not negatively affecting the network or is negatively affecting the network less than at the first time; calculating, for each of a plurality of network devices of the network:
a first noise score for the first time using a first calculation;
a second noise score for the first time using a second calculation different from the first calculation;
a third noise score for the second time using the first calculation; and
a fourth noise score for the second time using the second calculation;
determining, for each of the plurality of network devices:
a first difference score by calculating a difference between the first noise score and the third noise score for the respective network device; and
a second difference score by calculating a difference between the second noise score and the fourth noise score for the respective network device;
identifying the first calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have first difference scores that exceed a threshold difference; and identifying the second calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have second difference scores that exceed the threshold difference.
|
Various techniques include detecting noise in a network, identifying the type of noise in the network, localizing noise in the network, determining noise scores for network devices, and/or determining likelihoods that particular devices are causing noise and/or are in proximity of a point of entry of noise into the network.1. A method for noise analysis in a network, comprising:
determining, for a first plurality of devices on the network, upstream SNR values for a plurality of upstream channels; identifying a noisy upstream channel based on whether channels of the plurality of upstream channels meet a noisy channel criteria; and identifying a plurality of suspect devices based on respective devices of the plurality of devices meeting a set of one or more suspect criteria, wherein the plurality of suspect devices is less than the first plurality of devices, and wherein the set of one or more suspect criteria includes a channel criterion that is met for a respective device when the respective device has communicated on the noisy upstream channel. 2. The method of claim 1, wherein the set of one or more suspect criteria includes a pre-equalizer criterion that is met for the respective device based on a pre-equalizer coefficient of the respective device. 3. The method of any of claims 1-2, wherein the set of one or more suspect criteria includes an upstream transmit power level criterion that is met for the respective device when a determined upstream transmit power level value for the respective device exceeds an upstream transmit power level threshold. 4. The method of any of claims 1-3, wherein the set of one or more suspect criteria includes an upstream transmit power level standard deviation criterion that is met for the respective device when a determined upstream transmit power level standard deviation value for the respective device exceeds an upstream transmit power level standard deviation threshold. 5. The method of any of claims 1-4, wherein the set of one or more suspect criteria includes an NMTER (non-main tap energy to total tap energy ratio) criterion that is met for the respective device when a determined NMTER value for the respective device exceeds an NMTER threshold. 6. The method of any of claims 1-5, wherein the set of one or more suspect criteria includes an NMTER (non-main tap energy to total tap energy ratio) standard deviation criterion that is met for the respective device when a determined NMTER standard deviation value for the respective device exceeds an NMTER standard deviation threshold. 7. The method of any of claims 1-6, wherein the set of one or more suspect criteria includes a power level-to-NMTER (non-main tap energy to total tap energy ratio) correlation criterion that is met for the respective device when a determined power level-to-NMTER correlation value for the respective device exceeds a power level-to-NMTER correlation threshold. 8. The method of any of claims 1-7, wherein the set of one or more suspect criteria includes an NMITE criterion that is met for the respective device when a determined NMITE value for the respective device exceeds an NMITE threshold. 9. The method of any of claims 1-8, wherein the set of one or more suspect criteria includes an SNR (signal-to-noise ratio) criterion that is met for the respective device when a determined SNR value for the respective device does not exceed an SNR threshold. 10. The method of any of claims 1-9, wherein the set of one or more suspect criteria includes an SNR (signal-to-noise ratio) standard deviation criterion that is met for the respective device when a determined SNR standard deviation value for the respective device exceeds an SNR standard deviation threshold. 11. The method of any of claims 1-10, wherein the set of one or more suspect criteria includes a CER (codeword error rate) criterion that is met for the respective device when a determined CER value for the respective device exceeds a CER threshold. 12. The method of any of claims 1-11, further comprising:
determining whether the quantity of devices of the plurality of suspect devices meets a quantity metric; in accordance with a determination that the quantity of devices of the plurality of suspect devices does not meet the quantity metric:
adjusting one or more of:
the upstream transmit power level threshold,
the upstream transmit power level standard deviation threshold,
the NMTER threshold,
the NMTER standard deviation threshold,
the NMITE threshold,
SNR threshold,
SNR standard deviation threshold, and
CER threshold; and
subsequent to the adjusting, updating the identified plurality of suspect devices based on respective devices of the plurality of devices meeting the set of one or more suspect criteria with at least one adjusted threshold value. 13. The method of any of claims 1-12, further comprising:
determining noise scores for the plurality of suspect devices, the noise scores indicating the likelihood of the devices causing noise above a noise threshold and/or the likelihood of the devices being in proximity of a point of entry of noise into the network; and providing the noise scores. 14. The method of claim 13, wherein determining noise scores for the plurality of suspect devices includes:
assigning weights to a plurality of network parameters for the plurality of suspect devices; and calculating weight-adjusted noise scores for the plurality of suspect devices, the weight-adjusted noise scores indicating the likelihood of the devices causing noise above a noise threshold and/or the likelihood of the devices being in proximity of a point of entry of noise into the network. 15. The method of claim 13, wherein determining noise scores for the plurality of suspect devices includes:
providing a plurality of network parameters for the plurality of suspect devices to a logistic regression model to calculate the noise scores for the plurality of devices. 16. The method of claim 13, wherein determining noise scores for the plurality of suspect devices includes:
providing a plurality of network parameters for the plurality of suspect devices to a neural network machine learning model to calculate the noise scores for the plurality of devices. 17. The method of any of claims 14-16, wherein the plurality of network parameters are selected from among: (a) Codeword Error Rate, (b) Micro Reflection Level, (c) CM Pre-Equalized Frequency Response, (d) CMTS CM Equalized Frequency Response, (e) Main Tap Ratio, (f) Non Main Tap Energy to Total Tap Energy Ratio, (g) Power Level, (h) Power Level to MTR Ratio, (i) Power Level to NMTER Ratio, (j) Power Level to TTE Total Tap Energy Ratio, (k) TTE Total Tap Energy, (l) Non Main Individual Tap Energy, (m) Signal to Noise Ratio, (n) SNR spike level above certain threshold over time, and (o) SNR spike count above certain threshold over time for a period of time. 18. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device (with an optional display), the one or more programs including instructions for performing the method of any of claims 1-17. 19. An electronic device, comprising:
(an optional display); one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 1-17. 20. A computer-readable storage medium storing one or more programs for noise analysis in a network, the one or more programs configured to be executed by one or more processors of an electronic device, and the one or more programs including instructions for:
determining, for a first plurality of devices on the network, upstream SNR values for a plurality of upstream channels; identifying a noisy upstream channel based on whether channels of the plurality of upstream channels meet a noisy channel criteria; and identifying a plurality of suspect devices based on respective devices of the plurality of devices meeting a set of one or more suspect criteria, wherein the plurality of suspect devices is less than the first plurality of devices, and wherein the set of one or more suspect criteria includes a channel criterion that is met for a respective device when the respective device has communicated on the noisy upstream channel. 21. An electronic device, comprising:
one or more processors; and memory storing one or more programs for noise analysis in a network, the one or more programs configured to be executed by the one or more processors, and the one or more programs including instructions for:
determining, for a first plurality of devices on the network, upstream SNR values for a plurality of upstream channels;
identifying a noisy upstream channel based on whether channels of the plurality of upstream channels meet a noisy channel criteria; and
identifying a plurality of suspect devices based on respective devices of the plurality of devices meeting a set of one or more suspect criteria, wherein the plurality of suspect devices is less than the first plurality of devices, and wherein the set of one or more suspect criteria includes a channel criterion that is met for a respective device when the respective device has communicated on the noisy upstream channel. 22. A method for noise localization in a network, comprising:
identifying one or more channels that are affected by upstream noise on the network; identifying a plurality of devices on the network that are attached to the one or more channels that are affected by upstream noise; displaying a map; subsequent to identifying the one or more channels that are affected by upstream noise:
determining, for at least two devices of the plurality of devices that are attached to the one or more channels, respective noise scores; and
subsequent to determining the respective noise scores, displaying, on the map, visual indications of the at least two devices of the plurality of devices that are attached to the one or more channels, wherein:
in accordance with a determination that the determined noise score of a respective device is within a first noise score range, the visual indication of the respective device has a first characteristic without having a second characteristic; and
in accordance with a determination that the determined noise score of the respective device is within a second noise score range, the visual indication of the respective device has the second characteristic without having the first characteristic. 23. The method of claim 22, wherein determining respective noise scores includes determining respective downstream noise scores for the respective devices. 24. The method of any of claims 22-23, wherein determining respective noise scores includes determining respective upstream noise scores for the respective devices. 25. The method of any of claims 22-24, wherein determining respective noise scores includes accessing SNR values for the respective devices. 26. The method of any of claims 22-25, wherein determining respective noise scores includes using a Noise Spectral Density for the respective devices. 27. The method of any of claims 22-26, wherein determining respective noise scores includes using a full band spectrum for the respective devices. 28. The method of any of claims 22-27, further comprising:
identifying a first area as including a first noise source. 29. The method of any of claims 22-28:
wherein the at least two respective devices are at least three respective devices of the plurality of devices that are attached to the one or more channels; and wherein displaying, on the map, visual indications of the at least two respective devices of the plurality of devices that are attached to the one or more channels includes:
in accordance with a determination that the determined noise score of the respective device is within a third noise score range, the visual indication of the respective device has a third characteristic without having the first characteristics and without having the second characteristic. 30. The method of any of claims 22-29, further comprising:
identifying a second area as including a second noise source. 31. The method of any of claims 22-30, wherein the visual indications of the respective devices of the plurality of devices that are attached to the one or more channels are based on values according to the proximity of the respective devices to a source noise. 32. The method of any of claims 22-31, further comprising:
determining, for at least the two devices of the plurality of devices that are attached to the one or more channels, respective noise scores for a plurality of times; and storing the respective noise scores for the plurality of times. 33. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device with a display, the one or more programs including instructions for performing the method of any of claims 22-32. 34. An electronic device, comprising:
a display; one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 22-32. 35. A computer-readable storage medium storing one or more programs for noise localization in a network, the one or more programs configured to be executed by one or more processors of an electronic device with a display, and the one or more programs including instructions for:
identifying one or more channels that are affected by upstream noise on the network; identifying a plurality of devices on the network that are attached to the one or more channels that are affected by upstream noise; displaying a map; subsequent to identifying the one or more channels that are affected by upstream noise:
determining, for at least two devices of the plurality of devices that are attached to the one or more channels, respective noise scores; and
subsequent to determining the respective noise scores, displaying, on the map, visual indications of the at least two devices of the plurality of devices that are attached to the one or more channels, wherein:
in accordance with a determination that the determined noise score of a respective device is within a first noise score range, the visual indication of the respective device has a first characteristic without having a second characteristic; and
in accordance with a determination that the determined noise score of the respective device is within a second noise score range, the visual indication of the respective device has the second characteristic without having the first characteristic. 36. An electronic device, comprising:
a display; one or more processors; and memory storing one or more programs for noise localization in a network, the one or more programs configured to be executed by the one or more processors, and the one or more programs including instructions for:
identifying one or more channels that are affected by upstream noise on the network;
identifying a plurality of devices on the network that are attached to the one or more channels that are affected by upstream noise;
displaying a map;
subsequent to identifying the one or more channels that are affected by upstream noise:
determining, for at least two devices of the plurality of devices that are attached to the one or more channels, respective noise scores; and
subsequent to determining the respective noise scores, displaying, on the map, visual indications of the at least two devices of the plurality of devices that are attached to the one or more channels, wherein:
in accordance with a determination that the determined noise score of a respective device is within a first noise score range, the visual indication of the respective device has a first characteristic without having a second characteristic; and
in accordance with a determination that the determined noise score of the respective device is within a second noise score range, the visual indication of the respective device has the second characteristic without having the first characteristic. 37. A method for analyzing a network, comprising:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices
while displaying the graphical representation of the network quality metric for the signal, receiving input selecting a first time that is within the first duration of time; and in response to receiving the input selecting the first time, updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on a respective noise score for the corresponding network devices at the selected first time. 38. The method of claim 37, wherein the respective noise score for a network device is determined based on a plurality of network parameters, the plurality of network parameters including a first network parameter obtained directly from the network device and a second network parameter obtained by analyzing variations in a network parameter of the network device over time. 39. The method of any of claims 37-38, wherein the respective noise score for a network device is determined based on a plurality of network parameters, the plurality of network parameters including a first network parameter obtained directly from the network device and a third network parameter obtained by analyzing variations in a network parameter of the network device over multiple channel frequencies. 40. The method of any of claims 37-39, wherein the respective noise score for a network device is determined based on a plurality of network parameters, the plurality of network parameters including a first network parameter obtained directly from the network device and a fourth network parameter obtained by analyzing a dependency or correlation between at least two network parameters of the network device. 41. The method of any of claims 37-40, wherein updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on the noise score for the corresponding network devices at the selected first time comprises:
determining a respective noise score for each of the plurality of network devices for the selected first time; determining whether the respective noise score for each respective network devices of the plurality of network devices meets a noise score criteria; updating the map of the area such that:
respective network devices of the plurality of network devices that meet the device noise score criteria are displayed using a first visual appearance, and
respective network devices of the plurality of network devices that do not meet the noise score criteria are displayed using a second visual appearance different from the first visual appearance. 42. The method of any of claims 37-41, wherein updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices includes changing the visual characteristic of at least some network devices and maintaining the visual characteristic of at least some network devices. 43. The method of any of claims 37-42, further comprising:
receiving selection of a network device of the plurality of network devices; and in response to receiving selection of the network device, concurrently displaying two or more of:
a MAC address of the network device,
a street address of the network device, and
an account number of the network device. 44. The method of any of claims 37-43, further comprising:
displaying, concurrently with the graphical representation of a network quality metric graphed against time for a signals, second graphical representation of the network quality metric graphed against a second duration of time, wherein the second duration of time includes the first duration of time, and wherein the second duration of time is longer than the first duration of time. 45. The method of any of claims 37-4, further comprising:
displaying, concurrently with the graphical representation of the network quality metric for the signal, a graphical representation of the network quality metric graphed against the first duration of time for a second signal. 46. The method of claim 45, wherein:
the graphical representation of the network quality metric for the signal is in a first color; and the graphical representation of the network quality metric for the second signal is in a second color, the second color being different from the first color. 47. The method of any of claims 37-46, further comprising:
while displaying the graphical representation of the network quality metric for the signal and the map of the area, receiving input selecting a second time that is within the first duration of time; and in response to receiving the input selecting the second time, displaying a second map of the area, concurrently with the first map of the area, that includes at least some of the displayed plurality of network devices with a visual characteristic based on the respective noise score for the corresponding network devices at the selected second time. 48. The method of any of claims 37-47, wherein a respective noise score for a respective network device is calculated based on a make of the network device. 49. The method of any of claims 37-48, further comprising:
determining a respective noise score for a respective network device for a time includes:
determining a noise score type that is currently selected;
in accordance with a determination that a first noise score type is currently selected:
using, based on the first noise score type, a first set of network parameters for the respective network device for the time to calculate the respective noise score;
in accordance with a determination that a second noise score type is currently selected:
using, based on the second noise score type, a second set of network parameters for the respective network device for the time to calculate the respective noise score. 50. The method of claim 49, further comprising:
subsequent to determining the respective noise score types for the respective devices and subsequent to updating the map of the area to change the visual characteristic of at least some of the displayed plurality of network devices based on the respective noise score for the corresponding network devices at the selected first time, receiving input to change the noise score type; and in response to receiving input to change the noise score type, updating the map of the area to change the visual characteristic of at least some of the displayed plurality of network devices based on the updated respective noise score for the corresponding network devices at the selected time. 51. A computer-readable storage medium comprising one or more programs configured to be executed by an electronic device with one or more processors (and optionally a display), the one or more programs including instructions for performing the method of any of claims 37-50. 52. An electronic device, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 37-50. 53. An electronic device, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signal, receiving input selecting a first time that is within the first duration of time; and
in response to receiving the input selecting the first time, updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on a respective noise score for the corresponding network devices at the selected first time. 54. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signal, receiving input selecting a first time that is within the first duration of time; and
in response to receiving the input selecting the first time, updating the map of the area to change a visual characteristic of at least some of the displayed plurality of network devices based on a respective noise score for the corresponding network devices at the selected first time. 55. A method for analyzing a network, comprising:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signals, receiving first input selecting a first time that is within the first duration of time; and in response to receiving the first input, displaying a first visual indicator corresponding to the first time in the graphical representation of the network quality metric; while displaying the graphical representation of the network quality metric for the signals, receiving second input selecting a second time, different from the first time, that is within the first duration of time; in response to receiving the second input, displaying a second visual indicator corresponding to the second time in the graphical representation of the network quality metric; and subsequent to receiving the first input and the second input:
determining a change in a noise score for each of the plurality of network devices between the first time and the second time;
determining whether the respective change in the noise score for each respective network device of the plurality of network devices meets a noise score change criteria;
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that meet the noise score change criteria are displayed using a first visual appearance. 56. The method of claim 55, further comprising:
subsequent to receiving the first input and the second input:
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that do not meet the noise score change criteria are displayed using a second visual appearance different from the first visual appearance. 57. The method of any of claims 55-56, further comprising:
subsequent to receiving the first input and the second input:
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that do not meet the noise score change criteria are not displayed. 58. The method of any of claims 55-57,
wherein the noise score change criteria is met for a respective network device when a change in the noise score of the network device between the first time and the second time exceeds a threshold change value; and wherein the threshold change value is provided by user input. 59. The method of any of claims 55-58,
wherein the noise score change criteria is met for a respective network device when the respective network device is categorized has having an amount of change in the noise score of the network device between the first time and the second time that falls within a top number of network devices; and wherein the threshold change value is provided by user input. 60. The method of any of claims 55-59, wherein the visual appearance of respective network devices of the plurality of network devices are displayed using a variable value, wherein the variable value is based on a magnitude of the change in the noise score of the network device between the first time and the second time. 61. The method of any of claims 55-60, further comprising:
receiving selection of a network device of the plurality of network devices; and in response to receiving selection of the network devices, concurrently displaying two or more of:
a MAC address of the network device,
a street address of the network device, and
an account number of the network device. 62. The method of any of claims 55-61, further comprising:
displaying, concurrently with the graphical representation of the network quality metric graphed against time for the signal, second graphical representation of the network quality metric graphed against a second duration of time, wherein the second duration of time includes the first duration of time, and wherein the second duration of time is longer than the first duration of time. 63. The method of any of claims 55-62, further comprising:
displaying, concurrently with the graphical representation of the network quality metric for the signal, a graphical representation of the network quality metric graphed against the first duration of time for a second signal. 64. The method of claim 63, wherein:
the graphical representation of the network quality metric for the signal is in a first color; and the graphical representation of the network quality metric for the second signal is in a second color, the second color being different from the first color. 65. The method of any of claims 55-64, wherein a respective noise score for a respective network device is calculated based on a make of the network device. 66. The method of any of claims 55-65, further comprising:
determining a respective noise score for a respective network device for a time includes:
determining a noise score type that is currently selected;
in accordance with a determination that a first noise score type is currently selected:
using, based on the first noise score type, a first set of network parameters for the respective network device for the time to calculate the respective noise score;
in accordance with a determination that a second noise score type is currently selected:
using, based on the second noise score type, a second set of network parameters for the respective network device for the time to calculate the respective noise score. 67. The method of claim 66, further comprising:
subsequent to displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area, receiving input to change the noise score type; and in response to receiving input to change the noise score type:
determining updated respective noise scores for respective network devices for the first time and the second time; and
determining whether a respective change in the noise score for each respective network device of the plurality of network devices meets the noise score change criteria;
updating, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area to change the visual characteristic of at least some of the displayed plurality of network devices. 68. A (optionally non-transitory) computer-readable storage medium comprising one or more programs configured to be executed by an electronic device with one or more processors (and optionally a display), the one or more programs including instructions for performing the method of any of claims 55-67. 69. An electronic device, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for performing the method of any of claims 55-67. 70. A device for analyzing a network, comprising:
one or more processors; memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signals, receiving first input selecting a first time that is within the first duration of time; and
in response to receiving the first input, displaying a first visual indicator corresponding to the first time in the graphical representation of the network quality metric;
while displaying the graphical representation of the network quality metric for the signals, receiving second input selecting a second time, different from the first time, that is within the first duration of time; and
in response to receiving the second input, displaying a second visual indicator corresponding to the second time in the graphical representation of the network quality metric;
subsequent to receiving the first input and the second input:
determining a change in a noise score for each of the plurality of network devices between the first time and the second time;
determining whether the respective change in the noise score for each respective network device of the plurality of network devices meets a noise score change criteria;
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that meet the noise score change criteria are displayed using a first visual appearance. 71. A (optionally non-transitory) computer-readable storage medium storing one or more programs for analyzing a network, the one or more programs including instructions for:
concurrently displaying:
a graphical representation of a network quality metric graphed against a first duration of time for a signal; and
a map of an area, wherein the map includes concurrent display of:
one or more geographical elements of the area that are not network devices, and
a plurality of network devices;
while displaying the graphical representation of the network quality metric for the signals, receiving first input selecting a first time that is within the first duration of time; and in response to receiving the first input, displaying a first visual indicator corresponding to the first time in the graphical representation of the network quality metric; while displaying the graphical representation of the network quality metric for the signals, receiving second input selecting a second time, different from the first time, that is within the first duration of time; and in response to receiving the second input, displaying a second visual indicator corresponding to the second time in the graphical representation of the network quality metric; subsequent to receiving the first input and the second input:
determining a change in a noise score for each of the plurality of network devices between the first time and the second time;
determining whether the respective change in the noise score for each respective network device of the plurality of network devices meets a noise score change criteria;
displaying, based on the determinations of whether respective changes in the noise scores meet the noise score change criteria, the map of the area such that:
respective network devices of the plurality of network devices that meet the noise score change criteria are displayed using a first visual appearance. 72. A method for analyzing a network, comprising:
determining a first time at which a first type of network impairment s negatively affecting the network; determining a second time at which the first type of network impairment is not negatively affecting the network or is negatively affecting the network less than at the first time; calculating, for each of a plurality of network devices of the network:
a first noise score for the first time using a first calculation;
a second noise score for the first time using a second calculation different from the first calculation;
a third noise score for the second time using the first calculation; and
a fourth noise score for the second time using the second calculation;
determining, for each of the plurality of network devices:
a first difference score by calculating a difference between the first noise score and the third noise score for the respective network device; and
a second difference score by calculating a difference between the second noise score and the fourth noise score for the respective network device;
identifying the first calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have first difference scores that exceed a threshold difference; and identifying the second calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have second difference scores that exceed the threshold difference. 73. A device for analyzing a network, comprising:
one or more processors; and memory storing one or more programs configured to be executed by the one or more processors, the one or more programs including instructions for:
determining a first time at which a first type of network impairment is negatively affecting the network;
determining a second time at which the first type of network impairment is not negatively affecting the network or is negatively affecting the network less than at the first time;
calculating, for each of a plurality of network devices of the network:
a first noise score for the first time using a first calculation;
a second noise score for the first time using a second calculation different from the first calculation;
a third noise score for the second time using the first calculation; and
a fourth noise score for the second time using the second calculation;
determining, for each of the plurality of network devices:
a first difference score by calculating a difference between the first noise score and the third noise score for the respective network device; and
a second difference score by calculating a difference between the second noise score and the fourth noise score for the respective network device;
identifying the first calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have first difference scores that exceed a threshold difference; and
identifying the second calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have second difference scores that exceed the threshold difference. 74. A (optionally non-transitory) computer-readable storage medium storing one or more programs configured to be executed by one or more processors of a device, the one or more programs including instructions for:
determining a first time at which a first type of network impairment is negatively affecting the network; determining a second time at which the first type of network impairment is not negatively affecting the network or is negatively affecting the network less than at the first time; calculating, for each of a plurality of network devices of the network:
a first noise score for the first time using a first calculation;
a second noise score for the first time using a second calculation different from the first calculation;
a third noise score for the second time using the first calculation; and
a fourth noise score for the second time using the second calculation;
determining, for each of the plurality of network devices:
a first difference score by calculating a difference between the first noise score and the third noise score for the respective network device; and
a second difference score by calculating a difference between the second noise score and the fourth noise score for the respective network device;
identifying the first calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have first difference scores that exceed a threshold difference; and identifying the second calculation as an indicator of the first type of network impairment when a subset of the plurality of network devices have second difference scores that exceed the threshold difference.
| 2,600
|
338,089
| 16,799,750
| 1,658
|
The present disclosure provides muteins of FVIII to which a biocompatible polymer may be attached to increase the circulatory half-life of the muteins, as well as conjugates of such muteins and biocompatible polymers.
|
1. A modified FVIII protein comprising a cysteine substitution mutation at an amino acid corresponding to a position in the amino acid sequence of SEQ ID NO:1 selected from the group of amino acid positions consisting of: 2094, 2186, 2204, 2206, 59, 239, 333, 336, 379, 481, 484, 486, 488, 489, 490, 492, 493, 495, 496, 497, 499, 500, 501, 507, 555, 562, 568, 571, 582, 1680, 1778, 1793, 1794, 1797, 1798, 1799, 1800, 1801, 1806, 1810, 1811, 1814, 1816, 1818, 1891, 2035, 2068, 2092, 2093, 2095, 2118, 2125, 2183, 2191, 2196, and 2212. 2. The modified FVIII protein of claim 1, further comprising at least one additional substitution other than cysteine at a position corresponding to 336, 562, 1680 or 1968 in the amino acid sequence of SEQ ID NO:1 selected from the group consisting of: R336A, R562A, Y1680F and K1968A. 3. The modified FVIII protein of claim 1, further comprising two additional substitutions other than cysteine at positions corresponding to 336 and 1680 in the amino acid sequence of SEQ ID NO:1, wherein said substitutions are R336A and Y1680F. 4. (canceled) 5. The modified FVIII protein of claim 1, wherein said FVIII protein is a single chain. 6. The modified FVIII protein of claim 1, wherein said FVIII protein is an inactive two-chain form capable of being activated by thrombin. 7. The modified FVIII protein of claim 1, wherein said FVIII protein lacks all or part of the B domain. 8. The modified FVIII protein of claim 7, wherein in its single chain form said FVIII protein has the amino acid sequence of SEQ ID NO:2. 9. A conjugate comprising the modified FVIII protein of claim 1 and a biocompatible polymer covalently attached directly, or indirectly via a linker, to said cysteine substitution mutation. 10. The conjugate of claim 9, wherein the conjugate further comprises a spacer. 11. The conjugate of claim 9, wherein said covalent attachment is to the sulfur atom of the thiol group of said cysteine substitution mutation. 12. The conjugate of claim 9, wherein said biocompatible polymer is selected from the group consisting of: polyethylene glycol (PEG), hydroxyalkyl starch (HAS), hydroxyethyl starch (HES), polysialic acid (PSA), a zwitterionic brush polymer, and a poly-phosphorylcholine branched polymer. 13. The conjugate of claim 12, wherein said biocompatible polymer is hydroxyethyl starch (HES). 14. (canceled) 15. A nucleic acid encoding the modified FVIII protein of claim 1. 16. A host cell comprising the nucleic acid of claim 15. 17. A vector comprising the nucleic acid of claim 15. 18. A host cell comprising the vector of claim 17. 19. A method of producing the modified FVIII protein of claim 1, comprising culturing the host cell of claim 18 under conditions where the protein is expressed and isolating said protein. 20. (canceled) 21. A composition comprising the conjugate of claim 13 and a pharmaceutically acceptable excipient. 22. A method of preventing or treating bleeding in a subject having a deficiency of FVIII activity comprising the step of administering to a subject having a deficiency of FVIII activity a prophylactically or therapeutically effective dose of the composition of claim 21. 23. The method of claim 22, wherein said subject has Hemophilia A. 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled)
|
The present disclosure provides muteins of FVIII to which a biocompatible polymer may be attached to increase the circulatory half-life of the muteins, as well as conjugates of such muteins and biocompatible polymers.1. A modified FVIII protein comprising a cysteine substitution mutation at an amino acid corresponding to a position in the amino acid sequence of SEQ ID NO:1 selected from the group of amino acid positions consisting of: 2094, 2186, 2204, 2206, 59, 239, 333, 336, 379, 481, 484, 486, 488, 489, 490, 492, 493, 495, 496, 497, 499, 500, 501, 507, 555, 562, 568, 571, 582, 1680, 1778, 1793, 1794, 1797, 1798, 1799, 1800, 1801, 1806, 1810, 1811, 1814, 1816, 1818, 1891, 2035, 2068, 2092, 2093, 2095, 2118, 2125, 2183, 2191, 2196, and 2212. 2. The modified FVIII protein of claim 1, further comprising at least one additional substitution other than cysteine at a position corresponding to 336, 562, 1680 or 1968 in the amino acid sequence of SEQ ID NO:1 selected from the group consisting of: R336A, R562A, Y1680F and K1968A. 3. The modified FVIII protein of claim 1, further comprising two additional substitutions other than cysteine at positions corresponding to 336 and 1680 in the amino acid sequence of SEQ ID NO:1, wherein said substitutions are R336A and Y1680F. 4. (canceled) 5. The modified FVIII protein of claim 1, wherein said FVIII protein is a single chain. 6. The modified FVIII protein of claim 1, wherein said FVIII protein is an inactive two-chain form capable of being activated by thrombin. 7. The modified FVIII protein of claim 1, wherein said FVIII protein lacks all or part of the B domain. 8. The modified FVIII protein of claim 7, wherein in its single chain form said FVIII protein has the amino acid sequence of SEQ ID NO:2. 9. A conjugate comprising the modified FVIII protein of claim 1 and a biocompatible polymer covalently attached directly, or indirectly via a linker, to said cysteine substitution mutation. 10. The conjugate of claim 9, wherein the conjugate further comprises a spacer. 11. The conjugate of claim 9, wherein said covalent attachment is to the sulfur atom of the thiol group of said cysteine substitution mutation. 12. The conjugate of claim 9, wherein said biocompatible polymer is selected from the group consisting of: polyethylene glycol (PEG), hydroxyalkyl starch (HAS), hydroxyethyl starch (HES), polysialic acid (PSA), a zwitterionic brush polymer, and a poly-phosphorylcholine branched polymer. 13. The conjugate of claim 12, wherein said biocompatible polymer is hydroxyethyl starch (HES). 14. (canceled) 15. A nucleic acid encoding the modified FVIII protein of claim 1. 16. A host cell comprising the nucleic acid of claim 15. 17. A vector comprising the nucleic acid of claim 15. 18. A host cell comprising the vector of claim 17. 19. A method of producing the modified FVIII protein of claim 1, comprising culturing the host cell of claim 18 under conditions where the protein is expressed and isolating said protein. 20. (canceled) 21. A composition comprising the conjugate of claim 13 and a pharmaceutically acceptable excipient. 22. A method of preventing or treating bleeding in a subject having a deficiency of FVIII activity comprising the step of administering to a subject having a deficiency of FVIII activity a prophylactically or therapeutically effective dose of the composition of claim 21. 23. The method of claim 22, wherein said subject has Hemophilia A. 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled)
| 1,600
|
338,090
| 16,799,746
| 2,687
|
The present disclosure provides muteins of FVIII to which a biocompatible polymer may be attached to increase the circulatory half-life of the muteins, as well as conjugates of such muteins and biocompatible polymers.
|
1. A modified FVIII protein comprising a cysteine substitution mutation at an amino acid corresponding to a position in the amino acid sequence of SEQ ID NO:1 selected from the group of amino acid positions consisting of: 2094, 2186, 2204, 2206, 59, 239, 333, 336, 379, 481, 484, 486, 488, 489, 490, 492, 493, 495, 496, 497, 499, 500, 501, 507, 555, 562, 568, 571, 582, 1680, 1778, 1793, 1794, 1797, 1798, 1799, 1800, 1801, 1806, 1810, 1811, 1814, 1816, 1818, 1891, 2035, 2068, 2092, 2093, 2095, 2118, 2125, 2183, 2191, 2196, and 2212. 2. The modified FVIII protein of claim 1, further comprising at least one additional substitution other than cysteine at a position corresponding to 336, 562, 1680 or 1968 in the amino acid sequence of SEQ ID NO:1 selected from the group consisting of: R336A, R562A, Y1680F and K1968A. 3. The modified FVIII protein of claim 1, further comprising two additional substitutions other than cysteine at positions corresponding to 336 and 1680 in the amino acid sequence of SEQ ID NO:1, wherein said substitutions are R336A and Y1680F. 4. (canceled) 5. The modified FVIII protein of claim 1, wherein said FVIII protein is a single chain. 6. The modified FVIII protein of claim 1, wherein said FVIII protein is an inactive two-chain form capable of being activated by thrombin. 7. The modified FVIII protein of claim 1, wherein said FVIII protein lacks all or part of the B domain. 8. The modified FVIII protein of claim 7, wherein in its single chain form said FVIII protein has the amino acid sequence of SEQ ID NO:2. 9. A conjugate comprising the modified FVIII protein of claim 1 and a biocompatible polymer covalently attached directly, or indirectly via a linker, to said cysteine substitution mutation. 10. The conjugate of claim 9, wherein the conjugate further comprises a spacer. 11. The conjugate of claim 9, wherein said covalent attachment is to the sulfur atom of the thiol group of said cysteine substitution mutation. 12. The conjugate of claim 9, wherein said biocompatible polymer is selected from the group consisting of: polyethylene glycol (PEG), hydroxyalkyl starch (HAS), hydroxyethyl starch (HES), polysialic acid (PSA), a zwitterionic brush polymer, and a poly-phosphorylcholine branched polymer. 13. The conjugate of claim 12, wherein said biocompatible polymer is hydroxyethyl starch (HES). 14. (canceled) 15. A nucleic acid encoding the modified FVIII protein of claim 1. 16. A host cell comprising the nucleic acid of claim 15. 17. A vector comprising the nucleic acid of claim 15. 18. A host cell comprising the vector of claim 17. 19. A method of producing the modified FVIII protein of claim 1, comprising culturing the host cell of claim 18 under conditions where the protein is expressed and isolating said protein. 20. (canceled) 21. A composition comprising the conjugate of claim 13 and a pharmaceutically acceptable excipient. 22. A method of preventing or treating bleeding in a subject having a deficiency of FVIII activity comprising the step of administering to a subject having a deficiency of FVIII activity a prophylactically or therapeutically effective dose of the composition of claim 21. 23. The method of claim 22, wherein said subject has Hemophilia A. 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled)
|
The present disclosure provides muteins of FVIII to which a biocompatible polymer may be attached to increase the circulatory half-life of the muteins, as well as conjugates of such muteins and biocompatible polymers.1. A modified FVIII protein comprising a cysteine substitution mutation at an amino acid corresponding to a position in the amino acid sequence of SEQ ID NO:1 selected from the group of amino acid positions consisting of: 2094, 2186, 2204, 2206, 59, 239, 333, 336, 379, 481, 484, 486, 488, 489, 490, 492, 493, 495, 496, 497, 499, 500, 501, 507, 555, 562, 568, 571, 582, 1680, 1778, 1793, 1794, 1797, 1798, 1799, 1800, 1801, 1806, 1810, 1811, 1814, 1816, 1818, 1891, 2035, 2068, 2092, 2093, 2095, 2118, 2125, 2183, 2191, 2196, and 2212. 2. The modified FVIII protein of claim 1, further comprising at least one additional substitution other than cysteine at a position corresponding to 336, 562, 1680 or 1968 in the amino acid sequence of SEQ ID NO:1 selected from the group consisting of: R336A, R562A, Y1680F and K1968A. 3. The modified FVIII protein of claim 1, further comprising two additional substitutions other than cysteine at positions corresponding to 336 and 1680 in the amino acid sequence of SEQ ID NO:1, wherein said substitutions are R336A and Y1680F. 4. (canceled) 5. The modified FVIII protein of claim 1, wherein said FVIII protein is a single chain. 6. The modified FVIII protein of claim 1, wherein said FVIII protein is an inactive two-chain form capable of being activated by thrombin. 7. The modified FVIII protein of claim 1, wherein said FVIII protein lacks all or part of the B domain. 8. The modified FVIII protein of claim 7, wherein in its single chain form said FVIII protein has the amino acid sequence of SEQ ID NO:2. 9. A conjugate comprising the modified FVIII protein of claim 1 and a biocompatible polymer covalently attached directly, or indirectly via a linker, to said cysteine substitution mutation. 10. The conjugate of claim 9, wherein the conjugate further comprises a spacer. 11. The conjugate of claim 9, wherein said covalent attachment is to the sulfur atom of the thiol group of said cysteine substitution mutation. 12. The conjugate of claim 9, wherein said biocompatible polymer is selected from the group consisting of: polyethylene glycol (PEG), hydroxyalkyl starch (HAS), hydroxyethyl starch (HES), polysialic acid (PSA), a zwitterionic brush polymer, and a poly-phosphorylcholine branched polymer. 13. The conjugate of claim 12, wherein said biocompatible polymer is hydroxyethyl starch (HES). 14. (canceled) 15. A nucleic acid encoding the modified FVIII protein of claim 1. 16. A host cell comprising the nucleic acid of claim 15. 17. A vector comprising the nucleic acid of claim 15. 18. A host cell comprising the vector of claim 17. 19. A method of producing the modified FVIII protein of claim 1, comprising culturing the host cell of claim 18 under conditions where the protein is expressed and isolating said protein. 20. (canceled) 21. A composition comprising the conjugate of claim 13 and a pharmaceutically acceptable excipient. 22. A method of preventing or treating bleeding in a subject having a deficiency of FVIII activity comprising the step of administering to a subject having a deficiency of FVIII activity a prophylactically or therapeutically effective dose of the composition of claim 21. 23. The method of claim 22, wherein said subject has Hemophilia A. 24. (canceled) 25. (canceled) 26. (canceled) 27. (canceled)
| 2,600
|
338,091
| 16,799,734
| 2,687
|
A single-instruction, multiple data processor performs object detection in an image by testing for a plurality of object features in a plurality of image regions, the processor comprising: a set of computation units operable to execute a plurality of classifier sequences in parallel, each classifier sequence comprising a plurality of classifier routines, and each classifier routine comprising identical instructions to the other classifier routines in each of the plurality of classifier sequences; wherein each computation unit is configured to independently maintain data identifying an image region and a feature under test on that computation unit, and each classifier routine is arranged to access the data, test the identified feature against the identified image region and update the data such that the computation units are operable to concurrently test different features against different image regions.
|
1. A single-instruction, multiple data processing unit for performing object detection in an image by testing for a plurality of object features in a plurality of image regions, the processing unit comprising:
a set of computation units operable to execute a plurality of classifier routines, each classifier routine comprising identical instructions to the other classifier routines, wherein the classifier routines are configured to concurrently test different features against different image regions using data identifying an image region and a feature under test, and wherein each classifier routine is configured to pass or fail an image region on testing an identified feature against the identified image region; and a memory accessible to the set of computation units and arranged to store an index representing progress through the plurality of image regions, wherein each classifier routine comprises instructions configured to, on completing a test , increment the index so as to update the progress and cause an identifier of a next image region to be returned to the classifier routine. 2. The single-instruction, multiple data processing unit as claimed in claim 1, wherein the set of computation units are operable to execute a plurality of classifier routines by executing a plurality of classifier sequences in parallel, each classifier sequence comprising a plurality of classifier routines. 3. The single-instruction, multiple data processing unit as claimed in claim 2, wherein each classifier routine comprises identical instructions to the other classifier routines in each of the plurality of classifier sequences. 4. The single-instruction, multiple data processing unit as claimed in claim 1, wherein the instructions are configured to, on failing an image region, increment the index. 5. The single-instruction, multiple data processing unit as claimed in claim 1, wherein the data at which the classifier routine is executing is updated when the index is incremented. 6. The single-instruction, multiple data processing unit as claimed in claim 2, each classifier sequence being configured to perform a sequence of tests for object features in an image region, each classifier routine of the classifier sequence being configured to perform a test of the sequence. 7. The single-instruction, multiple data processing unit as claimed in claim 1, each classifier routine comprising instructions configured to:
on passing an image region, update the data at which the classifier routine is executing so as to cause the next classifier routine in the classifier sequence to test the next feature against the same image region; on failing an image region, update the data at which the classifier routine is executing so as to cause the next classifier routine in the classifier sequence to test the first feature against the next image region. 8. The single-instruction, multiple data processing unit as claimed in claim 1, each classifier routine being configured to use its data identifying an image region to lookup data from that identified image region in the image in which object detection is being performed. 9. The single-instruction, multiple data processing unit as claimed in claim 1, each classifier routine being a single routine arranged to execute iteratively at its computation unit so as to test the identified feature against the identified region and update the data. 10. The single-instruction, multiple data processing unit as claimed in claim 1, further comprising a further set of computation units operable to execute the plurality of classifier routines, wherein the set of computation units forms a first computation group and the further set of computation units forms a second computation group, and wherein the plurality of image regions are divided into a plurality of subsets of image regions, and each of the first and second computation group is allocated a different one of the subsets of image regions to test. 11. The single-instruction, multiple data processing unit as claimed in claim 10 wherein the processing unit further comprises a global memory storing a global index representing an extent of search by the first and second computation groups through the plurality of subsets of image regions;
wherein each classifier routine comprises instructions configured to, on exhausting the subset of image regions for its associated computation group, cause a new subset of image regions to be allocated to the associated computation group in dependence on the global index. 12. The single-instruction, multiple data processing unit as claimed in claim 11, each classifier routine comprising instructions configured to cause the global index to allocate a new subset of image regions to the associated computation group by atomically updating the global index so as to update the extent of search through the plurality of subsets of image regions, and cause an identifier of the next subset of image regions to be returned to the classifier routine. 13. The single-instruction, multiple data processing unit as claimed in claim 10 further comprising a memory accessible to the first computation group but not to the second computation group, the memory being arranged to store an index representing an extent of search by the first computation group through the plurality of image regions;
wherein each classifier routine of the first computation group is configured to pass or fail an image region on testing the identified feature against the identified image region and comprises instructions configured to, on failing an image region, update the data at which the classifier routine is executing by atomically incrementing the index so as to update the extent of search and cause an identifier of the next image region to be returned to the classifier routine. 14. The single-instruction, multiple data processing unit as claimed in claim 1, each image region differing from other image regions in terms of one or more of its position, size and orientation in the frame. 15. The single-instruction, multiple data processing unit as claimed in claim 1, each object feature being a Haar-like feature and each classifier routine being configured to determine whether the feature meets a predefined threshold. 16. A method for performing object detection in an image at a single-instruction, multiple data processor having a set of computation units arranged to execute a plurality of classifier routines, each classifier routine having identical instructions to the other classifier routines, and the method comprising:
executing a classifier routine in parallel at each of the set of computation units so as to test for a plurality of object features in a plurality of image regions such that the classifier routines are configured to concurrently test different features against different image regions using data identifying an image region and a feature under test; wherein, on testing an identified feature against an identified image region, passing or failing the identified image region; and maintaining an index representing an extent of search by the set of computation units through the plurality of image regions, and each classifier routine, on completing a test, incrementing the index so as to update the progress and cause an identifier of the next image region to be returned to the classifier routine. 17. The method as claimed in claim 16, wherein the set of computation units are arranged to execute a plurality of classifier routines by being operable to execute a plurality of classifier sequences in parallel, each classifier sequence comprising a plurality of classifier routines and wherein each classifier routine:
on passing the image region, updating the data identifying the image region and the feature under test so as to cause the next classifier routine in the classifier sequence to test the next feature against the same image region; or on failing the image region, updating the data identifying the image region and the feature under test so as to cause the next classifier routine in the classifier sequence to test the first feature against the next image region. 18. The method as claimed in claim 16, comprising iteratively executing each classifier routine at its computation unit so as to test the identified feature against the identified region and update the data. 19. The method as claimed in claim 16, each classifier routine executing at a computation unit of one of a plurality of groups of computation units and the method further comprising:
dividing the plurality of image regions into a plurality of subsets of image regions; and allocating a different one of the subsets of image regions for testing at each group of computation units. 20. A non-transitory computer readable storage medium having stored thereon computer readable instructions that, when executed at a computer system comprising a single-instruction, multiple data processor, cause the computer system to perform a method for performing object detection in an image at the single-instruction, multiple data processor having a set of computation units arranged to execute a plurality of classifier routines, each classifier routine having identical instructions to the other classifier routines, the method comprising:
executing a classifier routine in parallel at each of the set of computation units so as to test for a plurality of object features in a plurality of image regions such that the classifier routines are configured to concurrently test different features against different image regions using data identifying an image region and a feature under test.
|
A single-instruction, multiple data processor performs object detection in an image by testing for a plurality of object features in a plurality of image regions, the processor comprising: a set of computation units operable to execute a plurality of classifier sequences in parallel, each classifier sequence comprising a plurality of classifier routines, and each classifier routine comprising identical instructions to the other classifier routines in each of the plurality of classifier sequences; wherein each computation unit is configured to independently maintain data identifying an image region and a feature under test on that computation unit, and each classifier routine is arranged to access the data, test the identified feature against the identified image region and update the data such that the computation units are operable to concurrently test different features against different image regions.1. A single-instruction, multiple data processing unit for performing object detection in an image by testing for a plurality of object features in a plurality of image regions, the processing unit comprising:
a set of computation units operable to execute a plurality of classifier routines, each classifier routine comprising identical instructions to the other classifier routines, wherein the classifier routines are configured to concurrently test different features against different image regions using data identifying an image region and a feature under test, and wherein each classifier routine is configured to pass or fail an image region on testing an identified feature against the identified image region; and a memory accessible to the set of computation units and arranged to store an index representing progress through the plurality of image regions, wherein each classifier routine comprises instructions configured to, on completing a test , increment the index so as to update the progress and cause an identifier of a next image region to be returned to the classifier routine. 2. The single-instruction, multiple data processing unit as claimed in claim 1, wherein the set of computation units are operable to execute a plurality of classifier routines by executing a plurality of classifier sequences in parallel, each classifier sequence comprising a plurality of classifier routines. 3. The single-instruction, multiple data processing unit as claimed in claim 2, wherein each classifier routine comprises identical instructions to the other classifier routines in each of the plurality of classifier sequences. 4. The single-instruction, multiple data processing unit as claimed in claim 1, wherein the instructions are configured to, on failing an image region, increment the index. 5. The single-instruction, multiple data processing unit as claimed in claim 1, wherein the data at which the classifier routine is executing is updated when the index is incremented. 6. The single-instruction, multiple data processing unit as claimed in claim 2, each classifier sequence being configured to perform a sequence of tests for object features in an image region, each classifier routine of the classifier sequence being configured to perform a test of the sequence. 7. The single-instruction, multiple data processing unit as claimed in claim 1, each classifier routine comprising instructions configured to:
on passing an image region, update the data at which the classifier routine is executing so as to cause the next classifier routine in the classifier sequence to test the next feature against the same image region; on failing an image region, update the data at which the classifier routine is executing so as to cause the next classifier routine in the classifier sequence to test the first feature against the next image region. 8. The single-instruction, multiple data processing unit as claimed in claim 1, each classifier routine being configured to use its data identifying an image region to lookup data from that identified image region in the image in which object detection is being performed. 9. The single-instruction, multiple data processing unit as claimed in claim 1, each classifier routine being a single routine arranged to execute iteratively at its computation unit so as to test the identified feature against the identified region and update the data. 10. The single-instruction, multiple data processing unit as claimed in claim 1, further comprising a further set of computation units operable to execute the plurality of classifier routines, wherein the set of computation units forms a first computation group and the further set of computation units forms a second computation group, and wherein the plurality of image regions are divided into a plurality of subsets of image regions, and each of the first and second computation group is allocated a different one of the subsets of image regions to test. 11. The single-instruction, multiple data processing unit as claimed in claim 10 wherein the processing unit further comprises a global memory storing a global index representing an extent of search by the first and second computation groups through the plurality of subsets of image regions;
wherein each classifier routine comprises instructions configured to, on exhausting the subset of image regions for its associated computation group, cause a new subset of image regions to be allocated to the associated computation group in dependence on the global index. 12. The single-instruction, multiple data processing unit as claimed in claim 11, each classifier routine comprising instructions configured to cause the global index to allocate a new subset of image regions to the associated computation group by atomically updating the global index so as to update the extent of search through the plurality of subsets of image regions, and cause an identifier of the next subset of image regions to be returned to the classifier routine. 13. The single-instruction, multiple data processing unit as claimed in claim 10 further comprising a memory accessible to the first computation group but not to the second computation group, the memory being arranged to store an index representing an extent of search by the first computation group through the plurality of image regions;
wherein each classifier routine of the first computation group is configured to pass or fail an image region on testing the identified feature against the identified image region and comprises instructions configured to, on failing an image region, update the data at which the classifier routine is executing by atomically incrementing the index so as to update the extent of search and cause an identifier of the next image region to be returned to the classifier routine. 14. The single-instruction, multiple data processing unit as claimed in claim 1, each image region differing from other image regions in terms of one or more of its position, size and orientation in the frame. 15. The single-instruction, multiple data processing unit as claimed in claim 1, each object feature being a Haar-like feature and each classifier routine being configured to determine whether the feature meets a predefined threshold. 16. A method for performing object detection in an image at a single-instruction, multiple data processor having a set of computation units arranged to execute a plurality of classifier routines, each classifier routine having identical instructions to the other classifier routines, and the method comprising:
executing a classifier routine in parallel at each of the set of computation units so as to test for a plurality of object features in a plurality of image regions such that the classifier routines are configured to concurrently test different features against different image regions using data identifying an image region and a feature under test; wherein, on testing an identified feature against an identified image region, passing or failing the identified image region; and maintaining an index representing an extent of search by the set of computation units through the plurality of image regions, and each classifier routine, on completing a test, incrementing the index so as to update the progress and cause an identifier of the next image region to be returned to the classifier routine. 17. The method as claimed in claim 16, wherein the set of computation units are arranged to execute a plurality of classifier routines by being operable to execute a plurality of classifier sequences in parallel, each classifier sequence comprising a plurality of classifier routines and wherein each classifier routine:
on passing the image region, updating the data identifying the image region and the feature under test so as to cause the next classifier routine in the classifier sequence to test the next feature against the same image region; or on failing the image region, updating the data identifying the image region and the feature under test so as to cause the next classifier routine in the classifier sequence to test the first feature against the next image region. 18. The method as claimed in claim 16, comprising iteratively executing each classifier routine at its computation unit so as to test the identified feature against the identified region and update the data. 19. The method as claimed in claim 16, each classifier routine executing at a computation unit of one of a plurality of groups of computation units and the method further comprising:
dividing the plurality of image regions into a plurality of subsets of image regions; and allocating a different one of the subsets of image regions for testing at each group of computation units. 20. A non-transitory computer readable storage medium having stored thereon computer readable instructions that, when executed at a computer system comprising a single-instruction, multiple data processor, cause the computer system to perform a method for performing object detection in an image at the single-instruction, multiple data processor having a set of computation units arranged to execute a plurality of classifier routines, each classifier routine having identical instructions to the other classifier routines, the method comprising:
executing a classifier routine in parallel at each of the set of computation units so as to test for a plurality of object features in a plurality of image regions such that the classifier routines are configured to concurrently test different features against different image regions using data identifying an image region and a feature under test.
| 2,600
|
338,092
| 16,799,709
| 2,687
|
A flexible display panel includes a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel. The flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode. In a second mode, the flexible display panel is concurrently scanned from the first end portion of the flexible display panel to a central portion of the flexible display panel and from the second end portion of the flexible display panel to the central portion of the flexible display panel.
|
1. A flexible display panel comprising a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel,
wherein the flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode, and wherein, in a second mode, the flexible display panel is concurrently scanned from the first end portion of the flexible display panel to a central portion of the flexible display panel and from the second end portion of the flexible display panel to the central portion of the flexible display panel. 2. The flexible display panel of claim 1, wherein the first mode is an unfolded mode in which the flexible display panel is unfolded, and
wherein the second mode is an outfolding dual view mode, in which the first display area and the second display area display an image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 3. The flexible display panel of claim 1, wherein, in the first mode, the first display area and the second display area display a single continuous image and an image displayed on the first display area is different from an image displayed on the second display area, and
wherein, in the second mode, the first display area and the second display area display symmetric images with respect to a folding line where the flexible display panel is folded. 4. The flexible display panel of claim 1, wherein, in a third mode, the first display area displays an image and the second display area does not display an image. 5. The flexible display panel of claim 4, wherein the third mode is an outfolding single view mode, in which only the first display area displays the image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 6. The flexible display panel of claim 1, wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the second end portion of the flexible display panel in the second mode, and
wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the first end portion of the flexible display panel in the second mode. 7. The flexible display panel of claim 1, further comprising an inactive area between the first display area and the second display area, the inactive area not displaying an image in the second mode. 8. The flexible display panel of claim 7, wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to a first end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the first end portion of the inactive area to the second end portion of the flexible display panel in the second mode, and
wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to a second end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the second end portion of the inactive area to the second end portion of the flexible display panel in the second mode. 9. A flexible display panel comprising a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel,
wherein the flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode, and wherein, in a second mode, the flexible display panel is concurrently scanned from a central portion of the flexible display panel to the first end portion of the flexible display panel and from the central portion of the flexible display panel to the second end portion of the flexible display panel. 10. A flexible display apparatus comprising:
a flexible display panel comprising a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel; a gate driver configured to output a gate signal to the flexible display panel; and a data driver configured to output a data voltage to the flexible display panel, wherein the flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode, and wherein, in a second mode, the flexible display panel is concurrently scanned from the first end portion of the flexible display panel to a central portion of the flexible display panel and from the second end portion of the flexible display panel to the central portion of the flexible display panel. 11. The flexible display apparatus of claim 10, wherein the first mode is an unfolded mode in which the flexible display panel is unfolded, and
wherein the second mode is an outfolding dual view mode, in which the first display area and the second display area display an image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 12. The flexible display apparatus of claim 10, wherein, in the first mode, the first display area and the second display area display a single continuous image and an image displayed on the first display area is different from an image displayed on the second display area, and
wherein, in the second mode, the first display area and the second display area display symmetric images with respect to a folding line where the flexible display panel is folded. 13. The flexible display apparatus of claim 10, wherein, in a third mode, the first display area displays an image and the second display area does not display an image. 14. The flexible display apparatus of claim 13, wherein the third mode is an outfolding single view mode, in which only the first display area displays the image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 15. The flexible display apparatus of claim 10, wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the second end portion of the flexible display panel in the second mode, and
wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the first end portion of the flexible display panel in the second mode. 16. The flexible display apparatus of claim 15, wherein at least one of stages of the gate driver comprises:
a first switching element comprising a control electrode configured to receive a first clock signal, an input electrode configured to receive a vertical start signal or a previous carry signal and an output electrode connected to a first control node; a second switching element comprising a control electrode connected to a second control node, an input electrode configured to receive a first power voltage and an output electrode connected to an input electrode of a third switching element; the third switching element comprising a control electrode configured to receive a second clock signal, the input electrode connected to the output electrode of the second switching element and an output electrode connected to the first control node; a fourth switching element comprising a control electrode connected to the first control node, an input electrode configured to receive the first clock signal and an output electrode connected to the second control node; a fifth switching element comprising a control electrode configured to receive the first clock signal, an input electrode configured to receive a second power voltage and an output electrode connected to the second control node; a sixth switching element comprising a control electrode connected to the second control node, an input electrode configured to receive the first power voltage and an output electrode connected to an output node; and a seventh switching element comprising a control electrode connected to the first control node, an input electrode configured to receive the second clock signal and an output electrode connected to the output node. 17. The flexible display apparatus of claim 16, wherein the gate signal outputted from the stage of the gate driver is masked, a pulse of the second clock signal applied to the stage of the gate driver is skipped. 18. The flexible display apparatus of claim 10, wherein the flexible display panel further comprises an inactive area between the first display area and the second display area, the inactive area not displaying an image in the second mode,
wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to a first end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the first end portion of the inactive area to the second end portion of the flexible display panel in the second mode, and wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to a second end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the second end portion of the inactive area to the second end portion of the flexible display panel in the second mode. 19. The flexible display apparatus of claim 10, wherein a width of a pulse of the gate signal in the second mode is greater than a width of a pulse of the gate signal in the first mode. 20. The flexible display apparatus of claim 10, wherein a data signal applied to the data driver comprises a frame data duration and a dummy data duration,
a width of a pulse of the gate signal in the second mode is equal to a width of a pulse of the gate signal in the first mode, a length of the frame data duration of the data signal in the second mode is less than a length of the frame data duration of the data signal in the first mode, a length of the dummy data duration of the data signal in the second mode is greater than a length of the dummy data duration of the data signal in the first mode.
|
A flexible display panel includes a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel. The flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode. In a second mode, the flexible display panel is concurrently scanned from the first end portion of the flexible display panel to a central portion of the flexible display panel and from the second end portion of the flexible display panel to the central portion of the flexible display panel.1. A flexible display panel comprising a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel,
wherein the flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode, and wherein, in a second mode, the flexible display panel is concurrently scanned from the first end portion of the flexible display panel to a central portion of the flexible display panel and from the second end portion of the flexible display panel to the central portion of the flexible display panel. 2. The flexible display panel of claim 1, wherein the first mode is an unfolded mode in which the flexible display panel is unfolded, and
wherein the second mode is an outfolding dual view mode, in which the first display area and the second display area display an image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 3. The flexible display panel of claim 1, wherein, in the first mode, the first display area and the second display area display a single continuous image and an image displayed on the first display area is different from an image displayed on the second display area, and
wherein, in the second mode, the first display area and the second display area display symmetric images with respect to a folding line where the flexible display panel is folded. 4. The flexible display panel of claim 1, wherein, in a third mode, the first display area displays an image and the second display area does not display an image. 5. The flexible display panel of claim 4, wherein the third mode is an outfolding single view mode, in which only the first display area displays the image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 6. The flexible display panel of claim 1, wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the second end portion of the flexible display panel in the second mode, and
wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the first end portion of the flexible display panel in the second mode. 7. The flexible display panel of claim 1, further comprising an inactive area between the first display area and the second display area, the inactive area not displaying an image in the second mode. 8. The flexible display panel of claim 7, wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to a first end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the first end portion of the inactive area to the second end portion of the flexible display panel in the second mode, and
wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to a second end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the second end portion of the inactive area to the second end portion of the flexible display panel in the second mode. 9. A flexible display panel comprising a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel,
wherein the flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode, and wherein, in a second mode, the flexible display panel is concurrently scanned from a central portion of the flexible display panel to the first end portion of the flexible display panel and from the central portion of the flexible display panel to the second end portion of the flexible display panel. 10. A flexible display apparatus comprising:
a flexible display panel comprising a first display area adjacent to a first end portion of the flexible display panel and a second display area adjacent to a second end portion of the flexible display panel; a gate driver configured to output a gate signal to the flexible display panel; and a data driver configured to output a data voltage to the flexible display panel, wherein the flexible display panel is scanned from the first end portion of the flexible display panel to the second end portion of the flexible display panel in a first mode, and wherein, in a second mode, the flexible display panel is concurrently scanned from the first end portion of the flexible display panel to a central portion of the flexible display panel and from the second end portion of the flexible display panel to the central portion of the flexible display panel. 11. The flexible display apparatus of claim 10, wherein the first mode is an unfolded mode in which the flexible display panel is unfolded, and
wherein the second mode is an outfolding dual view mode, in which the first display area and the second display area display an image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 12. The flexible display apparatus of claim 10, wherein, in the first mode, the first display area and the second display area display a single continuous image and an image displayed on the first display area is different from an image displayed on the second display area, and
wherein, in the second mode, the first display area and the second display area display symmetric images with respect to a folding line where the flexible display panel is folded. 13. The flexible display apparatus of claim 10, wherein, in a third mode, the first display area displays an image and the second display area does not display an image. 14. The flexible display apparatus of claim 13, wherein the third mode is an outfolding single view mode, in which only the first display area displays the image and the flexible display panel is folded where the first display area and the second display area are exposed outwardly. 15. The flexible display apparatus of claim 10, wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the second end portion of the flexible display panel in the second mode, and
wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to the central portion of the flexible display panel in the second mode and wherein corresponding gate signals are masked from the central portion of the flexible display panel to the first end portion of the flexible display panel in the second mode. 16. The flexible display apparatus of claim 15, wherein at least one of stages of the gate driver comprises:
a first switching element comprising a control electrode configured to receive a first clock signal, an input electrode configured to receive a vertical start signal or a previous carry signal and an output electrode connected to a first control node; a second switching element comprising a control electrode connected to a second control node, an input electrode configured to receive a first power voltage and an output electrode connected to an input electrode of a third switching element; the third switching element comprising a control electrode configured to receive a second clock signal, the input electrode connected to the output electrode of the second switching element and an output electrode connected to the first control node; a fourth switching element comprising a control electrode connected to the first control node, an input electrode configured to receive the first clock signal and an output electrode connected to the second control node; a fifth switching element comprising a control electrode configured to receive the first clock signal, an input electrode configured to receive a second power voltage and an output electrode connected to the second control node; a sixth switching element comprising a control electrode connected to the second control node, an input electrode configured to receive the first power voltage and an output electrode connected to an output node; and a seventh switching element comprising a control electrode connected to the first control node, an input electrode configured to receive the second clock signal and an output electrode connected to the output node. 17. The flexible display apparatus of claim 16, wherein the gate signal outputted from the stage of the gate driver is masked, a pulse of the second clock signal applied to the stage of the gate driver is skipped. 18. The flexible display apparatus of claim 10, wherein the flexible display panel further comprises an inactive area between the first display area and the second display area, the inactive area not displaying an image in the second mode,
wherein corresponding gate signals are scanned from the first end portion of the flexible display panel to a first end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the first end portion of the inactive area to the second end portion of the flexible display panel in the second mode, and wherein corresponding gate signals are scanned from the second end portion of the flexible display panel to a second end portion of the inactive area in the second mode and wherein corresponding gate signals are masked from the second end portion of the inactive area to the second end portion of the flexible display panel in the second mode. 19. The flexible display apparatus of claim 10, wherein a width of a pulse of the gate signal in the second mode is greater than a width of a pulse of the gate signal in the first mode. 20. The flexible display apparatus of claim 10, wherein a data signal applied to the data driver comprises a frame data duration and a dummy data duration,
a width of a pulse of the gate signal in the second mode is equal to a width of a pulse of the gate signal in the first mode, a length of the frame data duration of the data signal in the second mode is less than a length of the frame data duration of the data signal in the first mode, a length of the dummy data duration of the data signal in the second mode is greater than a length of the dummy data duration of the data signal in the first mode.
| 2,600
|
338,093
| 16,799,742
| 3,732
|
An attachment combination for positioning an accessory along an elongate structure such as a shoe lace a shoe strap, arm or finger where the accessory has a loop attached to the accessory that at least in part holds the accessory to the elongate structure. In one form the accessory has a closed loop held inside a releasable clasp that has an open position for receiving the closed loop and the elongate structure and a closed position that holds the elongate structure and the closed loop together in a pocket formed by the releasable clap. The releasable clasp is a flexible strap having joinable sections that when spaced apart allow the strap to receive both the loop band and the elongate structure and when joined together surround the elongate structure and hold the loop band together with the elongate structure. The joinable sections may be the hook and loop portions of a hook and loop type strap. In another form the releasable clasp may be attached directly to the accessory.
|
1. An accessory and attachment combination to position the accessory along an elongate structure comprising:
an accessory; at least one loop band fixed to the accessory and providing a closed loop; a releasable clasp having unengaged and engaged positions wherein the releasable clasp (1) can receive the loop band and be moved into engagement with a section of the elongate structure when in an unengaged position and (2) will engage the elongate structure to remain fixed thereto and will retain the band when in an engaged position. 2. The accessory and attachment combination of claim 1 wherein the loop band and releasable clasp comprise flexible materials. 3. The accessory and attachment combination of claim 1 wherein the releasable clasp comprises a flexible strap having a first and second joinable sections, the strap receives both the band and the elongate structure when the first and second joinable sections are spaced apart and wherein at least a portion of the strap surrounds both the loop band the elongate structure together in a closed pocket formed by the strap when the first and second joinable sections are joined together. 4. The accessory and attachment combination of claim 3 wherein the first joinable section is a hook portion of a hook loop arrangement and the second joinable section is the loop portion of the hook and loop arrangement. 5. The accessory and attachment combination of claim 1 wherein the elongate structure comprises an article of clothing, a portion of the human body, or a shoelace or strap of an article of footwear. 6. The accessory and attachment combination of claim 1 further wherein the elongate structure comprising a gapping band in the form of straps, shoelaces, or a decorative band, each of which extend across the vamp of the shoe;
the releasable clasp comprises a base in the form of elongated plate having a length exceeding its broadest width and a thickness that does not exceed its average width; and,
wherein the base has an anchoring section defined by a portion of the elongated plate that is spaced apart and adapted to extend underneath at least portion of a gapping band to position the accessory to the elongate structure via the releasable clasp and pressure between the gapping band and the vamp of the shoe. 7. The accessory and attachment combination of claim 6 further comprising:
an attachment section defined by a portion of the base and through which the base can extend; and,
at least one attachment structure fixed to the back side of the accessory that provides at least a portion of the loop band and arranged for attachment to the base to provide at least a portion of a rotational element that fixes the accessory to the base in at least two rotational orientations of the principal axis relative to the base. 8. The accessory and attachment combination of claim 6 wherein the plate defines at least two anchoring sections that are spaced apart along its length and the plate and each anchoring section defines a hole for passing a shoelace therethrough. 9. The accessory and attachment combination of claim 8 wherein the plate defines at least two anchoring sections spaced apart over its length and arranged to extend under gapping bands that comprise two spaced apart hook and loop straps that extend across the vamp of the shoe or two distinct portions of a shoelace that extends across the vamp of the shoe. 10. The accessory and attachment combination of claim 6 wherein the releasable clasp includes the base and a retaining bar that extends parallel to the plate and is fixed to the plate by a connecting section that joins the plate and provides the retaining bar and the retaining bar and/or the connection section has sufficient resiliency to allow separation of the plate and bar to provide a temporary gap suitable to receive a gapping band. 11. The accessory and attachment combination of claim 10 wherein:
the connection section comprises a strut that connects the plate to the bar, the strut provides, at least in part, resiliency to the plate and bar to provide the temporary gap, or the strut provides a hinge positioned at a common end of the plate and the bar and the upper bar and the lower bar are adapted to provide the releasable clasp. 12. The accessory and attachment combination of claim 7 wherein the rotational element comprises a pivot structure, the base and the accessory are fixed to the pivot structure and wherein the pivot structure can position the accessory and base in a first rotational position and second rotational position distinct from the first rotational position. 13. The accessory and attachment combination of claim 12 wherein the pivot structure comprises an upper stop structure fixed with respect to the accessory and a lower stop structure located on or about the attachment section;
the upper and lower stop structures cooperate with each other to adjustably fix the accessory to the base and to provide the first and second rotational positions. 14. The accessory and attachment combination of claim 11 wherein the plate has a lower locking section and the bar has an upper retaining section and the upper and lower locking section cooperate to inhibit movement of the bar away from the plate when engaged. 15. An accessory and attachment combination to attach the accessory to an elongate structure comprising:
an accessory; an elongate strap affixed to the accessory; a first joinable element located at a first section of the strap; and, a second joinable element spaced apart from the first joinable element and adapted for engagement with the first joinable element: wherein the spacing between the first joinable element and the second joinable element provides sufficient strap length for the strap to encircle and fix the accessory to the elongate structure by engagement of the first joinable element and the second joinable element. 16. The accessory and attachment combination of claim 15 wherein the first joinable element comprises the hook portion of a hook and loop arrangement and the second joinable element comprises the loop portion of a hook and loop arrangement. 17. The accessory and attachment combination of claim 16 wherein an adhesive or stitching extends transversely to the strap and fixes the strap to the accessory at a tying section; the hook portion is located proximate to one end of the strap and the loop portion is located proximate to the opposite end of the strap: and the hook and loop portion are located on opposite sides of the strap. 18. The accessory and attachment of combination of claim 15 wherein the strap comprises an elastic material. 19. The accessory and attachment combination of claim 16 wherein the strap is affixed to the accessory at two tying sections each located proximate an edge of the strap with each tying section on an opposite side of the strap relative to the other; most of the strap length is located to one side of the tying sections to form a short segment and a long segment of the strap; the hook portion of the strap is located proximate to the end of the long section of the strap; the loop portion is located on the opposite side of the strap relative to the hook portion; the loop portion covers at least a quarter of the length of the long segment of the strap; and the hook portion of the strap is adapted to slide below the short section of the strap and above the accessory at a location between the two tying sections for engagement of a loop portion located on the long segment of the strap. 20. An accessory and attachment combination to attach the accessory to an elongate structure comprising:
an accessory; an elongate strap affixed to the accessory at two tying sections; a hook portion of a hook and loop arrangement located on a first section of the strap; a loop portion of a hook and loop arrangement located on a second section of the strap, located on an opposite side of the strap with respect to the hook portion and spaced apart from the hook portion by a sufficient strap length for the strap to encircle and fix the accessory to the elongate structure by engagement of the hook and loop attachment; each of the tying sections is located proximate an edge of the strap with each tying section on an opposite side of the strap relative to the other and the tying section located such that most of the strap length is located to one side of the tying sections to form a short segment and a long segment of the strap; the hook portion of the strap is located proximate to the end of the long section of the strap; the loop portion covers at least a quarter of the length of the long segment of the strap; and, the hook portion of the strap is adapted to slide below the short section of the strap and above the accessory at a location between the two tying sections for engagement of a loop portion located on the long segment of the strap.
|
An attachment combination for positioning an accessory along an elongate structure such as a shoe lace a shoe strap, arm or finger where the accessory has a loop attached to the accessory that at least in part holds the accessory to the elongate structure. In one form the accessory has a closed loop held inside a releasable clasp that has an open position for receiving the closed loop and the elongate structure and a closed position that holds the elongate structure and the closed loop together in a pocket formed by the releasable clap. The releasable clasp is a flexible strap having joinable sections that when spaced apart allow the strap to receive both the loop band and the elongate structure and when joined together surround the elongate structure and hold the loop band together with the elongate structure. The joinable sections may be the hook and loop portions of a hook and loop type strap. In another form the releasable clasp may be attached directly to the accessory.1. An accessory and attachment combination to position the accessory along an elongate structure comprising:
an accessory; at least one loop band fixed to the accessory and providing a closed loop; a releasable clasp having unengaged and engaged positions wherein the releasable clasp (1) can receive the loop band and be moved into engagement with a section of the elongate structure when in an unengaged position and (2) will engage the elongate structure to remain fixed thereto and will retain the band when in an engaged position. 2. The accessory and attachment combination of claim 1 wherein the loop band and releasable clasp comprise flexible materials. 3. The accessory and attachment combination of claim 1 wherein the releasable clasp comprises a flexible strap having a first and second joinable sections, the strap receives both the band and the elongate structure when the first and second joinable sections are spaced apart and wherein at least a portion of the strap surrounds both the loop band the elongate structure together in a closed pocket formed by the strap when the first and second joinable sections are joined together. 4. The accessory and attachment combination of claim 3 wherein the first joinable section is a hook portion of a hook loop arrangement and the second joinable section is the loop portion of the hook and loop arrangement. 5. The accessory and attachment combination of claim 1 wherein the elongate structure comprises an article of clothing, a portion of the human body, or a shoelace or strap of an article of footwear. 6. The accessory and attachment combination of claim 1 further wherein the elongate structure comprising a gapping band in the form of straps, shoelaces, or a decorative band, each of which extend across the vamp of the shoe;
the releasable clasp comprises a base in the form of elongated plate having a length exceeding its broadest width and a thickness that does not exceed its average width; and,
wherein the base has an anchoring section defined by a portion of the elongated plate that is spaced apart and adapted to extend underneath at least portion of a gapping band to position the accessory to the elongate structure via the releasable clasp and pressure between the gapping band and the vamp of the shoe. 7. The accessory and attachment combination of claim 6 further comprising:
an attachment section defined by a portion of the base and through which the base can extend; and,
at least one attachment structure fixed to the back side of the accessory that provides at least a portion of the loop band and arranged for attachment to the base to provide at least a portion of a rotational element that fixes the accessory to the base in at least two rotational orientations of the principal axis relative to the base. 8. The accessory and attachment combination of claim 6 wherein the plate defines at least two anchoring sections that are spaced apart along its length and the plate and each anchoring section defines a hole for passing a shoelace therethrough. 9. The accessory and attachment combination of claim 8 wherein the plate defines at least two anchoring sections spaced apart over its length and arranged to extend under gapping bands that comprise two spaced apart hook and loop straps that extend across the vamp of the shoe or two distinct portions of a shoelace that extends across the vamp of the shoe. 10. The accessory and attachment combination of claim 6 wherein the releasable clasp includes the base and a retaining bar that extends parallel to the plate and is fixed to the plate by a connecting section that joins the plate and provides the retaining bar and the retaining bar and/or the connection section has sufficient resiliency to allow separation of the plate and bar to provide a temporary gap suitable to receive a gapping band. 11. The accessory and attachment combination of claim 10 wherein:
the connection section comprises a strut that connects the plate to the bar, the strut provides, at least in part, resiliency to the plate and bar to provide the temporary gap, or the strut provides a hinge positioned at a common end of the plate and the bar and the upper bar and the lower bar are adapted to provide the releasable clasp. 12. The accessory and attachment combination of claim 7 wherein the rotational element comprises a pivot structure, the base and the accessory are fixed to the pivot structure and wherein the pivot structure can position the accessory and base in a first rotational position and second rotational position distinct from the first rotational position. 13. The accessory and attachment combination of claim 12 wherein the pivot structure comprises an upper stop structure fixed with respect to the accessory and a lower stop structure located on or about the attachment section;
the upper and lower stop structures cooperate with each other to adjustably fix the accessory to the base and to provide the first and second rotational positions. 14. The accessory and attachment combination of claim 11 wherein the plate has a lower locking section and the bar has an upper retaining section and the upper and lower locking section cooperate to inhibit movement of the bar away from the plate when engaged. 15. An accessory and attachment combination to attach the accessory to an elongate structure comprising:
an accessory; an elongate strap affixed to the accessory; a first joinable element located at a first section of the strap; and, a second joinable element spaced apart from the first joinable element and adapted for engagement with the first joinable element: wherein the spacing between the first joinable element and the second joinable element provides sufficient strap length for the strap to encircle and fix the accessory to the elongate structure by engagement of the first joinable element and the second joinable element. 16. The accessory and attachment combination of claim 15 wherein the first joinable element comprises the hook portion of a hook and loop arrangement and the second joinable element comprises the loop portion of a hook and loop arrangement. 17. The accessory and attachment combination of claim 16 wherein an adhesive or stitching extends transversely to the strap and fixes the strap to the accessory at a tying section; the hook portion is located proximate to one end of the strap and the loop portion is located proximate to the opposite end of the strap: and the hook and loop portion are located on opposite sides of the strap. 18. The accessory and attachment of combination of claim 15 wherein the strap comprises an elastic material. 19. The accessory and attachment combination of claim 16 wherein the strap is affixed to the accessory at two tying sections each located proximate an edge of the strap with each tying section on an opposite side of the strap relative to the other; most of the strap length is located to one side of the tying sections to form a short segment and a long segment of the strap; the hook portion of the strap is located proximate to the end of the long section of the strap; the loop portion is located on the opposite side of the strap relative to the hook portion; the loop portion covers at least a quarter of the length of the long segment of the strap; and the hook portion of the strap is adapted to slide below the short section of the strap and above the accessory at a location between the two tying sections for engagement of a loop portion located on the long segment of the strap. 20. An accessory and attachment combination to attach the accessory to an elongate structure comprising:
an accessory; an elongate strap affixed to the accessory at two tying sections; a hook portion of a hook and loop arrangement located on a first section of the strap; a loop portion of a hook and loop arrangement located on a second section of the strap, located on an opposite side of the strap with respect to the hook portion and spaced apart from the hook portion by a sufficient strap length for the strap to encircle and fix the accessory to the elongate structure by engagement of the hook and loop attachment; each of the tying sections is located proximate an edge of the strap with each tying section on an opposite side of the strap relative to the other and the tying section located such that most of the strap length is located to one side of the tying sections to form a short segment and a long segment of the strap; the hook portion of the strap is located proximate to the end of the long section of the strap; the loop portion covers at least a quarter of the length of the long segment of the strap; and, the hook portion of the strap is adapted to slide below the short section of the strap and above the accessory at a location between the two tying sections for engagement of a loop portion located on the long segment of the strap.
| 3,700
|
338,094
| 16,799,738
| 3,732
|
A method of generating receiving a valid domain name comprises evaluating a received valid domain name in a neural network trained to generate similar domain names, and providing an output comprising at least one domain name similar to the received valid domain name generated by the neural network. In a further example, a recurrent neural network is trained using valid domain names and observed malicious similar domain names and/or linguistic rules. In another example, the output of the recurrent neural network further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name, such that the similarity score can be used to generate a ranked list of domain names similar to the valid domain name.
|
1. A method of generating similar domain names using machine learning, comprising:
receiving a valid domain name; evaluating the received valid domain name in a neural network trained to generate similar domain names; and providing an output comprising at least one domain name similar to the received valid domain name generated by the neural network. 2. The method of generating similar domain names using machine learning of claim 1, wherein the neural network is trained using valid domain names and observed malicious similar domain names. 3. The method of generating similar domain names using machine learning of claim 1, wherein the neural network is trained using linguistic rules. 4. The method of generating similar domain names using machine learning of claim 1, wherein providing an output further comprises providing a ranked list of domain names similar to the received valid domain name. 5. The method of generating similar domain names using machine learning of claim 1, further comprising registering at least one of the at least one output domain names similar to the received valid domain name. 6. The method of generating similar domain names using machine learning of claim 1, further comprising indicating which of the at least one output domain names are registered. 7. The method of generating similar domain names using machine learning of claim 1, the neural network comprising a recurrent neural network using a bidirectional encoder and a unidirectional decoder. 8. The method of generating similar domain names using machine learning of claim 1, wherein the output of the neural network further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name. 9. The method of generating similar domain names using machine learning of claim 8, further comprising using the similarity score of two or more generated similar domain names to generate a ranked list of domain names similar to the valid domain name. 10. A method of training a neural network to generate similar domain names, comprising:
receiving a valid domain name and a similar domain name; evaluating the received valid domain name in a neural network and observing an output of the neural network; and if the similar domain name and the observed output of the neural network differ, modifying at least one parameter of the neural network to generate an output more similar to similar domain name than the observed output of the neural network. 11. The method of training a neural network to generate similar domain names of claim 10, further comprising using linguistic rules to train the neural network. 12. The method of training a neural network to generate similar domain names of claim 10, wherein the output of the neural network further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name. 13. The method of training a neural network to generate similar domain names of claim 10, the neural network comprising a bidirectional encoder and a unidirectional decoder. 14. The method of training a neural network to generate similar domain names of claim 10, wherein the neural network comprises a plurality of Long Short Term Memory (LSTM) nodes. 15. The method of training a neural network to generate similar domain names of claim 10, wherein the neural network comprises a plurality of Gated Recurrent Units (GRUs). 16. A method of generating similar domain names using machine learning, comprising:
receiving a valid domain name; evaluating the received valid domain name in a machine learning system trained to generate similar domain names; and providing an output comprising at least one domain name similar to the received valid domain name generated by the machine learning system. 17. The method of generating similar domain names using machine learning of claim 16, wherein the machine learning system is trained using valid domain names and observed malicious similar domain names. 18. The method of generating similar domain names using machine learning of claim 16, wherein the machine learning is trained using linguistic rules. 19. The method of generating similar domain names using machine learning of claim 16, wherein providing an output further comprises providing a ranked list of domain names similar to the received valid domain name. 20. The method of generating similar domain names using machine learning of claim 16, wherein the output of the machine learning system further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name.
|
A method of generating receiving a valid domain name comprises evaluating a received valid domain name in a neural network trained to generate similar domain names, and providing an output comprising at least one domain name similar to the received valid domain name generated by the neural network. In a further example, a recurrent neural network is trained using valid domain names and observed malicious similar domain names and/or linguistic rules. In another example, the output of the recurrent neural network further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name, such that the similarity score can be used to generate a ranked list of domain names similar to the valid domain name.1. A method of generating similar domain names using machine learning, comprising:
receiving a valid domain name; evaluating the received valid domain name in a neural network trained to generate similar domain names; and providing an output comprising at least one domain name similar to the received valid domain name generated by the neural network. 2. The method of generating similar domain names using machine learning of claim 1, wherein the neural network is trained using valid domain names and observed malicious similar domain names. 3. The method of generating similar domain names using machine learning of claim 1, wherein the neural network is trained using linguistic rules. 4. The method of generating similar domain names using machine learning of claim 1, wherein providing an output further comprises providing a ranked list of domain names similar to the received valid domain name. 5. The method of generating similar domain names using machine learning of claim 1, further comprising registering at least one of the at least one output domain names similar to the received valid domain name. 6. The method of generating similar domain names using machine learning of claim 1, further comprising indicating which of the at least one output domain names are registered. 7. The method of generating similar domain names using machine learning of claim 1, the neural network comprising a recurrent neural network using a bidirectional encoder and a unidirectional decoder. 8. The method of generating similar domain names using machine learning of claim 1, wherein the output of the neural network further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name. 9. The method of generating similar domain names using machine learning of claim 8, further comprising using the similarity score of two or more generated similar domain names to generate a ranked list of domain names similar to the valid domain name. 10. A method of training a neural network to generate similar domain names, comprising:
receiving a valid domain name and a similar domain name; evaluating the received valid domain name in a neural network and observing an output of the neural network; and if the similar domain name and the observed output of the neural network differ, modifying at least one parameter of the neural network to generate an output more similar to similar domain name than the observed output of the neural network. 11. The method of training a neural network to generate similar domain names of claim 10, further comprising using linguistic rules to train the neural network. 12. The method of training a neural network to generate similar domain names of claim 10, wherein the output of the neural network further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name. 13. The method of training a neural network to generate similar domain names of claim 10, the neural network comprising a bidirectional encoder and a unidirectional decoder. 14. The method of training a neural network to generate similar domain names of claim 10, wherein the neural network comprises a plurality of Long Short Term Memory (LSTM) nodes. 15. The method of training a neural network to generate similar domain names of claim 10, wherein the neural network comprises a plurality of Gated Recurrent Units (GRUs). 16. A method of generating similar domain names using machine learning, comprising:
receiving a valid domain name; evaluating the received valid domain name in a machine learning system trained to generate similar domain names; and providing an output comprising at least one domain name similar to the received valid domain name generated by the machine learning system. 17. The method of generating similar domain names using machine learning of claim 16, wherein the machine learning system is trained using valid domain names and observed malicious similar domain names. 18. The method of generating similar domain names using machine learning of claim 16, wherein the machine learning is trained using linguistic rules. 19. The method of generating similar domain names using machine learning of claim 16, wherein providing an output further comprises providing a ranked list of domain names similar to the received valid domain name. 20. The method of generating similar domain names using machine learning of claim 16, wherein the output of the machine learning system further comprises a similarity score reflecting a degree of similarity between the valid domain name and the similar domain name.
| 3,700
|
338,095
| 16,799,735
| 3,732
|
Holographic polymer dispersed liquid crystal material systems in accordance with various embodiments of the invention are illustrated. One embodiment includes a holographic polymer dispersed liquid crystal formulation, including monomers, photoinitiators, and a liquid crystal mixture including terphenyl compounds and non-terphenyl compounds, the liquid crystal mixture having a ratio of at least 1:10 by weight percentage of the terphenyl compounds to the non-terphenyl compounds, wherein the photoinitiators are configured to facilitate a photopolymerization induced phase separation process of the monomers and the liquid crystal mixture. In another embodiment, the liquid crystal mixture further includes pyrimidine compounds, and wherein the liquid crystal mixture has a ratio of at least 1:10 by weight percentage of the terphenyl compounds and pyrimidine compounds to the non-terphenyl compounds. In a further embodiment, the ratio of the terphenyl compounds to the non-terphenyl compounds is at least 1.5:10.
|
1. A holographic polymer dispersed liquid crystal formulation, comprising:
monomers; photoinitiators; and a liquid crystal mixture comprising terphenyl compounds and non-terphenyl compounds, said liquid crystal mixture having a ratio of at least 1:10 by weight percentage of said terphenyl compounds to said non-terphenyl compounds; wherein said photoinitiators are configured to facilitate a photopolymerization induced phase separation process of said monomers and said liquid crystal mixture. 2. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said liquid crystal mixture further comprises pyrimidine compounds, and wherein said liquid crystal mixture has a ratio of at least 1:10 by weight percentage of said terphenyl compounds and pyrimidine compounds to said non-terphenyl compounds. 3. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1.5:10. 4. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1:5. 5. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said terphenyl compounds comprise a compound selected from the group consisting of:
fluoro-terphenyl compounds, cyano-terphenyl compounds, and alkyl, alkoxy, thiocyanate, and isothiocyanate substituents thereof. 6. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said non-terphenyl compounds comprise a compound selected from the group consisting of: cyanobiphenyl compounds, phenyl ester compounds, cyclohexyl compounds, and biphenyl ester compounds. 7. The holographic polymer dispersed liquid crystal formulation of claim 1, further comprising an additive selected from group consisting of: nanoparticles, low-functionality monomers, additives for reducing switching voltage, additives for reducing switching time, additives for increasing refractive index modulation, and additives for reducing haze. 8. A holographic polymer dispersed liquid crystal formulation, comprising:
monomers; photoinitiators; and a liquid crystal mixture comprising higher-index liquid crystal compounds having an ordinary refractive index at 550 nm and at 25 degrees Celsius of 1.7 or more and other liquid crystal compounds having an ordinary refractive index at 550 nm and at 25 degrees Celsius of less than 1.7, said liquid crystal mixture having a ratio of at least 1:10 by weight percentage of said higher-index liquid crystal compounds to said other liquid crystal compounds; wherein said photoinitiators is configured to facilitate a photopolymerization induced phase separation process of said monomers and said liquid crystal mixture. 9. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said ratio of said higher-index liquid crystal compounds to said other liquid crystal compounds is at least 1.5:10. 10. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said ratio of said higher-index liquid crystal compounds to said other liquid crystal compounds is at least 1:5. 11. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said higher-index liquid crystal compounds comprise a compound selected from the group consisting of: substituted terphenyl compounds, substituted pyrimidine compounds, substituted tolane compounds, and alkyl, alkoxy, thiocyanate, and isothiocyanate substituents thereof. 12. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said other liquid crystal compounds comprise a compound selected from the group consisting of: biphenyl compounds, cyanobiphenyl compounds, phenyl ester compounds, and biphenyl ester compounds. 13. The holographic polymer dispersed liquid crystal formulation of claim 8, further comprising an additive selected from group consisting of: nanoparticles, low-functionality monomers, additives for reducing switching voltage, additives for reducing switching time, additives for increasing refractive index modulation, and additives for reducing haze. 14. A method for forming a holographic optical element, the method comprising:
providing a first transparent substrate; depositing a layer of optical recording material onto said first substrate, wherein said layer of optical recording material comprises a liquid crystal mixture comprising terphenyl compounds and non-terphenyl compounds, said liquid crystal mixture having a ratio of at least 1:10 by weight percentage of said terphenyl compounds to said non-terphenyl compounds; placing a second transparent substrate onto said deposited layer of optical recording material; exposing said layer of optical recording material using at least one recording beam; and forming a waveguide having at least one grating structure within said layer of optical recording material. 15. The method of claim 14, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1.5:10. 16. The method of claim 14, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1:5. 17. The method of claim 14, wherein said terphenyl compounds comprise a compound selected from the group consisting of: fluoro, cyano, thiocyanate, and isothiocyanate substituted phenyl compounds. 18. The method of claim 14, wherein said non-terphenyl compounds comprise a compound selected from the group consisting of: cyanobiphenyl compounds, phenyl ester compounds, and biphenyl ester compounds. 19. The method of claim 14, wherein said layer of optical recording material further comprises an additive selected from group consisting of: nanoparticles, low-functionality monomers, additives for reducing switching voltage, additives for reducing switching time, additives for increasing refractive index modulation, and additives for reducing haze. 20. The method of claim 14, wherein said terphenyl compounds have an ordinary refractive index at 550 nm and at 25 degrees Celsius of 1.7 or more; and said non-terphenyl compounds have an ordinary refractive index at 550 nm and at 25 degrees Celsius of less than 1.7.
|
Holographic polymer dispersed liquid crystal material systems in accordance with various embodiments of the invention are illustrated. One embodiment includes a holographic polymer dispersed liquid crystal formulation, including monomers, photoinitiators, and a liquid crystal mixture including terphenyl compounds and non-terphenyl compounds, the liquid crystal mixture having a ratio of at least 1:10 by weight percentage of the terphenyl compounds to the non-terphenyl compounds, wherein the photoinitiators are configured to facilitate a photopolymerization induced phase separation process of the monomers and the liquid crystal mixture. In another embodiment, the liquid crystal mixture further includes pyrimidine compounds, and wherein the liquid crystal mixture has a ratio of at least 1:10 by weight percentage of the terphenyl compounds and pyrimidine compounds to the non-terphenyl compounds. In a further embodiment, the ratio of the terphenyl compounds to the non-terphenyl compounds is at least 1.5:10.1. A holographic polymer dispersed liquid crystal formulation, comprising:
monomers; photoinitiators; and a liquid crystal mixture comprising terphenyl compounds and non-terphenyl compounds, said liquid crystal mixture having a ratio of at least 1:10 by weight percentage of said terphenyl compounds to said non-terphenyl compounds; wherein said photoinitiators are configured to facilitate a photopolymerization induced phase separation process of said monomers and said liquid crystal mixture. 2. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said liquid crystal mixture further comprises pyrimidine compounds, and wherein said liquid crystal mixture has a ratio of at least 1:10 by weight percentage of said terphenyl compounds and pyrimidine compounds to said non-terphenyl compounds. 3. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1.5:10. 4. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1:5. 5. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said terphenyl compounds comprise a compound selected from the group consisting of:
fluoro-terphenyl compounds, cyano-terphenyl compounds, and alkyl, alkoxy, thiocyanate, and isothiocyanate substituents thereof. 6. The holographic polymer dispersed liquid crystal formulation of claim 1, wherein said non-terphenyl compounds comprise a compound selected from the group consisting of: cyanobiphenyl compounds, phenyl ester compounds, cyclohexyl compounds, and biphenyl ester compounds. 7. The holographic polymer dispersed liquid crystal formulation of claim 1, further comprising an additive selected from group consisting of: nanoparticles, low-functionality monomers, additives for reducing switching voltage, additives for reducing switching time, additives for increasing refractive index modulation, and additives for reducing haze. 8. A holographic polymer dispersed liquid crystal formulation, comprising:
monomers; photoinitiators; and a liquid crystal mixture comprising higher-index liquid crystal compounds having an ordinary refractive index at 550 nm and at 25 degrees Celsius of 1.7 or more and other liquid crystal compounds having an ordinary refractive index at 550 nm and at 25 degrees Celsius of less than 1.7, said liquid crystal mixture having a ratio of at least 1:10 by weight percentage of said higher-index liquid crystal compounds to said other liquid crystal compounds; wherein said photoinitiators is configured to facilitate a photopolymerization induced phase separation process of said monomers and said liquid crystal mixture. 9. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said ratio of said higher-index liquid crystal compounds to said other liquid crystal compounds is at least 1.5:10. 10. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said ratio of said higher-index liquid crystal compounds to said other liquid crystal compounds is at least 1:5. 11. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said higher-index liquid crystal compounds comprise a compound selected from the group consisting of: substituted terphenyl compounds, substituted pyrimidine compounds, substituted tolane compounds, and alkyl, alkoxy, thiocyanate, and isothiocyanate substituents thereof. 12. The holographic polymer dispersed liquid crystal formulation of claim 8, wherein said other liquid crystal compounds comprise a compound selected from the group consisting of: biphenyl compounds, cyanobiphenyl compounds, phenyl ester compounds, and biphenyl ester compounds. 13. The holographic polymer dispersed liquid crystal formulation of claim 8, further comprising an additive selected from group consisting of: nanoparticles, low-functionality monomers, additives for reducing switching voltage, additives for reducing switching time, additives for increasing refractive index modulation, and additives for reducing haze. 14. A method for forming a holographic optical element, the method comprising:
providing a first transparent substrate; depositing a layer of optical recording material onto said first substrate, wherein said layer of optical recording material comprises a liquid crystal mixture comprising terphenyl compounds and non-terphenyl compounds, said liquid crystal mixture having a ratio of at least 1:10 by weight percentage of said terphenyl compounds to said non-terphenyl compounds; placing a second transparent substrate onto said deposited layer of optical recording material; exposing said layer of optical recording material using at least one recording beam; and forming a waveguide having at least one grating structure within said layer of optical recording material. 15. The method of claim 14, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1.5:10. 16. The method of claim 14, wherein said ratio of said terphenyl compounds to said non-terphenyl compounds is at least 1:5. 17. The method of claim 14, wherein said terphenyl compounds comprise a compound selected from the group consisting of: fluoro, cyano, thiocyanate, and isothiocyanate substituted phenyl compounds. 18. The method of claim 14, wherein said non-terphenyl compounds comprise a compound selected from the group consisting of: cyanobiphenyl compounds, phenyl ester compounds, and biphenyl ester compounds. 19. The method of claim 14, wherein said layer of optical recording material further comprises an additive selected from group consisting of: nanoparticles, low-functionality monomers, additives for reducing switching voltage, additives for reducing switching time, additives for increasing refractive index modulation, and additives for reducing haze. 20. The method of claim 14, wherein said terphenyl compounds have an ordinary refractive index at 550 nm and at 25 degrees Celsius of 1.7 or more; and said non-terphenyl compounds have an ordinary refractive index at 550 nm and at 25 degrees Celsius of less than 1.7.
| 3,700
|
338,096
| 16,799,737
| 3,732
|
Disclosed herein is an action robot including a figure including an authentication memory in which identification information is stored and a base configured to output an action using the figure when the figure is mounted. The base includes a figure driver configured to drive the figure such that the figure outputs a predetermined action, a communication transceiver configured to establish connection with a management server for performing authentication of the mounted figure, a figure authenticator configured to acquire the identification information stored in the authentication memory when the figure is mounted, and a processor configured to control the communication transceiver to transmit the acquired identification information to the management server.
|
1. An action robot comprising:
a figure including an authentication memory in which identification information is stored; and a base configured to output an action using the figure when the figure is mounted, wherein the base includes: a figure driver configured to drive the figure such that the figure outputs a predetermined action; a communication transceiver configured to establish connection with a management server for performing authentication of the mounted figure; a figure authenticator configured to acquire the identification information stored in the authentication memory when the figure is mounted; and a processor configured to control the communication transceiver to transmit the acquired identification information to the management server. 2. The action robot of claim 1, wherein the processor:
receives a control signal related to an authentication result of the figure from the management server through the communication transceiver, and determines whether an action is output using the figure based on the received control signal. 3. The action robot of claim 2, wherein the processor prevents driving of the figure based on the received control signal when authentication of the figure by the management server has failed. 4. The action robot of claim 2, wherein the processor controls the figure driver to output an action using the figure when authentication of the figure by the management server has succeeded. 5. The action robot of claim 4, further comprising an output interface configured to output content data,
wherein the processor controls the figure driver based on action control data corresponding to the content data. 6. The action robot of claim 5, wherein the content data and the action control data are received from a server or a terminal connected through the communication transceiver. 7. The action robot of claim 1, further comprising a memory configured to store the identification information of the base,
wherein the processor transmits the identification information of the figure and the identification information of the base to the management server. 8. The action robot of claim 1, wherein the processor recognizes a type of the figure or authenticates compatibility of the figure, based on authentication data stored in a memory and the acquired identification information. 9. The action robot of claim 1,
wherein the figure authenticator includes a near field communication (NFC) reader, and wherein the authentication memory includes an NFC tag. 10. A management server connected to an action robot including a figure configured to output an action and a base configured to drive the figure, the management server comprising:
a communication transceiver configured to receive first identification information of the figure from the action robot; and a processor configured to: perform authentication of the figure based on the received first identification information and user information received from a terminal, and transmit a control signal for activating or deactivating driving of the figure to the action robot based on an result of performing authentication of the figure. 11. The management server of claim 10, wherein the processor:
further receives second identification information of the base from the action robot, determines whether the received first identification information is present in a database, receives the user information from a terminal matching the second identification information when the first identification information is present in the database, and performs authentication of the figure depending on whether the received user information matches user information matching the first identification information. 12. The management server of claim 11, wherein the processor:
transmits a control signal for activating driving of the figure to the action robot when the received user information matches the user information matching the first identification information, and transmits a control signal for deactivating driving of the figure to the action robot when the received user information does not match the user information matching the first identification information. 13. The management server of claim 11, wherein the processor:
transmits authentication success notification to the terminal when the received user information matches the user information matching the first identification information, and transmits authentication failure notification to the terminal when the received user information does not match the user information matching the first identification information. 14. The management server of claim 11, wherein the processor:
transmits a user information request to a terminal matching the second identification information when the first identification information is not present in the database, and stores the user information received from the terminal and the first identification information in the database. 15. A method of authenticating an action robot including a figure configured to output an action and a base configured to drive the figure, the method comprising:
by a management server connected to the action robot, receiving first identification information of the figure and second identification information of the base from the action robot; receiving user information from a terminal matching the second identification information when the first identification information is present in a database; performing authentication of the figure depending on whether the received user information matches user information matching the first identification information; and activating or deactivating driving of the figure mounted on the base based on a result of performing authentication of the figure. 16. The method of claim 15, wherein the performing of the authentication includes:
recognizing authentication success when the received user information matches user information matching the first identification information, and recognizing authentication failure when the received user information does not match the user information matching the first identification information. 17. The method of claim 16, wherein the activating or deactivating of the driving of the figure includes:
transmitting a control signal for activating driving of the robot to the action robot at the time of authentication success, and transmitting a control signal for deactivating driving of the robot to the action robot at the time of authentication failure. 18. The method of claim 15, further comprising:
receiving user information from a terminal matching the second identification information when the first identification information is not present in the database; and storing the received user information and the first identification information in the database.
|
Disclosed herein is an action robot including a figure including an authentication memory in which identification information is stored and a base configured to output an action using the figure when the figure is mounted. The base includes a figure driver configured to drive the figure such that the figure outputs a predetermined action, a communication transceiver configured to establish connection with a management server for performing authentication of the mounted figure, a figure authenticator configured to acquire the identification information stored in the authentication memory when the figure is mounted, and a processor configured to control the communication transceiver to transmit the acquired identification information to the management server.1. An action robot comprising:
a figure including an authentication memory in which identification information is stored; and a base configured to output an action using the figure when the figure is mounted, wherein the base includes: a figure driver configured to drive the figure such that the figure outputs a predetermined action; a communication transceiver configured to establish connection with a management server for performing authentication of the mounted figure; a figure authenticator configured to acquire the identification information stored in the authentication memory when the figure is mounted; and a processor configured to control the communication transceiver to transmit the acquired identification information to the management server. 2. The action robot of claim 1, wherein the processor:
receives a control signal related to an authentication result of the figure from the management server through the communication transceiver, and determines whether an action is output using the figure based on the received control signal. 3. The action robot of claim 2, wherein the processor prevents driving of the figure based on the received control signal when authentication of the figure by the management server has failed. 4. The action robot of claim 2, wherein the processor controls the figure driver to output an action using the figure when authentication of the figure by the management server has succeeded. 5. The action robot of claim 4, further comprising an output interface configured to output content data,
wherein the processor controls the figure driver based on action control data corresponding to the content data. 6. The action robot of claim 5, wherein the content data and the action control data are received from a server or a terminal connected through the communication transceiver. 7. The action robot of claim 1, further comprising a memory configured to store the identification information of the base,
wherein the processor transmits the identification information of the figure and the identification information of the base to the management server. 8. The action robot of claim 1, wherein the processor recognizes a type of the figure or authenticates compatibility of the figure, based on authentication data stored in a memory and the acquired identification information. 9. The action robot of claim 1,
wherein the figure authenticator includes a near field communication (NFC) reader, and wherein the authentication memory includes an NFC tag. 10. A management server connected to an action robot including a figure configured to output an action and a base configured to drive the figure, the management server comprising:
a communication transceiver configured to receive first identification information of the figure from the action robot; and a processor configured to: perform authentication of the figure based on the received first identification information and user information received from a terminal, and transmit a control signal for activating or deactivating driving of the figure to the action robot based on an result of performing authentication of the figure. 11. The management server of claim 10, wherein the processor:
further receives second identification information of the base from the action robot, determines whether the received first identification information is present in a database, receives the user information from a terminal matching the second identification information when the first identification information is present in the database, and performs authentication of the figure depending on whether the received user information matches user information matching the first identification information. 12. The management server of claim 11, wherein the processor:
transmits a control signal for activating driving of the figure to the action robot when the received user information matches the user information matching the first identification information, and transmits a control signal for deactivating driving of the figure to the action robot when the received user information does not match the user information matching the first identification information. 13. The management server of claim 11, wherein the processor:
transmits authentication success notification to the terminal when the received user information matches the user information matching the first identification information, and transmits authentication failure notification to the terminal when the received user information does not match the user information matching the first identification information. 14. The management server of claim 11, wherein the processor:
transmits a user information request to a terminal matching the second identification information when the first identification information is not present in the database, and stores the user information received from the terminal and the first identification information in the database. 15. A method of authenticating an action robot including a figure configured to output an action and a base configured to drive the figure, the method comprising:
by a management server connected to the action robot, receiving first identification information of the figure and second identification information of the base from the action robot; receiving user information from a terminal matching the second identification information when the first identification information is present in a database; performing authentication of the figure depending on whether the received user information matches user information matching the first identification information; and activating or deactivating driving of the figure mounted on the base based on a result of performing authentication of the figure. 16. The method of claim 15, wherein the performing of the authentication includes:
recognizing authentication success when the received user information matches user information matching the first identification information, and recognizing authentication failure when the received user information does not match the user information matching the first identification information. 17. The method of claim 16, wherein the activating or deactivating of the driving of the figure includes:
transmitting a control signal for activating driving of the robot to the action robot at the time of authentication success, and transmitting a control signal for deactivating driving of the robot to the action robot at the time of authentication failure. 18. The method of claim 15, further comprising:
receiving user information from a terminal matching the second identification information when the first identification information is not present in the database; and storing the received user information and the first identification information in the database.
| 3,700
|
338,097
| 16,799,726
| 3,732
|
A system and method for web filtering, including: generating an institutional policy dashboard that enables an institution that issued a computing device to a minor user to select a set of institutional web access policies sanctioned by the institution; generating a parental policy dashboard that enables a parent of the minor user to select to a set of parental web access policies sanctioned by the parent; filtering web content accessed by the minor user via the computing device by enforcing the parental and the institutional web access policies; and reporting to the parent a set of web accesses undertaken by the minor user via the computing device.
|
1. A web filtering mechanism, comprising:
a computer having a processor, memory and a plurality of instructions configured to: select, using an institutional policy dashboard, a set of institutional web access policies sanctioned by the institution for a computing device of a minor user; select, using a parental policy dashboard, a set of parental web access policies sanctioned by a parent of the minor user; filter, using a web filter, a piece of web content accessed by the minor user via the computing device by enforcing the set of parental and institutional web access policies for the computing device; and detect, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 2. The web filtering mechanism of claim 1, wherein the computer is further configured to provide a current geographic location of the computing device to the web filter such that the web filter adapts the parental web access policies and the institutional web access policies to the current geographic location. 3. The web filtering mechanism of claim 2, wherein the computer is further configured to determine the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 4. The web filtering mechanism of claim 2, wherein the computer is further configured to record a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution. 5. The web filtering mechanism of claim 4, wherein the computer is further configured to generate an activity report for the parent in response to each web access and the geographic location recorded in the activity log. 6. A method for web filtering, comprising:
providing a set of institutional web access policies sanctioned by the institution for a computing device of a minor user and a set of parental web access policies sanctioned by a parent of the minor user; receiving an access to a piece of web content by the minor user using the computing device; filtering, using a web filter, the piece of web by enforcing the set of parental and institutional web access policies for the computing device; and detect, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 7. The method of claim 6 further comprising providing a current geographic location of the computing device to the web filter and adapting the parental web access policies and the institutional web access policies to the current geographic location. 8. The method of claim 7 further comprising determining the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 9. The method of claim 7 further comprising recording a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution. 10. The method of claim 9 further comprising generating an activity report for the parent in response to each web access and the geographic location recorded in the activity log. 11. A web filtering mechanism, comprising:
a computer having a processor, memory and a plurality of instructions configured to: provide a set of institutional web access policies sanctioned by the institution for a computing device of a minor user and a set of parental web access policies sanctioned by a parent of the minor user; filter, using a web filter, a piece of web content accessed by the minor user via the computing device by enforcing the set of parental and institutional web access policies for the computing device; receive a current geographic location of the computing device; and adapt the set of parental and institutional web access policies for the computing device to the current geographic location. 12. The web filtering mechanism of claim 11, wherein the computer is further configured to determine the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 13. The web filtering mechanism of claim 11, wherein the computer is further configured to select a set of institutional web access policies sanctioned by the institution for the computing device of the minor user and select, using a parental policy dashboard, a set of parental web access policies sanctioned by a parent of the minor user and detect, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 14. The web filtering mechanism of claim 11, wherein the computer is further configured to record a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution. 15. The web filtering mechanism of claim 14, wherein the computer is further configured to generate an activity report for the parent in response to each web access and the geographic location recorded in the activity log. 16. A web filtering method, comprising:
providing a set of institutional web access policies sanctioned by the institution for a computing device of a minor user and a set of parental web access policies sanctioned by a parent of the minor user; filtering, using a web filter, a piece of web content accessed by the minor user via the computing device by enforcing the set of parental and institutional web access policies for the computing device; receiving a current geographic location of the computing device; and adapting the set of parental and institutional web access policies for the computing device to the current geographic location. 17. The method of claim 16 further comprising determining the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 18. The method of claim 16 further comprising selecting a set of institutional web access policies sanctioned by the institution for the computing device of the minor user and selecting, using a parental policy dashboard, a set of parental web access policies sanctioned by a parent of the minor user and detecting, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 19. The method of claim 16 further comprising enabling the parent to establish a trust relationship by logging in using a set of credentials issued to the minor user by the institution and sending a respective email to the minor user and the parent and the institution in response to a login by the parent. 20. The method of claim 16 further comprising recording a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution.
|
A system and method for web filtering, including: generating an institutional policy dashboard that enables an institution that issued a computing device to a minor user to select a set of institutional web access policies sanctioned by the institution; generating a parental policy dashboard that enables a parent of the minor user to select to a set of parental web access policies sanctioned by the parent; filtering web content accessed by the minor user via the computing device by enforcing the parental and the institutional web access policies; and reporting to the parent a set of web accesses undertaken by the minor user via the computing device.1. A web filtering mechanism, comprising:
a computer having a processor, memory and a plurality of instructions configured to: select, using an institutional policy dashboard, a set of institutional web access policies sanctioned by the institution for a computing device of a minor user; select, using a parental policy dashboard, a set of parental web access policies sanctioned by a parent of the minor user; filter, using a web filter, a piece of web content accessed by the minor user via the computing device by enforcing the set of parental and institutional web access policies for the computing device; and detect, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 2. The web filtering mechanism of claim 1, wherein the computer is further configured to provide a current geographic location of the computing device to the web filter such that the web filter adapts the parental web access policies and the institutional web access policies to the current geographic location. 3. The web filtering mechanism of claim 2, wherein the computer is further configured to determine the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 4. The web filtering mechanism of claim 2, wherein the computer is further configured to record a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution. 5. The web filtering mechanism of claim 4, wherein the computer is further configured to generate an activity report for the parent in response to each web access and the geographic location recorded in the activity log. 6. A method for web filtering, comprising:
providing a set of institutional web access policies sanctioned by the institution for a computing device of a minor user and a set of parental web access policies sanctioned by a parent of the minor user; receiving an access to a piece of web content by the minor user using the computing device; filtering, using a web filter, the piece of web by enforcing the set of parental and institutional web access policies for the computing device; and detect, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 7. The method of claim 6 further comprising providing a current geographic location of the computing device to the web filter and adapting the parental web access policies and the institutional web access policies to the current geographic location. 8. The method of claim 7 further comprising determining the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 9. The method of claim 7 further comprising recording a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution. 10. The method of claim 9 further comprising generating an activity report for the parent in response to each web access and the geographic location recorded in the activity log. 11. A web filtering mechanism, comprising:
a computer having a processor, memory and a plurality of instructions configured to: provide a set of institutional web access policies sanctioned by the institution for a computing device of a minor user and a set of parental web access policies sanctioned by a parent of the minor user; filter, using a web filter, a piece of web content accessed by the minor user via the computing device by enforcing the set of parental and institutional web access policies for the computing device; receive a current geographic location of the computing device; and adapt the set of parental and institutional web access policies for the computing device to the current geographic location. 12. The web filtering mechanism of claim 11, wherein the computer is further configured to determine the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 13. The web filtering mechanism of claim 11, wherein the computer is further configured to select a set of institutional web access policies sanctioned by the institution for the computing device of the minor user and select, using a parental policy dashboard, a set of parental web access policies sanctioned by a parent of the minor user and detect, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 14. The web filtering mechanism of claim 11, wherein the computer is further configured to record a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution. 15. The web filtering mechanism of claim 14, wherein the computer is further configured to generate an activity report for the parent in response to each web access and the geographic location recorded in the activity log. 16. A web filtering method, comprising:
providing a set of institutional web access policies sanctioned by the institution for a computing device of a minor user and a set of parental web access policies sanctioned by a parent of the minor user; filtering, using a web filter, a piece of web content accessed by the minor user via the computing device by enforcing the set of parental and institutional web access policies for the computing device; receiving a current geographic location of the computing device; and adapting the set of parental and institutional web access policies for the computing device to the current geographic location. 17. The method of claim 16 further comprising determining the current geographic location using one of an IP address of the computing device, a web-based geo-location service and a GPS device in the computing device. 18. The method of claim 16 further comprising selecting a set of institutional web access policies sanctioned by the institution for the computing device of the minor user and selecting, using a parental policy dashboard, a set of parental web access policies sanctioned by a parent of the minor user and detecting, by an urgency module, a potential for harm to the minor user by examining a set of text of the piece of web content. 19. The method of claim 16 further comprising enabling the parent to establish a trust relationship by logging in using a set of credentials issued to the minor user by the institution and sending a respective email to the minor user and the parent and the institution in response to a login by the parent. 20. The method of claim 16 further comprising recording a geographic location for each web access undertaken by the minor user using the computing device when outside of the institution.
| 3,700
|
338,098
| 16,799,632
| 3,732
|
Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for secure multi-party computation. One of the methods includes identifying a trusted input data item that is homomorphically encrypted; generating a message authentication code (MAC) key share; generating a MAC share associated with the trusted input data item, wherein the MAC share is a random number; generating a ciphertext based on the trusted input data item, the MAC key share, and the MAC share; sending the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and after the multi-party computation is completed by the plurality of computing devices, verifying a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item.
|
1. A computer-implemented method for preventing misrepresentation of input data in a multi-party computation involving a plurality of computing devices, the method comprising:
identifying, by a first computing device from the plurality of computing devices, a trusted input data item that is homomorphically encrypted, wherein the trusted input data item corresponds to a secret input data item associated with a second computing device from the plurality of computing devices that is different than the first computing device, wherein the second computing device is associated with an owner of the secret input data item, and wherein the first computing device is associated with a different party that is not the owner of the secret input data item; generating, by the first computing device, a trusted message authentication code (MAC) share associated with the trusted input data item; generating, by the first computing device, a MAC key share associated with the first computing device, wherein the MAC key share is a random number; generating, by the first computing device, a ciphertext based at least in part on the MAC key share, the trusted input data item and the trusted MAC share; sending, by the first computing device, the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and after the multi-party computation is completed by the plurality of computing devices, verifying, by the first computing device, a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item. 2. The method of claim 1, wherein the trusted input data item is received by the first computing device from a trusted data source. 3. The method of claim 2, wherein the trusted data source is a blockchain. 4. (canceled) 5. The method of claim 1, wherein the MAC share associated with the secret input data item is generated based on the ciphertext, a MAC key share associated with the second computing device, the secret input data item, and a secret key configured to decrypt the secret input data item. 6. The method of claim 1, further comprising, before verifying the multi-party computation, performing the multi-party computation according to a Smart-Pastro-Damgård-Zakarias (SPDZ) protocol, and wherein verifying the result of the multi-party computation is performed according to the SPDZ protocol. 7. The method of claim 1, wherein an operation performed by the multi-party computation is an addition operation, wherein a result r of the multi-party computation is determined according to the equation:
r=z 1 +z 2 + . . . z n 8. The method of claim 7, wherein shares of the MAC result M(r) are computed based on MAC shares of input data by the plurality of computing devices. 9. The method of claim 1, wherein the trusted MAC share is a random number. 10. A non-transitory, computer-readable storage medium storing one or more instructions executable by a computer system to perform operations for preventing misrepresentation of input data in a multi-party computation involving a plurality of computing devices, the operations comprising:
identifying, by a first computing device from the plurality of computing devices, a trusted input data item that is homomorphically encrypted, wherein the trusted input data item corresponds to a secret input data item associated with a second computing device from the plurality of computing devices that is different than the first computing device, wherein the second computing device is associated with an owner of the secret input data item, and wherein the first computing device is associated with a different party that is not the owner of the secret input data item; generating, by the first computing device, a trusted message authentication code (MAC) share associated with the trusted input data item; generating, by the first computing device, a MAC key share associated with the first computing device, wherein the MAC key share is a random number; generating, by the first computing device, a ciphertext based at least in part on the MAC key share, the trusted input data item and the trusted MAC share; sending, by the first computing device, the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and after the multi-party computation is completed by the plurality of computing devices, verifying, by the first computing device, a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item. 11. The non-transitory, computer-readable storage medium of claim 10, wherein the trusted input data item is received by the first computing device from a trusted data source. 12. The non-transitory, computer-readable storage medium of claim 11, wherein the trusted data source is a blockchain. 13. (canceled) 14. The non-transitory, computer-readable storage medium of claim 10, wherein the MAC share associated with the secret input data item is generated based on the ciphertext, a MAC key share associated with the second computing device, the secret input data item, and a secret key configured to decrypt the secret input data item. 15. The non-transitory, computer-readable storage medium of claim 10, the operations further comprising:
before verifying the multi-party computation, performing the multi-party computation according to a Smart-Pastro-Damgård-Zakarias (SPDZ) protocol, and wherein verifying the result of the multi-party computation is performed according to the SPDZ protocol. 16. The non-transitory, computer-readable storage medium of claim 10,
wherein an operation performed by the multi-party computation is an addition operation, wherein a result r of the multi-party computation is determined according to the equation:
r=z 1 +z 2 + . . . z n
and wherein a MAC result M(r) of the multi-party computation is determined according to the equation:
M(r)=M(z 1)+M(z 2)+ . . . M(z n). 17. The non-transitory, computer-readable storage medium of claim 16, wherein shares of the MAC result M(r) are computed based on MAC shares of input data by the plurality of computing devices. 18. The non-transitory, computer-readable storage medium of claim 10, wherein the trusted MAC share is a random number. 19. A computer-implemented system, comprising:
one or more computing devices; and one or more computer memory devices interoperably coupled with the one or more computing devices and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computing devices, perform one or more operations for preventing misrepresentation of input data in a multi-party computation involving a plurality of computing devices, the operations comprising:
identifying, by a first computing device from the plurality of computing devices, a trusted input data item that is homomorphically encrypted, wherein the trusted input data item corresponds to a secret input data item associated with a second computing device from the plurality of computing devices that is different than the first computing device, wherein the second computing device is associated with an owner of the secret input data item, and wherein the first computing device is associated with a different party that is not the owner of the secret input data item;
generating, by the first computing device, a trusted message authentication code (MAC) share associated with the trusted input data item;
generating, by the first computing device, a MAC key share associated with the first computing device, wherein the MAC key share is a random number;
generating, by the first computing device, a ciphertext based at least in part on the MAC key share, the trusted input data item and the trusted MAC share;
sending, by the first computing device, the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and
after the multi-party computation is completed by the plurality of computing devices, verifying, by the first computing device, a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item. 20. The computer-implemented system of claim 19, wherein the trusted input data item is received by the first computing device from a trusted data source. 21. The computer-implemented system of claim 20, wherein the trusted data source is a blockchain. 22. (canceled) 23. The computer-implemented system of claim 19, wherein the MAC share associated with the secret input data item is generated based on the ciphertext, a MAC key share associated with the second computing device, the secret input data item, and a secret key configured to decrypt the secret input data item. 24. The computer-implemented system of claim 19, the operations further comprising:
before verifying the multi-party computation, performing the multi-party computation according to a Smart-Pastro-Damgård-Zakarias (SPDZ) protocol, and wherein verifying the result of the multi-party computation is performed according to the SPDZ protocol. 25. The computer-implemented system of claim 19, wherein an operation performed by the multi-party computation is an addition operation, wherein a result r of the multi-party computation is determined according to the equation:
r=z 1 +z 2 + . . . z n and wherein a MAC result M(r) of the multi-party computation is determined according to the equation:
M(r)=M(z 1)+M(z 2)+ . . . M(z n). 26. The computer-implemented system of claim 25, wherein shares of the MAC result M(r) are computed based on MAC shares of input data by the plurality of computing devices. 27. The computer-implemented system of claim 19, wherein the trusted MAC share is a random number.
|
Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for secure multi-party computation. One of the methods includes identifying a trusted input data item that is homomorphically encrypted; generating a message authentication code (MAC) key share; generating a MAC share associated with the trusted input data item, wherein the MAC share is a random number; generating a ciphertext based on the trusted input data item, the MAC key share, and the MAC share; sending the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and after the multi-party computation is completed by the plurality of computing devices, verifying a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item.1. A computer-implemented method for preventing misrepresentation of input data in a multi-party computation involving a plurality of computing devices, the method comprising:
identifying, by a first computing device from the plurality of computing devices, a trusted input data item that is homomorphically encrypted, wherein the trusted input data item corresponds to a secret input data item associated with a second computing device from the plurality of computing devices that is different than the first computing device, wherein the second computing device is associated with an owner of the secret input data item, and wherein the first computing device is associated with a different party that is not the owner of the secret input data item; generating, by the first computing device, a trusted message authentication code (MAC) share associated with the trusted input data item; generating, by the first computing device, a MAC key share associated with the first computing device, wherein the MAC key share is a random number; generating, by the first computing device, a ciphertext based at least in part on the MAC key share, the trusted input data item and the trusted MAC share; sending, by the first computing device, the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and after the multi-party computation is completed by the plurality of computing devices, verifying, by the first computing device, a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item. 2. The method of claim 1, wherein the trusted input data item is received by the first computing device from a trusted data source. 3. The method of claim 2, wherein the trusted data source is a blockchain. 4. (canceled) 5. The method of claim 1, wherein the MAC share associated with the secret input data item is generated based on the ciphertext, a MAC key share associated with the second computing device, the secret input data item, and a secret key configured to decrypt the secret input data item. 6. The method of claim 1, further comprising, before verifying the multi-party computation, performing the multi-party computation according to a Smart-Pastro-Damgård-Zakarias (SPDZ) protocol, and wherein verifying the result of the multi-party computation is performed according to the SPDZ protocol. 7. The method of claim 1, wherein an operation performed by the multi-party computation is an addition operation, wherein a result r of the multi-party computation is determined according to the equation:
r=z 1 +z 2 + . . . z n 8. The method of claim 7, wherein shares of the MAC result M(r) are computed based on MAC shares of input data by the plurality of computing devices. 9. The method of claim 1, wherein the trusted MAC share is a random number. 10. A non-transitory, computer-readable storage medium storing one or more instructions executable by a computer system to perform operations for preventing misrepresentation of input data in a multi-party computation involving a plurality of computing devices, the operations comprising:
identifying, by a first computing device from the plurality of computing devices, a trusted input data item that is homomorphically encrypted, wherein the trusted input data item corresponds to a secret input data item associated with a second computing device from the plurality of computing devices that is different than the first computing device, wherein the second computing device is associated with an owner of the secret input data item, and wherein the first computing device is associated with a different party that is not the owner of the secret input data item; generating, by the first computing device, a trusted message authentication code (MAC) share associated with the trusted input data item; generating, by the first computing device, a MAC key share associated with the first computing device, wherein the MAC key share is a random number; generating, by the first computing device, a ciphertext based at least in part on the MAC key share, the trusted input data item and the trusted MAC share; sending, by the first computing device, the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and after the multi-party computation is completed by the plurality of computing devices, verifying, by the first computing device, a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item. 11. The non-transitory, computer-readable storage medium of claim 10, wherein the trusted input data item is received by the first computing device from a trusted data source. 12. The non-transitory, computer-readable storage medium of claim 11, wherein the trusted data source is a blockchain. 13. (canceled) 14. The non-transitory, computer-readable storage medium of claim 10, wherein the MAC share associated with the secret input data item is generated based on the ciphertext, a MAC key share associated with the second computing device, the secret input data item, and a secret key configured to decrypt the secret input data item. 15. The non-transitory, computer-readable storage medium of claim 10, the operations further comprising:
before verifying the multi-party computation, performing the multi-party computation according to a Smart-Pastro-Damgård-Zakarias (SPDZ) protocol, and wherein verifying the result of the multi-party computation is performed according to the SPDZ protocol. 16. The non-transitory, computer-readable storage medium of claim 10,
wherein an operation performed by the multi-party computation is an addition operation, wherein a result r of the multi-party computation is determined according to the equation:
r=z 1 +z 2 + . . . z n
and wherein a MAC result M(r) of the multi-party computation is determined according to the equation:
M(r)=M(z 1)+M(z 2)+ . . . M(z n). 17. The non-transitory, computer-readable storage medium of claim 16, wherein shares of the MAC result M(r) are computed based on MAC shares of input data by the plurality of computing devices. 18. The non-transitory, computer-readable storage medium of claim 10, wherein the trusted MAC share is a random number. 19. A computer-implemented system, comprising:
one or more computing devices; and one or more computer memory devices interoperably coupled with the one or more computing devices and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computing devices, perform one or more operations for preventing misrepresentation of input data in a multi-party computation involving a plurality of computing devices, the operations comprising:
identifying, by a first computing device from the plurality of computing devices, a trusted input data item that is homomorphically encrypted, wherein the trusted input data item corresponds to a secret input data item associated with a second computing device from the plurality of computing devices that is different than the first computing device, wherein the second computing device is associated with an owner of the secret input data item, and wherein the first computing device is associated with a different party that is not the owner of the secret input data item;
generating, by the first computing device, a trusted message authentication code (MAC) share associated with the trusted input data item;
generating, by the first computing device, a MAC key share associated with the first computing device, wherein the MAC key share is a random number;
generating, by the first computing device, a ciphertext based at least in part on the MAC key share, the trusted input data item and the trusted MAC share;
sending, by the first computing device, the ciphertext to the second computing device, wherein the second computing device uses the ciphertext as a component of a MAC share associated with the secret input data item; and
after the multi-party computation is completed by the plurality of computing devices, verifying, by the first computing device, a result of the multi-party computation based at least in part on the MAC share associated with the secret input data item. 20. The computer-implemented system of claim 19, wherein the trusted input data item is received by the first computing device from a trusted data source. 21. The computer-implemented system of claim 20, wherein the trusted data source is a blockchain. 22. (canceled) 23. The computer-implemented system of claim 19, wherein the MAC share associated with the secret input data item is generated based on the ciphertext, a MAC key share associated with the second computing device, the secret input data item, and a secret key configured to decrypt the secret input data item. 24. The computer-implemented system of claim 19, the operations further comprising:
before verifying the multi-party computation, performing the multi-party computation according to a Smart-Pastro-Damgård-Zakarias (SPDZ) protocol, and wherein verifying the result of the multi-party computation is performed according to the SPDZ protocol. 25. The computer-implemented system of claim 19, wherein an operation performed by the multi-party computation is an addition operation, wherein a result r of the multi-party computation is determined according to the equation:
r=z 1 +z 2 + . . . z n and wherein a MAC result M(r) of the multi-party computation is determined according to the equation:
M(r)=M(z 1)+M(z 2)+ . . . M(z n). 26. The computer-implemented system of claim 25, wherein shares of the MAC result M(r) are computed based on MAC shares of input data by the plurality of computing devices. 27. The computer-implemented system of claim 19, wherein the trusted MAC share is a random number.
| 3,700
|
338,099
| 16,799,752
| 2,848
|
A guarded coaxial cable assembly including at least a pair of conductors, one or more rails, and a jacket covering these parts such as a first rail extending alongside two nearby conductors, the rail and the conductors embedded in an outer electrically insulating jacket, the outer jacket having a pair of generally opposed bearing surfaces for bearing transverse loads, the rail operative to reduce outer jacket deformations resulting from transverse loads applied to the bearing surfaces; and, the orientation of the rail and the conductors within the outer jacket operative to limit conductor or conductor jacket deformations resulting from transverse loads applied to the bearing surfaces.
|
1. An assembly including a guarded cable comprising:
a first metallic rail extending alongside an electrical conductor surrounded by an electrically insulating jacket; the rail and the insulated conductor covered by an outer electrically insulating jacket; the outer jacket having a generally rectangular cross-section with a wide by narrow dimension and a pair of generally opposed wide bearing surfaces for bearing transverse loads; the rail operative to reduce outer jacket deformations resulting from transverse loads applied to the bearing surfaces; an orientation of the rail and the conductor within the outer jacket operative to limit conductor or conductor jacket deformation resulting from a transverse load applied to the bearing surfaces; and, the assembly capable of 90-degree bends about the wide jacket dimension as when the assembly is passed between a closed sliding sash and a mating U shaped jamb. 2. The assembly of claim 1 wherein the bearing surfaces include opposed planes. 3. The assembly of claim 1 wherein the bearing surfaces are described by parallel planes. 4. The assembly of claim 3 wherein the parallel planes are about 3 mm apart. 5. The assembly of claim 1 wherein the conductor is included in a twisted pair of conductors. 6. The assembly of claim 5 further comprising:
a total of 2 or more twisted pairs of conductors between the first rail and a second rail. 7. The assembly of claim 1 wherein a fluid jacket material fills in around the rail to form the outer jacket. 8. The assembly of claim 4 further comprising:
a rail diameter equal to or less than a conductor jacket diameter. 9. The assembly of claim 4 further comprising:
a rail diameter equal to or less than a conductor diameter. 10. The assembly of claim 6 wherein pairs of conductors are suited for interconnection with an RJ45 or CAT 5 connector. 11. An assembly including a guarded cable comprising:
rails of metal and conductor pairs, the pairs in side by side arrangement between the rails and each conductor surrounded an electrically insulating jacket; the rails and pairs in an outer jacket having a generally rectangular cross-section with a wide dimension and a narrow dimension; the conductors protected from opposing forces bearing on wide dimension bearing surfaces and passing through the narrow dimension by orientation of the rails and pairs within the outer jacket; and, the assembly capable of 90-degree bends when passing through a U shaped window jamb for receiving a window sash wherein a sash edge and floor of the U shaped window jamb impose the opposing forces on the bearing surfaces when mated. 12. The assembly of claim 11 wherein bending is facilitated by an outer jacket narrow dimension of about 2 mm to 6 mm. 13. The assembly of claim 11 wherein bending is facilitated by an outer jacket narrow dimension of about 3 mm. 14. The assembly of claim 12 wherein the bending is facilitated by an outer jacket wide dimension of about 11 mm to 21 mm. 15. The assembly of claim 12 wherein the bending is facilitated by an outer jacket wide dimension of about 16 mm. 16. The assembly of claim 11 wherein bending is facilitated by the pairs suited to interconnection with RJ45 or CAT 5 connectors. 17. The assembly of claim 11 wherein:
bending is facilitated by an outer jacket narrow dimension of about 2 mm to 6 mm and an outer jacket wide dimension of about 11 mm to 21 mm; and,
the rails transport electrical power or electrical signals.
|
A guarded coaxial cable assembly including at least a pair of conductors, one or more rails, and a jacket covering these parts such as a first rail extending alongside two nearby conductors, the rail and the conductors embedded in an outer electrically insulating jacket, the outer jacket having a pair of generally opposed bearing surfaces for bearing transverse loads, the rail operative to reduce outer jacket deformations resulting from transverse loads applied to the bearing surfaces; and, the orientation of the rail and the conductors within the outer jacket operative to limit conductor or conductor jacket deformations resulting from transverse loads applied to the bearing surfaces.1. An assembly including a guarded cable comprising:
a first metallic rail extending alongside an electrical conductor surrounded by an electrically insulating jacket; the rail and the insulated conductor covered by an outer electrically insulating jacket; the outer jacket having a generally rectangular cross-section with a wide by narrow dimension and a pair of generally opposed wide bearing surfaces for bearing transverse loads; the rail operative to reduce outer jacket deformations resulting from transverse loads applied to the bearing surfaces; an orientation of the rail and the conductor within the outer jacket operative to limit conductor or conductor jacket deformation resulting from a transverse load applied to the bearing surfaces; and, the assembly capable of 90-degree bends about the wide jacket dimension as when the assembly is passed between a closed sliding sash and a mating U shaped jamb. 2. The assembly of claim 1 wherein the bearing surfaces include opposed planes. 3. The assembly of claim 1 wherein the bearing surfaces are described by parallel planes. 4. The assembly of claim 3 wherein the parallel planes are about 3 mm apart. 5. The assembly of claim 1 wherein the conductor is included in a twisted pair of conductors. 6. The assembly of claim 5 further comprising:
a total of 2 or more twisted pairs of conductors between the first rail and a second rail. 7. The assembly of claim 1 wherein a fluid jacket material fills in around the rail to form the outer jacket. 8. The assembly of claim 4 further comprising:
a rail diameter equal to or less than a conductor jacket diameter. 9. The assembly of claim 4 further comprising:
a rail diameter equal to or less than a conductor diameter. 10. The assembly of claim 6 wherein pairs of conductors are suited for interconnection with an RJ45 or CAT 5 connector. 11. An assembly including a guarded cable comprising:
rails of metal and conductor pairs, the pairs in side by side arrangement between the rails and each conductor surrounded an electrically insulating jacket; the rails and pairs in an outer jacket having a generally rectangular cross-section with a wide dimension and a narrow dimension; the conductors protected from opposing forces bearing on wide dimension bearing surfaces and passing through the narrow dimension by orientation of the rails and pairs within the outer jacket; and, the assembly capable of 90-degree bends when passing through a U shaped window jamb for receiving a window sash wherein a sash edge and floor of the U shaped window jamb impose the opposing forces on the bearing surfaces when mated. 12. The assembly of claim 11 wherein bending is facilitated by an outer jacket narrow dimension of about 2 mm to 6 mm. 13. The assembly of claim 11 wherein bending is facilitated by an outer jacket narrow dimension of about 3 mm. 14. The assembly of claim 12 wherein the bending is facilitated by an outer jacket wide dimension of about 11 mm to 21 mm. 15. The assembly of claim 12 wherein the bending is facilitated by an outer jacket wide dimension of about 16 mm. 16. The assembly of claim 11 wherein bending is facilitated by the pairs suited to interconnection with RJ45 or CAT 5 connectors. 17. The assembly of claim 11 wherein:
bending is facilitated by an outer jacket narrow dimension of about 2 mm to 6 mm and an outer jacket wide dimension of about 11 mm to 21 mm; and,
the rails transport electrical power or electrical signals.
| 2,800
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.