SoroushVahidi/scidocs huggingface dataset:
Disclosure , Liquidity , and the Cost of Capital
(2007)

This paper shows that revealing public information to reduce information asymmetry can reduce a firm's cost of capital by attracting increased demand from large investors due to increased liquidity of its securities. Large firms will disclose more information since they benefit most. Disclosure also reduces the risk bearing capacity available through market makers. If initial information asymmetry is large, reducing it will increase the current price of the security. However, the maximum current price occurs with some asymmetry of information: further reduction of information asymmetry accentuates the undesirable effects of exit from market making. THIS PAPER STUDIES THE causes and consequences of a security's liquidity, especially the effect of future liquidity on the security's current price-equivalently the effect on its required expected rate of return, its cost of capital. Under conditions that we identify, reducing information asymmetry reduces the cost of capital. Under other (less typical) conditions, this reduced information asymmetry can have the opposite effect. We use public disclosure of information as the means of changing information asymmetry, but the points are more general. Our model is related to those of Kyle (1985), Glosten and Milgrom (1985), and Admati and Pfleiderer (1988). They assume that there is unlimited risk bearing capacity devoted to market making, which implies that changes in future liquidity never influence a security's cost of capital.1 In contrast, we develop a model of trade in an illiquid market with limited risk bearing capacity of risk-averse market makers and examine the effects of private information on the incentives of market makers to provide risk bearing *The University of Chicago and the University of Pennsylvania, respectively. Diamond gratefully acknowledges support from NSF grant SES-8896223 and from a gift to the University of Chicago from Dimensional Fund Advisors. Verrecchia gratefully acknowledges financial assistance from Ernst & Young and the Wharton School of the University of Pennsylvania. We are grateful to Franklin Allen, Ren6 Stulz, Robert Vishny, an anonymous referee, and workshop participants at the University of Chicago, the Federal Reserve Bank of Richmond, Georgetown University, and UCLA for helpful comments on a previous draft. 'Given the assumption, one could even close the secondary market for an arbitrarily long time in the future without influencing the current price. As a security becomes less liquid in these models, more of the security is permanently held by the market makers who do not care about liquidity.
Robust sensor-based grasp primitive for a three-finger robot hand
(2009)

This paper addresses the problem of robot grasping in conditions of uncertainty. We propose a grasp controller that deals robustly with this uncertainty using feedback from different contact-based sensors. This controller assumes a description of grasp consisting of a primitive that only determines the initial configuration of the hand and the control law to be used. We exhaustively validate the controller by carrying out a large number of tests with different degrees of inaccuracy in the pose of the target objects and by comparing it with results of a naive grasp controller.
Integrating Out Multinomial Parameters in Latent Dirichlet Allocation and Naive Bayes for Collapsed Gibbs Sampling
(2010)

This note shows how to integrate out the multinomial parameters for latent Dirichlet allocation (LDA) and naive Bayes (NB) models. This allows us to perform Gibbs sampling without taking multinomial parameter samples. Although the conjugacy of the Dirichlet priors makes sampling the multinomial parameters relatively straightforward, sampling on a topic-by-topic basis provides two advantages. First, it means that all samples are drawn from simple discrete distributions with easily calculated parameters. Second, and more importantly, collapsing supports fully stochastic Gibbs sampling where the model is updated after each word (in LDA) or document (in NB) is assigned a topic. Typically, more stochastic sampling leads to quicker convergence to the stationary state of the Markov chain made up of the Gibbs samples.
A 6.8GHz low-profile H-plane ridged SIW horn antenna
(2015)

The substrate integrated waveguide (SIW) allows the construct of some types of planar antennas which cannot be conventionally integrated on the substrate. However, owing to some technology restrictions, designed SIW horn antennas normally work in the frequency above 10 GHz. This paper proposes a 6.8GHz low-profile H-plane horn antenna based on the ridged SIW, which allows the substrates thinner than λ0/10. Far field radiation patterns are reported to reveal the good performance of proposed antenna. Comparisons among the ridged SIW horn antennas with different number of ridges are also made to shown the matching improvements.
Long Text Generation via Adversarial Training with Leaked Information
(2018)

Automatically generating coherent and semantically meaningful text has many applications in machine translation, dialogue systems, image captioning, etc. Recently, by combining with policy gradient, Generative Adversarial Nets (GAN) that use a discriminative model to guide the training of the generative model as a reinforcement learning policy has shown promising results in text generation. However, the scalar guiding signal is only available after the entire text has been generated and lacks intermediate information about text structure during the generative process. As such, it limits its success when the length of the generated text samples is long (more than 20 words). In this paper, we propose a new framework, called LeakGAN, to address the problem for long text generation. We allow the discriminative net to leak its own high-level extracted features to the generative net to further help the guidance. The generator incorporates such informative signals into all generation steps through an additional MANAGER module, which takes the extracted features of current generated words and outputs a latent vector to guide the WORKER module for next-word generation. Our extensive experiments on synthetic data and various realworld tasks with Turing test demonstrate that LeakGAN is highly effective in long text generation and also improves the performance in short text generation scenarios. More importantly, without any supervision, LeakGAN would be able to implicitly learn sentence structures only through the interaction between MANAGER and WORKER.
Pvclust: an R package for assessing the uncertainty in hierarchical clustering
(2006)

SUMMARY
Pvclust is an add-on package for a statistical software R to assess the uncertainty in hierarchical cluster analysis. Pvclust can be used easily for general statistical problems, such as DNA microarray analysis, to perform the bootstrap analysis of clustering, which has been popular in phylogenetic analysis. Pvclust calculates probability values (p-values) for each cluster using bootstrap resampling techniques. Two types of p-values are available: approximately unbiased (AU) p-value and bootstrap probability (BP) value. Multiscale bootstrap resampling is used for the calculation of AU p-value, which has superiority in bias over BP value calculated by the ordinary bootstrap resampling. In addition the computation time can be enormously decreased with parallel computing option.
Robust single particle tracking in live cell time-lapse sequences
(2008)

Single-particle tracking (SPT) is often the rate-limiting step in live-cell imaging studies of subcellular dynamics. Here we present a tracking algorithm that addresses the principal challenges of SPT, namely high particle density, particle motion heterogeneity, temporary particle disappearance, and particle merging and splitting. The algorithm first links particles between consecutive frames and then links the resulting track segments into complete trajectories. Both steps are formulated as global combinatorial optimization problems whose solution identifies the overall most likely set of particle trajectories throughout a movie. Using this approach, we show that the GTPase dynamin differentially affects the kinetics of long- and short-lived endocytic structures and that the motion of CD36 receptors along cytoskeleton-mediated linear tracks increases their aggregation probability. Both applications indicate the requirement for robust and complete tracking of dense particle fields to dissect the mechanisms of receptor organization at the level of the plasma membrane.
A Semi-Automatic Approach to Handle Data Warehouse Schema Evolution using Ontology
(2014)

In recent years, the number of digital information storage and retrieval systems has increased immensely. Data warehousing has been found to be an extremely useful technology for integrating such heterogeneous and autonomous information sources. Data within the data warehouse is modelled in the form of a star or snowflake schema which facilitates business analysis in a multidimensional perspective. The data warehouse schema is derived from these sources and business requirements. Due to changing business needs the information sources not only change their data but as well change their schema structure. In addition to the source changes the business requirements for data warehouse may also change. Both these changes results in data warehouse schema evolution. Existing approaches either deal with source changes or requirements changes in a manual way and the changes to the data warehouse schema is carried out at the physical level. This may induce high maintenance costs and complex OLAP server administration. As ontology seems to be promising technique in data warehousing research, in this paper we propose an ontological approach to automate the evolution of a data warehouse schema. Our method assists the designer of the data warehouse to handle evolution at the conceptual level and after validation the physical schema is constructed automatically.
A Survey on Semantic Web Search Engine
(2012)

The tremendous growth in the volume of data and with the terrific growth of number of web pages, traditional search engines now a days are not appropriate and not suitable anymore. Search engine is the most important tool to discover any information in World Wide Web. Semantic Search Engine is born of traditional search engine to overcome the above problem. The Semantic Web is an extension of the current web in which information is given well-defined meaning. Semantic web technologies are playing a crucial role in enhancing traditional web search, as it is working to create machine readable data. but it will not replace traditional search engine. In this paper we made a brief survey on various promising features of some of the best semantic search engines developed so far and we have discussed the various approaches to semantic search. We have summarized the techniques, advantages of some important semantic web search engines that are developed so far.The most prominent part is that how the semantic search engines differ from the traditional searches and their results are shown by giving a sample query as input.
Distributed Mutual Exclusion Algorithms for Intersection Traffic Control
(2015)

Traffic control at intersections is a key issue and hot research topic in intelligent transportation systems. Existing approaches, including traffic light scheduling and trajectory maneuver, are either inaccurate and inflexible or complicated and costly. More importantly, due to the dynamics of traffic, it is really difficult to obtain the optimal solution in a real-time way. Inspired by the emergence of vehicular ad hoc network, we propose a novel approach to traffic control at intersections. Via vehicle to vehicle or vehicle to infrastructure communications, vehicles can compete for the privilege of passing the intersection, i.e., traffic is controlled via coordination among vehicles. Such an approach is flexible and efficient. To realize the coordination among vehicles, we first model the problem as a new variant of the classic mutual exclusion problem, and then design algorithms to solve new problem. Both centralized and distributed algorithms are. We conduct extensive simulations to evaluate the performance of our proposed algorithms. The results show that, our approach is efficient and outperforms a reference algorithm based on optimal traffic light scheduling. Moreover, our approach does not rely on traffic light or intersection controller facilities, which makes it flexible and applicable to various kinds of intersections.
Combining Machine Learning Techniques and Natural Language Processing to Infer Emotions Using Spanish Twitter Corpus
(2013)

In the recent years, microblogging services, as Twitter, have become a popular tool for expressing feelings, opinions, broadcasting news, and communicating with friends. Twitter users produced more than 340 million tweets per day which may be consider a rich source of user information. We take a supervised approach to the problem, but leverage existing hashtags in Twitter for building our training data. Finally, we tested the Spanish emotional corpus applying two different machine learning algorithms for emotion identification reaching about 65% accuracy.
Learning to Create Jazz Melodies Using a Product of Experts
(2017)

We describe a neural network architecture designed to learn the musical structure of jazz melodies over chord progressions, then to create new melodies over arbitrary chord progressions from the resulting connectome (representation of neural network structure). Our architecture consists of two sub-networks, the interval expert and the chord expert, each being LSTM (long short-term memory) recurrent networks. These two sub-networks jointly learn to predict a probability distribution over future notes conditioned on past notes in the melody. We describe a training procedure for the network and an implementation as part of the opensource Impro-Visor (Improvisation Advisor) application, and demonstrate our method by providing improvised melodies based on a variety of training sets.
Ship Classification in TerraSAR-X Images With Feature Space Based Sparse Representation
(2013)

Ship classification is the key step in maritime surveillance using synthetic aperture radar (SAR) imagery. In this letter, we develop a new ship classification method in TerraSAR-X images based on sparse representation in feature space, in which the sparse representation classification (SRC) method is exploited. In particular, to describe the ship more accurately and to reduce the dimension of the dictionary in SRC, we propose to employ a representative feature vector to construct the dictionary instead of utilizing the image pixels directly. By testing on a ship data set collected from TerraSAR-X images, we show that the proposed method is superior to traditional methods such as the template matching (TM), K-nearest neighbor (K-NN), Bayes and Support Vector Machines (SVM).
Robust Real-Time Periodic Motion Detection, Analysis, and Applications
(2000)

We describe new techniques to detect and analyze periodic mo t on as seen from both a static and moving camera. By tracking objects of interest, we compute a n object’s self-similarity as it evolves in time. For periodic motion, the self-similarity measure is a l o periodic, and we apply Time-Frequency analysis to detect and characterize the periodic motion. Th e periodicity is also analyzed robustly using the 2-D lattice structures inherent in similarity matrices . A real-time system has been implemented to track and classify objects using periodicity. Examples of o bject classification (people, running dogs, vehicles), person counting, and non-stationary periodici ty are provided.
Finding scientific gems with Google's PageRank algorithm
(2007)

We apply the Google PageRank algorithm to assess the relative importance of all publications in the Physical Review family of journals from 1893 to 2003. While the Google number and the number of citations for each publication are positively correlated, outliers from this linear relation identify some exceptional papers or “gems” that are universally familiar to physicists. © 2006 Published by Elsevier Ltd. PACS: 02.50.Ey; 05.40.-a; 05.50.+q; 89.65.-s
Automatic Driving on Ill-defined Roads: An Adaptive, Shape-constrained, Color-based Method
(2015)

Autonomous following of ill-defined roads is an important part of visual navigation systems. This paper presents an adaptive method that uses a statistical model of the colour of the road surface within a trapezoidal shape that approximately corresponds to the projection of the road on the image plane. The method does not perform an explicit segmentation of the images but instead expands the shape sideways until the match between shape and road worsens, simultaneously computing the colour statistics. Results show that the method is capable of reactively following roads, at driving speeds typical of the robots used, in a variety of situations while coping with variable conditions of the road such as surface type, puddles and shadows. We extensively evaluate the proposed method using a large number of datasets with ground truth (that will be made public on our server once the paper is published). We moreover evaluate many colour spaces in the context of road following and find that the colour spaces that separate luminance from colour information perform best, especially if the luminance information is discarded.
Mapping the knowledge domain and the theme evolution of appropriability research between 1986 and 2016: a scientometric review
(2018)

The scholars in the research domains of innovation and strategic management concerned about the appropriability for about 30 years or more. They focused on appropriability research and constantly evolving. In this paper, we analyze 30 years (1986–2016) literature on appropriability studies from Web of Science Core Collection database. A cited reference clustering map of different periods and terms co-occurrence map have been generated using bibliometric analysis and content analysis. Based on this, we study the evolutionary trajectory, mechanisms and theoretical architecture of appropriability research and explore further research directions. The results indicate that the essence of the appropriability research evolution is the perception changes in opening and sharing, value creation and value growth, and future research is focusing on role of appropriability in the platform governance, generative appropriability and the evolution of the problem-solving mechanisms.
Reidentification by Relative Distance Comparison
(2013)

Matching people across nonoverlapping camera views at different locations and different times, known as person reidentification, is both a hard and important problem for associating behavior of people observed in a large distributed space over a prolonged period of time. Person reidentification is fundamentally challenging because of the large visual appearance changes caused by variations in view angle, lighting, background clutter, and occlusion. To address these challenges, most previous approaches aim to model and extract distinctive and reliable visual features. However, seeking an optimal and robust similarity measure that quantifies a wide range of features against realistic viewing conditions from a distance is still an open and unsolved problem for person reidentification. In this paper, we formulate person reidentification as a relative distance comparison (RDC) learning problem in order to learn the optimal similarity measure between a pair of person images. This approach avoids treating all features indiscriminately and does not assume the existence of some universally distinctive and reliable features. To that end, a novel relative distance comparison model is introduced. The model is formulated to maximize the likelihood of a pair of true matches having a relatively smaller distance than that of a wrong match pair in a soft discriminant manner. Moreover, in order to maintain the tractability of the model in large scale learning, we further develop an ensemble RDC model. Extensive experiments on three publicly available benchmarking datasets are carried out to demonstrate the clear superiority of the proposed RDC models over related popular person reidentification techniques. The results also show that the new RDC models are more robust against visual appearance changes and less susceptible to model overfitting compared to other related existing models.
The implications of embodiment for behavior and cognition: animal and robotic case studies
(2012)

In this paper, we will argue that if we want to understand the function of the brain (or the control in the case of robots), we must understand how the brain is embedded into the physical system, and how the organism interacts with the real world. While embodiment has often been used in its trivial meaning, i.e. ‘intelligence requires a body’, the concept has deeper and more important implications, concerned with the relation between physical and information (neural, control) processes. A number of case studies are presented to illustrate the concept. These involve animals and robots and are concentrated around locomotion, grasping, and visual perception. A theoretical scheme that can be used to embed the diverse case studies will be presented. Finally, we will establish a link between the low-level sensory-motor processes and cognition. We will present an embodied view on categorization, and propose the concepts of ‘body schema’ and ‘forward models’ as a natural extension of the embodied approach toward first representations.
Double-Hypergraph Based Sentence Ranking for Query-Focused Multi-document Summarizaton
(2016)

Traditional graph based sentence ranking approaches modeled the documents as a text graph where vertices represent sentences and edges represent pairwise similarity relationships between two sentences. Such modeling cannot capture complex group relationships shared among multiple sentences which can be useful for sentence ranking. In this paper, we propose two different group relationships (sentence-topic relationship and document-topic relationship) shared among sentences, and construct a double-hypergraph integrating these relationships into a unified framework. Then, a double-hypergraph based sentence ranking algorithm is developed for query-focused multi-document summarization, in which Markov random walk is defined on each hypergraph and the mixture Markov chains are formed so as to perform transductive learning in the double-hypergraph. When evaluated on DUC datasets, performance of the proposed approach is remarkable.
Connectionist speech recognition of Broadcast News
(2002)

This paper describes connectionist techniques for recogni ti n of Broadcast News. The fundamental difference between connectionist systems and more convent ional mixture-of-Gaussian systems is that connectionist models directly estimate posterior probabi lities as opposed to likelihoods. Access to posterior probabilities has enabled us to develop a number of no vel approaches to confidence estimation, pronunciation modelling and search. In addition we have inv stigated a new feature extraction technique based on the modulation-filtered spectrogram, and methods f or combining multiple information sources. We have incorporated all of these techniques into a system fo r the transcription of Broadcast News, and we present results on the 1998 DARPA Hub-4E Broadcast News ev aluation data.