SoroushVahidi/scidocs huggingface dataset:
Inadvertent Harvest of the Median Nerve Instead of the Palmaris Longus Tendon.
(2017)

BACKGROUND
The palmaris longus tendon is frequently used as a tendon graft or ligament replacement. In rare instances the median nerve has been inadvertently harvested instead of the palmaris longus for use as a tendon.


METHODS
Nineteen cases in which the median nerve had been mistakenly harvested instead of the palmaris longus tendon were collected from members of the American Society for Surgery of the Hand (ASSH) Listserve. Surgeons involved in the subsequent care of the subject who had had an inadvertent harvest were contacted or the chart was reviewed. The reason for the initial procedure, the skill level of the primary surgeon, and when the inadvertent harvest was recognized were documented. When possible, the method of harvest and subsequent treatment were also documented.


RESULTS
The most common initial procedure was a reconstruction of the elbow ulnar collateral ligament, followed by basal joint arthroplasty, tendon reconstruction, and reconstruction of the ulnar collateral ligament of the thumb metacarpophalangeal joint. Only 7 of the inadvertent harvests were recognized intraoperatively; in the remaining 12 cases the nerve was used as a tendon graft. The sensory loss was not recognized as being due to the inadvertent harvest until the first postoperative visit (2 subjects), 3 to 4 weeks (2 subjects), 2 to 3 months (2 subjects), 5 to 7 months (2 subjects), 1 year (1 subject), 3 years (1 subject), or 10 years (1 subject). Preoperative clinical identification of the presence or absence of a palmaris longus did not necessarily prevent an inadvertent harvest.


CONCLUSIONS
Knowledge of the relevant anatomy is crucial to avoiding inadvertent harvest of the median nerve instead of the palmaris longus tendon.
Bayesian Point Cloud Reconstruction
(2006)

In this paper, we propose a novel surface reconstruction technique based on Bayesian statistics: The measurement process as well as prior assumptions on the measured objects are modeled as probability distributions and Bayes’ rule is used to infer a reconstruction of maximum probability. The key idea of this paper is to define both measurements and reconstructions as point clouds and describe all statistical assumptions in terms of this finite dimensional representation. This yields a discretization of the problem that can be solved using numerical optimization techniques. The resulting algorithm reconstructs both topology and geometry in form of a well-sampled point cloud with noise removed. In a final step, this representation is then converted into a triangle mesh. The proposed approach is conceptually simple and easy to extend. We apply the approach to reconstruct piecewise-smooth surfaces with sharp features and examine the performance of the algorithm on different synthetic and real-world
The impact of website content dimension and e-trust on e-marketing effectiveness: The case of Iranian commercial saffron corporations
(2013)

By considering the problems that commercial saffron companies have faced in international markets, the aim of this study is to investigate the impact of website content, including informational and design dimensions, on the effectiveness of e-marketing and e-trust as mediator variables. These aspects are examined with reference to sales and marketing division managers in a sample of 100 commercial saffron corporations in the Khorasan province. The findings support the ideas that website content has an effect on e-marketing and e-trust and that e-trust plays a mediating role in the relationship between etrust and e-marketing effectiveness. 2013 Elsevier B.V. All rights reserved. * Corresponding author. Tel.: +98 5118811240; fax: +98 5118811243. E-mail addresses: r-nia@ferdowsi.um.ac.ir, frahimnia@hotmail.com (F. Rahimnia).
Editorial: special issue on web content mining
(2004)

With the phenomenal growth of the Web, there is an everincreasing volume of data and information published in numerous Web pages. The research in Web mining aims to develop new techniques to effectively extract and mine useful knowledge or information from these Web pages [8]. Due to the heterogeneity and lack of structure of Web data, automated discovery of targeted or unexpected knowledge/information is a challenging task. It calls for novel methods that draw from a wide range of fields spanning data mining, machine learning, natural language processing, statistics, databases, and information retrieval. In the past few years, there was a rapid expansion of activities in the Web mining field, which consists of Web usage mining, Web structure mining, and Web content mining. Web usage mining refers to the discovery of user access patterns from Web usage logs. Web structure mining tries to discover useful knowledge from the structure of hyperlinks. Web content mining aims to extract/mine useful information or knowledge from Web page contents. For this special issue, we focus on Web content mining.
An analysis of sources of risk in the consumer electronics industry
(2007)

The consumer electronics industry is a $ 240 billion global industry with a small number of highly competitive global players. We describe many of the risks associated with any global supply chain in this industry. As illustration, we also list steps that Samsung Electronics and its subsidiary, Samsung Electronics UK, have taken to mitigate these risks. Our description of the risks and illustration of mitigation efforts provides the backdrop to identify areas of future research.
SAP HANA database: data management for modern business applications
(2011)

The SAP HANA database is positioned as the core of the SAP HANA Appliance to support complex business analytical processes in combination with transactionally consistent operational workloads. Within this paper, we outline the basic characteristics of the SAP HANA database, emphasizing the distinctive features that differentiate the SAP HANA database from other classical relational database management systems. On the technical side, the SAP HANA database consists of multiple data processing engines with a distributed query processing environment to provide the full spectrum of data processing -- from classical relational data supporting both row- and column-oriented physical representations in a hybrid engine, to graph and text processing for semi- and unstructured data management within the same system.
 From a more application-oriented perspective, we outline the specific support provided by the SAP HANA database of multiple domain-specific languages with a built-in set of natively implemented business functions. SQL -- as the lingua franca for relational database systems -- can no longer be considered to meet all requirements of modern applications, which demand the tight interaction with the data management layer. Therefore, the SAP HANA database permits the exchange of application semantics with the underlying data management platform that can be exploited to increase query expressiveness and to reduce the number of individual application-to-database round trips.
Graph cube: on warehousing and OLAP multidimensional networks
(2011)

We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming the so-called multidimensional networks. Data warehouses and OLAP (Online Analytical Processing) technology have proven to be effective tools for decision support on relational data. However, they are not well-equipped to handle the new yet important multidimensional networks. In this paper, we introduce Graph Cube, a new data warehousing model that supports OLAP queries effectively on large multidimensional networks. By taking account of both attribute aggregation and structure summarization of the networks, Graph Cube goes beyond the traditional data cube model involved solely with numeric value based group-by's, thus resulting in a more insightful and structure-enriched aggregate network within every possible multidimensional space. Besides traditional cuboid queries, a new class of OLAP queries, crossboid, is introduced that is uniquely useful in multidimensional networks and has not been studied before. We implement Graph Cube by combining special characteristics of multidimensional networks with the existing well-studied data cube techniques. We perform extensive experimental studies on a series of real world data sets and Graph Cube is shown to be a powerful and efficient tool for decision support on large multidimensional networks.
The Graph Story of the SAP HANA Database
(2013)

Many traditional and new business applications work with inherently graphstructured data and therefore benefit from graph abstractions and operations provided in the data management layer. The property graph data model not only offers schema flexibility but also permits managing and processing data and metadata jointly. By having typical graph operations implemented directly in the database engine and exposing them both in the form of an intuitive programming interface and a declarative language, complex business application logic can be expressed more easily and executed very efficiently. In this paper we describe our ongoing work to extend the SAP HANA database with built-in graph data support. We see this as a next step on the way to provide an efficient and intuitive data management platform for modern business applications with SAP HANA.
miR-PREFeR: an accurate, fast and easy-to-use plant miRNA prediction tool using small RNA-Seq data
(2014)

SUMMARY
Plant microRNA prediction tools that use small RNA-sequencing data are emerging quickly. These existing tools have at least one of the following problems: (i) high false-positive rate; (ii) long running time; (iii) work only for genomes in their databases; (iv) hard to install or use. We developed miR-PREFeR (miRNA PREdiction From small RNA-Seq data), which uses expression patterns of miRNA and follows the criteria for plant microRNA annotation to accurately predict plant miRNAs from one or more small RNA-Seq data samples of the same species. We tested miR-PREFeR on several plant species. The results show that miR-PREFeR is sensitive, accurate, fast and has low-memory footprint.


AVAILABILITY AND IMPLEMENTATION
https://github.com/hangelwen/miR-PREFeR
45° Linearly Polarized Resonant Slot Array Antenna Based on Substrate Integrated Waveguide
(2007)

In this paper, a new configuration of integrated 45deg linearly polarized slot array antenna based on substrate integrated waveguide (SIW) technology is proposed, designed and fabricated with normal printed circuit board (PCB) process. The antenna consists of eight 45deg inclined slots and the measured gain is higher than 10.27 dBi at X-band. The measured radiation patterns and the return loss are in agreement with the simulated results.
THE X-BAR THEORY OF PHRASE STRUCTURE
(1990)

X-bar theory is widely regarded as a substantive theory of phrase structure properties in natural languages. In this paper we will demonstrate that a formalization of its content reveals very little substance in its claims. We state and discuss six conditions that encapsulate the claims of X-bar theory: Lexicality — each nonterminal is a projection of a preterminal; Succession — each X dominates an X for all n ≥ 0; Uniformity — all maximal projections have the same bar-level; Maximality — all non-heads are maximal projections; Centrality — the start symbol is a maximal projection; and Optionality — all and only non-heads are optional. We then consider recent proposals to ‘eliminate’ base components from transformational grammars and to reinterpret X-bar theory as a set of universal constraints holding for all languages at D-structure, arguing that this strategy fails. We show that, as constraints on phrase structure rule systems, the X-bar conditions have hardly any effect on the descriptive power of grammars, and that the principles with the most chance of making some descriptive difference are the least adhered to in practice. Finally, we reconstruct X-bar theory in a way that makes no reference to the notion of bar-level but instead makes the notion ‘head of’ the central one.∗
Interactive technical illustration
(1999)

A rendering is an abstraction that favors, preserves, or even emphasizes some qualities while sacrificing, suppressing, or omitting other characteristics that are not the focus of attention. Most computer graphics rendering activities have been concerned with photorealism, i.e., trying to emulate an image that looks like a highquality photograph. This laudable goal is useful and appropriate in many applications, but not in technical illustration where elucidation of structure and technical information is the preeminent motivation. This calls for a different kind of abstraction in which technical communication is central, but art and appearance are still essential instruments toward this end. Work that has been done on computer generated technical illustrations has focused on static images, and has not included all of the techniques used to hand draw technical illustrations. A paradigm for the display of technical illustrations in a dynamic environment is presented. This display environment includes all of the benefits of computer generated technical illustrations, such as a clearer picture of shape, structure, and material composition than traditional computer graphics methods. It also includes the three-dimensional interactive strength of modem display systems. This is accomplished by using new algorithms for real time drawing of silhouette curves, algorithms which solve a number of the problems inherent in previous methods. We incorporate current non-photorealistic lighting methods, and augment them with new shadowing algorithms based on accepted techniques used by artists and studies carried out in human perception. This paper, all of the images, and a mpeg video clip are available at http://www.cs.utah.edu/~bgooch/ITI CR Categories: I.3.0 [Computer Graphics]: General; I.3.6 [Computer Graphics]: Methodology and Techniques.
A Patch-Based Saliency Detection Method for Assessing the Visual Privacy Levels of Objects in Photos
(2017)

Photo privacy protection has recently received increasing attention from the public. However, the overprotection of photo privacy by hiding too much visual information can make photos meaningless. To avoid this, visual information with different degrees of privacy sensitivity can be filtered out using various image-processing techniques. Objects in a photo usually contain visual information that can potentially reveal private information; this potential depends on both the visual saliency of the objects and on the specific categories to which the objects belong. In this paper, we aim to quantitatively evaluate the influence of visual saliency information on privacy and objectively evaluate the levels of visual privacy that objects contain. Meeting this objective faces two challenges: 1) determining a method of effectively detecting generic objects in a photo for the extraction of saliency information and 2) determining a scientific method for assessing the visual private information contained in objects. To cope with these challenges, we first propose a hierarchical saliency detection method that combines a patch-based saliency detection strategy with an objectness estimation strategy to effectively locate salient objects and obtain the saliency information of each object. The proposed method results in a small set of class-independent locations with high quality and a mean average best overlap score of 0.627 at 1150 locations, which is superior to the score of other saliency detection methods. Second, we build a computational privacy assessment system to scientifically calculate and rank the privacy risks of objects in a photo by creating an improved risk matrix and using the Borda count method. The proposed computational privacy assessment method matches human evaluations to a relatively high degree.
Accelerating Apache Hive with MPI for Data Warehouse Systems
(2015)

Data warehouse systems, like Apache Hive, have been widely used in the distributed computing field. However, current generation data warehouse systems have not fully embraced High Performance Computing (HPC) technologies even though the trend of converging Big Data and HPC is emerging. For example, in traditional HPC field, Message Passing Interface (MPI) libraries have been optimized for HPC applications during last decades to deliver ultra-high data movement performance. Recent studies, like DataMPI, are extending MPI for Big Data applications to bridge these two fields. This trend motivates us to explore whether MPI can benefit data warehouse systems, such as Apache Hive. In this paper, we propose a novel design to accelerate Apache Hive by utilizing DataMPI. We further optimize the DataMPI engine by introducing enhanced non-blocking communication and parallelism mechanisms for typical Hive workloads based on their communication characteristics. Our design can fully and transparently support Hive workloads like Intel HiBench and TPC-H with high productivity. Performance evaluation with Intel HiBench shows that with the help of light-weight DataMPI library design, efficient job start up and data movement mechanisms, Hive on DataMPI performs 30% faster than Hive on Hadoop averagely. And the experiments on TPC-H with ORCFile show that the performance of Hive on DataMPI can improve 32% averagely and 53% at most more than that of Hive on Hadoop. To the best of our knowledge, Hive on DataMPI is the first attempt to propose a general design for fully supporting and accelerating data warehouse systems with MPI.
Adaptive figure-ground classification
(2012)

We propose an adaptive figure-ground classification algorithm to automatically extract a foreground region using a user-provided bounding-box. The image is first over-segmented with an adaptive mean-shift algorithm, from which background and foreground priors are estimated. The remaining patches are iteratively assigned based on their distances to the priors, with the foreground prior being updated online. A large set of candidate segmentations are obtained by changing the initial foreground prior. The best candidate is determined by a score function that evaluates the segmentation quality. Rather than using a single distance function or score function, we generate multiple hypothesis segmentations from different combinations of distance measures and score functions. The final segmentation is then automatically obtained with a voting or weighted combination scheme from the multiple hypotheses. Experiments indicate that our method performs at or above the current state-of-the-art on several datasets, with particular success on challenging scenes that contain irregular or multiple-connected foregrounds. In addition, this improvement in accuracy is achieved with low computational cost.
Salamandra Robotica II: An Amphibious Robot to Study Salamander-Like Swimming and Walking Gaits
(2013)

In this paper, we present Salamandra robotica II: an amphibious salamander robot that is able to walk and swim. The robot has four legs and an actuated spine that allow it to perform anguilliform swimming in water and walking on the ground. The paper first presents the new robot hardware design, which is an improved version of Salamandra robotica I. We then address several questions related to body–limb coordination in robots and animals that have a sprawling posture like salamanders and lizards, as opposed to the erect posture of mammals (e.g., in cats and dogs). In particular, we investigate how the speed of locomotion and curvature of turning motions depend on various gait parameters such as the body–limb coordination, the type of body undulation (offset, amplitude, and phase lag of body oscillations), and the frequency. Comparisons with animal data are presented, and our results show striking similarities with the gaits observed with real salamanders, in particular concerning the timing of the body’s and limbs’ movements and the relative speed of locomotion.
Extracting Relations between Non-Standard Entities using Distant Supervision and Imitation Learning
(2015)

Distantly supervised approaches have become popular in recent years as they allow training relation extractors without textbound annotation, using instead known relations from a knowledge base and a large textual corpus from an appropriate domain. While state of the art distant supervision approaches use off-theshelf named entity recognition and classification (NERC) systems to identify relation arguments, discrepancies in domain or genre between the data used for NERC training and the intended domain for the relation extractor can lead to low performance. This is particularly problematic for “non-standard” named entities such as album which would fall into the MISC category. We propose to ameliorate this issue by jointly training the named entity classifier and the relation extractor using imitation learning which reduces structured prediction learning to classification learning. We further experiment with Web features different features and compare against using two off-the-shelf supervised NERC systems, Stanford NER and FIGER, for named entity classification. Our experiments show that imitation learning improves average precision by 4 points over an one-stage classification model, while removing Web features results in a 6 points reduction. Compared to using FIGER and Stanford NER, average precision is 10 points and 19 points higher with our imitation learning approach.
Growth Promotion of indigenous Scenedesmus dimorphus strain under different conditions using stirred tank
(2015)

The effects of culture conditions at different temperature (15-25-35°C) and nitrate concentration (0.1-0.25-0.4g/L) on biomass production and growth rate of scenedesmus dimorphus were determined. The results shown that the dry biomass weight (0.153g/L) at 15°C was the lowest. No significant difference was observed between the dry biomasses at 25°C (0.289g/L) and 35°C (0.240g/L). While the lowest growth rate was at 15°C(0.157d), the highestone was at 25°C (0.229d) and 35°C (0.195d) with insignificant deference, and The nitrate concentration had no effect on both of biomass production and growth rate.
linalg: Matrix Computations in Apache Spark
(2015)

We describe matrix computations available in the cluster programming framework, Apache Spark. Out of the box, Spark comes with the mllib.linalg library, which provides abstractions and implementations for distributed matrices. Using these abstractions, we highlight the computations that were more challenging to distribute. When translating single-node algorithms to run on a distributed cluster, we observe that often a simple idea is enough: separating matrix operations from vector operations and shipping the matrix operations to be ran on the cluster, while keeping vector operations local to the driver. In the case of the Singular Value Decomposition, by taking this idea to an extreme, we are able to exploit the computational power of a cluster, while running code written decades ago for a single core. We conclude with a comprehensive set of benchmarks for hardware accelerated matrix computations from the JVM, which is interesting in its own right, as many cluster programming frameworks use the JVM.