As the World Wide Web expands and more users join, it becomes an increasingly attractive means of distributing malware. Malicious javascript frequently serves as the initial infection vector for malware. We train seve...
详细信息
As the World Wide Web expands and more users join, it becomes an increasingly attractive means of distributing malware. Malicious javascript frequently serves as the initial infection vector for malware. We train several classifiers to detect malicious javascript and evaluate their performance. We propose features focused on detecting obfuscation, a common technique to bypass traditional malware detectors. As the classifiers show a high detection rate and a low false alarm rate, we propose several uses for the classifiers, including selectively suppressing potentially malicious javascript based on the classifier's recommendations, achieving a compromise between usability and security.
In this paper a prototype emergency services system is presented, equipped with a multimedia database registering and storing relevant emergency situations in a semi automatic way. In this paper we assume that this da...
详细信息
In this paper a prototype emergency services system is presented, equipped with a multimedia database registering and storing relevant emergency situations in a semi automatic way. In this paper we assume that this database is created exclusively with sound and linguistic material won from emergency telephone calls. The presented system enables conducting speaker recognition experiments. Sources of data, metadata generation, architecture description, searching for results, and database implementation are comprised.
The CHANGE-MAKING problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the...
详细信息
The CHANGE-MAKING problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the greedy algorithm yields optimal solutions. In this paper, we study what type of coin systems that guarantee the optimality of the greedy algorithm. We provide new proofs for a suf cient and necessary condition for the so-called canonical coin systems with 4 or 5 types of coins, and a suf cient condition for non-canonical coin systems, respectively. Moreover, we propose an O(m2) algorithm that decides whether a tight coin system is canonical.
In this paper, a discriminative representation method of head images is proposed, which is based on parts and poses for identity-independent head pose estimation. Head images are preprocessed to enhance the facial fea...
详细信息
In this paper, a discriminative representation method of head images is proposed, which is based on parts and poses for identity-independent head pose estimation. Head images are preprocessed to enhance the facial features and eliminate the identity information by skin color model and Laplacian of Gaussian transform. Then, the preprocessed images are used to construct a eigenpose subspace by a matrix factorization method. The testing head images are represented as the projections of the eigenpose subspace in which we can easily find the decision function for head pose estimation. The proposed representation method evaluated on the standard head pose database and real-time videos achieves higher pose estimation accuracy than other methods.
Scientific applications like neuroscience data analysis are usually compute and data-intensive. With the use of globally distributed resources and suitable middlewares, we can achieve much shorter execution time, dist...
详细信息
Scientific applications like neuroscience data analysis are usually compute and data-intensive. With the use of globally distributed resources and suitable middlewares, we can achieve much shorter execution time, distribute compute and storage load, and add greater flexibility to the execution of these scientific applications than we could ever achieve in a single compute *** this paper, we present the processing of image registration (IR) for functional magnetic resonance imaging(fMRI) studies on global grids. We characterize the application, list its requirements and transform it to a workflow. We then execute the application on Gridpsila5000 platform and present extensive performance results. We show that the IR application can have 1) significantly improved makespan, 2) distribution of compute and storage load among resources used, and 3) flexibility when executing multiple times on global Grids.
Since its conception in the mid 1950s, artificial intelligence with its great ambition to understand and emulate intelligence in natural and artificial environments alike is now a truly multidisciplinary field that re...
Since its conception in the mid 1950s, artificial intelligence with its great ambition to understand and emulate intelligence in natural and artificial environments alike is now a truly multidisciplinary field that reaches out and is inspired by a great diversity of other fields. Rapid advances in research and technology in various fields have created environments into which artificial intelligence could embed itself naturally and comfortably. Neuroscience with its desire to understand nervous systems of biological organisms and systems biology with its longing to comprehend, holistically, the multitude of complex interactions in biological systems are two such fields. They target ideals artificial intelligence has dreamt about for a long time including the computer simulation of an entire biological brain or the creation of new life forms from manipulations of cellular and genetic information in the laboratory. The scope for artificial intelligence in neuroscience and systems biology is extremely wide. This article investigates the standing of artificial intelligence in relation to neuroscience and systems biology and provides an outlook at new and exciting challenges for artificial intelligence in these fields. These challenges include, but are not necessarily limited to, the ability to learn from other projects and to be inventive, to understand the potential and exploit novel computing paradigms and environments, to specify and adhere to stringent standards and robust statistical frameworks, to be integrative, and to embrace openness principles.
This work focuses on proposing a method of effectively dealing with P2P-based service selection and composition, especially when handling a large number of peers along with their diverse qualities. The QoS-aware peer ...
详细信息
This work focuses on proposing a method of effectively dealing with P2P-based service selection and composition, especially when handling a large number of peers along with their diverse qualities. The QoS-aware peer selection is one of the major challenges faced in order to guarantee the success and enhance performance of distributed computing. Since many peer candidates provide overlapping or identical functionalities, though with different QoS evaluations, selections need to be rapidly conducted to determine which peers are suitable to join in the requested composite service. The main contribution of this paper is proposing a P2P-based service selection model, in which peer's non-functional properties are modeled with Web service modelling ontology (WSMO), and where ant colony optimisation (ACO) technique is adopted to facilitate and enhance the QoS-aware peers' composition. We present experimental results to illustrate the effectiveness and feasibility of the proposed method.
Multicast communication is an efficient method of data transmission and distribution among a group, especially when network resources are inadequate and needs to be shared. Fair share of network resources, such as, ba...
详细信息
Multicast communication is an efficient method of data transmission and distribution among a group, especially when network resources are inadequate and needs to be shared. Fair share of network resources, such as, bandwidth, is desirable in such cases. Although there has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group, construction of multiple multicast groups and the fair allocation of network resources remains virtually unexplored. In this paper, a unified approach for the Multiple Multicast Tree Construction and Rate Allocation (MMTCRA) problem is addressed. The MMTCRA problem has been defined as an optimization problem with an objective of finding a Max-Min Fair rate allocation among the multiple multicast groups that co-exist in the network subject to the link-capacity constraints. The problem is proved to be NP-Complete. A Mixed Integer Linear Program (MILP) is formulated to achieve the optimal solution for this problem. A heuristic is proposed to solve the MMTCRA problem in polynomial time. The quality of the heuristic is evaluated by comparing the solution with the optimal solution for several randomly generated networks. A metric for user satisfaction, USat, has been defined in the paper. Experimental results show that 81% solutions obtained from heuristic have optimal USat, 95% solutions obtained from heuristic have optimal minimum allocated rate and the standard deviation of solutions are within 10% of optimal solutions.
This paper presents a comprehensive system modeling and analysis approach for both predicting and controlling queuing delay at an expected value under multi-class traffic in a single buffer. This approach could effect...
详细信息
ISBN:
(纸本)9781424440009
This paper presents a comprehensive system modeling and analysis approach for both predicting and controlling queuing delay at an expected value under multi-class traffic in a single buffer. This approach could effectively enhance QoS delivery for delay sensitive applications. Six major contributions are given in the paper: (1) a discrete-time analytical model is developed for capturing multi-class traffic with binomial distribution; (2) a control strategy with dynamic queue thresholds is used in simulation experiments to control the delay at a specified value within the buffer; (3) the feasibility of the system is validated by comparing theoretical analysis with simulation scenarios; (4) the arrival rate can be adjusted for each forthcoming time window during the simulation with multi-packet sources; (5) statistical evaluation is performed to show both efficiency and accuracy of the analytical and simulation results; (6) a graphical user interface is developed that can provide flexible configuration for the simulation and validate input values.
暂无评论