Abstract: A carrier is provided for a hard drive. The carrier includes a housing that receives a hard drive and a security chip. A locking component secures the hard drive within the housing. Securing the locking component prevents the hard drive from being removed from the housing. A release mechanism releases the locking component. A breaking component is in communication with the release mechanism such that upon actuation of the release mechanism to release the locking component, the breaking component breaks the security chip for the hard drive.

Abstract: A pet stroller with an adjustable structure of strut and canopy includes a pet stroller body, an adjustable supporting frame and an adjustable canopy. The adjustable supporting frame includes two rotation shaft boxes respectively arranged on the inner sides of the folding brace of the two sides of the pet stroller body. Each rotation shaft box includes a canopy strut extended diagonally upwards from the front end thereof and a front window strut extended forward parallelly from the front end thereof. The adjustable canopy covers on the external side of the pet stroller body and corresponds to the adjustable supporting frame, so as to allow the adjustable canopy to be transformed among a covering mode, a front opening mode, and a full-opening mode through adjusting the positions of the canopy strut and the front window strut.

Abstract: A method for behavior rewarding is applied in a rewarding system, which comprises a computer device and a server. The computer device is configured for a user to execute a designated action and communicates with the server. The method comprises the following steps: receiving an execution request of a plurality of designated actions by the computer device, wherein the designated actions at least comprises a special action or a random action; transmitting an execution result of the designated actions from the computer device to the server; and, when determining that the execution result of the designated actions matches the execution request of the designated actions, transmitting a rewarding value corresponding to the designated actions from the server to the computer device. A server and a computer device for executing the method for behavior rewarding are also disclosed.

Abstract: A method for distributing a reward value includes the following steps of: getting a consumption amount spent in a second store by a member of a first store; calculating a reward value by multiplicating a preset ratio with the consumption amount; randomly distributing the reward value into at least two parts of the reward value; and transmitting one of the parts of the reward value to an account of the member. A member computer device applied to the method is also disclosed.

Abstract: A trade reward method includes the following steps of: getting a consumption amount spent in a second store by a member of a first store; calculating a reward value by multiplicating a preset ratio with the consumption amount; and transferring a first part of the reward value to an account of the first store. A server and a store computer device applied with the trade reward method are also provided.

Abstract: A pet stroller with an adjustable structure of strut and canopy includes a pet stroller body, an adjustable supporting frame and an adjustable canopy. The adjustable supporting frame includes two rotation shaft boxes respectively arranged on the inner sides of the folding brace of the two sides of the pet stroller body. Each rotation shaft box includes a canopy strut extended diagonally upwards from the front end thereof and a front window strut extended forward parallelly from the front end thereof. The adjustable canopy covers on the external side of the pet stroller body and corresponds to the adjustable supporting frame, so as to allow the adjustable canopy to be transformed among a covering mode, a front opening mode, and a full-opening mode through adjusting the positions of the canopy strut and the front window strut.

Abstract: Provided is a semiconductor device having dual channels including a first portion and a second portion sharing a buried gate pillar. The buried gate pillar extends from a first surface of a substrate toward a second surface opposite to the first surface. The first portion includes the buried gate pillar, a first gate dielectric layer at a first sidewall of the buried gate pillar and a first doped region set aside the first gate dielectric layer. A first channel is provided in the substrate between the first gate dielectric layer and the first doped region set. The second portion includes the buried gate pillar, a second gate dielectric layer at a second sidewall of the buried gate pillar and a second doped region set aside the second gate dielectric layer. A second channel is provided in the substrate between the second gate dielectric layer and the second doped region set.

Abstract: Provided is a semiconductor device having dual channels including a first portion and a second portion sharing a buried gate pillar. The buried gate pillar extends from a first surface of a substrate toward a second surface opposite to the first surface. The first portion includes the buried gate pillar, a first gate dielectric layer at a first sidewall of the buried gate pillar and a first doped region set aside the first gate dielectric layer. A first channel is provided in the substrate between the first gate dielectric layer and the first doped region set. The second portion includes the buried gate pillar, a second gate dielectric layer at a second sidewall of the buried gate pillar and a second doped region set aside the second gate dielectric layer. A second channel is provided in the substrate between the second gate dielectric layer and the second doped region set.

Abstract: A method of semiconductor processing comprises providing a semiconductor wafer in a processing chamber; feeding at least one tungsten-containing precursor in a gas state into the processing chamber for atomic layer deposition (ALD) of tungsten; feeding at least one reducing chemical in a gas state into the processing chamber; and monitoring a concentration of at least one gaseous byproduct in the chamber; and providing a signal indicating concentration of the at least one gaseous byproduct in the chamber. The byproduct is produced by a reaction between the at least one tungsten-containing precursor and the at least one reducing chemical during the ALD.

Abstract: A method of semiconductor processing comprises providing a semiconductor wafer in a processing chamber; feeding at least one tungsten-containing precursor in a gas state into the processing chamber for atomic layer deposition (ALD) of tungsten; feeding at least one reducing chemical in a gas state into the processing chamber; and monitoring a concentration of at least one gaseous byproduct in the chamber; and providing a signal indicating concentration of the at least one gaseous byproduct in the chamber. The byproduct is produced by a reaction between the at least one tungsten-containing precursor and the at least one reducing chemical during the ALD.

Abstract: A multi-stationed continuous electro-polishing system includes an electrolysis tank, a driving mechanism, electrode plates and a power supply. The electrolysis tank is filled with electrolyzing liquid. The driving mechanism is placed in the electrolysis tank for driving a metal strip into and out of the electrolysis tank. Each of the electrode plates is placed at an adjustable gap from the metal strip in the electrolysis tank. The power supply includes a positive electrode connected to the metal strip and a negative electrode connected to all of the electrode plates.

Abstract: The present invention relates to an error-tolerant language understanding, system and method. The system and the method is using example sentences to provide the clues for detecting and recovering errors. The procedure of detection and recovery is guided by a probabilistic scoring function which integrated the scores from the speech recognizer, concept parser, the scores of concept-bigram and edit operations, such as deleting, inserting and substituting concepts. Meanwhile, the score of edit operations refers the confidence measure achieving more precise detection and recovery of the speech recognition errors. That said, a concept with lower confidence measure tends to be deleted or substituted, while a concept with higher one tends to be retained.

Abstract: A method for named-entity (NE) recognition and verification is provided. The method can extract at least one to-be-tested segments from an article according to a text window, and use a predefined grammar to parse the at least one to-be-tested segments to remove ill-formed ones. Then, a statistical verification model is used to calculate the confidence measurement of each to-be-tested segment to determine where the to-be-tested segment has a named-entity or not. If the confidence measurement is less than a predefined threshold, the to-be-tested segment will be rejected. Otherwise, it will be accepted.

Abstract: The present invention relates to an example-based concept-orietned data extraction method. In an example labeling phase, the exemplary data string is converted into an exemplary token sequence, in which the target concepts and filler concepts are labeled to be tuples for use as an example, and thus an exemplary concept graph is constructed. In the data extraction phase, the untested data string is converted into an untested token sequence to be processed, and, based on the associated concept recognizers defined by the tuples in the example labeling phase, it is able to detect the concept candidates and establish the composite concepts and aggregate concepts, thereby constructing a hypothetical concept graph. After comparing the exemplary concept graph with the hypothetical concept graph, the optimal hypothetical concept sequence in the hypothetical graph is determined, so as to extract the targeted data from the matched target concepts.

Abstract: A method of phrase verification to verify a phrase not only according to its confidence measures but also according to neighboring concepts and their confidence tags. First, an utterance is received, and the received utterance is parsed to find a concept sequence. Subsequently, a plurality of tag sequences corresponding to the concept sequence is produced. Then, a first score of each of the tag sequences is calculated. Finally, the tag sequence of the highest first score is selected as the most probable tag sequence, and the tags contained therein are selected as the most probable confidence tags, respectively corresponding to the concepts in the concept sequence.

Abstract: An adaptor device is developed for attaching to a wrench and for being driven by the wrench, the adaptor device includes an extension for attaching to the wrench, a shank extended from the extension and having an engaging hole to receive a tool member, the shank includes one or more slots to form one or more blades and to retain various tool members in the engaging hole of the shank. A ferrule includes a bore to receive the shank and includes an inclined surface to engage with the blade and to force the blade to engage with and to force against the tool member, or to release the blade from the tool member.

Abstract: The present invention provides a method for text-to-pronunciation conversion capable of increasing the accuracy by re-scoring graphemes likely to be tagged erroneously. Grapheme segmentation and phoneme tagging are first applied to an input word to generate at least one grapheme-phoneme pair sequence, and the score of each grapheme-phoneme pair sequence is also computed. Then, at least one grapheme-phoneme pair sequence having a higher score is selected. For the selected grapheme-phoneme pair sequence that has a grapheme likely to be tagged erroneously, the features in the context of the grapheme are selected and made good use of computing re-score corresponding to the graphemes likely to be tagged erroneously, so as to re-score the grapheme-phoneme pair sequence. Accordingly, the grapheme-phoneme pair sequence with the highest score is the final conversion result.

Abstract: A method of probabilistic error-tolerant natural language understanding. The process of language understanding is divided into a concept parse and a concept sequence comparison steps. The concept parse uses a parse driven by a concept grammar to construct a concept parse forest set by parsing results of speech recognition. The concept sequence comparison uses an error-tolerant interpreter to compare the hypothetical concept sequences included by the concept parse forest set and the exemplary concept sequences included in the database of the system. A most possible concept sequence is found and converted into a semantic framed that expresses the intention of the user. The whole process is led by a probability oriented scoring function. When error occurs in the speech recognition and a correct concept sequence cannot be formed, the position of the error is determined and the error is recovered according to the scoring function to reduce the negative effect.

Abstract: An adaptor device is developed for attaching to a wrench and for being driven by the wrench, the adaptor device includes an extension for attaching to the wrench, a shank extended from the extension and having an engaging hole to receive a tool member, the shank includes one or more slots to form one or more blades and to retain various tool members in the engaging hole of the shank. A ferrule includes a bore to receive the shank and includes an inclined surface to engage with the blade and to force the blade to engage with and to force against the tool member, or to release the blade from the tool member.

Abstract: The present invention relates to an example-based concept-orietned data extraction method. In an example labeling phase, the exemplary data string is converted into an exemplary token sequence, in which the target concepts and filler concepts are labeled to be tuples for use as an example, and thus an exemplary concept graph is constructed. In the data extraction phase, the untested data string is converted into an untested token sequence to be processed, and, based on the associated concept recognizers defined by the tuples in the example labeling phase, it is able to detect the concept candidates and establish the composite concepts and aggregate concepts, thereby constructing a hypothetical concept graph. After comparing the exemplary concept graph with the hypothetical concept graph, the optimal hypothetical concept sequence in the hypothetical graph is determined, so as to extract the targeted data from the matched target concepts.