Abstract: There is disclosed a fluidfoil comprising a selectively fluid chargeable capillary and a flexible body adjacent the capillary, the shape of the flexible body being adjustable in use via controlling the degree to which the capillary is charged and therefore the forces that the capillary exerts on the flexible body.

Abstract: A bleed valve for a gas turbine engine, the bleed valve comprising: an inlet coupled to an air source; and an outlet coupled to an air sink. The bleed valve also comprises a first stage of flow area modulation between the inlet and the outlet. Also a second stage of flow area modulation between the first stage and the outlet. The pressure can be equalised between the first and second stages. There is also an arrangement comprising a plurality of bleed valves and a controller to control the flow areas of at least one of the first and second stages of each bleed valve.

Abstract: A baby safe trimming tool has a first blade and a second blade being curved as to accommodate the curved nature of human nails. The first blade is connected to a first handle opposite a first spring. The second blade is connected to a second handle opposite a second spring, and is pivotally connected to the first blade, wherein a first cutting edge of the first blade is scissionably aligned with a second cutting edge of the second blade. The first spring engages the second spring to provide a restoring force when the first handle and the second handle are squeezed together. The first handle and the second handle can be outfitted in multiple grip configurations in order to provide enhanced comfort and grip for a user, wherein a grooved grip area or a loop may be provided for either the first handle or the second handle.

Abstract: Disclosed are systems and methods for protecting secret device keys, such as High-bandwidth Digital Content Protection (HDCP) device keys. Instead of storing secret device keys in the plain, a security algorithm and one or more protection keys are stored on the device. The security algorithm is applied to the secret device keys and the one or more protection keys to produce encrypted secret device keys. The encrypted secret device keys are then stored either on chip or off-chip.

Abstract: Disclosed are systems and methods for protecting secret device keys, such as High-bandwidth Digital Content Protection (HDCP) device keys. Instead of storing secret device keys in the plain, a security algorithm and one or more protection keys are stored on the device. The security algorithm is applied to the secret device keys and the one or more protection keys to produce encrypted secret device keys. The encrypted secret device keys are then stored either on chip or off-chip.

Abstract: A method of manufacturing a semiconductor device includes depositing a first capping layer on a dielectric layer. The method also includes etching the first capping layer from a second portion of the semiconductor device. The first capping layer remaining in a first portion of the semiconductor device may form a PMOS device. The method further includes depositing a second capping layer after etching the first capping layer. After the second capping layer is deposited a maskless process results in selectively etching the second capping layer from the first portion of the semiconductor device. The second portion of the semiconductor device may be a NMOS device. The method described may be used in manufacturing integrated CMOS devices as scaling reduces device size. Additionally, the method of selectively etching capping layers may be used to manufacture multi-threshold voltage devices.

Abstract: Systems and methods are provided for providing a quality score associated with an advertisement response to be used to assist in determining the display of the advertisement response on a user interface. Methods include sending a quality score associated with an advertisement response as well as receiving and using a quality score to determine where to display at least a portion of the advertisement response on a user interface.

Abstract: Systems and methods are provided for increasing user response to advertisements. Methods include identifying a base request from an advertisement requester, identifying a first keyword and a second keyword associated with the base request, ranking the first keyword and the second keyword based on a user response history associated with the first keyword and the second keyword, and identifying the higher ranked of the first keyword and the second keyword to be used to dynamically alter the base request.

Abstract: Systems and methods are provided for dynamically backfilling a deficient number of advertisements from an advertisement supplier. In one embodiment, a method includes identifying a first request from an advertisement requester, the first request identifying a desired number of advertisements to receive from a first advertisement supplier; identifying a first fetching period; sending the first request to the first advertisement supplier; monitoring to determine whether the desired number of advertisements from the first advertisement supplier are received within the first fetching period; and if the desired number of advertisements are not received within the first fetching period, performing a backfill mechanism to supply the desired number of advertisements.

Abstract: Systems and methods are provided for dynamically ordering advertisements received from at least one advertisement supplier. In one embodiment, a method includes sending a request to at least a first advertisement supplier; receiving one or more advertisements from the at least first advertisement supplier; identifying a prioritizing parameter associated with each of the one or more advertisements; and dynamically ordering the one or more advertisements from the at least first advertisement supplier into two or more positions of a response based on the prioritizing parameter.

Abstract: Systems and methods are provided for dynamically rotating keywords to be used to alter an advertisement request from an advertisement requester. In one embodiment, a method includes identifying a base request from an advertisement requester; identifying at least two potential keywords associated with the base request; and assigning a usage weight to each of the at least two potential keywords, the usage weight determining a percentage of times that each of the at least two potential keywords should be selected to dynamically alter the base request.

Abstract: Systems and methods are provided for increasing user response to advertisements. Embodiments include an optimization engine configured to identify a request from a requester; identify at least one potential keyword associated with the request; associate the at least one potential keyword with at least one criteria bin; and identify at least one keyword from the at least one criteria bin based on a weight given the at least one criteria bin; and a routing system communicating with the requester and a supplier, the routing system also communicating with the optimization engine, the routing system configured to dynamically alter the base request with the at least one keyword to form an altered request; and send the altered request to the supplier.

Abstract: Methods for fabricating two metal gate stacks for complementary metal oxide semiconductor (CMOS) devices are provided. A common layer, such as a metal layer, a metal alloy layer, or a metal nitride layer may be deposited on to a gate dielectric. A first mask layer may be deposited and patterned over an active region, exposing a portion of the common layer. A first ion may be deposited in the common layer forming a first mask layer. Similarly, a second mask layer may be deposited and patterned over the other active region and the first metal layer, and another portion of the common layer is exposed. A second ion may be deposited in the common layer, forming a second mask layer.

Abstract: Methods for fabricating two metal gate stacks for complementary metal oxide semiconductor (CMOS) devices are provided. A first metal layer may be deposited onto a gate dielectric. Next a mask layer may be deposited on the first metal layer and subsequently etch. The first metal layer is then etched. Without removing the mask layer, a second metal layer may be deposited. In one embodiment, the mask layer is a second metal layer. In other embodiments, the mask layer is a silicon layer. Subsequent fabrication steps include depositing another metal layer (e.g., another PMOS metal layer), depositing a cap, etching the cap to define gate stacks, and simultaneously etching the first and second gate region having a similar thickness with differing metal layers.

Abstract: A network transport layer accelerator accelerates processing of packets so that packets can be forwarded at wire-speed. To accelerate processing of packets, the accelerator performs pre-processing on a network transport layer header encapsulated in a packet for a connection and performs in-line network transport layer checksum insertion prior to transmitting a packet. A timer unit in the accelerator schedules processing of the received packets. The accelerator also includes a free pool allocator which manages buffers for storing the received packets and a packet order unit which synchronizes processing of received packets for a same connection.

Abstract: A method of integrating quantum key distribution (QKD) with Internet protocol security (IPSec) to improve the security of IPSec. Standard IPSec protocols impose limits on the frequency at which keys can be changed. This makes efforts to improve the security of IPSec by employing quantum keys problematic. The method includes increasing the size of the Security Association (SA) Table in a manner that enables a high key change rate so that the quantum keys can be combined with the classical keys generated by Internet Key Exchange (IKE). The invention includes a method of creating the SA Table by combining quantum keys generated by the QKD process with classical keys generated by the IKE process, thereby enabling QKD-based IPSec.

Abstract: An improved content search mechanism uses a graph that includes intelligent nodes avoids the overhead of post processing and improves the overall performance of a content processing application. An intelligent node is similar to a node in a DFA graph but includes a command. The command in the intelligent node allows additional state for the node to be generated and checked. This additional state allows the content search mechanism to traverse the same node with two different interpretations. By generating state for the node, the graph of nodes does not become exponential. It also allows a user function to be called upon reaching a node, which can perform any desired user tasks, including modifying the input data or position.

Abstract: A computer-readable instruction is described for traversing deterministic finite automata (DFA) graphs to perform a pattern search in the in-coming packet data in real-time. The instruction includes one or more pre-defined fields. One of the fields includes a DFA graph identifier for identifying one of several previously-stored DFA graphs. Another one of the fields includes an input reference for identifying input data to be processed using the identified DFA graphs. Yet another one of the fields includes an output reference for storing results generated responsive to the processed input data. The instructions are forwarded to a DFA engine adapted to process the input data using the identified DFA graph and to provide results as instructed by the output reference.

Abstract: A network application executing on a host system provides a list of application buffers in host memory stored in a queue to a network services processor coupled to the host system. The application buffers are used for storing data transferred on a socket established between the network application and a remote network application executing in a remote host system. Using the application buffers, data received by the network services processor over the network is transferred between the network services processor and the application buffers. After the transfer, a completion notification is written to one of the two control queues in the host system. The completion notification includes the size of the data transferred and an identifier associated with the socket. The identifier identifies a thread associated with the transferred data and the location of the data in the host system.