SoroushVahidi/scidocs huggingface dataset:
Ventilation performance prediction for buildings : A method overview and recent applications
(2008)

This paper presented an overview of the tools used to predict ventilation performance in buildings. The tools reviewed were analytical models, empirical models, small-scale experimental models, full-scale experimental models, multizone network models, zonal models, and Computational Fluid Dynamics (CFD) models. This review found that the analytical and empirical models had made minimal contributions to the research literature in the past year. The smalland full-scale experimental models were mainly used to generate data to validate numerical models. The multizone models were improving, and they were the main tool for predicting ventilation performance in an entire building. The zonal models had limited applications and could be replaced by the coarse-grid CFD models. The CFD models were most popular and contributed to 70 percent of the literature found in this review. Considerable efforts were still made to seek more reliable and accurate models. It has been a trend to improve their performance by coupling CFD with other building simulation models. The applications of CFD models were mainly for studying indoor air quality, natural ventilation, and stratified ventilation as they were difficult to be predicted by other models.
Bioconductor: open software development for computational biology and bioinformatics
(2004)

The Bioconductor project is an initiative for the collaborative creation of extensible software for computational biology and bioinformatics. The goals of the project include: fostering collaborative development and widespread use of innovative software, reducing barriers to entry into interdisciplinary scientific research, and promoting the achievement of remote reproducibility of research results. We describe details of our aims and methods, identify current challenges, compare Bioconductor to other open bioinformatics projects, and provide working examples.
State of the Art in LP-WAN Solutions for Industrial IoT Services
(2016)

The emergence of low-cost connected devices is enabling a new wave of sensorization services. These services can be highly leveraged in industrial applications. However, the technologies employed so far for managing this kind of system do not fully cover the strict requirements of industrial networks, especially those regarding energy efficiency. In this article a novel paradigm, called Low-Power Wide Area Networking (LP-WAN), is explored. By means of a cellular-type architecture, LP-WAN-based solutions aim at fulfilling the reliability and efficiency challenges posed by long-term industrial networks. Thus, the most prominent LP-WAN solutions are reviewed, identifying and discussing the pros and cons of each of them. The focus is also on examining the current deployment state of these platforms in Spain. Although LP-WAN systems are at early stages of development, they represent a promising alternative for boosting future industrial IIoT (Industrial Internet of Things) networks and services.
Facial performance sensing head-mounted display
(2015)

There are currently no solutions for enabling direct face-to-face interaction between virtual reality (VR) users wearing head-mounted displays (HMDs). The main challenge is that the headset obstructs a significant portion of a user's face, preventing effective facial capture with traditional techniques. To advance virtual reality as a next-generation communication platform, we develop a novel HMD that enables 3D facial performance-driven animation in real-time. Our wearable system uses ultra-thin flexible electronic materials that are mounted on the foam liner of the headset to measure surface strain signals corresponding to upper face expressions. These strain signals are combined with a head-mounted RGB-D camera to enhance the tracking in the mouth region and to account for inaccurate HMD placement. To map the input signals to a 3D face model, we perform a single-instance offline training session for each person. For reusable and accurate online operation, we propose a short calibration step to readjust the Gaussian mixture distribution of the mapping before each use. The resulting animations are visually on par with cutting-edge depth sensor-driven facial performance capture systems and hence, are suitable for social interactions in virtual worlds.
Machine Learning for the Internet of Things Security: A Systematic Review
(2018)

Internet of things (IoT) is nowadays one of the fastest growing technologies for both private and business purposes. Due to a big number of IoT devices and their rapid introduction to the market, security of things and their services is often not at the expected level. Recently, machine learning algorithms, techniques, and methods are used in research papers to enhance IoT security. In this paper, we systematically review the state-of-the art to classify the research on machine learning for the IoT security. We analysed the primary studies, identify types of studies and publication fora. Next, we have extracted all machine learning algorithms and techniques described in primary studies, and identified the most used ones to tackle IoT security issues. We classify the research into three main categories (intrusion detection, authentication and other) and describe the primary studies in detail to analyse existing relevant works and propose topics for future research.
The impact of data replication on job scheduling performance in the Data Grid
(2006)

In the Data Grid environment, the primary goal of data replication is to shorten the data access time experienced by the job and consequently reduce the job turnaround time. After introducing a Data Grid architecture that supports efficient data access for the Grid job, the dynamic data replication algorithms are put forward. Combined with different Grid scheduling heuristics, the performances of the data replication algorithms are evaluated with various simulations. The simulation results demonstrate f shortest lacement data e ists, d the ten-
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
(1997)

We develop a face recognition algorithm which is insensitive to large variation in lighting direction and facial expression. Taking a pattern classification approach, we consider each pixel in an image as a coordinate in a high-dimensional space. We take advantage of the observation that the images of a particular face, under varying illumination but fixed pose, lie in a 3D linear subspace of the high dimensional image space—if the face is a Lambertian surface without shadowing. However, since faces are not truly Lambertian surfaces and do indeed produce self-shadowing, images will deviate from this linear subspace. Rather than explicitly modeling this deviation, we linearly project the image into a subspace in a manner which discounts those regions of the face with large deviation. Our projection method is based on Fisher’s Linear Discriminant and produces well separated classes in a low-dimensional subspace, even under severe variation in lighting and facial expressions. The Eigenface technique, another method based on linearly projecting the image space to a low dimensional subspace, has similar computational requirements. Yet, extensive experimental results demonstrate that the proposed “Fisherface” method has error rates that are lower than those of the Eigenface technique for tests on the Harvard and Yale Face Databases. Index Terms —Appearance-based vision, face recognition, illumination invariance, Fisher’s linear discriminant. —————————— ✦ ——————————
Hardware, Design and Implementation Issues on a Fpga-Based Smart Camera
(2007)

Processing images to extract useful information in real-time is a complex task, dealing with large amounts of iconic data and requiring intensive computation. Smart cameras use embedded processing to save the host system from the low-level processing load and to reduce communication flows and overheads. Field programmable devices present special interest for smart cameras design: flexibility, reconfigurability and parallel processing skills are some specially important features. In this paper we present a FPGA-based smart camera research platform. The hardware architecture is described, and some design issues are discussed. Our goal is to use the possibility to reconfigure the FPGA device in order to adapt the system architecture to a given application. To that, a design methodology, based on pre-programmed processing elements, is proposed and sketched. Some implementation issues are discussed and a template tracking application is given as example, with its experimental results.
Oboe: auto-tuning video ABR algorithms to network conditions
(2018)

Most content providers are interested in providing good video delivery QoE for all users, not just on average. State-of-the-art ABR algorithms like BOLA and MPC rely on parameters that are sensitive to network conditions, so may perform poorly for some users and/or videos. In this paper, we propose a technique called Oboe to auto-tune these parameters to different network conditions. Oboe pre-computes, for a given ABR algorithm, the best possible parameters for different network conditions, then dynamically adapts the parameters at run-time for the current network conditions. Using testbed experiments, we show that Oboe significantly improves BOLA, MPC, and a commercially deployed ABR. Oboe also betters a recently proposed reinforcement learning based ABR, Pensieve, by 24% on average on a composite QoE metric, in part because it is able to better specialize ABR behavior across different network states.
An efficient method of license plate location
(2005)

License plate location is an important stage in vehicle license plate recognition for automated transport system. This paper presents a real time and robust method of license plate location. License plate area contains rich edge and texture information. We first extract out the vertical edges of the car image using image enhancement and Sobel operator, then remove most of the background and noise edges by an effective algorithm, and finally search the plate region by a rectangle window in the residual edge image and segment the plate out from the original car image. Experimental results demonstrate the great robustness and efficiency of our method. 2005 Elsevier B.V. All rights reserved.
How to Increase Users' Social Commerce Engagement? A Technology Attractiveness Model
(2017)

With the proliferation of social networking and electronic commerce, social commerce helps people engage in various forms of online social commercial activities through sharing their product or service knowledge and experiences. A better understanding of users’ engagement in social commerce websites thus become increasingly important. Based on the attractiveness theory, this study proposes a research model that highlights the unique role of technology attractiveness, including task, social, and physical attractiveness, in promoting user involvement, which in turn affects social commerce engagement. Results demonstrate that users’ perceptions of technology attractiveness are positively associated with their involvement with social commerce websites, and further stimulate engagement. In addition, website involvement partially and fully mediates the effects of social and physical attractiveness, respectively, on social commerce engagement. The limitations and implications of this study for research and practice are further discussed.
Geometry-Driven Diffusion in Computer Vision
(1994)

Inevitably, reading is one of the requirements to be undergone. To improve the performance and quality, someone needs to have something new every day. It will suggest you to have more inspirations, then. However, the needs of inspirations will make you searching for some sources. Even from the other people experience, internet, and many books. Books and internet are the recommended media to help you improving your quality and performance.
3D face matching and registration based on hyperbolic Ricci flow
(2008)

3D surface matching is fundamental for shape analysis. As a powerful method in geometric analysis, Ricci flow can flexibly design metrics by prescribed target curvature. In this paper we describe a novel approach for matching surfaces with complicated topologies based on hyperbolic Ricci flow. For surfaces with negative Euler characteristics, such as a human face with holes (eye contours), the canonical hyperbolic metric is conformal to the original and can be efficiently computed. Then the surface can be canonically decomposed to hyperbolic hexagons. By matching the corresponding hyperbolic hexagons, the matching between surfaces can be easily established. Compared to existing methods, hyperbolic Ricci flow induces diffeomorphisms between surfaces with complicated topologies with negative Euler characteristics, while avoiding singularities. Furthermore, all the boundaries are intrinsically mapped to hyperbolic lines as alignment constraints. Finally, we demonstrate the applicability of this intrinsic shape representation for 3D face matching and registration.
The weight consistency matrix framework for general non-binary LDPC code optimization: Applications in flash memories
(2016)

Transmission channels underlying modern memory systems, e.g., Flash memories, possess a significant amount of asymmetry. While existing LDPC codes optimized for symmetric, AWGN-like channels are being actively considered for Flash applications, we demonstrate that, due to channel asymmetry, such approaches are fairly inadequate. We propose a new, general, combinatorial framework for the analysis and design of non-binary LDPC (NB-LDPC) codes for asymmetric channels. We introduce a refined definition of absorbing sets, which we call general absorbing sets (GASs), and an important subclass of GASs, which we refer to as general absorbing sets of type two (GASTs). Additionally, we study the combinatorial properties of GASTs. We then present the weight consistency matrix (WCM), which succinctly captures key properties in a GAST. Based on these new concepts, we then develop a general code optimization framework, and demonstrate its effectiveness on the realistic highly-asymmetric normal-Laplace mixture (NLM) Flash channel. Our optimized codes enjoy over one order (resp., half of an order) of magnitude performance gain in the uncorrectable BER (UBER) relative to the unoptimized codes (resp. the codes optimized for symmetric channels).
An approach to interactive deep reinforcement learning for serious games
(2016)

Serious games receive increasing interest in the area of e-learning. Their development, however, is often still a demanding, specialized and arduous process, especially when regarding reasonable non-player character behaviour. Reinforcement learning and, since recently, also deep reinforcement learning have proven to automatically generate successful AI behaviour to a certain degree. These methods are computationally expensive and hardly scalable to various complex serious game scenarios. For this reason, we introduce a new approach of augmenting the application of deep reinforcement learning methods by interactively making use of domain experts' knowledge to guide the learning process. Thereby, we aim to create a synergistic combination of experts and emergent cognitive systems. We call this approach interactive deep reinforcement learning and point out important aspects regarding realization within a framework.
Gesture recognition using kinect for sign language translation
(2013)

Sign Language is a widely used method of communication among the community of deaf-mute people. It contains some series of body gestures, which enables a person to interact without the need of spoken words. Although the use of sign language is very popular among the deaf-mute people but the other communities don't even try to learn it, this creates a gulf of communication and hence becomes a cause of the isolation of physically impaired people. The problem creates a requirement of a system which can facilitate a way of communication between these two communities. This paper presents a novel method for identification of an isolated sign language gesture using Microsoft Kinect. This paper presents the way of extracting some highly robust features from the depth image provided by Kinect and to use them in creating a robust and accurate gesture recognition system, for the purpose of sign language translation. Apart from translation, the proposed system also opens the doors of endless applications in the field of Human Computer Interaction. The proposed algorithm helps in translating a sign language gesture performed by a user, which in-turn can be used as an input for different types of applications.
Software and Algorithms for Graph Queries on Multithreaded Architectures
(2007)

Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster-based computing platforms can run these queries. However, the lack of compute-bound processing at each vertex of the input graph and the constant need to retrieve neighbors implies low processor utilization. Furthermore, graph classes such as scale-free social networks lack the locality to make partitioning clearly effective. Massive multithreading is an alternative architectural paradigm, in which a large shared memory is combined with processors that have extra hardware to support many thread contexts. The processor speed is typically slower than normal, and there is no data cache. Rather than mitigating memory latency, multithreaded machines tolerate it. This paradigm is well aligned with the problem of graph search, as the high ratio of memory requests to computation can be tolerated via multithreading. In this paper, we introduce the multithreaded graph library (MTGL), generic graph query software for processing semantic graphs on multithreaded computers. This library currently runs on serial machines and the Cray MTA-2, but Sandia is developing a run-time system that will make it possible to run MTGL-based code on symmetric multiprocessors. We also introduce a multithreaded algorithm for connected components and a new heuristic for inexact subgraph isomorphism We explore the performance of these and other basic graph algorithms on large scale-free graphs. We conclude with a performance comparison between the Cray MTA-2 and Blue Gene/Light for s-t connectivity.
The hymen morphology in normal newborn Saudi girls.
(2001)

BACKGROUND
Hymen morphology has a medico-legal importance. In view of the lack of national norms, establishing the hymen morphology of Saudi newborn infants is essential.


SUBJECTS AND METHODS
Over a period of 4 months, the genitalia of 345 full-term female newborn infants were examined to determine the shape of the hymen. A previously described labia traction technique was used to classify the hymen morphology into annular, sleeve-like, fimbriated, crescentric, and other types.


RESULTS
The hymen was present in all 345 female newborn infants examined. A total of 207 (60%) were of the annular type, 76 (22%) were sleeve-like, 43 (12.5%) fimbriated, 17 (4.9%) crescentric, and 2 (0.6%) of other types.


CONCLUSION
The most common hymen morphology in Saudi newborn girls was annular, followed by sleeve-like, fimbriated, and crescentric. This study may be the first to define normal configuration of the hymen in this community.
Self-Attentive Feature-Level Fusion for Multimodal Emotion Detection
(2018)

Multimodal emotion recognition is the task of detecting emotions present in user-generated multimedia content. Such resources contain complementary information in multiple modalities. A stiff challenge often faced is the complexity associated with feature-level fusion of these heterogeneous modes. In this paper, we propose a new feature-level fusion method based on self-attention mechanism. We also compare it with traditional fusion methods such as concatenation, outer-product, etc. Analyzed using textual and speech (audio) modalities, our results suggest that the proposed fusion method outperforms others in the context of utterance-level emotion recognition in videos.
Provenance: On and Behind the Screens
(2016)

Collecting and processing provenance, i.e., information describing the production process of some end product, is important in various applications, e.g., to assess quality, to ensure reproducibility, or to reinforce trust in the end product. In the past, different types of provenance meta-data have been proposed, each with a different scope. The first part of the proposed tutorial provides an overview and comparison of these different types of provenance. To put provenance to good use, it is essential to be able to interact with and present provenance data in a user-friendly way. Often, users interested in provenance are not necessarily experts in databases or query languages, as they are typically domain experts of the product and production process for which provenance is collected (biologists, journalists, etc.). Furthermore, in some scenarios, it is difficult to use solely queries for analyzing and exploring provenance data. The second part of this tutorial therefore focuses on enabling users to leverage provenance through adapted visualizations. To this end, we will present some fundamental concepts of visualization before we discuss possible visualizations for provenance.
Using Genetic Algorithm to Solve Game of Go-Moku
(2012)

Genetic algorithm is a stochastic parallel beam search that can be applied to many typical search problems. This paper describes a genetic algorithmic approach to a problem in artificial intelligence. During the process of evolution, the environment cooperates with the population by continuously making itself friendlier so as to lower the evolutionary pressure. Evaluations show the performance of this approach seems considerably effective in solving this type of board games. Game-playing programs are often described as being a combination of search and
An improved algorithm for feature selection using fractal dimension
(2002)

Dimensionality reduction is an important issue in data mining and machine learning. Traina[1] proposed a feature selection algorithm to select the most important attributes for a given set of n-dimensional vectors based on correlation fractal dimension. The author used a kind of multi-dimensional “quad-tree” structure to compute the fractal dimension. Inspired by his work, we propose a new and simpler algorithm to compute the fractal dimension, and design a novel and faster feature selection algorithm using correlation fractal dimension, whose time complexity is lower than that of Traina’s. The main idea is when computing the fractal dimension of (d-1)-dimensional data, the intermediate generated results of the extended d-dimensional data is reused. It inherits the desirable properties described as in [1]. Also, Our algorithm does not require the grid sizes decrease by half as the original “quad-tree” algorithm. Experiments show our feature selection algorithm has a good efficiency over the test dataset.
Advancing interactive collaborative mediums through tele-immersive dance (TED): a symbiotic creativity and design environment for art and computer science
(2008)

The Tele-immersive Dance Environment (TED) is a geographically distributed, real-time 3-D virtual room where multiple participants interact independent of physical distance. TED, a highly interactive collaborative environment, offers digital options with multiple viewpoints, enhancing the creative movement composition involved with dance choreography. A symbiotic relationship for creativity and design exists between dance artists and computer scientists as the tele-immersive environment is analyzed as a creativity and learning tool. We introduce the advancements of the interactive digital options, new interface developments, user study results, and the possibility of a computational model for human creativity through Laban Movement Analysis.