SoroushVahidi/scidocs huggingface dataset:
Management of trust in the e-marketplace: the role of the buyer's experience in building trust
(2007)

The e-marketplace, or broker-managed online market, is one of today’s most profitable e-business models. In these marketplaces, buyers routinely engage with businesses and individual sellers with whom they have had little or no prior interaction, making trust one of the most important issues in the e-marketplaces. Therefore, a clear understanding of the trust building process in the e-marketplace is important for the success in the market. In this study, we analyze the process by which e-marketplace customers develop trust in both a market-maker and sellers. Additionally, this analysis provides a theoretical framework to identify the antecedents of trust. In the framework, we suggest that the impact of trust on transaction intention is moderated by the customer’s previous experiences in the e-marketplace. The theoretical model presented here was tested on survey and transaction data collected from 692 respondents. The results indicate that customers value the importance of trust in the market-maker and sellers differentially by the level of transaction experience. It is also shown that market-maker’s characteristics (reputation, website’s usability and security) and seller’s characteristics (expertise) play an important role in the formation and development of trust toward a market-maker and sellers, respectively. Journal of Information Technology (2007) 22, 119–132. doi:10.1057/palgrave.jit.2000095 Published online 23 January 2007
A note on the maximum flow through a network
(1956)

-This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of a number of branches, each of which has a !imited capacity. The main result is a theorem: The maximum possible flow from left to right through a network is equal to the minimum value among all simple cut-sets. This theorem is applied to solve a more general problem, in which a number of input nodes and a number of output nodes are used.
The Design of High-Level Features for Photo Quality Assessment
(2006)

We propose a principled method for designing high level features forphoto quality assessment. Our resulting system can classify between high quality professional photos and low quality snapshots. Instead of using the bag of low-level features approach, we first determine the perceptual factors that distinguish between professional photos and snapshots. Then, we design high level semantic features to measure the perceptual differences. We test our features on a large and diverse dataset and our system is able to achieve a classification rate of 72% on this difficult task. Since our system is able to achieve a precision of over 90% in low recall scenarios, we show excellent results in a web image search application.
Proposing measures of flicker in the low frequencies for lighting applications
(2011)

The IEEE Standards Working Group, IEEE PAR1789 "Recommending practices for modulating current in High Brightness LEDs for mitigating health risks to viewers" has been formed to advise the lighting industry and standards groups about the emerging concern of flicker in LED lighting. This paper intends to introduce new measures and definitions of lamp flicker in lighting. The discussion represents on-going work in IEEE PAR1789 that is vital to designing safe LED lamp drivers.
DataPlay: interactive tweaking and example-driven correction of graphical database queries
(2012)

Writing complex queries in SQL is a challenge for users. Prior work has developed several techniques to ease query specification but none of these techniques are applicable to a particularly difficult class of queries: quantified queries. Our hypothesis is that users prefer to specify quantified queries interactively by trial-and-error. We identify two impediments to this form of interactive trial-and-error query specification in SQL: (i) changing quantifiers often requires global syntactical query restructuring, and (ii) the absence of non-answers from SQL's results makes verifying query correctness difficult. We remedy these issues with DataPlay, a query tool with an underlying graphical query language, a unique data model and a graphical interface. DataPlay provides two interaction features that support trial-and-error query specification. First, DataPlay allows users to directly manipulate a graphical query by changing quantifiers and modifying dependencies between constraints. Users receive real-time feedback in the form of updated answers and non-answers. Second, DataPlay can auto-correct a user's query, based on user feedback about which tuples to keep or drop from the answers and non-answers. We evaluated the effectiveness of each interaction feature with a user study and we found that direct query manipulation is more effective than auto-correction for simple queries but auto-correction is more effective than direct query manipulation for more complex queries.
Reliability of lower limb motor evoked potentials in stroke and healthy populations: How many responses are needed?
(2014)

OBJECTIVE
To determine the intra- and inter-session reliability of motor evoked potential (MEP) size parameters in the lower limb of patients with stroke, focussing on the number of MEPs collected and the method of measuring MEP size.


METHODS
Transcranial magnetic stimulation was used to elicit MEPs in the soleus muscle of patients with stroke (n=13) and age-matched healthy participants (n=13) during low level muscle activation. Two sets of 10 responses were collected in the first session and a further 10 responses collected in a second session held 7 days later. Four MEP size measurements were made using 4, 6, 8, or all 10 of the MEPs collected. Intra- and inter-session reliability was examined using intraclass correlation coefficients (ICC) and typical percentage error.


RESULTS
Intrasession ICC statistics using 6 or more MEPs were >0.85 in the stroke group but intersession values were all <0.5. Reliability was best when measuring parameters from individual MEPs rather than averaged responses.


CONCLUSIONS
Reliability of intrasession MEP size is excellent in the lower limb of patients with stroke using as few as 6 MEPs but intersession reliability is poor.


SIGNIFICANCE
Comparing MEP size measures across two or more sessions is questionable in the lower limb of patients with stroke.
The Future of Memory: Remembering, Imagining, and the Brain
(2012)

During the past few years, there has been a dramatic increase in research examining the role of memory in imagination and future thinking. This work has revealed striking similarities between remembering the past and imagining or simulating the future, including the finding that a common brain network underlies both memory and imagination. Here, we discuss a number of key points that have emerged during recent years, focusing in particular on the importance of distinguishing between temporal and nontemporal factors in analyses of memory and imagination, the nature of differences between remembering the past and imagining the future, the identification of component processes that comprise the default network supporting memory-based simulations, and the finding that this network can couple flexibly with other networks to support complex goal-directed simulations. This growing area of research has broadened our conception of memory by highlighting the many ways in which memory supports adaptive functioning.
A Literature Review and Classification of Recommender Systems on Academic Journals
(2011)

Recommender systems have become an important research field since the emergence of the first paper on collaborative filtering in the mid‐1990s. In general, recommender systems are defined as the supporting systems which help users to find information, products, or services (such as books, movies, music, digital products, web sites, and TV programs) by aggregating and analyzing suggestions from other users, which mean reviews from various authorities, and user attributes. However, as academic researches on recommender systems have increased significantly over the last ten years, more researches are required to be applicable in the real world situation. Because research field on recommender systems is still wide and less mature than other research fields. Accordingly, the existing articles on recommender systems need to be reviewed toward the next generation of recommender systems. However, it would be not easy to confine the recommender system researches to specific disciplines, considering the nature of the recommender system researches. So, we reviewed all articles on recommender systems from 37 journals which were published from 2001 to 2010. The 37 journals are selected from top 125 journals of the MIS Journal Rankings. Also, the literature search was based on the descriptors “Recommender system”, “Recommendation system”, “Personalization system”, “Collaborative filtering” and “
Subpixel rendering without color distortions for diamond-shaped PenTile displays
(2017)

A novel subpixel rendering algorithm for diamond-shaped PenTile displays, which improves the apparent display resolution and reduces color fringing artifacts, is proposed in this work. We develop two types of filters: main filters and nonnegative filters. First, the main filters are derived to minimize the error between an original input image and a perceived image. Second, the nonnegative filters are modified from the main filters. While the main filters are optimized for improving the resolution, the nonnegative filters suppress color distortions effectively. We analyze local characteristics of an image and estimate the amount of color distortions in each region. Based on the color distortion analysis, we render the image by applying adaptive combinations of the main filters and the nonnegative filters. Experimental results demonstrate that the proposed algorithm outperforms conventional algorithms, by not only improving the apparent resolution but also suppressing color distortions effectively.
Can Scientific Impact Be Predicted?
(2016)

A widely used measure of scientific impact is citations. However, due to their heavy-tailed distribution, citations are fundamentally difficult to predict. Instead, to characterize scientific impact, we address two analogous questions asked by many scientific researchers: “How will my h-index evolve over time, and which of my previously or newly published papers will contribute to it?” To answer these questions, we perform two related tasks. First, we develop a model to predict authors' future h-indices based on their current scientific impact. Second, we examine the factors that drive papers-either previously or newly published-to increase their authors' predicted future h-indices. By leveraging relevant factors, we can predict an author's h-index in five years with an R2 value of 0.92 and whether a previously (newly) published paper will contribute to this future h-index with an F1 score of 0.99 (0.77). We find that topical authority and publication venue are crucial to these effective predictions, while topic popularity is surprisingly inconsequential. Further, we develop an online tool that allows users to generate informed h-index predictions. Our work demonstrates the predictability of scientific impact, and can help researchers to effectively leverage their scholarly position of “standing on the shoulders of giants”.
Early prediction of scholar popularity
(2016)

Prediction of scholar popularity has become an important research topic for a number of reasons. In this paper, we tackle the problem of predicting the popularity {\it trend} of scholars by concentrating on making predictions both as earlier and accurate as possible. In order to perform the prediction task, we first extract the popularity trends of scholars from a training set. To that end, we apply a time series clustering algorithm called K-Spectral Clustering (K-SC) to identify the popularity trends as cluster centroids. We then predict trends for scholars in a test set by solving a classification problem. Specifically, we first compute a set of measures for individual scholars based on the distance between earlier points in her particular popularity curve and the identified centroids. We then combine those distance measures with a set of academic features (e.g., number of publications, number of venues, etc) collected during the same monitoring period, and use them as input to a classification method. One aspect that distinguishes our method from other approaches is that the monitoring period, during which we gather information on each scholar popularity and academic features, is determined on a per scholar basis, as part of our approach. Using total citation count as measure of scientific popularity, we evaluate our solution on the popularity time series of more than 500,000 Computer Science scholars, gathered from Microsoft Azure Marketplace (https://datamarket.azure.com/dataset/mrc/microsoftacademic). The experimental results show that the our prediction method outperforms other alternative prediction methods. We also show how to apply our method jointly with regression models to improve the prediction of scholar popularity values (e.g., number of citations) at a given future time.
Bringing PageRank to the citation analysis
(2008)

The paper attempts to provide an alternative method for measuring the importance of scientific papers based on the Google’s PageRank. The method is a meaningful extension of the common integer counting of citations and is then experimented for bringing PageRank to the citation analysis in a large citation network. It offers a more integrated picture of the publications’ influence in a specific field. We firstly calculate the PageRanks of scientific papers. The distributional characteristics and comparison with the traditionally used number of citations are then analyzed in detail. Furthermore, the PageRank is implemented in the evaluation of research influence for several countries in the field of Biochemistry and Molecular Biology during the time period of 2000–2005. Finally, some advantages of bringing PageRank to the citation analysis are concluded. 2007 Elsevier Ltd. All rights reserved.
An Efficient Design Methodology for CNFET Based Ternary Logic Circuits
(2016)

Ternary logic is a promising alternative to conventional binary logic. Implementation of ternary logic circuits however requires devices with multiple thresholds, which is a complex task with current CMOS technology. Carbon Nanotube based FETs (CNFETs) present an easier alternative for the implementation of ternary logic circuits since their threshold voltages can be varied by varying the diameter. In existing design methodology of ternary logic circuits, ternary signals are first converted to binary signals using ternary decoders which are then passed through binary gates and an encoder to get the final ternary output. Since every input signal requires a ternary decoder, the resulting circuits lead to increased area, power and delay. In this paper, authors suggest a new transistor-level methodology for designing CNFET-based ternary circuits without using ternary decoders. Elimination of decoders results in reduced area, power and delay. Simulation results indicate that up to 88% reduction in power consumption, 64% reduction in transistor count and 12 % reduction in delay can be achieved using the proposed approach when compared to the existing one.
Adaptive Control of an Inverted Pendulum Using Adaptive PID Neural Network
(2009)

Abstract- In this paper, a new method for adaptive control of nonlinear systems using neural networks and Proportional-Integral-Derivative (PID) methodology is proposed. In this method, a PID control and adaptive linear neural network is used to control a inverted pendulum with uncertainities and external disturbances. The system consists of an inverted pole hinged on a cart which is free to move in the x direction. The performance of the proposed method is demonstrated via simulations.
Scaling HDFS to More Than 1 Million Operations Per Second with HopsFS
(2017)

HopsFS is an open-source, next generation distribution of the Apache Hadoop Distributed File System(HDFS) that replaces the main scalability bottleneck in HDFS, single node in-memory metadata service, with a no-sharedstate distributed system built on a NewSQL database. By removing the metadata bottleneck in Apache HDFS, HopsFS enables significantly larger cluster sizes, more than an order of magnitude higher throughput, and significantly lower clientlatencies for large clusters. In this paper, we detail the techniques and optimizations that enable HopsFS to surpass 1 million file system operations per second - at least 16 times higher throughput than HDFS. In particular, we discuss how we exploit recent high performance features from NewSQL databases, such as application defined partitioning, partition-pruned index scans, and distribution aware transactions. Together with more traditional techniques, such as batching and write-ahead caches, we show how many incremental optimizations have enabled a revolution in distributed hierarchical file system performance.
Inpainting of Continuous Frames of Old Movies Based on Deep Neural Network
(2018)

With the changes of eras, traditional movies may suffer continuous frame damage after digits due to improper preservation. In order to solve this problem, we proposed a new inpainting technique for continuous video sequences based on deep neural networks. We introduced the latest image restoration techniques for inpainting key frames of new scenes. Then we use the deep neural network interpolation algorithm to interpolate the intermediate frames, so that the video can achieve a coherent effect in time. In order to preserve the original information as much as possible, we only replace the damaged areas and preserve most of undamaged areas, and finally perform image blending. We test different types of videos and compare them with other methods. Our method has higher quality video inpainting than existing methods.
Non-Autoregressive Machine Translation with Auxiliary Regularization
(2019)

As a new neural machine translation approach, NonAutoregressive machine Translation (NAT) has attracted attention recently due to its high efficiency in inference. However, the high efficiency has come at the cost of not capturing the sequential dependency on the target side of translation, which causes NAT to suffer from two kinds of translation errors: 1) repeated translations (due to indistinguishable adjacent decoder hidden states), and 2) incomplete translations (due to incomplete transfer of source side information via the decoder hidden states). In this paper, we propose to address these two problems by improving the quality of decoder hidden representations via two auxiliary regularization terms in the training process of an NAT model. First, to make the hidden states more distinguishable, we regularize the similarity between consecutive hidden states based on the corresponding target tokens. Second, to force the hidden states to contain all the information in the source sentence, we leverage the dual nature of translation tasks (e.g., English to German and German to English) and minimize a backward reconstruction error to ensure that the hidden states of the NAT decoder are able to recover the source side sentence. Extensive experiments conducted on several benchmark datasets show that both regularization strategies are effective and can alleviate the issues of repeated translations and incomplete translations in NAT models. The accuracy of NAT models is therefore improved significantly over the state-of-the-art NAT models with even better efficiency for inference.
Turing Patterns in Memristive Cellular Nonlinear Networks
(2016)

The formation of ordered structures, in particular Turing patterns, in complex spatially extended systems has been observed in many different contexts, spanning from natural sciences (chemistry, physics, and biology) to technology (mechanics and electronics). In this paper, it is shown that the use of memristors in a simple cell of a spatially-extended circuit architecture allows us to design systems able to generate Turing patterns. In addition, the memristor parameters play a key role in the selection of the type and characteristics of the emerging pattern, which is also influenced by the initial conditions. The problem of finding the regions of parameters where Turing patterns may emerge in the proposed cellular architecture is solved in an analytic way, and numerical results are shown to illustrate the system behavior with respect to its parameters.
Integrated multilayered triboelectric nanogenerator for harvesting biomechanical energy from human motions.
(2013)

We demonstrate a new flexible multilayered triboelectric nanogenerator (TENG) with extremely low cost, simple structure, small size (3.8 cm×3.8 cm×0.95 cm) and lightweight (7 g) by innovatively integrating five layers of units on a single flexible substrate. Owing to the unique structure and nanopore-based surface modification on the metal surface, the instantaneous short-circuit current (Isc) and the open-circuit voltage (Voc) could reach 0.66 mA and 215 V with an instantaneous maximum power density of 9.8 mW/cm2 and 10.24 mW/cm3. This is the first 3D integrated TENG for enhancing the output power. Triggered by press from normal walking, the TENG attached onto a shoe pad was able to instantaneously drive multiple commercial LED bulbs. With the flexible structure, the TENG can be further integrated into clothes or even attached onto human body without introducing sensible obstruction and discomfort to human motions. The novel design of TENG demonstrated here can be applied to potentially achieve self-powered portable electronics.
An Operational Amplifier with Recycling Folded Cascode Topology and Adaptive Biasing
(2014)

This paper presents a highly adaptive operational amplifier with high gain, high bandwidth, high speed and low power consumption. By adopting the recycling folded cascode topology along with an adaptivebiasing circuit, this design achieves high performance in terms of gain-bandwidth product (GBW) and slew rate (SR). This single stage op-amp has been designed in 0.18μm technology with a power supply of 1.8V and a 5pF load. The simulation results show that the amplifier achieved a GBW of 335.5MHz, Unity Gain Bandwidth of 247.1MHz and a slew rate of 92.8V/μs.