Nowadays, malicious URLs are the common threat to the businesses, social networks, net-banking etc. Existing approaches have focused on binary detection i.e. either the URL is malicious or benign. Very few literature is found which focused on the detection of malicious URLs and their attack types. Hence, it becomes necessary to know the attack type and adopt an effective countermeasure. This pa...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xii

In this paper, we describe the University of Illinois system that participated in Helping Our Own (HOO), a shared task in text correction. We target several common errors, such as articles, prepositions, word choice, and punctuation errors, and we describe the approaches taken to address each error type. Our system is based on a combination of classifiers, combined with adaptation techniques fo...

In this paper, an image recovery method based on search-order coding (SOC) is proposed. By using SOC, a SOC-image of the secret image can be generated. If the secret image is damaged, people can still obtain a version of the secret image that looks not bad by referring to the SOC-image. Also, the information of the secret image cannot be retrieved from the SOC-image alone. Key-Words: search-ord...

We propose a method for using all available information to help correct recognition errors in tasks that use constrained grammars of the kind used in the domain of Command and Control (CC) systems. In current spoken language CC systems, if there is a recognition error, the user repeats the same phrase multiple times until a correct recognition is achieved. This interaction can be frustrating fo...

Transaction services offered by public authorities vary from simple forms with few fields to multi-form compound documents with hundreds of input areas. In the latter case, field placement within forms is of particular importance for facilitating the filling and error correction processes. In this paper we present an approach to improving the form layout by exploiting validation checks that are...

We show that the minimum expected length of a 1-1 encoding of a discrete random variable X is at least H(X)− log(H(X)+1)− log e and that this bound is asymptotically achievable.

We detect errors in Korean post-positional particle usage, focusing on optimizing omission detection, as omissions are the single-biggest factor in particle errors for learners of Korean. We also develop a system for predicting the correct choice of a particle. For omission detection, we model the task largely on English grammatical error detection, but employ Korean-specific features and filte...

This paper addresses the problem of compacting test responses in the presence of unknowns at the input of the compactor by exploiting the capabilities of well-known error detection and correction codes. The technique, called i-Compact, uses Saluja-Karpovsky Space Compactors, but permits detection and location of errors in the presence of unknown logic (X) values with help from the ATE. The adva...

Five methods are discussed to fit circles to data. Two of the methods are shown to be highly sensitive to measurement error. The other three are shown to be quite stable in this regard. Of the stable methods, two have the advantage of having closed form solutions. A positive aspect of all of these models is that they are coordinate free in the sense that the same estimating circles are produced...