Abstract: A modular conduit cable management assembly is used with tall vertical structures for holding and managing one or more cables, with the assembly having a plurality of conduit members and a plurality of removable closure members. Each conduit member has at least one retaining arm, a plurality of prongs, an anchor, and a core, with each conduit member defining a slot opening, a plurality of apertures, a holding cavity forming a conduit track, and a receiving chamber. Once assembled, one or more cables can be installed within the conduit track, with at least one of the closure members closing the conduit member slot opening. The cables and each conduit track may be accessed at a later time after removing the closure member.

Abstract: Methods and systems for power amplification with digital quantized power supply with multiple amplifiers are disclosed herein. In one embodiment, In one embodiment, a time-varying envelope signal is sampled, quantized and decomposed into several constituent signals that are individually amplified, and then combined to form a desired amplified version of the quantized time-varying envelope. Amplitude, phase and/or frequency characteristics of one or more of the signals and supply voltages Vdd and source current of one or more amplifiers are digital controlled based on the information provided by quantization process and slow and fast power control information. Amplitude, phase and/or frequency characteristics of one or more of the constituent signals to be amplified are controlled to provide the desired amplitude, phase, frequency, and/or spectral characteristics of the desired quantized version of the time-varying envelope signal.

Abstract: A computer implemented method and apparatus for optimized online presence blockchain trust management to avoid online fraud.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating client-based control and experience of application programming interfaces in an on-demand services environment according to one embodiment. In one embodiment and by way of example, a method comprises offering, by application programming interface (API)-usage server device (“API-usage device”), a client interface package including a user interface for facilitating client-based control of APIs at a client computing device over a network. The method may further include facilitating, by the API-usage device, the client-based control of the APIs using an API menu accessible through the user interface, where the API menu is selectively populated with one or more of documentation, working code samples, and application protocol clients.

Abstract: A method for providing a proof-of-work challenge based on hash mining for reducing spam attacks comprising: receiving an email message from a client device; determining a level of trustworthiness of the client device; generating a challenge message based on the determined trustworthiness of the client device; transmitting the challenge message to the client device; receiving a response to the challenge message from the client device; and forwarding the email to one or more recipients when the response to the challenge message is correct.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A method for providing a proof-of-work challenge based on hash mining for reducing spam attacks comprising: receiving an email message from a client device; determining a level of trustworthiness of the client device; generating a challenge message based on the determined trustworthiness of the client device; transmitting the challenge message to the client device; receiving a response to the challenge message from the client device; and forwarding the email to one or more recipients when the response to the challenge message is correct.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating client-based control and experience of application programming interfaces in an on-demand services environment according to one embodiment. In one embodiment and by way of example, a method comprises offering, by application programming interface (API)-usage server device (“API-usage device”), a client interface package including a user interface for facilitating client-based control of APIs at a client computing device over a network. The method may further include facilitating, by the API-usage device, the client-based control of the APIs using an API menu accessible through the user interface, where the API menu is selectively populated with one or more of documentation, working code samples, and application protocol clients.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: Embodiments of the present disclosure are directed toward a system and method to drain a fuel manifold wherein a fuel drainage and purge system includes a fuel manifold and a drainage line extending from the fuel manifold. The drainage line is configured to flow a liquid-gas mixture from the fuel manifold. The fuel drainage and purge system also includes a drain valve disposed along the drainage line, a vent line extending from the drainage line upstream of the drain valve, a vent valve disposed along the vent line, and a drainage trap arranged along the drainage line downstream of the drain valve. The drainage trap is configured to separate the liquid-gas mixture into a liquid stream and a gaseous stream.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: Data obsolescence is managed using a bitmap or bit array index which is associated with a table during an obsolescence control period. A table is selected to undergo obsolescence control for a period of time. Any records that have not been accessed for a certain number of cycles ‘M’, which represents an obsolescence limit, are deemed to be obsolete. During at least a part of each cycle, the results of database queries to the table are monitored, such that for each cycle an ‘obsolescence’ bitmap is created indicating which records were accessed. Once a sufficient number of cycles have elapsed, so that records that have not been accessed at all since the start of the obsolescence control period lie outside the obsolescence limit, queries are restricted to records which have been accessed during the last ‘M’ cycles by applying the ‘M’ most recently stored obsolescence bitmaps.

Abstract: A technique for generating or updating a user profile based on a packet flow in a communications network from a user terminal to a destination address is described. A method implementation of this technique comprises receiving, by a Policy Control and Charging Rules Function (PCRF) from a Policy and Charging Enforcement Function (PCEF), at least one item of information indicative of at least one of the destination address and a service provided at the destination address to the user terminal. Based on this item of information, a user profile for a user associated with the user terminal is generated or updated.

Abstract: A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

Abstract: A computer program product for implementing a method comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, and determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.