15017700
A Comparative Study on Chinese Text Categorization Methods
This paper reports our comparative evaluation of three machine learning methods on Chinese text categorization. Whereas a wide range of methods have been applied to English text categorization, relatively few studies have been done on Chinese text categorization. Based on a People's Daily news corpus, a series of controlled experiments evaluate three machine learning methods, namely k Nearest Neighbor (kNN) algorithm, Support Vector Machines (SVM), and Adaptive Resonance Associative Map (ARAM), in terms of their capabilities in mining categorization knowledge from high dimensional, sparse, and relatively noisy document feature vectors. Experiments reveal that all three methods produce satisfactory performance on the test corpus while ARAM exhibits a marginally better generalization capability, especially from relatively small and noisy training sets.
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.
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
5976969
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. It works by calculating eigen-vectors of an adjacency graph's Laplacian to recover a submanifold of data from a high dimensionality space and then performing cluster number estimation on the eigenvectors. Experiment results on ACE corpora show that this spectral clustering based approach outperforms the other clustering methods.
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.
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.
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.
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.
18402501
An Empirical Investigation of the Auction Buyer's Choice to Buy Out or Bid: Cry of Regret or Laugh of Satisfaction?
Online auction buyers often face the predicament of choosing between the buyout strategy and the bidding strategy to acquire an auctioned product. A buyer who chooses to buy out will obtain the item immediately at the posted price while the one who chooses to bid will have to monitor the bidding process in the hope of acquiring the product at a price lower than the posted one. Despite the wealth of auction literature, relatively few studies empirically assess the buyout option. This study seeks to bridge the gap by investigating how the buyout option (permanent or temporary) and price parameters (starting price and buyout price) affect the formation of two emotions, namely anticipated satisfaction of choice and anticipated regret of outcome, which in turn affect the buying strategy (i.e., buy out or bid). We employ laboratory experiments in our study and our results indicate two interesting findings. First, when the permanent buyout option is available, a buyer is more likely to exhibit loss aversion characteristics and prefer to adopt the buyout strategy. Second, when the temporary buyout option is present, the thought that one could avoid premature ending of auction by exercising the bidding option at the start decreases one’s preference for adopting the buyout strategy. Implications of these results for further research and practice are discussed.
29337903
User Response to Free Trial Restrictions: A Coping Perspective
Software vendors often provide software for free download but with restrictions (e.g., time and/or functionality restrictions). The question that arises is to what extent the restrictions should be set to induce users to procure the full version. This study seeks to answer this question by looking from two perspectives: expectation-disconfirmation and coping behavior. Building on these perspectives, we present a research model of user's coping reactions toward software restrictions. We seek to understand user reactions (i.e., derivation of coping strategy) when their expectation toward trial restrictions is negatively disconfirmed. It is further posited that situational control could moderate the relationship between expectation disconfirmation and coping responses. We believe this research will contribute to enrich the current IS field and benefit market practitioners.
15370586
Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks
A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden convexity in the problem formulations, we obtain solutions that can tackle a variety of objective functions, provide robustness to resource allocations such as power, and be obtained often through distributed algorithms. The advantages of such flexibility and robustness are demonstrated through comparisons with the state-of-the-art in recent research literature. First we show how to distributively solve a variety of resource allocation problems in CDMA and interference limited CDMA channels with quality of service constraints, such as meeting minimum queueing delay or energy per bit requirement. Then, for uplink transmission in a CDMA cellular network, we propose an optimal power control scheme with congestion-aware active link protection. In particular, the tradeoff between power expenditure and the protection margin of the SIR-balancing power algorithm is optimized.