| Patent application number | Description | Published |
| 20080261400 | POLISHING COMPOSITION, POLISHING METHOD, AND METHOD FOR FORMING COPPER WIRING FOR SEMICONDUCTOR INTEGRATED CIRCUIT - The present invention provides a technique for realizing highly flat surface of a semiconductor integrated circuit employing copper as a wiring metal. | 10-23-2008 |
| 20080272088 | POLISHING COMPOUND AND POLISHING METHOD - To provide a polishing compound that is capable of minimizing formation of scratches on an object to be polished, such as a resin substrate or a metal wiring, and polishing at a high removal rate. To further provide a polishing method that is capable of minimizing formation of scratches on a resin substrate or a metal wiring, and improving the throughput. | 11-06-2008 |
| 20110212621 | ABRASIVE COMPOSITION AND METHOD FOR MANUFACTURING SEMICONDUCTOR INTEGRATED CIRCUIT DEVICE - The present invention relates to a polishing composition used in a step of polishing until a barrier layer adjacent to a copper layer is exposed, in a pattern formation of polishing the copper layer provided on an insulating layer through the barrier layer thereby alternately forming a copper embedded wiring and the insulating layer, the polishing composition including: an alicyclic resin acid; a colloidal silica in which a content thereof in the polishing composition is from 0.1 to 1.5% by mass, an average primary particle size thereof is from 10 to 40 nm, an average secondary particle size thereof is from 30 to 80 nm, and (the average secondary particle size×the content) is in a range of from 10 to 40; and tetramethylammonium ion. | 09-01-2011 |
| Patent application number | Description | Published |
| 20090074161 | TELEPHONE DEVICE - In a telephone device including telephone operation section ( | 03-19-2009 |
| 20100002862 | TELEPHONE RELAY APPARATUS, TELEPHONE RELAY SYSTEM, RECORDING MEDIUM AND DATA PROCESSING METHOD - A telephone relay apparatus stores peripheral telephone numbers of a plurality of peripheral telephone terminals scheduled to be located at the periphery of each specific terminal user. When a line connecting request from an outgoing telephone terminal of an arbitrary telephone outgoing user to a specific telephone terminal is received, connection of a telephone call execution line from the outgoing telephone terminal to the specific telephone terminal is tried. Therefore, when the connection is connected, a telephone call between the telephone outgoing user and the specific terminal user can be immediately made. However, when the telephone call execution line to the specific telephone terminal is not connected, the peripheral telephone terminal is selected in a transfer trying order, and connection of the telephone call execution line is tried with the peripheral telephone numbers in the transfer trying order. | 01-07-2010 |
| 20100008478 | NOTIFICATION APPARATUS, NOTIFICATION SYSTEM, METHOD OF OPERATING NOTIFICATION APPARATUS, AND PROGRAM FOR NOTIFICATION APPARATUS - A management apparatus of a notification system includes an interface unit that communicates with a store terminal used for a predetermined site work process by a site worker and an IP telephone terminal used for IP phone call, which are located at one work site; an accepting unit that accepts an emergency notification to the site worker; a display control unit that displays and outputs the accepted emergency notification on the store terminal via the interface unit; and a calling unit that calls the IP telephone terminal via the interface unit to make the site worker recognize the emergency notification. | 01-14-2010 |
| 20100040223 | TELEPHONE RELAY SYSTEM, TELEPHONE RELAY APPARATUS, RECORDING MEDIUM AND DATA PROCESSING METHOD - When a telephone call line from an outgoing telephone terminal to the specific telephone terminal of a specific terminal user is not opened, the telephone relay apparatus acquires periphery requirement data from user scheduled data about the specific terminal user having a scheduled date matching the present date, and selects a peripheral telephone terminal. Opening of a telephone call line from the outgoing telephone terminal to the selected peripheral telephone terminal is tried, and the outgoing telephone terminal not connected to the specific telephone terminal is connected to the peripheral telephone terminal. Thus, it is possible to increase the possibility that the telephone outgoing user and the specific terminal user can talk to each other between the peripheral telephone terminal and the outgoing telephone terminal. | 02-18-2010 |
| 20110038289 | DATA PROCESSING SYSTEM, CENTRAL MANAGEMENT UNIT THEREOF, COMPUTER PROGRAM THEREOF, AND DATA PROCESSING METHOD - A plurality of data communication terminals having a data display function is individually provided in each of a plurality of locations of use where general users individually check in. A user storage unit stores the user ID data and the location ID data with respect to each general user who has checked in, and a situation storage unit stores user situation data of the general user who has checked in, together with the user ID data. A group identification unit identifies the plurality of general users who have checked in as a group, and a listing display unit causes each of the data communication terminals in the plurality of locations of use where the general users of the group have checked in, to display a listing of at least the user ID data, the location ID data, and the user situation data of another member of the group. Thus, a data processing system is provided that allows the general users of the group, who have individually checked in for the plurality of locations of use, to confirm the situation of another member at a glance. | 02-17-2011 |
| Patent application number | Description | Published |
| 20090187810 | ERROR CORRECTION CODING METHOD AND DEVICE - An error correction coding method using a low-density parity-check code includes: dividing an information bit sequence to be processed for error correction coding, into (m−r) pieces of first blocks each comprising a bit sequence having a length n and r pieces of second blocks comprising respective bit sequences having lengths k | 07-23-2009 |
| 20100153810 | DECODING DEVICE AND RECEIVING DEVICE - A decoding apparatus for low density parity check codes includes a variable-to-check message generator and a check-to-variable message generator. The variable-to-check message generator includes a variable-to-check processing unit block, provided with an adder, and which is arranged between registers corresponding to locations of ‘1’s in a check matrix. The check-to-variable message generator includes a check-to-variable processing unit block, provided with a comparator, between registers corresponding to locations of ‘1’s in the check matrix. The decoding apparatus for low density parity check codes is simple in configuration and is able to perform high speed processing without using RAMs without the necessity of performing complex control operations. | 06-17-2010 |
| 20100251063 | DECODING DEVICE, DATA STORAGE DEVICE, DATA COMMUNICATION SYSTEM, AND DECODING METHOD - A data converting means generates first interim data held in one-to-one correspondence to columns vectors from data stored in a first storage means and data stored in a second storage means. A check node processing means generates second interim data for updating the data stored in the first storage means based on the sum of the first interim data and received data. The data converting means updates the data stored in the second storage means using the first interim data, and updates the data stored in the first storage means using the second interim data generated by the check node processing means. Decoded data are generated by a process carried out by the data converting means and the check node processing means. | 09-30-2010 |
| 20110219286 | DECODING DEVICE, DATA COMMUNICATION APPARATUS HAVING THE DECODER DEVICE, AND DATA MEMORY - A decoding device comprises two check node processing devices of feedback shift register type, each of which node processing includes a plurality of registers and a plurality of comparator circuits. A multiplexer and a demultiplexer switch between the two check node processing devices, and a memory holds the two sorts of data. The comparator circuits are interposed between registers of the check node processing device. | 09-08-2011 |
| Patent application number | Description | Published |
| 20090175287 | Packet switch - A virtual output queuing controlling device in an input buffering switch with a virtual output queuing technique includes a specialized class for CBR traffic, and a connection request generation section that makes a connection request for a switch scheduler, which can execute a three-step priority control. The connection request generation section makes the connection request of the specialized class for CBR traffic prior to the connection request of the other classes for the switch scheduler. | 07-09-2009 |
| 20090282105 | P2P DATA DELIVERY SYSTEM, P2P DATA DELIVERY METHOD AND P2P DATA DELIVERY PROGRAM - Since a shared public data delivery module makes a response to a data query to other data delivery modules or other shared public data delivery modules; or to a query from other data delivery modules or other shared public data delivery modules instead of the data delivery module, the data delivery module needs not to directly make response to the data query, and it is hence possible to reduce load imposed on data delivery modules participating in the P2P data delivery system. For example, for a data request issued from a data delivery module, an adjacent shared public data delivery module acquires data substitutionally; it is hence possible to reduce the transfer network amount between the module having issued the data request and other data delivery modules and between the module having issued the data request and other shared public data delivery modules not adjacent thereto. | 11-12-2009 |
| 20090323695 | TWO-DIMENSIONAL PIPELINED SCHEDULING TECHNIQUE - A scheduler allowing high-speed scheduling scalable with the number of input and output ports of a crosspoint switch and suppressed unfairness among inputs is disclosed. The scheduler includes an M×M matrix of scheduling modules, each of which schedules packet forwarding connections from a corresponding input group of input ports to selected ones of a corresponding output group of output ports based on reservation information. A diagonal modulo pattern is used to determine a set of M scheduling modules to avoid coming into collision with each other. Each determined scheduling module performs reservation of packet forwarding connections based on current reservation information and transfers updated reservation information in row and column directions of the M×M matrix. | 12-31-2009 |
| 20100325157 | SYSTEM FOR GENERATING CHARACTER-STRING MATCHING FINITE AUTOMATION, ITS GENERATING METHOD, AND GENERATING PROGRAM - Disclosed is a system in which Aan NFA conversion meansunit | 12-23-2010 |
| 20110310746 | COMMUNICATION NETWORK MANAGEMENT SYSTEM AND METHOD AND MANAGEMENT COMPUTER - A management computer has: a storage unit in which a route information indicating a transfer route of frames in the communication network is stored; and a monitoring unit. The monitoring unit refers to the route information to transmit a frame to the transfer route and performs identification processing that identifies a location of a failure on the transfer route. First to N-th nodes (N is an integer equal to or more than 3) line up in order along the transfer route. The i-th node (i=1 to N−1) forwards a received frame to the (i+1)-th node, and the N-th node forwards a received frame to the management computer. In the identification processing, the monitoring unit sets at least one node between the first node and the N-th node as an insertion node. Then, the monitoring unit transmits a frame to the insertion node each, and identifies the location of the failure based on reception state of a frame from the N-th node. | 12-22-2011 |
| 20120020219 | Network system and congestion control method - A transmission terminal has a plurality of congestion control units (RPs) each controlling a frame transmission rate. A switch arranged between the transmission terminal and a reception terminal has a plurality of congestion detection units (CPs) each generating a congestion information notification frame addressed to the transmission terminal. A plurality of routes exist between the transmission terminal and the reception terminal. The management computer manages a correspondence relationship between the routes and the RPs, assigns any of the routes to a flow, selects a RP associated with a route assigned to the flow, and notifies the transmission terminal and the switch of the flow and the selected RP. When the switch receives a frame belonging to the flow, a CP associated with the selected RP generates the congestion information notification frame addressed to the selected RP. The transmission terminal transmits a frame belonging to the flow through the selected RP. | 01-26-2012 |
| 20120026891 | Communication network management system and method and management computer - A management computer includes a storage unit in which route information indicating a transfer route of frames in a communication network is stored; and a monitoring unit. First to N-th nodes (N is an integer not less than 2) line up in order along a transfer route. In identifying a location of failure on the transfer route, the monitoring unit transmits a state notification frame to the first node. The i-th node, when receiving the state notification frame, updates a forwarding table by adding the management computer to the forwarding destination and forwards the state notification frame to the (i+1)-th node. The i-th node, when receiving a check frame, forwards the check frame to the (i+1)-th node and the management computer by referring to the post-update forwarding table. The monitoring unit identifies the location of failure based on reception state of the check frame from the transfer route. | 02-02-2012 |
| Patent application number | Description | Published |
| 20090162921 | Method of detoxifying a harmful compound - The detoxification method characterized by comprising converting at least one member selected from the group comprising arsenic, antimony and selenium into a harmless substance produced in a food chain system by using the food chain system. The method of detoxifying a harmful compound as described above is characterized by comprising converting a harmful compound containing at least one element selected from the group comprising arsenic, antimony, and selenium into a harmless substance by using a food chain system containing a larval zooplankton. | 06-25-2009 |
| 20090326313 | Composition for the Alkylation and a Method For Detoxifying a Harmful Compound by Using The Composition - It is an object of the present invention to provide a beneficial composition in order to detoxify the harmful compound containing arsenic etc. effectively and systematically and a method for detoxifying a harmful compound by using the composition. The composition for the alkylation according to the present invention is characterized in that the composition contains a cobalt complex. The method of detoxifying the harmful compound according to the present invention is characterized in that a harmful compound containing at least one element selected from the groups comprising arsenic, antimony and selenium is detoxified by the alkylation of the harmful compound, in the presence of the composition according to the present invention. | 12-31-2009 |
| 20100116090 | METHOD FOR RECOVERING METAL - It is an object of the present invention to make it possible to recover and recycle the rare metals such as gallium and indium safely from the III-V group compound semiconductors. | 05-13-2010 |
| 20100228073 | METHOD OF DETOXIFYING A METHYL COMPOUND - It is an object of the present invention to provide a method of detoxifying a methyl compound comprising arsenic etc., effectively and systematically. The method of detoxifying a methyl compound according to the present invention is characterized in that an organic halogenated compound is reacted with a methyl compound comprising at least one element selected from the groups comprising arsenic, antimony and selenium to convert the methyl compound into more harmless substances. Furthermore, in a preferred embodiment of the method of detoxifying a methyl compound according to the present invention, the method is characterized in that the element is arsenic. | 09-09-2010 |
| Patent application number | Description | Published |
| 20110257778 | METHOD AND DEVICE FOR SIMULATING NC WORKING MACHINE - Even in an uncuttable state in which an actual rotational direction of a main spindle is not matched with an actually cuttable main spindle rotational direction of a tool, an interference check between a workpiece and the tool is performed. Accordingly, the cuttable main spindle rotational direction of the selected tool or the uncuttable main spindle rotational direction is compared with each main spindle rotational direction of a working machine during execution of a simulation, and it is determined whether an interference check between the tool blade edge and the workpiece is necessary on the basis of the comparison result. When it is determined that the interference check is not necessary in the step above, the interference check between the tool blade edge and the workpiece is not performed. When it is determined that the interference check is necessary, the interference check between the tool blade edge and the workpiece is performed. When the interference therebetween is present, abnormality is detected. | 10-20-2011 |
| 20120016507 | PROCESSING SIMULATION METHOD AND APPARATUS, AND PROGRAM MAKING COMPUTER EXECUTE THE METHOD - A processing simulation method and apparatus is provided, which can appropriately detect interference between a tool processing area and a shape model of a material without being affected by the accuracy of expression of a tool movement path and the shape model. A tool shape model for processing a material, that includes a strict tool shape, and a tool shape model for checking interference, that is included in the strict tool shape, are generated by tool model setting unit according to an error range set in consideration of the tool movement path and the expression accuracy of the shape model, and the processed material shape model is generated by generating a tool processing area shape model from the tool movement path during processing feed and the tool shape model for processing the material and removing the tool processing area shape model from the material shape model. The tool processing area shape model is generated from a tool movement path during fast feed and the tool shape model for detecting the interference, and the interference between the tool processing area shape model and the material shape model is detected. | 01-19-2012 |
| 20120029675 | NUMERICAL CONTROL PROGRAMMING METHOD, APPARATUS THEREFOR, AND PROGRAM FOR CAUSING A COMPUTER TO EXECUTE THE METHOD - A level difference or a uncut portion is prevented from being left between adjoining worked regions without forming any useless worked region. A lathe sectional shape forming unit ( | 02-02-2012 |