Abstract: The determination of user perceived delay in audio and video conferencing systems/services is described. Example embodiments consistent with the present invention measure delays in audio and/or video conferencing systems and services, by treating such systems and services as black boxes, thereby providing end-to-end delays as they would be perceived by users. For example, the user perceived round-trip delay in a video conference system/service may include time delays from each of video capture, video encoding, video transmission, video decoding and video rendering.

Abstract: An all-photonic method to cause a WGM resonator to self-tune to a given wavelength is described. Such all photonic approaches include simply superimposing intense light of a wavelength in a range different from that of a signal wave. The wavelength of the pass band for the signal wavelength can be tuned by adjusting the wavelength (and/or the intensity) of the intense light.

Abstract: A security system and service, which improves the performance of SECaaS services, is described. A security server system tracks the content that has successfully passed through its security modules and distributes this information to the end user client devices as hashlist information. The remote client devices can then safely bypass the cloud for a significant fraction of Web object requests by using information on a locally stored hashlist to validate Web objects.

Abstract: Sensors suitable for the sensing/detection of biological or chemical agents may be fabricated by immobilizing biological and/or chemical recognition components (selectors or probes) on a substrate by the polymerization of a suitable monomer in the presence of the selectors or probes, for example, by Polysiloxane Monolayer Immobilization (PMI). PMI may involve the polymerization of polysiloxane onto a substrate, onto which selector molecules are adsorbed or otherwise immobilized. The resulting immobilized selector molecule may then be used to interact with specific molecules (targets) within a mixture of molecules, thereby enabling those specific molecules to be detected and/or quantified.

Abstract: The problem of obtaining a multi-touch input sequence for use in user authentication is solved by determining, at a plurality of time instances, a mapping from an unordered set of at least four touch points to a an ordered set of at least four fingertips, wherein for at least one of the plurality of time instances, the mapping from the unordered set of at least four touch points to the ordered set of at least four fingertips is subject to a constraint that the ordered set of at least four touch points defines a simple polygon.

Abstract: The problem of providing an efficient physical implementation of a (first) classifier defined by a first rule set, at least a part of which first classifier having a sparse distribution in Boolean space, is solved by (1) converting the first classifier, having a corresponding Boolean space, into a second classifier, wherein the second classifier has a corresponding Boolean space which is not semantically equivalent to the Boolean space corresponding to the first classifier, and wherein the second classifier is defined by a second set of rules which is smaller than the first set of rules defining the first classifier; and (2) defining a bit string transformation which transforms a first bit string into a second bit string, wherein applying the first bit string to the first classifier is equivalent to applying the second bit string to the second classifier. In at least some example embodiments, the first bit string includes packet header information.

Abstract: A ring oscillator (RO) based Design-For-Trust (DFTr) technique is described. Functional paths of integrated circuit (IC) are included in one or more embedded ROs by (1) selecting a path in the IC, based on path selection criteria, that has one or more unsecured gates, and (2) embedding one or more ROs on the IC until a stop condition is met. An input pattern to activate embedded RO is determined. Further, a golden frequency which is a frequency at which the embedded RO oscillates, and a frequency range of the embedded RO are determined. A Trojan in the IC may be detected by activating the embedded RO (by applying the input pattern), measuring a frequency at which the embedded RO oscillates, and determining whether or not a Trojan is present based on whether or not the measured frequency of the RO is within a predetermined operating frequency range of the RO.

Abstract: A peer-to-peer (P2P) bot(s) in a network is identified using an already identified P2P bot. More specifically, such embodiments may facilitate determining a candidate set of computers, which may be potential P2P bots, by identifying computers in a network that have a private mutual contact with a seed bot, which is a computer identified as a P2P bot, and identifying additional computers that have private mutual contacts with the identified computers. Further, a confidence level indicative of a certainty of a membership of each of the candidate computers in the P2P botnet is determined and responsive to a determination that the confidence level of the candidate computer exceeds a determined threshold confidence level, the candidate computer is identified as a P2P bot.

Abstract: Substrate arrangements useful for high-performance radio-frequency planar circuits and antennas eliminate excitation of parallel-plate or surface-wave radiations. By eliminating such radiation which escapes sideways through the substrates, the loss of valuable power carried away by these radiations can be avoided, and/or complications resulting from these radiations (e.g., in the form or electromagnetic interference, cross-talk between circuit components or poor signal integrity) can be avoided. A new type of substrate layer is embedded with thin conducting wires that are closely packed and oriented normal to the substrate layering. These conducting wires change the substrate behavior in a unique way. Such new substrate layers may be used in slotline/coplanar waveguide circuits and microstrip antennas to achieve high-performance radio-frequency operations.

Abstract: The invention concerns a method for controlling the adhesive bond between an electric-field responsive material and a substrate, which method comprises using an electric field to control the strength and integrity of the adhesive bond. The method may be used, for example, for removing or delaminating a material, which material is responsive to an electric field, from a substrate. The invention further comprises elimination of the application of the electric field and application of the previously removed electric-field-responsive material to the substrate, thereby resuming the strength and integrity of the adhesive bond. The invention includes apparatus for use in the bond controlling process.

Abstract: For user authentication, finger touch information from a user is accepted via a touch sensitive element, the finger touch information including at least a time series of finger touch samples that define a trace of the user's signature, and each of the finger touch samples including centroid coordinates and non-centroid information, the non-centroid information including at least one of (A) a shape of the finger touch sample, (B) a size of the finger touch sample, (C) an orientation of the finger touch sample, and (D) characteristics of a multi-touch finger touch sample. A similarity of such finger touch samples with previously entered and stored finger touch samples is determined and compared with a threshold for purposes of user authentication.

Abstract: Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA.

Abstract: Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA.

Abstract: Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA.

Abstract: Hybrid security architecture (HSA) provides a platform for middlebox traversal in the network. The HSA decouples the middlebox control from network forwarding. More specifically, such embodiments may receive a data packet having a packet header including an Ethernet header identifying source and destination addresses in the network. A traffic type of the data packet is determined. Then, layer-2 forwarding information, which encodes a set of non-forwarding network service provider middleboxes in the network to be traversed by the data packet, is determined based on the traffic type. The layer-2 forwarding information is inserted into the Ethernet header and the data packet is forwarded into the network. The data packet will then traverse, according to the layer-2 forwarding information, a sequence of the middleboxes in the network, wherein at least one non-forwarding network service will be provided by each of the middleboxes to the data packet in a sequence.

Abstract: A syringe-based whispering gallery mode sensor includes a syringe including an assembly provided its needle, the assembly including (1) an optical carrier having a reflective distal end, and (2) at least one resonator coupled with the optical carrier. This sensor may be provided in a system including a light source, a light detector, and a data analysis component. A method for determining the presence or concentration of a target substance in body fluid may be performed using such a system.

Abstract: Load balancing is performed in a network using flow-based routing. For example, upon detection of a big flow, one or more alternative paths from a source host to a destination host in the network may be discovered by probing the network and generating, for each of the one or more alternative paths, an association of the packet header information of the big flow to an alternative path discovered using results of probing the network. Upon congestion in a path currently being used by the big flow, an alternative path that is not congested is selected from the one or more discovered alternative paths. The packet header information of the big flow is altered using the generated association of the packet header information to the selected alternative path such that the big flow will be transmitted using the selected alternative path.

Abstract: Scheduling methods and apparatus for use with optical switches with hybrid architectures are provided. An exemplary distributed scheduling process achieves 100% throughput for any admissible Bernoulli arrival traffic. The exemplary distributed scheduling process may be easily adapted to work for any finite round trip time, without sacrificing any throughput. Simulation results also showed that this distributed scheduling process can provide very good delay performance for different traffic patterns and for different round trip times associated with current switches.

Abstract: Generating and using a high-speed, scalable, and easily updateable data structure are described. The proposed data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query.

Abstract: Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA.