816402
Enhancing knowledge discovery via association-based evolution of neural logic networks
The comprehensibility aspect of rule discovery is of emerging interest in the realm of knowledge discovery in databases. Of the many cognitive and psychological factors relating the comprehensibility of knowledge, we focus on the use of human amenable concepts as a representation language in expressing classification rules. Existing work in neural logic networks (or neulonets) provides impetus for our research; its strength lies in its ability to learn and represent complex human logic in decision-making using symbolic-interpretable net rules. A novel technique is developed for neulonet learning by composing net rules using genetic programming. Coupled with a sequential covering approach for generating a list of neulonets, the straightforward extraction of human-like logic rules from each neulonet provides an alternate perspective to the greater extent of knowledge that can potentially be expressed and discovered, while the entire list of neulonets together constitute an effective classifier. We show how the sequential covering approach is analogous to association-based classification, leading to the development of an association-based neulonet classifier. Empirical study shows that associative classification integrated with the genetic construction of neulonets performs better than general association-based classifiers in terms of higher accuracies and smaller rule sets. This is due to the richness in logic expression inherent in the neulonet learning paradigm.
38236882
Chart analysis and recognition in document images
Hidden Markov models are a probabilistic modeling tool for time series data. It has been successfully applied to many areas, such as speech recognition, hand-written character recognition, etc. In this paper, we present a novel statistical approach using ergodic hidden Markov models to recognize scientific charts. We also present a newly developed feature extraction method for chart images. Unlike traditional primitive-based diagram recognition method, our approach need not recognize the graphic primitives in charts thus bypassing the recognition error problem caused by the inaccurate primitive extraction that is also a major obstacle to the construction of a general chart recognition system.
2536406
Improving Pronoun Resolution Using Statistics-Based Semantic Compatibility Information
In this paper we focus on how to improve pronoun resolution using the statistics-based semantic compatibility information. We investigate two unexplored issues that influence the effectiveness of such information: statistics source and learning framework. Specifically, we for the first time propose to utilize the web and the twin-candidate model, in addition to the previous combination of the corpus and the single-candidate model, to compute and apply the semantic information. Our study shows that the semantic compatibility obtained from the web can be effectively incorporated in the twin-candidate learning model and significantly improve the resolution of neutral pronouns.
15710341
Motion deblurring for optical character recognition
This paper investigates the problem of blurring caused by motion during image capture of text documents. Motion blurring prevents proper optical character recognition of the document text contents. One area of such applications is to deblur name card images obtained from handheld cameras. In this paper, a complete motion deblurring procedure for document images has been proposed. The method handles both uniform linear motion blur and uniform acceleration motion blur. Experiments on synthetic and real-life blurred images prove the feasibility and reliability of this algorithm provided that the motion is not too irregular. The restoration procedure consumes only small amount of computation time.
14312797
Correcting document image warping based on regression of curved text lines
Image warping is a common problem when one scans or photocopies a document page from a thick bound volume, resulting in shading and curved text lines in the spine area of the bound volume. This will not only impair readability, but will also reduce the OCR accuracy. Further to our earlier attempt to correct such images, this paper proposes a simpler connected component analysis and regression technique. Compared to our earlier method, the present system is computationally less expensive and is resolution independent too. The implementation of the new system and improvement of OCR accuracy are presented in this paper.
16665932
Document Flattening through Grid Modeling and Regularization
For document images captured by a digital camera, perspective and geometric distortions make it hard to recognize the document content properly. In this paper, we propose an integrated document restoration technique, which is capable of removing perspective and geometric distortions, and producing a flattened and fronto-parallel text image that is friendly to the generic OCR systems. The proposed document restoration is accomplished through grid modeling, which divides camera images into multiple quadrilateral grids using vertical text directions and the x lines and base lines. The global distortions are then removed through grid regularization that transforms the quadrilateral grids together with the pixel contents to the regular square grids. Experimental results show the proposed method is fast and easy for implementation
16019676
A Distributed Throttling Approach for Handling High Bandwidth Aggregates
Public-access networks need to handle persistent congestion and overload caused by high bandwidth aggregates that may occur during times of flooding-based DDoS attacks or flash crowds. The often unpredictable nature of these two activities can severely degrade server performance. Legitimate user requests also suffer considerably when traffic from many different sources aggregates inside the network and causes congestion. This paper studies a family of algorithms that "proactively" protect a server from overload by installing rate throttles in a set of upstream routers. Based on an optimal control setting, we propose algorithms that achieve throttling in a distributed and fair manner by taking important performance metrics into consideration, such as minimizing overall load variations. Using ns-2 simulations, we show that our proposed algorithms 1) are highly adaptive by avoiding unnecessary parameter configuration, 2) provide max-min fairness for any number of throttling routers, 3) respond very quickly to network changes, 4) are extremely robust against extrinsic factors beyond the system control, and 5) are stable under given delay bounds.
18299325
A Human Capital Perspective of Organizational Intention to Adopt Open Source Software
This study adopts the human capital perspective as a theoretical lens to understand the factors that influence organizational intention to adopt open source software (OSS). We posit that availability of internal human capital and accessibility to external human capital significantly affect an organization’s intention to adopt OSS either directly or indirectly through switching cost. We analyze survey responses from 81 chief information officers or information systems managers and the results indicate that organizational availability of internal human capital has an indirect effect on an organization’s intention to adopt OSS through switching cost whereas accessibility to external human capital has a direct effect on an organization’s intention to adopt OSS. This study has both theoretical and practical implications. Theoretically, the unique approach from the human capital perspective adds to the extant literature on organizational adoption of innovation and calls for more attention to be directed at understanding the influence of human capital in an increasingly technologically complex environment. Practically, our findings suggest that potential OSS adopters and proponents should develop the human capital necessary for effective exploitation of OSS.
9855788
An Investigation of Online Group-Buying Institution and Buyer Behavior
This study draws on interdependency theory to propose and assess the effects of two artifacts - conditional purchase and information cue - on decisional choice in the online group-buying context. Our results suggest that buyers presented with conditional purchase options (i.e., of not honoring the purchase when the expected discount price is not met) are more willing to make a purchase choice (i.e., deviate from an inactive inertia). Counter-intuitively, provision of information cues (i.e., information about procurement actions of the other buyers) appears to induce inaction. However, when a choice has to be made between a riskier and a less risky choice, the presence of information cues leads to a higher propensity for the riskier choice. Implications for theory and practice are further discussed.
39519625
A CCA2 Secure Key Encapsulation Scheme Based on 3rd Order Shift Registers
In 1998, Cramer and Shoup proposed the first practical and provable cryptosystem against adaptive chosen ciphertext attack under the standard assumption in the standard model, that is, decisional Diffie-Hellman assumption. Recently, Lucks extended the Cramer-Shoup cryptosystem to a group of quadratic residues modulo a composite number and showed that the scheme is provably secure in the standard model. In this paper, we extend Lucks' key encapsulation scheme to a third order linear feedback shift register and is based on a new assunmption which is called shift register based decisional Diffie-Hellman assumptions (SR-DDH). The proposed scheme is provably secure against adaptive chosen ciphertext attack based on the hardness of shift register based decisional Diffie-Hellman assumption in the standard model and not in random oracle model. Furthermore, the size of public key and ciphertext are shorter than Cramer-Shoup cryptosystem and the computational complexity is also more efficient than Cramer-Shoup cryptosystem and Lucks scheme.
34324862
Signature Schemes Based on 3rd Order Shift Registers
In this paper, we propose two digital signature schemes based on a third order linear feedback shift register. One of them is a normal signature scheme for signing document and the other is with encryption for intended reciever. These two signature schemes are different from most of the signature schemes which are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. The efficient computational algorithm for computing kth term of a sequence is also presented. The advantage of these two schemes is that the computation is carried out in the ground field and not in an extension field. We also show that the security of these two signature schemes is equivalent to that of Schnorr signature scheme and Signed-ElGamal encryption scheme respectively.