High temperature robot end effector
    31.
    发明授权
    High temperature robot end effector 有权
    高温机器人端部执行器

    公开(公告)号:US07717481B2

    公开(公告)日:2010-05-18

    申请号:US11968441

    申请日:2008-01-02

    Applicant: Eric Ng

    Inventor: Eric Ng

    CPC classification number: H01L21/67742 H01L21/68707 Y10S414/135 Y10S414/141

    Abstract: A robotic end effector or blade suitable for transferring a substrate in a processing system is provided. In some embodiments, an end effector can include a body having opposing mounting and distal end, the body fabricated from a single mass of ceramic. The body can include a pair of arcuate lips extending upward from an upper surface of the body. Each lip is disposed on a respective finger disposed at the distal end of the body. An arcuate inner wall extends upward from the upper surface at the mounting end of the body. The inner wall and lips define a substrate receiving pocket. A plurality of contact pads extend upward from the upper surface of the body for supporting the substrate thereon. A recess is formed in a bottom surface of the body to accommodate a mounting clamp.

    Abstract translation: 提供了一种适用于在处理系统中转移衬底的机器人末端执行器或刀片。 在一些实施例中,末端执行器可以包括具有相对的安装和远端的主体,主体由单个陶瓷块制成。 身体可以包括从身体的上表面向上延伸的一对弓形嘴唇。 每个唇缘设置在设置在身体的远端的相应手指上。 弧形内壁从主体的安装端的上表面向上延伸。 内壁和唇缘限定了基底接收口袋。 多个接触垫从主体的上表面向上延伸,用于在其上支撑基板。 在本体的底表面上形成一个凹槽以容纳安装夹具。

    Method and apparatus for performing a binary search on an expanded tree
    32.
    发明授权
    Method and apparatus for performing a binary search on an expanded tree 失效
    用于在扩展树上执行二进制搜索的方法和装置

    公开(公告)号:US07610271B2

    公开(公告)日:2009-10-27

    申请号:US10937321

    申请日:2004-09-10

    CPC classification number: G06F17/30985 Y10S707/99933

    Abstract: A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match. The method is also applicable to routing data in an internet router where the routing of data packets depends on address information stored in the table of information.

    Abstract translation: 一种用于搜索电子存储的包括多个表条目的信息表的方法和装置,并且便于表的高速搜索以提供最长匹配条目。 表搜索方法使用至少一个具有包括多个数据条目的信息表的存储器单元。 信息表具有与多个数据条目相关联的多个搜索关键字,并且多个搜索关键字基于每个搜索关键字的前缀长度形成树形结构。 多个搜索键被扩展,使得多个搜索关键字中的每一个具有与其相关联的两个最低级别的搜索关键字,其覆盖树结构的最低级别。 基于搜索值来执行最低级搜索关键字的二进制搜索以确定最长的前缀匹配。 基于所述最长前缀匹配输出所述多个数据条目的数据条目。 该方法还适用于在互联网路由器中路由数据,其中数据分组的路由取决于存储在信息表中的地址信息。

    DEPOSITION ANALYSIS FOR ROBOT MOTION CORRECTION
    33.
    发明申请
    DEPOSITION ANALYSIS FOR ROBOT MOTION CORRECTION 审中-公开
    机器人运动校正的沉积分析

    公开(公告)号:US20080101912A1

    公开(公告)日:2008-05-01

    申请号:US11553113

    申请日:2006-10-26

    Abstract: Methods for correcting motion of a robot are provided in the present invention. In one embodiment, a method for correcting motion of a robot includes transferring a first substrate supported on a robot to a processing position using a robotic motion routine, depositing a material on the first substrate in the processing position, determining an offset between a center of the deposited material and a center of the first substrate, adjusting the robotic motion routine to compensate for the offset. In another embodiment, a processing chamber is provided configured to obtain samples from which motion of a robot operated therein may be corrected to improve substrate placement on a substrate support through analysis of material deposited on the substrate.

    Abstract translation: 在本发明中提供了用于校正机器人运动的方法。 在一个实施例中,一种用于校正机器人运动的方法包括:使用机器人运动程序将支撑在机器人上的第一衬底转移到处理位置,将材料沉积在处理位置的第一衬底上, 沉积材料和第一衬底的中心,调整机器人运动程序以补偿偏移。 在另一个实施例中,提供了一种处理室,其被配置为获得可以通过分析沉积在基板上的材料的方式来校正在其中操作的机器人的运动以便改进衬底支撑件上的衬底放置的样本。

    System and method for personalized text-to-voice synthesis
    34.
    发明申请
    System and method for personalized text-to-voice synthesis 有权
    个性化文字到语音合成的系统和方法

    公开(公告)号:US20060210028A1

    公开(公告)日:2006-09-21

    申请号:US11081939

    申请日:2005-03-16

    Applicant: Eric Ng

    Inventor: Eric Ng

    CPC classification number: H04M1/72552 H04M1/72563 H04M1/72594 H04M2201/39

    Abstract: A communication device and method are provided for audibly outputting a received text message to a user, the text message being received from a sender. A text message to present audibly is received. An output voice to present the text message is retrieved, wherein the output voice is synthesized using predefined voice characteristic information to represent the sender's voice. The output voice is used to audibly present the text message to the user.

    Abstract translation: 提供了一种通信设备和方法,用于将接收到的文本消息可听地输出给用户,该文本消息是从发送者接收的。 接收到可听见的文本消息。 检索用于呈现文本消息的输出语音,其中使用预定义的语音特征信息来合成输出语音以表示发送者的语音。 输出语音用于向用户可听地呈现文本消息。

    Method and apparatus for performing a binary search on an expanded tree

    公开(公告)号:US20050071501A1

    公开(公告)日:2005-03-31

    申请号:US10965074

    申请日:2004-10-15

    CPC classification number: G06F17/30985 Y10S707/99933

    Abstract: A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match. The method is also applicable to routing data in an internet router where the routing of data packets depends on address information stored in the table of information.

Patent Agency Ranking