Abstract: A JTAG standard pin test system is disclosed. In the system, to-be-tested slots are electrically connected to form different to-be-tested series chains, or riser cards which are inserted into the to-be-tested slots are electrically connected to each other through first JTAG input interfaces and first JTAG output interfaces thereof or through second JTAG input interfaces and second JTAG output interfaces thereof, to form different riser-card series chains; a TAP controller provides a JTAG format test signal to a to-be-tested series chain or a riser-card series chain to make a test card perform a JTAG standard pin test, so as to achieve the technical effect of efficiency of providing the JTAG standard pin test for the to-be-tested slots on different to-be-tested boards by a testing machine.

Abstract: A method for the fabrication of p-type Ga2O3 by phosphorus ion implantation, wherein the method comprises: growing gallium oxide epilayer having a predetermined thickness on a substrate by controlling a growth temperature and a growth pressure; and implanting phosphorus ions on the gallium oxide epilayer by providing the phosphorus ion with a predetermined energy, wherein the phosphorus ions were implanted with a predetermined doses and with a predetermined incident angle.

Abstract: A method for customizing an appearance of a merchandise which is suitable for being performed by a computing device in order to customize a customized choice result selected by a user includes a designed image and a merchandise information. The method includes receiving the designed image, receiving the merchandise information, overlappingly displaying the designed image on a virtual merchandise image corresponding to the merchandise information, receiving at least one edit operation for at least one designed element in the designed image, and editing for the designed element in the designed image according to the edit operation and then generating a customizing virtual image. Thereby, the method can be used for customizing an appearance of a merchandise and directly customize the designed image that has been arranged. In addition, a computing device and a non-transitory computer-readable recording medium for customizing the appearance of the merchandise are also provided.

Abstract: A system of performing boundary scan test on pin through test point and a method thereof are disclosed. When an under-test pin of a target connector is determined to be unable to perform a boundary scan test, a test point connected to and closest to the under-test pin is searched, a test signal is transmitted to a target connector, a result signal from the target connector in response to the test signal is received, an expected result and the result signal are compared to generate a test result, so that a boundary scan function can be applied to test a connector of a computer product, to achieve the technical effect of providing a better test range and a better test coverage to improve test efficiency and reduce test cost, compared to conventional boundary scan test.

Abstract: A system of performing boundary scan test on pin through test point and a method thereof are disclosed. When an under-test pin of a target connector is determined to be unable to perform a boundary scan test, a test point connected to and closest to the under-test pin is searched, a test signal is transmitted to a target connector, a result signal from the target connector in response to the test signal is received, an expected result and the result signal are compared to generate a test result, so that a boundary scan function can be applied to test a connector of a computer product, to achieve the technical effect of providing a better test range and a better test coverage to improve test efficiency and reduce test cost, compared to conventional boundary scan test.

Abstract: A test coverage rate improvement system for pins of tested circuit board and a method thereof are disclosed. In the system, partial pins of a circuit board connector in a tested circuit board are not electrically connected to the boundary scan chip, test pins of the test pin board are pressed with the partial pins by a fixture of a boundary scan interconnect testing workstation to electrically connect the test pins to the partial pins. A test access port controller receives a detection signal for detecting the partial pins, which are not electrically connected to the boundary scan chip, of the circuit board connector through the test pin board from the test adapter card, and determines whether conduction is formed based on the detection signal, thereby achieving the technical effect of improving a test coverage rate for the pins of the tested circuit board.

Abstract: A USB type-C adapter board is disclosed. Through a circuit board electrically connected to a USB type-C connector and a JTAG connector, ground pins of the USB type-C connector and the JTAG connector can form a ground net, data output pins of the USB type-C connector and the JTAG connector can form a data output net, data input pins of the USB type-C connector and the JTAG connector can form a data input net, clock pins of the USB type-C connector and the JTAG connector can form a clock net, test mode selection pins of the USB type-C connector and the JTAG connector can form a test mode selection net.

Abstract: A tool for combining common processes shared by at least two or more sub-queries within a query is provided. The tool determines whether one or more sub set relationships are shared between the at least two or more sub-queries. Responsive to a determination that one or more sub set relationships are shared between the at least two or more sub-queries, the tool determines an order class for the at least two or more sub-queries based on the one or more sub set relationships, wherein determining the order class includes transforming the query to include one or more differing aspects within the single shared common process, with the one or more differing aspects arranged based, at least in part, on a query style, a query type, and a query function. Responsive to determining an access path for the query, the tool executes the access path during run-time for data accessing.

Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

Abstract: In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

Abstract: A method, computing system and computer program product are provided. A nested loop join access plan for a query is executed and processed records of a most outer table of a nested loop join that satisfy local predicates are counted. When a count of the processed records is not less than a threshold value, a cost to complete execution of the nested loop join access plan and a cost of executing a new access plan based on recalculated filter factors for local predicates of the query are compared. When the cost to complete is less, execution of the nested loop join access plan is resumed to complete running of the query. When the cost of executing the new access plan is less, the new access plan is executed to rerun the query. A result of the query is provided.

Abstract: In an embodiment of the present invention, a command for performing a database operation with respect to a table of a database is received, whereby the table has a visible key column for identification information and one or more invisible token columns for token information. The user's role from the command is obtained. A record is identified in the table based on a combination of the identification information and the token information corresponding to the user's role. The database operation is performed on the identified record.

Abstract: In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.

Abstract: Embodiments of the present invention provide efficient systems and methods for searching a keyword. Embodiments of the present invention can be used to more quickly and comprehensively search a document for a keyword or phrase, based on the preferences and behaviors of a user, so that the returned results to the user are ranked in order of the preferences of the user. By factoring in user data such as time spent on certain content and highlighted content, the system is able to more efficiently return preferred results of a user of a keyword search.

Abstract: A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator.

Abstract: Aspects include a method that includes receiving a structured query language (SQL) database command at a processing device configured to manage a table space of a relational database, the database command including a merge statement. The method also includes identifying a group of target records from the database command, and associating each target record with one of a plurality of portions of the table space, and in response to determining that the group of target records is associated with more than one portion of the table space, sorting the target records into a plurality of sub-groups, each sub-group associated with a different portion of the table space. The method further includes generating a sub-task associated with each sub-group, the sub-task prescribing aspects of performing the merge operation using an associated sub-group respective sub-group, and performing all of the sub-tasks on the memory space in parallel.

Abstract: Embodiments of the present invention provide efficient systems and methods for searching a keyword. Embodiments of the present invention can be used to more quickly and comprehensively search a document for a keyword or phrase, based on the preferences and behaviors of a user, so that the returned results to the user are ranked in order of the preferences of the user. By factoring in user data such as time spent on certain content and highlighted content, the system is able to more efficiently return preferred results of a user of a keyword search.