Abstract: A dielectric ceramic material comprises a primary component of barium titanate (BaTiO3) and at least one additive component. The additive component has a mole percentage from 1% to 50% and is selected from the group consisting of lithium tantalite [lithium tantalate (LiTaO3)], barium cerate (BaCeO3), sodium metaniobate [sodium niobate (NaNbO3)] and the combinations thereof.

Abstract: A real traffic replay over wireless networks with environment emulation and an event-driven automata-synchronized replay method are disclosed. The system includes a first traffic capture module configured to capture packet traces and environment effects in a real environment, a first event transform module configured to transform the packet traces into a sequence of events, and a reproduce module configured to receive the environment effects from the first traffic capture module and the sequence of events from the first event transform module such as to control a replay of the environment effects in the real environment and the sequence of events coordinately by means of automata.

Abstract: A dielectric ceramic material comprises a primary component of barium titanate (BaTiO3) and at least one additive component. The additive component has a mole percentage from 1% to 50% and is selected from the group consisting of lithium tantalite (LiTaO3), barium cerate (BaCeO3), sodium metaniobate (NaNbO3) and the combinations thereof.

Abstract: A decision method considering time and power consumption for offloading computations is provided. The method includes: obtaining a computing mission; obtaining a plurality of static effect factors from an effect factor table; collecting a plurality of dynamic effect factors. The method also includes: generating power consumptions and computing time that each of the computing unit and each of the server consumes according to the dynamic effect factors and the static effect factors; calculating cost values of executing the computing mission according to the power consumptions and the computing time; determining a target unit to execute the computing mission according to the cost values, in which the target unit is a computing unit or a server; executing the computing mission by the target unit. Therefore, the power consumptions and the computing time are simultaneously considered, and computations are adequately allocated to one of the computing unit and the servers.

Abstract: A recording, recovering, and replaying method for real traffic is used for processing a plurality of network packets of a plurality of network connections. A recording procedure of the method includes the following steps. A recording parameter (N, M, P) is received. A header and a payload of each network packet of the network connections are completely recorded, and a payload accumulation value of each network connection is accumulated. When one of the payload accumulation values exceeds N, the header of each network packet and first M bytes of the payload are recorded for P consecutive network packets corresponding to the payload accumulation value. When one of the payload accumulation values exceeds N and after the P consecutive network packets of the network connection corresponding to the payload accumulation value are recorded, the header of each network packet is recorded for the network connection corresponding to the payload accumulation value.

Abstract: A machine-implemented method for determining whether a to-be-analyzed software is a known malware or a variant of the known malware includes the steps of: (A) configuring a processor to execute the to-be-analyzed software, and obtain a to-be-analyzed system call sequence that corresponds to the to-be-analyzed software with reference to a plurality of system calls made in sequence as a result of executing the to-be-analyzed software; (B) configuring the processor to determine a degree of similarity between the to-be-analyzed system call sequence and a reference system call sequence that corresponds to the known malware; and (C) configuring the processor to determine that the to-be-analyzed software is neither the known malware nor a variant of the known malware when the degree of similarity determined in step (B) is not greater than a predefined similarity threshold value.

Abstract: A machine-implemented method for determining whether a to-be-analyzed software is a known malware or a variant of the known malware includes the steps of: (A) configuring a processor to execute the to-be-analyzed software, and obtain a to-be-analyzed system call sequence that corresponds to the to-be-analyzed software with reference to a plurality of system calls made in sequence as a result of executing the to-be-analyzed software; (B) configuring the processor to determine a degree of similarity between the to-be-analyzed system call sequence and a reference system call sequence that corresponds to the known malware; and (C) configuring the processor to determine that the to-be-analyzed software is neither the known malware nor a variant of the known malware when the degree of similarity determined in step (B) is not greater than a predefined similarity threshold value.

Abstract: A recording, recovering, and replaying method for real traffic is used for processing a plurality of network packets of a plurality of network connections. A recording procedure of the method includes the following steps. A recording parameter (N, M, P) is received. A header and a payload of each network packet of the network connections are completely recorded, and a payload accumulation value of each network connection is accumulated. When one of the payload accumulation values exceeds N, the header of each network packet and first M bytes of the payload are recorded for P consecutive network packets corresponding to the payload accumulation value. When one of the payload accumulation values exceeds N and after the P consecutive network packets of the network connection corresponding to the payload accumulation value are recorded, the header of each network packet is recorded for the network connection corresponding to the payload accumulation value.

Abstract: A string matching system includes a text string, a plurality of patterns, an m-byte search window and a plurality of Bloom filters, wherein the m-byte search window stands for an m-byte sub-string in the text string under inspection. Every Bloom filter comprises sub-strings of a plurality of patterns. These Bloom filters are queried for membership of the rightmost block in the search window to determine the shift length. The acceleration efficiency of matching many bytes can be achieved simultaneously by shifting the search window for many bytes. Meanwhile, the patterns are stored into an embedded memory through a memory-efficient mechanism —the Bloom filter.

Abstract: An identification and administration system applied to P2P gateway and a method for the same are proposed. The system is installed in a kernel space, and a plug-in kernel module is in the kernel space to finish preprocessing and application processing of packets on the kernel space without the need of copying data to the user space for processing. Moreover, a connection cache is provided in the kernel space to process source/destination IP addresses, connection ports and protocol identifiers of all packets to recognize and then block identical request packets in reconnections. Therefore, the throughput of content-level security gateway can be increased, and the processing efficiency of packets can also be enhanced.

Abstract: A string matching system includes a text string, a plurality of patterns, an m-byte search window and a plurality of Bloom filters, wherein the m-byte search window stands for an m-byte sub-string in the text string under inspection. Every Bloom filter comprises sub-strings of a plurality of patterns. These Bloom filters are queried for membership of the rightmost block in the search window to determine the shift length. The acceleration efficiency of matching many bytes can be achieved simultaneously by shifting the search window for many bytes. Meanwhile, the patterns are stored into an embedded memory through a memory-efficient mechanism-the Bloom filter.

Abstract: An apparatus, a system and a method for stream-based data filtering are disclosed. The apparatus is for filtering data transmitted from a sending end. The data is transmitted one by one by using a plurality of data segments. The data filtering apparatus includes a receiving module, a processing module and a transmission module. The receiving module is for receiving the data segments transmitted from the sending end. The processing module implements virus scanning for the data segments one by one. The transmission module then transmits the data segments which have passed through the virus scanning to a receiving end.

Abstract: A system for providing differentiated service by using category/resource scheduling and the method thereof are provided. The system and the method are mainly used in the Internet environment, and apply computer executable programs executed at relay points or in a servo system to schedule the processes of external requests according to classified categories of and resources consumed by the external requests when the servo system receives the external requests from the Internet. The time points when individual external requests are released to the servo system to be processed are determined by the category weight corresponding to each external request, the proportion of resource consumed by each external request, and the capacity of available resources in the servo system.

Abstract: A system and a method of request scheduling for differentiated quality of services at an intermediary are provided. An intermediary located between clients and a server is used to schedule requests from the clients in the Internet. The intermediary classifies the requests and decides resources required for each request according to the administrative policies. Then the intermediary decides the order and the time the requests being transferred to the server by the size of the responses corresponding to the requests, window control and server loading. Therefore, the system is transparent to clients and servers and is capable of high compatibility with other systems.

Abstract: A preprocessing method for smoothing handwritten Chinese characters before subjecting the same to computerized character recognition and/or other applications. The method disclosed in the present invention is a run-based smoothing method which takes advantages of the unique characteristics of the building blocks of Chinese characters, which consist essentially of vertical, horizontal, and tilted strokes. Accordingly, the two-dimensional array of pixels representing a digitized character are first converted into a run information map which will be repeatedly scanned and subject to three main smoothing treatments: (1) empty run filling, (2) small triangular area filling, and (3) filled run deleting. A unique protocol is developed for effectuating each of the smoothing steps. After each treatment, the run information map is updated, and the treatment steps are repeated until no more empty run filling or filled run deleting can be found, or until a specified number of cycles are exceeded.