Abstract: A method of interpreting data in a first version of a data structure, the method comprising determining if the first version of the data structure is different to a currently used version of the data structure; and if the versions are different, then for each field of the currently used version of the data structure, determining if a corresponding field is present in the first version of the data structure; and if not, adding data to the field in the currently used version of the data structure according to interpretation rules.

Abstract: A multi-chip socket including multiple cavities. The multiple cavities include support surfaces. The support surfaces may be disposed at different heights relative to a reference plane. A first thermal interface is to thermally contact a top surface of the first component, and a second thermal interface is to thermally contact a top surface of the second component.

Abstract: Techniques are provided to allow concurrent operation of threads in an operating system that does not support kernel threads. A first process may create a first thread. The first thread may create a second process. The second process is granted access to a portion of the address space of the first thread. Synchronization information is passed between the first thread and the second process over a communications channel.

Abstract: A method of automated security testing includes recording a macro. The recorded macro is played and a web request is intercepted while playing the macro. The web request may be attacked and sent to a web server. A response from the web server based on the web request is received, and the response of the web server is processed to determine any vulnerabilities.

Abstract: A measure of performance may be calculated for a composite cloud service of a particular cloud in a federated cloud environment. A determination may be made as to whether the measure of performance indicates breaching of a performance policy associated with the composite cloud service.

Abstract: Example embodiments relate to providing pixel-based visualizations of time series data using nested helices. In example embodiments, helix portions in the time series data may be identified according to a measured time interval, where each of the helix portions represents the measured time interval in the time series data. A helical time period may then be determined and used as a helical revolution in a helical pixel representation. At this stage, the helical pixel representation may be generated using the helix portions, where proximate helix portions along a common line parallel to an axis of the helical pixel representation are chronologically separated by the helical time period.

Abstract: A method and system for introducing controlled delay of packet processing at a network device using one or more delay loop paths (DLPs). For each packet received at the network device, a determination will be made as to whether or not packet processing should be delayed. If delay is chosen, a DLP will be selected according to a desired delay for the packet. The desired delay value is used to determine a time value and inserts the time value in the DLP ahead of the packet. Upon completion of a DLP delay, a packet will be returned for processing, an additional delay, or some other action. One or more DLPs may be enabled with packet queues, and may be used advantageously by devices, for which in-order processing of packets may be desired or required.

Abstract: Storage apparatus and related methods for managing removable media. A controller is configured to manage the removable media. A user interface is coupled to the controller for displaying errors. When an error displayed on the user interface is selected, the controller causes the user interface to display additional information related to the error from an event log. For example, when the error is selected, a complete error log for an individual error or a screen display showing all current errors, if there are multiple ones, is displayed.

Abstract: Techniques are described for assigning an application thread to a cache. A newly created application thread may be assigned to a plurality of caches. The cache assignment that optimizes performance may be determined. The newly created application thread may be associated with the determined cache.

Abstract: In some embodiments, in a registration process where a user device is registering for access to a network, a public/private key pair may be generated based on a media access control (MAC) address of a user device. The generated public/private key pair may be transmitted to the user device for future access to the network. In some embodiments, where a user device is requesting access to a network, a MAC address embedded in a public key may be utilized to determine whether access to the network should be granted.

Abstract: A message to be signed and a base name point derived from a direct anonymous attestation (DAA) credential may be provided to a device. A signed version of the message and a public key value associated with the base name point may be received in response. Thereafter, the DAA credential may be determined to be valid based on the signed version of the message.

Abstract: Embodiments herein relate to selection of one of first and second links between first and second network devices. The first link is to transmit the traffic between the first and second network devices directly and the second link is to transmit the traffic between the first and second network devices through a network appliance.

Abstract: An apparatus and method unlock a shaft (42, 142) of a unit (24, 124) for rotation in response to a mechanical reaction between the unit (24, 124) and an enclosure (22, 122) receiving the unit (24, 124) when the unit (24, 124) has been sufficiently inserted into the enclosure (22, 122), whereby rotation of the shaft (42, 142) linearly translates a component of the unit (24, 124) into connection with a component of the enclosure (22, 122).

Abstract: One example relates to an optical engine comprising an optical waveguide. The optical waveguide can comprise a total internal reflection (TIR) edge to change direction of an optical light beam to an angle parallel to a top surface and a bottom surface of the optical waveguide. The optical waveguide can also comprise a plurality of aligning holes extending from the top surface to the bottom surface of the optical waveguide. The optical engine can comprise a substantially transparent slab underlying the optical waveguide. The slab can also comprise a micro lens to collimate the optical light beam. The slab can further comprise a plurality of aligning pins extending perpendicular from a top surface and bottom surface of the slab. Each of the plurality of aligning pins can extend through a respective one of the plurality of aligning holes.

Abstract: Packets in an intrusion prevention system are inspected by a deep packet inspection engine. A packet may be queued for transmission onto an output queue and transmitted over a network while deep packet inspection is still being performed on the packet. Such simultaneous inspection processing and transmission may be implemented using two ownership bits for the packet, one to indicate “ownership to process” and one to indicate “ownership to send,” instead of the single ownership bit that is used in conventional systems. Furthermore, the packet may be inspected, queued onto the output queue, and transmitted without making a copy of the packet within the deep packet inspection engine. These techniques enable the inspection latency, and therefore the overall transmission latency, of packets to decrease, thereby improving the overall performance of the intrusion prevent system.

Abstract: One embodiment is a method that uses MapReduce and Relation Valued Functions (RVFs) with parallel processing to search a database and obtain search results.

Abstract: Methods and systems are provided for using keyword preprocessing, Boyer-Moore analysis, and hybrids thereof, in intrusion-prevention systems. In one embodiment, a state-transition table representative of a data pattern is provided. The table has a plurality of states, each having egress events that define transitions to other states. The data pattern is parsed to identify character strings. A subject is received for evaluation, and preprocessed to find any instances of those character strings. A keyword table is populated with the character strings found during preprocessing. While using the table to evaluate the subject, a first state having a first one of the character strings as an egress event is transitioned into. The keyword table is checked for the first character string, and, responsive to finding the first character string in the keyword table, a transition is taken from the first state to the second state.