Query: Human Character Recognition by Handwriting using Fuzzy Logic Ms .

Relevant passages:
Identifying Personality Traits , and Especially Traits Resulting in Violent Behavior through Automatic Handwriting Analysis <=SEP=> Handwriting analysis is a process that has been carried out for centuries. But its effectiveness when analyzing the behavior and personality of an individual is still a debate. Is it possible to detect potential deviant behavior and personality traits of an individual by carrying out an analysis of his/her handwriting? There are two methods of handwriting analysis: Graphology is the method of psychological analysis, while forensic document examination or handwriting identification which is the examination of documents and writing samples by a known source, or person. In this paper we have carried out research of the various state of the art technologies available in analyzing an individual's behavior based on their handwriting and the effectiveness of predicting the character and personality of that individual. We also wanted to determine if we can uncover handedness, authorship and gender through analysis. Apart from working on Lewinson-Zubin method of analyzing handwriting, various online tools are also available for handwriting analysis, such as: NEURO SCRIPT, WANDA, CEDAR-FOX, and Gaussian Mixture Model.

Handwriting Analysis based on Segmentation Method for Prediction of Human Personality using Support Vector Machine <=SEP=> Handwriting analysis is a method to predict personality of an author and to better understand the writer. Allograph and allograph combination analysis is a scientific method of writer identification and evaluating the behavior. To make this computerized we considered six main different types of features: (i) size of letters, (ii) slant of letters and words, (iii) baseline, (iv) pen pressure, (v) spacing between letters and (vi) spacing between words in a document to identify the personality of the writer. Segmentation is used to calculate the features from digital handwriting and is trained to SVM which outputs the behavior of the writer. For this experiment 100 different writers were used for different handwriting data samples. The proposed method gives about 94% of accuracy rate with RBF kernel. In this paper an automatic method has been proposed to predict the psychological personality of the writer. The system performance is measured under two different conditions with the same sample.

Automatically Categorizing Written Texts by Author Gender <=SEP=> The problem of automatically determining the gender of a document's author would appear to be a more subtle problem than those of categorization by topic or authorship attribution. Nevertheless, it is shown that automated text categorization techniques can exploit combinations of simple lexical and syntactic features to infer the gender of the author of an unseen formal written document with approximately 80% accuracy. The same techniques can be used to determine if a document is fiction or non-fiction with approximately 98% accuracy.

On-Line and Off-Line Handwriting Recognition: A Comprehensive Survey <=SEP=> ÐHandwriting has continued to persist as a means of communication and recording information in day-to-day life even with the introduction of new technologies. Given its ubiquity in human transactions, machine recognition of handwriting has practical significance, as in reading handwritten notes in a PDA, in postal addresses on envelopes, in amounts in bank checks, in handwritten fields in forms, etc. This overview describes the nature of handwritten language, how it is transduced into electronic data, and the basic concepts behind written language recognition algorithms. Both the on-line case (which pertains to the availability of trajectory data during writing) and the off-line case (which pertains to scanned images) are considered. Algorithms for preprocessing, character and word recognition, and performance with practical systems are indicated. Other fields of application, like signature verification, writer authentification, handwriting learning tools are also considered. Index TermsÐHandwriting recognition, on-line, off-line, written language, signature verification, cursive script, handwriting learning tools, writer authentification.

Automated Human Behavior Prediction through Handwriting Analysis <=SEP=> Handwriting Analysis or Graphology is a scientific method of identifying, evaluating and understanding personality through the strokes and patterns revealed by handwriting. Handwriting reveals the true personality including emotional outlay, fears, honesty, defenses and many others. Professional handwriting examiners called graphologist often identify the writer with a piece of handwriting. Accuracy of handwriting analysis depends on how skilled the analyst is. Although human intervention in handwriting analysis has been effective, it is costly and prone to fatigue. Hence the proposed methodology focuses on developing a tool for behavioral analysis which can predict the personality traits automatically with the aid of a computer without the human intervention. In this paper a method has been proposed to predict the personality of a person from the baseline, the pen pressure, the letter‘t’, the lower loop of letter ‘y’ and the slant of the writing as found in an individual’s handwriting. These parameters are the inputs to a Rule-Base which outputs the personality trait of the writer.

Human Action Recognition under Log-Euclidean Riemannian Metric <=SEP=> This paper presents a new action recognition approach based on local spatio-temporal features. The main contributions of our approach are twofold. First, a new local spatio-temporal feature is proposed to represent the cuboids detected in video sequences. Specifically, the descriptor utilizes the covariance matrix to capture the self-correlation information of the low-level features within each cuboid. Since covariance matrices do not lie on Euclidean space, the Log-Euclidean Riemannian metric is used for distance measure between covariance matrices. Second, the Earth Mover’s Distance (EMD) is used for matching any pair of video sequences. In contrast to the widely used Euclidean distance, EMD achieves more robust performances in matching histograms/distributions with different sizes. Experimental results on two datasets demonstrate the effectiveness of the proposed approach.

Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation <=SEP=> The sheer volume of scholarly publications available online significantly challenges how scholars retrieve the new information available and locate the candidate reference papers. While classical text retrieval and pseudo relevance feedback (PRF) algorithms can assist scholars in accessing needed publications, in this study, we propose an innovative publication ranking method with PRF by leveraging a number of meta-paths on the heterogeneous bibliographic graph. Different meta-paths on the graph address different ranking hypotheses, whereas the pseudo-relevant papers (from the retrieval results) are used as the seed nodes on the graph. Meanwhile, unlike prior studies, we propose "restricted meta-path" facilitated by a new context-rich heterogeneous network extracted from full-text publication content along with citation context. By using learning-to-rank, we integrate 18 different meta-path-based ranking features to derive the final ranking scores for candidate cited papers. Experimental results with ACM full-text corpus show that meta-path-based ranking with PRF on the new graph significantly (p < 0.0001) outperforms text retrieval algorithms with text-based or PageRank-based PRF.

Privacy-Preserving Online Task Assignment in Spatial Crowdsourcing with Untrusted Server <=SEP=> With spatial crowdsourcing (SC), requesters outsource their spatiotemporal tasks (tasks associated with location and time) to a set of workers, who will perform the tasks by physically traveling to the tasks' locations. However, current solutions require the locations of the workers and/or the tasks to be disclosed to untrusted parties (SC server) for effective assignments of tasks to workers. In this paper we propose a framework for assigning tasks to workers in an online manner without compromising the location privacy of workers and tasks. We perturb the locations of both tasks and workers based on geo-indistinguishability and then devise techniques to quantify the probability of reachability between a task and a worker, given their perturbed locations. We investigate both analytical and empirical models for quantifying the worker-task pair reachability and propose task assignment strategies that strike a balance among various metrics such as the number of completed tasks, worker travel distance and system overhead. Extensive experiments on real-world datasets show that our proposed techniques result in minimal disclosure of task locations and no disclosure of worker locations without significantly sacrificing the total number of assigned tasks.

How Personal Experience and Technical Knowledge Affect Using Conversational Agents <=SEP=> Conversational agents (CA) use dialogues to interact with users so as to offer an experience of naturalistic interaction. However, due to the low transparency and poor explanability of mechanism inside CA, individual's understanding of CA's capabilities may affect how the individual interacts with CA and the sustainability of CA use. To examine how users' understanding affect perceptions and experiences of using CA, we conducted a laboratory study asking 41 participants performed a set of tasks using Apple Siri. We independently manipulated two factors: (1) personal experience of using CA, and (2) technical knowledge about CA's system model. We conducted mixed-method analyses of post-task usability measures and interviews, and confirmed that use experience and technical knowledge affects perceived usability and mental models differently.

Dynamic TXOP HCCA reclaiming scheduler with transmission time estimation for IEEE 802.11e real-time networks <=SEP=> IEEE 802.11e HCCA reference scheduler guarantees Quality of Service only for Constant Bit Rate traffic streams, whereas its assignment of scheduling parameters (transmission time TXOP and polling period) is too rigid to serve Variable Bit Rate (VBR) traffic.
 This paper presents a new scheduling algorithm, Dynamic TXOP HCCA (DTH). Its scheduling scheme, integrated with the centralized scheduler, uses both a statistical estimation of needed transmission duration and a bandwidth reclaiming mechanism with the aim of improving the resource management and providing an instantaneous dynamic Transmission Opportunity (TXOP), tailored to multimedia applications with variable bit rate. Performance evaluation through simulation, confirmed by the scheduling analysis, shows that DTH is suitable to reduce the transmission queues length. This positively impacts on the delay and on packets drop rate experienced by VBR traffic streams.

Netradar - Measuring the wireless world <=SEP=> There exists a number of network measurement tools and web-based services for end users. Almost all of them focus on network bandwidth and possibly latency, and simply report the results to the user. This paper presents Netradar, a somewhat different measurement service. We analyze network bandwidth and latency but also over ten other parameters. We dwell into the data and show various coverage maps and statistics on our web site for the benefit of the end users. Our long term goal is to be able to answer the simple question: why did I get the indicated result at a given time and place?

A Behavioral Model of Rational Choice <=SEP=> Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.

Building Domain-Specific Search Engines with Machine Learning Techniques <=SEP=> Domain-specific search engines are growing in popularity because they offer increased accuracy and extra functionality not possible with the general, Web-wide search engines. For example, www.campsearch.com allows complex queries by age-group, size, location and cost over .summer camps. Unfortunately these domain-specific search engines are difficult and timeconsuming to maintain. This paper proposes the use of machine learning techniques to greatly automate the creation and maintenance of domain-specific search engines. We describe new research in reinforcement learning, information extraction and text classification that enables efficient spidering, identifying informative text segments, and populating topic hierarchies. Using these techniques, we have built a demonstration system: a search engine for computer science research papers. It already contaius over 50,000 papers and is publicly available at ~w. cora.justres earch, com.

Dynamic Identification of Manipulator : Comparison between CAD and Actual Parameters <=SEP=> It is essential to know the dynamic parameters of the robot for its precise control and simulation. Philosophy of identification is based on finding the model using its input-output data. The identification equation of the manipulator is derived from Newton-Euler equations, using manipulator kinematic, i.e., geometric parameters and joint values as input and joint torque data as output. In this paper, the dynamic parameters are identified for the CAD model provided by the robot manufacturer in simulation. And experimentally for the installed seven degrees of freedom (DOF) robot KUKA-iiwaR800. The variation between the joint torques predicted from the estimated base parameters obtained using CAD model and actual robot are presented. The factors responsible for the variation are also highlighted.

An Efficient Algorithm for Disease Prediction with Multi Dimensional Data <=SEP=> The main objective of this study is to create a fast, easy and an efficient algorithm for disease prediction , with less error rate and can apply with even large data sets and show reasonable patterns with dependent variables. For disease identification and prediction in data mining a new hybrid algorithm was constructed. The Disease Identification and Prediction(DIP) algorithm, which is the combination of decision tree and association rule is used to predict the chances of some of the disease hits in some particular areas. It also shows the relationship between different parameters for the prediction. To implement this algorithm using vb.net software was also developed.

Stemming of Amharic Words for Information Retrieval <=SEP=> This paper presents a stemmer for processing document and query words to facilitate searching databases of Amharic text. An iterative stemmer has been developed that involves the removal of both prefixes and suffixes and that also takes account of letter inconsistency and reiterative verb forms. Application of the stemmer to a test file of 1221 words suggested that appropriate stems were generated for ca. 95 per cent of them, with only limited overstemming and understemming. Lit&Ling 17/1 001-017 FINAL 23/7/02 3:33 pm Page 1

Graph-based Approach to Automatic Taxonomy Generation (GraBTax) <=SEP=> We propose a novel graph-based approach for constructing concept hierarchy from a large text corpus. Our algorithm, GraBTax, incorporates both statistical co-occurrences and lexical similarity in optimizing the structure of the taxonomy. To automatically generate topic-dependent taxonomies from a large text corpus, GraBTax first extracts topical terms and their relationships from the corpus. The algorithm then constructs a weighted graph representing topics and their associations. A graph partitioning algorithm is then used to re-cursively partition the topic graph into a tax-onomy. For evaluation, we apply GraBTax to articles, primarily computer science, in the CiteSeerX digital library and search engine. The quality of the resulting concept hierarchy is assessed by both human judges and comparison with Wikipedia categories.

Semantic integration of UML class diagram with semantic validation on segments of mappings <=SEP=> Recently, attention has focused on the software development, specially by different teams that are geographically distant to support collaborative work. Management, description and modeling in such collaborative approach are through several tools and techniques based on UML models. It is now supported by a large number of tools. Most of these systems have the ability to compare different UML models, assist developers, designers and also provide operations for the merging and integration, to produce a coherent model. The contribution in this article is both to integrate a set of UML class diagrams using mappings that are result of alignment and assist designers and developers in the integration. In addition, we will present a detail integration of UML models with the validation of mappings between them. Such validation helps to achieve correct, consistent and coherent integrated model.

Research on metadata-driven data quality assessment architecture <=SEP=> So far there have never been systematic evaluation criteria and entire assessment and evaluation system in Data quality internationally. Based on the research on the relative content of both international and domestic data quality, this article analyzes the requests of data quality for the large enterprises. First of all, this paper raises and builds a complete data quality assessment system. Second, the definitions and specific algorithms of data quality assessment indicators and poses data quality analysis are built to evaluate the architecture and processes. A frame structure of data quality meta-model is presented in this paper. In addition, this paper also designs an evaluation system. This system includes the classification and definition of data quality and the algorithm in evaluation index and the system and process of data quality evaluation. This paper provides credibility basis for enterprises in evaluation of data quality.

Cortical mechanism for the visual guidance of hand grasping movements in the monkey: A reversible inactivation study. <=SEP=> Picking up an object requires two basic motor operations: reaching and grasping. Neurophysiological studies in monkeys have suggested that the visuomotor transformations necessary for these two operations are carried out by separate parietofrontal circuits and that, for grasping, a key role is played by a specific sector of the ventral premotor cortex: area F5. The aim of the present study was to test the validity of this hypothesis by reversibly inactivating area F5 in monkeys trained to grasp objects of different shape, size and orientation. In separate sessions, the hand field of the primary motor cortex (area F1 or area 4) was also reversibly inactivated. The results showed that after inactivation of area F5 buried in the bank of the arcuate sulcus (the F5 sector where visuomotor neurones responding to object presentation are located), the hand shaping preceding grasping was markedly impaired and the hand posture was not appropriate for the object size and shape. The monkeys were eventually able to grasp the objects, but only after a series of corrections made under tactile control. With small inactivations the deficits concerned the contralesional hand, with larger inactivations the ipsilateral hand as well. In addition, there were signs of peripersonal neglect in the hemispace contralateral to the inactivation site. Following inactivation of area F5 lying on the cortical convexity (the F5 sector where visuomotor neurones responding to action observation, 'mirror neurones', are found) only a motor slowing was observed, the hand shaping being preserved. The inactivation of the hand field of area F1 produced a severe paralysis of contralateral finger movements with hypotonia. The results of this study indicate the crucial role of the ventral premotor cortex in visuomotor transformations for grasping movements. More generally, they provide strong support for the notion that distal and proximal movement organization relies upon distinct cortical circuits. Clinical data on distal movement deficits in humans are re-examined in the light of the present findings.

Pegasus: A framework for mapping complex scientific workflows onto distributed systems <=SEP=> This paper describes the Pegasus framework that can be used to map complex scientific workflows onto distributed resources. Pegasus enables users to represent the workflows at an abstract level without needing to worry about the particulars of the target execution systems. The paper describes general issues in mapping applications and the functionality of Pegasus. We present the results of improving application performance through workflow restructuring which clusters multiple tasks in a workflow into single entities. A real-life astronomy application is used as the basis for the study.

Stability of Drugs and Dosage Forms <=SEP=> 

An Algebraic Fault Attack on the LED Block Cipher <=SEP=> In this paper we propose an attack on block ciphers where we combine techniques derived from algebraic and fault based cryptanalysis. The recently introduced block cipher LED serves us as a target for our attack. We show how to construct an algebraic representation of the encryption map and how to cast the side channel information gained from a fault injection into polynomial form. The resulting polynomial system is converted into a logical formula in conjunctive normal form and handed over to a SAT solver for reconstruction of the secret key. Following this approach we were able to mount a new, successful attack on the version of LED that uses a 64-bit secret key, requiring only a single fault injection.

Implementation of 3D Obstacle Compliant Mobility Models for UAV Networks in ns-3 <=SEP=> UAV networks are envisioned to play a crucial role in the future generations of wireless networks. The mechanical degrees of freedom in the movement of UAVs provides various advantages for tactical and civilian applications. Due to the high cost of failures in system-based tests, initial analysis and refinement of designs and algorithms for UAV applications are performed through rigorous simulations. Current trend of UAV specific simulators is mainly biased towards the mechanical properties of flying. For network-centric simulations, the intended measurements on the performance of protocols in mobile scenarios are conventionally captured from general-purpose network simulators, which are not natively equipped with comprehensive models for 3D movements of UAVs. To facilitate such simulations for UAV systems, this paper presents different mobility models for emulation of the movement of a UAV. Detailed description of three mobility models (random walk, random direction, and Gauss-Markov) are presented, and their associated movement patterns are characterized. This characterization is further extended by considering the effect of large obstacles on movement patterns of nodes following the three models. The mobility models are prepared as open-source add-ons for ns-3 network simulator.

Gain Improvement of Rectangular Dielectric Resonator Antenna by Engraving Grooves on Its Side Walls <=SEP=> A new technique for increasing the boresight gain of a rectangular dielectric resonator antenna (DRA) operating at its fundamental radiating <inline-formula><tex-math notation="LaTeX">$TE_{111}^y$</tex-math></inline-formula> mode is introduced. The idea is to increase the radiations from the side walls of the DRA compared to that of its top wall by engraving grooves on the side walls. A model based on the array theory is developed to explain the high-gain nature of the antenna. The measured results demonstrate that the proposed antenna achieves an impedance bandwidth of 21% over a band of 3.24–4 GHz, with a maximum gain of 9.6 dB. This is significantly higher with respect to available data in the literature.

Microwave Doherty Power Amplifier for High Efficiency and Linearity <=SEP=> This paper explains the basic circuit configuration of microwave Doherty amplifier and additional design methods for wide bandwidth and high power applications. This paper also presents the recent experimental results of the group using the uneven power drive. Most of the previous works about microwave Doherty amplifier have employed identical input drives. In this works, two 1:1(2-way) and a 1:2(3-way) Doherty amplifiers are implemented at 2.14GHz center frequency using LDMOS with a peak envelope power of 180 watt and 285 watt, respectively. The 2-way Doherty amplifiers are optimized at 25 watt average output power for high efficiency and linearity and the 3-way Doherty amplifier at 16 watt average output power for high linearity. The amplifiers are tested using WCDMA 4FA signal. The performances of the 2-way Doherty amplifier are compared with that of the comparable class AB amplifier and the Doherty amplifier with even power drive. The performances of the 3-way Doherty amplifier are compared with that of the comparable class AB amplifier. The experimental results show the superior performances of our Doherty amplifiers

A Monocephalus Diprosopus Fetus: Antenatal Sonographic Findings - <=SEP=> Monocephalus Diprosopus is the rarest form of conjoined twins. The etiology of this anomaly is stil obscure. We herein report a monocephalus diprosopus case that was diagnosed in week 19 of pregnancy was presented due to its rarity and the significance of its prenatal diagnosis. Recommended a pregnancy termination since it does not have a definitive treatment today, prenatal diagnosis made for such fetuses at an early stage bears importance in terms of lowering the severity of psychological trauma.

The Self-Serv Environment for Web Services Composition <=SEP=> The composition of Web services to handle complex transactions such as finance, billing, and traffic information services is gaining considerable momentum as a way to enable business-to-business (B2B) collaborations.1 Web services allow organizations to share costs, skills, and resources by joining their applications and systems.2 Although current technologies provide the foundation for building composite services, several issues still need to be addressed:

Sentiment Identification in Code-Mixed Social Media Text <=SEP=> Sentiment analysis is the Natural Language Processing (NLP) task dealing with the detection and classification of sentiments in texts. While some tasks deal with identifying presence of sentiment in text (Subjectivity analysis), other tasks aim at determining the polarity of the text categorizing them as positive, negative and neutral. Whenever there is presence of sentiment in text, it has a source (people, group of people or any entity) and the sentiment is directed towards some entity, object, event or person. Sentiment analysis tasks aim to determine the subject, the target and the polarity or valence of the sentiment. In our work, we try to automatically extract sentiment (positive or negative) from Facebook posts using a machine learning approach. While some works have been done in code-mixed social media data and in sentiment analysis separately, our work is the first attempt (as of now) which aims at performing sentiment analysis of code-mixed social media text. We have used extensive pre-processing to remove noise from raw text. Multilayer Perceptron model has been used to determine the polarity of the sentiment. We have also developed the corpus for this task by manually labelling Facebook posts with their associated sentiments.

Millimeter-wave antenna in package on low-cost organic substrate for flip chip chip scale (FCCSP) package <=SEP=> This work proposes a broadband microstrip patch antenna array with H-shaped aperture-coupled stacked rectangular patches is implemented to low-cost and low-loss organic substrate for flip chip chip scale (FCCSP) package for millimeter-wave antenna in package (AiP) application. The proposed antenna array is built on a low-cost and low-loss multilayer organic substrate for flip chip chip scale (FCCSP) package. The return loss of < −10 dB bandwidth of the proposed antenna array is from 55 to 69 GHz, which covers the requirement of IEEE 802.11ad standard. The cross-polarization levels in both and planes are better than 30 dB. The front-to-back ratio of the antenna radiation pattern is better than 20 dB. The prospoed microstrip patch antenna can achieve a wide bandwidth, low cross-polarization levels, low backward radiation levels, and easy integration with radio frequency (RF) circuits. This work provides a cost-effective approach for fifth-generation mobile communications (5G), IEEE 802.11ad, such as smart phone, laptops, and wireless router.