SoroushVahidi/scidocs huggingface dataset:
MRG-OHTC Database for Online Handwritten Tibetan Character Recognition
(2011)

A handwritten Tibetan database, MRG-OHTC, is presented to facilitate the research of online handwritten Tibetan character recognition. The database contains 910 Tibetan character classes written by 130 persons from Tibetan ethnic minority. These characters are selected from basic set and extension set A of Tibetan coded character set. The current version of this database is collected using electronic pen on digital tablet. We investigate some characteristic of writing style from different writers. We evaluate MRG-OHTC database using existing algorithms as a baseline. Experimental results reveal a big challenge to higher recognition performance. To our knowledge, MRG-OHTC is the first publicly available database for handwritten Tibetan research. It provides a basic database to compare empirically different algorithms for handwritten Tibetan character recognition.
Interactive Freeform Design of Tensegrity
(2012)

In this paper, we propose a novel interactive method for flexibly designing tensegrity structures under valid force equilibriums. Unlike previous form-finding techniques that aim to obtain a unique solution by fixing some parameters such as the force densities and lengths of elements, our method provides a design system that allows a user to continuously interact with the form within a multidimensional solution space. First, a valid initial form is generated by converting a given polygon mesh surface into a strut-and-cable network that follows the original surface, and the form is then perturbed to attain an equilibrium state through a two-step optimization of both node coordinates and force densities. Then, the form can be freely transformed by using a standard 2D input device while the system updates the form on the fly based on the orthogonal projection of a deformation mode into the solution space. The system provides a flexible platform for designing a tensegrity form for use as a static architectural structure or a kinetic deployable system.
The Promise of Sustainable Happiness
(2008)

Reference: Boehm, J. K., & Lyubomirsky, S. (in press). The promise of sustainable happiness. In S. J. Lopez (Ed.), Handbook of positive psychology (2 ed.). Oxford: Oxford University Press. The Promise of Sustainable Happiness Julia K. Boehm and Sonja Lyubomirsky Department of Psychology University of California, Riverside Abstract From ancient history to recent times, philosophers, writers, self-help gurus, and now scientists have taken up the challenge of how to foster greater happiness. This chapter discusses why some people are happier than others, focusing on the distinctive ways that happy and unhappy individuals construe themselves and others, respond to social comparisons, make decisions, and self-reflect. We suggest that, despite several barriers to increased well-being, less happy people can strive successfully to be happier by learning a variety of effortful strategies and practicing them with determination and commitment. The sustainable happiness model (Lyubomirsky, Sheldon, & Schkade, 2005) provides a theoretical framework for experimental intervention research on how to increase and maintain happiness. According to this model, three factors contribute to an individual’s chronic happiness level – 1) the set point, 2) life circumstances, and 3) intentional activities, or effortful acts that are naturally variable and episodic. Such activities, which include committing acts of kindness, expressing gratitude or optimism, and savoring joyful life events, represent the most promising route to sustaining enhanced happiness. We describe a half dozen randomized controlled interventions testing the efficacy of each of these activities in raising and maintaining well-being, as well as the mediators and moderators underlying their effects. Future researchers must endeavor not only to learn which particular practices make people happier, but how and why they do so.
Comparative Study of Cloud Computing Data Security Methods
(2015)

Cloud computing is the concept implemented to decipher the Daily Computing Problems. Cloud computing is basically virtual pool of resources and it provides these resources to users via internet. Cloud computing is the internet based development and used in computer technology. The prevalent problem associated with cloud computing is data privacy, security, anonymity and reliability etc. But the most important between them is security and how cloud provider assures it. The work plan here is to eliminate the concerns regarding data privacy using encryption algorithms to enhance the security in cloud. Have discussed about cloud computing security mechanisms and presented the comparative study of several algorithms.
Determining the informational, navigational, and transactional intent of Web queries
(2008)

In this paper, we define and present a comprehensive classification of user intent for Web searching. The classification consists of three hierarchical levels of informational, navigational, and transactional intent. After deriving attributes of each, we then developed a software application that automatically classified queries using a Web search engine log of over a million and a half queries submitted by several hundred thousand users. Our findings show that more than 80% of Web queries are informational in nature, with about 10% each being navigational and transactional. In order to validate the accuracy of our algorithm, we manually coded 400 queries and compared the results from this manual classification to the results determined by the automated method. This comparison showed that the automatic classification has an accuracy of 74%. Of the remaining 25% of the queries, the user intent is vague or multi-faceted, pointing to the need for probabilistic classification. We discuss how search engines can use knowledge of user intent to provide more targeted and relevant results in Web searching. 2007 Elsevier Ltd. All rights reserved.
A Kernel Approach to Comparing Distributions
(2007)

We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reproducing Kernel Hilbert Space. We apply this technique to construct a two-sample test, which is used for determining whether two sets of observations arise from the same distribution. We use this test in attribute matching for databases using the Hungarian marriage method, where it performs strongly. We also demonstrate excellent performance when comparing distributions over graphs, for which no alternative tests currently exist.
Beliefs and biases in web search
(2013)

People's beliefs, and unconscious biases that arise from those beliefs, influence their judgment, decision making, and actions, as is commonly accepted among psychologists. Biases can be observed in information retrieval in situations where searchers seek or are presented with information that significantly deviates from the truth. There is little understanding of the impact of such biases in search. In this paper we study search-related biases via multiple probes: an exploratory retrospective survey, human labeling of the captions and results returned by a Web search engine, and a large-scale log analysis of search behavior on that engine. Targeting yes-no questions in the critical domain of health search, we show that Web searchers exhibit their own biases and are also subject to bias from the search engine. We clearly observe searchers favoring positive information over negative and more than expected given base rates based on consensus answers from physicians. We also show that search engines strongly favor a particular, usually positive, perspective, irrespective of the truth. Importantly, we show that these biases can be counterproductive and affect search outcomes; in our study, around half of the answers that searchers settled on were actually incorrect. Our findings have implications for search engine design, including the development of ranking algorithms that con-sider the desire to satisfy searchers (by validating their beliefs) and providing accurate answers and properly considering base rates. Incorporating likelihood information into search is particularly important for consequential tasks, such as those with a medical focus.
Emotional intelligence as a standard intelligence.
(2001)

The authors have claimed that emotional intelligence (EI) meets traditional standards for an intelligence (J. D. Mayer, D. R. Caruso, & P. Salovey, 1999). R. D. Roberts, M. Zeidner, and G. Matthews (2001) questioned whether that claim was warranted. The central issue raised by Roberts et al. concerning Mayer et al. (1999) is whether there are correct answers to questions on tests purporting to measure EI as a set of abilities. To address this issue (and others), the present authors briefly restate their view of intelligence, emotion, and EI. They then present arguments for the reasonableness of measuring EI as an ability, indicate that correct answers exist, and summarize recent data suggesting that such measures are, indeed, reliable.
Architecting for DevOps and Continuous Deployment
(2015)

Development and Operations (DevOps) in the context of Continuous Deployment (CD) have emerged as an attractive software development movement, which tries to establish a strong connection between development and operations teams. CD is defined as the ability to quickly put new releases into production. We believe that DevOps/CD brings new challenges for architects, which considerably impacts both on their (architectural) design decisions and their organizational responsibilities. We assert that there is an important and urgent need of sufficient research work to gain a deep understanding of how DevOps/CD adoption can influence architecting, architectural decision-making processes and their outcomes in an organization. This PhD research is aimed at understanding and addressing new challenges for designing architectures for supporting DevOps in the context of CD.
SASI: a generic texture descriptor for image retrieval
(2003)

In this paper, a generic texture descriptor, namely, Statistical Analysis of Structural Information (SASI) is introduced as a representation of texture. SASI is based on statistics of clique autocorrelation coefficients, calculated over structuring windows. SASI defines a set of clique windows to extract and measure various structural properties of texture by using a spatial multi-resolution method. Experimental results, performed on various image databases, indicate that SASI is more successful then the Gabor Filter descriptors in capturing small granularities and discontinuities such as sharp corners and abrupt changes. Due to the flexibility in designing the clique windows, SASI reaches higher average retrieval rates compared to Gabor Filter descriptors. However, the price of this performance is increased computational complexity.
Iterative Integration of Visual Insights during Scalable Patent Search and Analysis
(2011)

Patents are of growing importance in current economic markets. Analyzing patent information has, therefore, become a common task for many interest groups. As a prerequisite for patent analysis, extensive search for relevant patent information is essential. Unfortunately, the complexity of patent material inhibits a straightforward retrieval of all relevant patent documents and leads to iterative, time-consuming approaches in practice. Already the amount of patent data to be analyzed poses challenges with respect to scalability. Further scalability issues arise concerning the diversity of users and the large variety of analysis tasks. With "PatViz”, a system for interactive analysis of patent information has been developed addressing scalability at various levels. PatViz provides a visual environment allowing for interactive reintegration of insights into subsequent search iterations, thereby bridging the gap between search and analytic processes. Because of its extensibility, we expect that the approach we have taken can be employed in different problem domains that require high quality of search results regarding their completeness.
Compact four-port MIMO antenna system at 3.5 GHz
(2017)

This work proposed a compact multiple-input multiple-output (MIMO) antenna system having four antennas each fed by coplanar waveguide (CPW) operating for 3.5GHz band (3400–3600) MHz. The proposed MIMO antenna system is realized with two groups of printed Inverted L-monopole of size 5×4 mm2 placed orthogonally to each other to attain the diversity capability of polarization and pattern at the edge of non-ground portion of size 15 × 15 mm2 of mobile handset. The proposed MIMO antenna system consists of four monopole inverted-L shape radiator each with parasitic shorted stripe extending from the ground plane having same dimensions. The parasitic inverted-L shorted striped served as tuning element by reducing the resonating frequency of the monopole radiator and improving the impedance matching. The mutual coupling between the closely packed antennas is addressed by the neutralization line by feeding anti-phase current to the neighbor antenna. The simulation result showed that that the impedance bandwidth at S11 ≤ −10 dB is 200 MHz enough for 5G network communication channel. The diversity parameters of interest are envelop correlation coefficient and mean effective gain are also calculated.
PostBL: Post-mesh Boundary Layer Mesh Generation Tool
(2013)

A boundary layer mesh is a mesh with dense element distribution in the normal direction along specific boundaries. PostBL is a utility to generate boundary layers elements on an already existing mesh model. PostBL supports creation of hexahedral, prism, quad and tri boundary layer elements. It is a part of MeshKit, which is an open-source library for mesh generation functionalities. Generally, boundary layer mesh generation is a pre-meshing process; in this effort, we start from a model that has already been meshed. Boundary layers elements can be generated along the entire skin, selected exterior or internal surface boundaries. MeshKit uses graph-based approach for representing meshing operations; PostBL is one such meshing operation. It can be coupled to other meshing operations like Jaal, NetGen, TetGen, CAMAL and custom meshing tools like RGG. Simple examples demonstrating generation of boundary layers on different mesh types and OECD Vattenfall T-Junction benchmark hexahedral-mesh are presented.
Where the Truth Lies: Explaining the Credibility of Emerging Claims on the Web and Social Media
(2017)

The web is a huge source of valuable information. However, in recent times, there is an increasing trend towards false claims in social media, other web-sources, and even in news. Thus, factchecking websites have become increasingly popular to identify such misinformation based on manual analysis. Recent research proposed methods to assess the credibility of claims automatically. However, there are major limitations: most works assume claims to be in a structured form, and a few deal with textual claims but require that sources of evidence or counter-evidence are easily retrieved from the web. None of these works can cope with newly emerging claims, and no prior method can give user-interpretable explanations for its verdict on the claim’s credibility. This paper overcomes these limitations by automatically assessing the credibility of emerging claims, with sparse presence in web-sources, and generating suitable explanations from judiciously selected sources. To this end, we retrieve diverse articles about the claim, and model the mutual interaction between: the stance (i.e., support or refute) of the sources, the language style of the articles, the reliability of the sources, and the claim’s temporal footprint on the web. Extensive experiments demonstrate the viability of our method and its superiority over prior works. We show that our methods work well for early detection of emerging claims, as well as for claims with limited presence on the web and social media.
Functional Specialization for Semantic and Phonological Processing in the Left Inferior Prefrontal Cortex
(1999)

Neuroimaging and neuropsychological studies have implicated left inferior prefrontal cortex (LIPC) in both semantic and phonological processing. In this study, functional magnetic resonance imaging was used to examine whether separate LIPC regions participate in each of these types of processing. Performance of a semantic decision task resulted in extensive LIPC activation compared to a perceptual control task. Phonological processing of words and pseudowords in a syllable-counting task resulted in activation of the dorsal aspect of the left inferior frontal gyrus near the inferior frontal sulcus (BA 44/45) compared to a perceptual control task, with greater activation for nonwords compared to words. In a direct comparison of semantic and phonological tasks, semantic processing preferentially activated the ventral aspect of the left inferior frontal gyrus (BA 47/45). A review of the literature demonstrated a similar distinction between left prefrontal regions involved in semantic processing and phonological/lexical processing. The results suggest that a distinct region in the left inferior frontal cortex is involved in semantic processing, whereas other regions may subserve phonological processes engaged during both semantic and phonological tasks.
Color spaces for computer graphics
(1978)

Normal human color perception is a product of three independent sensory systems. By mirroring this mechanism, full-color display devices create colors as mixtures of three primaries. Any displayable color can be described by the corresponding values of these primaries. Frequently it is more convenient to define various other color spaces, or coordinate systems, for color representation or manipulation. Several such color spaces are presented which are suitable for applications involving user specification of color, along with the defining equations and illustrations. The use of special color spaces for particular kinds of color computations is discussed.
Using CMMI together with agile software development: A systematic review
(2015)

http://dx.doi.org/10.1016/j.infsof.2014.09.012 0950-5849/ 2014 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Center of Informatics, Federal University of Pernambuco (CIn/UFPE), Av. Jornalista Anibal Fernandes, S/N, Cidade Universitária, 50. Recife, PE, Brazil. Tel.: +55 81 8250 0470. E-mail addresses: fss4@cin.ufpe.br (F. Selleri Silva), fsfs@cin.ufpe.br (F.S.F. Soares), alp5@cin.ufpe.br (A.L. Peres), ima2@cin.ufpe.br (I.M.d. Azevedo), aplfv@ci (A.P.L.F. Vasconcelos), fkk@cin.ufpe.br (F.K. Kamei), srlm@cin.ufpe.br (S.R.d.L. Meira). Fernando Selleri Silva a,b,⇑, Felipe Santana Furtado Soares , Angela Lima Peres , Ivanildo Monteiro de Azevedo , Ana Paula L.F. Vasconcelos , Fernando Kenji Kamei , Silvio Romero de Lemos Meira a,c
Embedding Temporal Network via Neighborhood Formation
(2018)

Given the rich real-life applications of network mining as well as the surge of representation learning in recent years, network embedding has become the focal point of increasing research interests in both academic and industrial domains. Nevertheless, the complete temporal formation process of networks characterized by sequential interactive events between nodes has yet seldom been modeled in the existing studies, which calls for further research on the so-called temporal network embedding problem. In light of this, in this paper, we introduce the concept of neighborhood formation sequence to describe the evolution of a node, where temporal excitation effects exist between neighbors in the sequence, and thus we propose a Hawkes process based Temporal Network Embedding (HTNE) method. HTNE well integrates the Hawkes process into network embedding so as to capture the influence of historical neighbors on the current neighbors. In particular, the interactions of low-dimensional vectors are fed into the Hawkes process as base rate and temporal influence, respectively. In addition, attention mechanism is also integrated into HTNE to better determine the influence of historical neighbors on current neighbors of a node. Experiments on three large-scale real-life networks demonstrate that the embeddings learned from the proposed HTNE model achieve better performance than state-of-the-art methods in various tasks including node classification, link prediction, and embedding visualization. In particular, temporal recommendation based on arrival rate inferred from node embeddings shows excellent predictive power of the proposed model.
Survey of semantic annotation platforms
(2005)

The realization of the Semantic Web requires the widespread availability of semantic annotations for existing and new documents on the Web. Semantic annotations are to tag ontology class instance data and map it into ontology classes. The fully automatic creation of semantic annotations is an unsolved problem. Instead, current systems focus on the semi-automatic creation of annotations. The Semantic Web also requires facilities for the storage of annotations and ontologies, user interfaces, access APIs, and other features to fully support annotation usage. This paper examines current Semantic Web annotation platforms that provide annotation and related services, and reviews their architecture, approaches and performance.
The String-to-String Correction Problem
(1974)

The string-to-string correction problem is to determine the distance between two strings as measured by the minimum cost sequence of “edit operations” needed to change the one string into the other. The edit operations investigated allow changing one symbol of a string into another single symbol, deleting one symbol from a string, or inserting a single symbol into a string. An algorithm is presented which solves this problem in time proportional to the product of the lengths of the two strings. Possible applications are to the problems of automatic spelling correction and determining the longest subsequence of characters common to two strings.
Ontology Learning for the Semantic Web
(2001)

The Semantic Web relies heavily on the formal ontologies that structure underlying data for the purpose of comprehensive and transportable machine understanding. Therefore, the success of the Semantic Web depends strongly on the proliferation of ontologies, which requires fast and easy engineering of ontologies and avoidance of a knowledge acquisition bottleneck. Ontology Learning greatly facilitates the construction of ontologies by the ontology engineer. The vision of ontology learning that we propose here includes a number of complementary disciplines that feed on different types of unstructured, semi-structured and fully structured data in order to support a semi-automatic, cooperative ontology engineering process. Our ontology learning framework proceeds through ontology import, extraction, pruning, refinement, and evaluation giving the ontology engineer a wealth of coordinated tools for ontology modeling. Besides of the general framework and architecture, we show in this paper some exemplary techniques in the ontology learning cycle that we have implemented in our ontology learning environment, Text-ToOnto, such as ontology learning from free text, from dictionaries, or from legacy ontologies, and refer to some others that need to complement the complete architecture, such as reverse engineering of ontologies from database schemata or learning from XML documents. Ontologies for the Semantic Web Conceptual structures that define an underlying ontology are germane to the idea of machine processable data on the Semantic Web. Ontologies are (meta)data schemas, providing a controlled vocabulary of concepts, each with an explicitly defined and machine processable semantics. By defining shared and common domain theories, ontologies help both people and machines to communicate concisely,