This paper proposes a two-fold study: (1) to find the factors affecting attitude of Thai students for choosing informationtechnology (IT) program and (2) to investigate the existence of gender gap in behavioral inten...
详细信息
This paper proposes a two-fold study: (1) to find the factors affecting attitude of Thai students for choosing informationtechnology (IT) program and (2) to investigate the existence of gender gap in behavioral intention. The study is based on the Theory of Reasoned Action (TRA) as a theoretical framework. The factors that may affect students’ behavioral intention to choose IT program are categorized into two dimensions: attitudes toward choosing IT program and subjective norm. The web-based questionnaire is employed to collect data from a sample of 67 local Thai Grade 12 students of both genders who have intention to study in IT undergraduate program at school of informationtechnology (SIT), King Mongkut's University of technology Thonburi (KMUTT). The result of statistical analysis shows that TRA is effective for explaining the behavioral intention. Male and female students hold the same set of attitudinal attributes when deciding to enter IT program, hence, an IT school shall implement common strategies to grasp intention from both genders. The most effective strategy to gain students intention is to build up the reputation of IT program.
Despite its success,similarity-based collaborative filtering suffers from some limitations,such as scalability,sparsity and recommendation *** work has shown incorporating trust mechanism into traditional collaborativ...
详细信息
Despite its success,similarity-based collaborative filtering suffers from some limitations,such as scalability,sparsity and recommendation *** work has shown incorporating trust mechanism into traditional collaborative filtering recommender systems can improve these *** argue that trust-based recommender systems are facing novel recommendation attack which is different from the profile injection attacks in traditional recommender *** the best of our knowledge,there has not any prior study on recommendation attack in a trust-based recommender *** analyze the attack problem,and find that "victim" nodes play a significant role in the ***,we propose a data provenance method to trace malicious users and identify the "victim" nodes as distrust users of recommender *** study of the defend method is done with the dataset crawled from Epinions website.
Recently, social tagging systems become more and more popular in many Web 2.0 applications. In such systems, Users are allowed to annotate a particular resource with a freely chosen a set of tags. These user-generated...
详细信息
Recently, social tagging systems become more and more popular in many Web 2.0 applications. In such systems, Users are allowed to annotate a particular resource with a freely chosen a set of tags. These user-generated tags can represent users' interests more concise and closer to human understanding. Interests will change over time. Thus, how to describe users' interests and interests transfer path become a big challenge for personalized recommendation systems. In this approach, we propose a variable-length time interval division algorithm and user interest model based on time interval. Then, in order to draw users' interests transfer path over a specific time period, we suggest interest transfer model. After that, we apply a classical community partition algorithm in our approach to separate users into communities. Finally, we raise a novel method to measure users' similarities based on interest transfer model and provide personalized tag recommendation according to similar users' interests in their next time intervals. Experimental results demonstrate the higher precision and recall with our approach than classical user-based collaborative filtering methods.
Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Sin...
详细信息
Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Single attribute Join Queries within latest sampling Periods (SJQP) for wireless sensor networks. The main idea of our filter-based framework is to discard non-matching tuples, and our scheme can guarantee the result is correct independent of the filters. Experiments based on real-world sensor data show that our method performs close to a theoretical optimum and consistently outperforms the centralized join algorithm.
The increasing availability of GPS-embedded mobile devices has given rise to a new spectrum of location-based services, which have accumulated a huge collection of location trajectories. In practice, a large portion o...
详细信息
ISBN:
(纸本)9781467300421
The increasing availability of GPS-embedded mobile devices has given rise to a new spectrum of location-based services, which have accumulated a huge collection of location trajectories. In practice, a large portion of these trajectories are of low-sampling-rate. For instance, the time interval between consecutive GPS points of some trajectories can be several minutes or even hours. With such a low sampling rate, most details of their movement are lost, which makes them difficult to process effectively. In this work, we investigate how to reduce the uncertainty in such kind of trajectories. Specifically, given a low-sampling-rate trajectory, we aim to infer its possible routes. The methodology adopted in our work is to take full advantage of the rich information extracted from the historical trajectories. We propose a systematic solution, History based Route Inference System (HRIS), which covers a series of novel algorithms that can derive the travel pattern from historical data and incorporate it into the route inference process. To validate the effectiveness of the system, we apply our solution to the map-matching problem which is an important application scenario of this work, and conduct extensive experiments on a real taxi trajectory dataset. The experiment results demonstrate that HRIS can achieve higher accuracy than the existing map-matching algorithms for low-sampling-rate trajectories.
Although there exist a few good schemes to protect the kernel hooks of operating systems, attackers are still able to circumvent existing defense mechanisms with spurious context infonmtion. To address this challenge,...
详细信息
Although there exist a few good schemes to protect the kernel hooks of operating systems, attackers are still able to circumvent existing defense mechanisms with spurious context infonmtion. To address this challenge, this paper proposes a framework, called HooklMA, to detect compromised kernel hooks by using hardware debugging features. The key contribution of the work is that context information is captured from hardware instead of from relatively vulnerable kernel data. Using commodity hardware, a proof-of-concept pro- totype system of HooklMA has been developed. This prototype handles 3 082 dynamic control-flow transfers with related hooks in the kernel space. Experiments show that HooklMA is capable of detecting compomised kernel hooks caused by kernel rootkits. Performance evaluations with UnixBench indicate that runtirre overhead introduced by HooklMA is about 21.5%.
This paper proposes a framework to identify the relevant law articles consisting of sentences and range of punishments, given facts discovered in the criminal case of interest. The model is formulated as a two-stage c...
详细信息
This paper proposes a framework to identify the relevant law articles consisting of sentences and range of punishments, given facts discovered in the criminal case of interest. The model is formulated as a two-stage classifier according to the concept of machine learning. The first stage is to determine a set of case diagnostic issues, using a modular Artificial Neural Network (mANN), and the second stage is to determine the relevant legal elements which lead to legal charges identification, using SVM-equipped C4.5. The integrated multi-stage model aims at achieving high accuracy of classification while reserving “arguability”. Hypothetically, mANN handles well for digesting complexity in case-level issues analysis with acceptable explanatory power and C4.5 addresses the lesser extent of contingency and provides human-interpretable logic concerning the high-level context of legal codes.
this paper,the author defines Generalized Unique Game Problem (GUGP),where weights of the edges are allowed to be *** special types of GUGP are illuminated,GUGP-NWA,where the weights of all edges are negative,and GUGP...
this paper,the author defines Generalized Unique Game Problem (GUGP),where weights of the edges are allowed to be *** special types of GUGP are illuminated,GUGP-NWA,where the weights of all edges are negative,and GUGP-PWT(ρ),where the total weight of all edges are positive and the negative-positive ratio is at most ρ.
In algorithm trading, computer algorithms are used to make the decision on the time, quantity, and direction of operations (buy, sell, or hold) automatically. To create a useful algorithm, the parameters of the algori...
详细信息
In algorithm trading, computer algorithms are used to make the decision on the time, quantity, and direction of operations (buy, sell, or hold) automatically. To create a useful algorithm, the parameters of the algorithm should be optimized based on historical data. However, Parameter optimization is a time consuming task, due to the large search space. We propose to search the parameter combination space using the MapReduce framework, with the expectation that runtime of optimization be cut down by leveraging the parallel processing capability of MapReduce. This paper presents the details of our method and some experiment results to demonstrate its efficiency. We also show that a rule based strategy after being optimized performs better in terms of stability than the one whose parameters are arbitrarily preset, while making a comparable profit.
In recent years, Principle Component Analysis is an extraction method for statistics characteristic, which has been more researched and widely used in the signal processing, pattern recognition, digital image processi...
详细信息
In recent years, Principle Component Analysis is an extraction method for statistics characteristic, which has been more researched and widely used in the signal processing, pattern recognition, digital image processing and other fields. This paper mainly describe that original currency characteristic vectors will be carried the linear transform by Principle Component Analysis Method, and then reduced-dimension original currency characteristic vector is automatically classified by BP Neural Networks, and finally identification research experiment is made for different kinds of currency,such as 1 yuan, 5 yuan, 10 yuan and 20 yuan. The experiment results indicate that currency characteristic extraction and identification algorithm based on Principle Component Analysis and BP neural network has higher identification rate and better identification effect.
暂无评论