6547870
Automatic detection of Flash movie genre using Bayesian approach
As Flash, a relatively new rich media format, becomes more and more popular on the Web, the genre becomes increasingly important for Flash movie management as a complement to topical principles of classification. Genre classification can identify Flash movies authored in a style most likely to satisfy a user's information need. We present a method for detecting the Flash genre quickly and easily by employing a Bayesian approach. A feature set for representing genre information is proposed and used to build automatic genre classification algorithms. The performance of the proposed approach is evaluated by training a Bayesian classifier on real-world data sets. Classification results from our experiments on thousands of Flash movies demonstrate the usefulness of this approach
11837218
Using Web Based Answer Hunting System to Promote Collaborative Learning
In this paper, we share our pedagogical experience to motivate and facilitate an interactive and collaborative learning atmosphere by using an answer hunting system. In the software engineering practice course we are teaching, a problem that may deteriorate the learning quality is that, the students lack the opportunities of communication and discussion with the instructor both in class and out of class since they do not have many common time slots. Therefore, a web based answer hunting system is carefully designed and built to facilitate the communications between the students and instructor, and among the students. This system is designed based on the Q&A competition metaphor. The students are encouraged to participate in the competition to learn more knowledge, share more knowledge, and earn more participation marks.
7816927
An antiphishing strategy based on visual similarity assessment
The authors' proposed antiphishing strategy uses visual characteristics to identify potential phishing sites and measure suspicious pages similarity to actual sites registered with the system. The first of two sequential processes in the SiteWatcher system runs on local email servers and monitors emails for keywords and suspicious URLs. The second process then compares the potential phishing pages against actual pages and assesses visual similarities between them in terms of key regions, page layouts, and overall styles. The approach is designed to be part of an enterprise antiphishing solution.
7021428
An online composite graphics recognition approach based on matching of spatial relation graphs
A spatial relation graph (SRG) and its partial matching method are proposed for online composite graphics representation and recognition. The SRG-based approach emphasizes three characteristics of online graphics recognition: partial, structural, and independent of stroke order and stroke number. A constrained partial permutation strategy is also proposed to reduce the computational cost of matching two SRGs, which is originally an NP-complete problem as is graph isomorphism. Experimental results show that our proposed SRG-based approach is both efficient and effective for online composite graphics recognition in our sketch-based graphics input system - SmartSketchpad.
30505871
User Interest Detection on Web Pages for Building Personalized Information Agent
In this paper we propose a vision-based approach to detecting user’s interests on web pages. This approach first splits a web page into several blocks of topics according to visual cues and then analyzes the layout structure of the page based on these blocks. The user’s interests are detected according to his browsing behaviors on the blocks and the layout structure of the web page. A personalized information agent is also developed to automatically extract new content from those web pages according to the user’s interests. Our experiments show that our proposed approach to detecting user’s interests on web pages achieves satisfactory accuracy and the personalized information agent significantly saves user’s browsing time and improves user’s browsing experience.
1955475
An Answer Fusion Model for Web-based Question Answering
Many question answering systems are now focusing on the research of question-based answer mining from the Web information or snippets returned by the search engine. However, their main goal is only to get the related answers instead of the correct answers because answers are inconsistent. An answer fusion model and method is proposed, which makes semantic analysis of the various answers to the same question returned by search engines or question answering systems and return the fused answer based on fusion rules and data quality. Experimental test in our QA system shows that the method is effective.
33842812
Anycast-Based Cooperative Proxy Caching
As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in the network congestion and server overloading. Web caching as an important technique aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular contents on proxy caches. In our paper, we develop an anycast-based cooperative web proxy caching mechanism. It puts response time, hop counts, self-organized load balancing, adaption, and self-configuration as primary concerns. In our scheme, anycast is used to bring a server “nearest” to a client to improve overall performance, all proxies in a local network consists an anycast group. The object placement and replacement problems are formulated as an optimization problem and the solution is obtained by using an anycast-based cooperative proxy caching algorithm. Some simulation experiments have been conduced to evaluate the proposed scheme in terms of a wide range of performance metrics. Analytical and experimental results show that our algorithm outperforms some existing algorithms in response time, hop counts.
16581375
Visualizing the scientific world and its evolution
We propose an approach to visualizing the scientific world and its evolution by constructing minimum spanning trees (MSTs) and a two‐dimensional map of scientific journals using the database of the Science Citation Index (SCI) during 1994–2001. The structures of constructed MSTs are consistent with the sorting of SCI categories. The map of science is constructed based on our MST results. Such a map shows the relation among various knowledge clusters and their citation properties. The temporal evolution of the scientific world can also be delineated in the map. In particular, this map clearly shows a linear structure of the scientific world, which contains three major domains including physical sciences, life sciences, and medical sciences. The interaction of various knowledge fields can be clearly seen from this scientific world map. This approach can be applied to various levels of knowledge domains.
12502044
Portable and Scalable Algorithm for Irregular All-to-All Communication
In irregular all-to-all communication, messages are exchanged between every pair of processors. The message sizes vary from processor to processor and are known only at run time. This is a fundamental communication primitive in parallelizing irregularly structured scientific computations. Our algorithm reduces the total number of message start-ups. It also reduces node contention by smoothing out the lengths of the messages communicated. As compared to the earlier approaches, our algorithm provides deterministic performance and also reduces the buffer space at the nodes during message passing. The performance of the algorithm is characterised using a simple communication model of high-performance computing (HPC) platforms. We show the implementation on T3D and SP2 using C and the message passing interface standard. These can be easily ported to other HPC platforms. The results show the effectiveness of the proposed technique as well as the interplay among the machine size, the variance in message length, and the network interface.
893220
PathExpander: Architectural Support for Increasing the Path Coverage of Dynamic Bug Detection
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the path coverage problem: they detect bugs only in taken paths but not in non-taken paths. In other words, they require bugs to be exposed in the monitored execution. This paper makes one of the first attempts to address this fundamental problem with a simple hardware extension. First, we propose PathExpander, a novel design that dynamically increases the code path coverage of dynamic bug detection tools with no programmer involvement. As a program executes, PathExpander selectively executes non-taken paths in a sandbox without side effects. This enables dynamic bug detection tools to find bugs that are present in these non-taken paths and would otherwise not be detected. Second, we propose a simple hardware extension to control the huge overhead in its pure software implementation to a moderate level. To further minimize overhead, PathExpander provides an optimization option to execute non-taken paths on idle cores in chip multi-processor architectures that support speculative execution. To evaluate PathExpander, we use three dynamic bug detection methods: dynamic software-only checker (CCured), dynamic hardware-assisted checker (iWatcher) and assertions; and conduct side-by-side comparison with PathExpander's counterpart software implementation. Our experiments with seven buggy programs using general inputs that do not expose the tested bugs show that PathExpander is able to help these tools detect 21 (out of 38) tested bugs that are otherwise missed. This is because PathExpander increases the code coverage of each test case from 40% to 65% on average, based on the branch coverage metric. When applications are tested with multiple inputs, the cumulative coverage also significantly improves by 19%. We also show that PathExpander introduces modest false positives (4 on average) and overhead (less than 9.9%). The 3-4 orders of magnitude lower overhead compared with pure-software implementation further justifies the hardware design in PathExpander
10470214
Tasking with out-of-order spawn in TLS chip multiprocessors: microarchitecture and compilation
Chip Multiprocessors (CMPs) are flexible, high-frequency platforms on which to support Thread-Level Speculation (TLS). However, for TLS to deliver on its promise, CMPs must exploit multiple sources of speculative task-level parallelism, including any nesting levels of both subroutines and loop iterations. Unfortunately, these environments are hard to support in decentralized CMP hardware: since tasks are spawned out-of-order and unpredictably, maintaining key TLS basics such as task ordering and efficient resource allocation is challenging.While the concept of out-of-order spawning is not new, this paper is the first to propose a set of microarchitectural mechanisms that, altogether, fundamentally enable fast TLS with out-of-order spawn in a CMP. Moreover, we develop a fully-automated TLS compiler for aggressive out-of-order spawn. With our mechanisms, a TLS CMP with four 4-issue cores achieves an average speedup of 1.30 for full SPECint 2000 applications; the corresponding speedup for in-order only spawn is 1.04. Overall, our mechanisms unlock the potential of TLS for the toughest applications.