Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: In an approach for removing tenant initialization check per tenant for compiled code, a processor receives a request to create a tenant. A processor creates the tenant. A processor marks a current thread of the tenant as not eligible to run just-in-time (JIT) code, wherein the marking indicates that when a method is invoked, a non-JIT version of the method is executed. A processor executes initialization of a first class from an optimization list, wherein the optimization list is a configurable list of classes to be initialized prior to running JIT code. A processor determines that class initialization has been executed for all classes on the optimization list. A processor adjusts the marking to indicate that the current thread is eligible to run JIT code and that the tenant may run JIT code that assumes, without checking, that classes on the optimization list are initialized.

Abstract: Techniques for embedded high speed serial interface methods are described herein. The techniques provide an apparatus for link equalization including an equalization control module to determine at least a first coefficient setting and a second coefficient setting at a remote transmitter based on an algorithm. The apparatus also includes a receiver margining module to determine a first margin value to be associated with the first coefficient setting and a second margin value to be associated with the second coefficient setting. The receiver margining module is to further determine if at least the first margin value is higher than the second margin value.

Abstract: A switch mode nucleic acid aptamer probe includes a probe main body, a fluorescence generating unit and a fluorescence quenching unit which are respectively connected to two ends of the probe main body. The probe main body includes a nucleic acid aptamer fragment with a function of specifically recognizing target tumor cell and a nucleic acid fragment linked to the nucleic acid aptamer fragment by a connection fragment with a length of 7˜15 nm so as to form a hairpin structure. The ability of competitive hybridization of the nucleic acid fragment with the nucleic acid aptamer fragment is weaker than that of the target tumor cell. The use of the probe of the invention can be at least one of specific detection of tumor living cell in buffer solution, effective detection of tumor living cell in serum, and real-time fluorescence imaging and intravital detection of tumor in living body.

Abstract: A clamping jig for clamping a test object includes a first clamping member extending in a left-right direction, two second clamping members connected to and extending transversely of the first clamping member and spaced apart from each other in the left-right direction, and a third clamping member connected to and extending transversely of the second clamping members. The third clamping member is movable along the second clamping members in a front-rear direction to adjust a distance between the first and third clamping members. The first, second, and third clamping members are adapted to clamp therebetween the test object.

Abstract: The present invention relates to nucleic acid-based detection field, in particularly to a switchable nucleic acid aptamer probe and use thereof. The switchable nucleic acid aptamer probe includes a probe main body as well as a fluorescence generating unit and a fluorescence quenching unit which are respectively connected to two ends of the probe main body. The probe main body includes a nucleic acid aptamer fragment with a function of specifically recognizing target tumor cell and a nucleic acid fragment partially complemented with the nucleic acid aptamer fragment. The nucleic acid aptamer fragment and the nucleic acid fragment are linked by a connection fragment with a length of 7˜15 nm so as to form a hairpin structure. The ability of competitive hybridization of the nucleic acid fragment with the nucleic acid aptamer fragment is weaker than that of the target tumor cell.

Abstract: A clamping jig for clamping a test object includes a first clamping member extending in a left-right direction, two second clamping members connected to and extending transversely of the first clamping member and spaced apart from each other in the left-right direction, and a third clamping member connected to and extending transversely of the second clamping members. The third clamping member is movable along the second clamping members in a front-rear direction to adjust a distance between the first and third clamping members. The first, second, and third clamping members are adapted to clamp therebetween the test object.

Abstract: A simulation may be performed to assess availability of a service in the event of various types of failures. A specification may describe a behavior to be induced on a machine, and a formula under which availability is to be measured. A controller processes the specification and dispatches a request to induce the behavior to a machine on which the behavior is to be induced. An agent on that machine may look up a routine in a simulation library and may use the routine to induce the behavior. Data, such as performance counter values, are collected before, during, and/or after occurrence of the behavior, and are transmitted back to the controller. A report generator applies the formula contained in the specification to the data received to calculate the availability metric, and produces a report containing that metric.

Abstract: Disclosed is a magnetic circuit for a speaker. The magnetic circuit includes a yoke defining a bottom and a sidewall extending perpendicularly from the bottom, a magnet mounted on the bottom of the yoke, a pole plate mounted on a top of the magnet. The magnet includes a wider portion mounted on the bottom of the yoke and a narrower portion carrying the pole plate.

Abstract: A shared frequency transmitter for use in a network environment where transmitters and receivers of plural radio communication systems in which the same frequency is used exist is disclosed. The shared frequency transmitter includes (a) a communicating unit configured to detect peripheral transmitters existing in a peripheral area, and to exchange information with the detected peripheral transmitters; and (b) a signal generating unit configured to generate a transmit signal by applying an interference cancellation technique based on the information obtained through the exchange of information.

Abstract: A method and a processing device may be provided for creating a shadow database, having a size being approximately a desired percentage of a size of a relational database. Referential integrity of tables of the relational database may be preserved in the created shadow database. A representation of a connected graph may be created, based on a schema description of the relational database, and may be used to find driving tables and related tables of the relational database. Portions of driving tables of the relational database may be copied to corresponding tables of the shadow database and rows of tables of the relational database, related to the copied portions of the driving tables, may be copied to corresponding tables of the shadow database in a number of iterations until the size of the shadow database is approximately the desired percentage of the size of the relational database.

Abstract: Techniques are described herein for determining whether data sets of real information in databases indicate PII information. The data sets are stored in a first table and parsed for keywords related to the names of data items in the sets. The keywords are stored in the second table in a many-to-many relationship with related data items in the first table. The number of times the keywords are parsed from the data items is counted, as well as the number of times each keyword is associated with a PII-designated data item. The counted numbers are then used in analyzing new data sets to identify the likelihood that the new data sets contain any PII data items.

Abstract: To improve the channel capacity of an entire communication system in accordance with transmission quality of the channels of each node. A relay node has: a receiving section that receives a received signal from a source node; a channel estimation section that measures SNR of a backward channel between the source node and the relay node, and SNR of a forward channel between the relay node and a destination node; a relay selecting section that selects, from among a QR-P-ZF method, a QR-P-QR method and a ZF-P-QR method, a relay method of the relay node in accordance with the ratio between the SNRs of the backward and forward channels; a relay signal processing section that multiplies the received signal by a transmission weight matrix corresponding to the selected relay method, and thereby converts the received signal to a relay signal; and a transmitting section that transmits the relay signal to the destination node.

Abstract: A radio communication apparatus for performing transmission and reception based on radio communication includes: a power suppressor for coupling loop interference signal for attenuating signal power of a received signal to suppress the coupling loop interference signal power of the received signal; and a transceiver having a coupling loop interference signal removal function for analog domain and/or a coupling loop interference signal removal function for digital domain, for removing a coupling loop interference signal contained in a signal output from the power suppressor for coupling loop interference signal.

Abstract: A communication node for relaying a signal between a source node and a destination node is disclosed. The communication node includes: a relay signal generation unit configured to generate a transmit signal by reducing, from a receive signal, an interference signal from another communication node and performing a process such that the transmit signal is not received as an interference signal by another communication node.

Abstract: A radio communication apparatus for performing transmission and reception of radio communications simultaneously by using different carrier frequencies for transmission and reception, comprising: a transceiver having a coupling loop interference signal removal function for analog domain and/or a coupling loop interference signal removal function for digital domain, for removing a coupling loop interference signal contained in a signal; and a power suppressor for coupling loop interference signal for attenuating the signal power in order to suppress the coupling loop interference signal power that is contained in the signal.

Abstract: A simulation may be performed to assess availability of a service in the event of various types of failures. A specification may describe a behavior to be induced on a machine, and a formula under which availability is to be measured. A controller processes the specification and dispatches a request to induce the behavior to a machine on which the behavior is to be induced. An agent on that machine may look up a routine in a simulation library and may use the routine to induce the behavior. Data, such as performance counter values, are collected before, during, and/or after occurrence of the behavior, and are transmitted back to the controller. A report generator applies the formula contained in the specification to the data received to calculate the availability metric, and produces a report containing that metric.

Abstract: A method and a processing device may be provided for creating a shadow database, having a size being approximately a desired percentage of a size of a relational database. Referential integrity of tables of the relational database may be preserved in the created shadow database. A representation of a connected graph may be created, based on a schema description of the relational database, and may be used to find driving tables and related tables of the relational database. Portions of driving tables of the relational database may be copied to corresponding tables of the shadow database and rows of tables of the relational database, related to the copied portions of the driving tables, may be copied to corresponding tables of the shadow database in a number of iterations until the size of the shadow database is approximately the desired percentage of the size of the relational database.

Abstract: A communication node that relays signals between a source node and a destination node includes (a) a first unitary matrix calculation unit configured to calculate a first unitary matrix based on a first channel between the source node and the relay node, (b) a second unitary matrix calculation unit configured to calculate a second unitary matrix based on a second channel between the relay node and the destination node, (c) a transformation matrix estimation unit configured to estimate a transformation matrix based on a triangular matrix derived from QR decomposition of the first and/or second channel matrix, (d) a relaying signal generator configured to generates a relaying signal by multiplying a received signal by at least one of the first unitary matrix, the second unitary matrix, and the transformation matrix, and (e) a transmission unit configured to transmit the relaying signal to the destination node.