SoroushVahidi/scidocs huggingface dataset:
FLEXIBLE GENERATION OF SEMANTIC 3 D BUILDING MODELS
(2005)

The paper presents a new 3D semantic building model dedicated to urban development. It provides the following special semantic features: storeys, passages, opening objects, and building variants, modelling different levels of detail and design respectively temporal variants. The model also includes a parametric part supporting easy generation of buildings and building variants in the urban design phase. In order to make the powerful tools of the CA(A)D world accessible to city modeling, a toolbox is being developed for transformation of IFC data. These extensions and addition facilitate multiple utilization of city models and thus enhance sustainability of modeling.
An investigation into the applicability of building information models in geospatial environment in support of site selection and fire response management processes
(2008)

1474-0346/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.aei.2008.06.001 * Corresponding author. Tel.: +90 312 266 00 5 (U. Isikdag); tel.: +44 161 295 62 90; fax: +44 016 tel.: +44 0161 295 4992; fax: +44 0161 295 3173 (G. E-mail addresses: egetera@superonline.com, uisik j.underwood@salford.ac.uk (J. Underwood), g.aoauad@ Some tasks in the construction industry and urban management field such as site selection and fire response management are usually managed by using a Geographical Information System (GIS), as the tasks in these processes require a high level and amount of integrated geospatial information. Recently, a key element of this integrated geospatial information to emerge is detailed geometrical and semantic information about buildings. In parallel, Building Information Models (BIMs) of today have the capacity for storing and representing such detailed geometrical and semantic information. In this context, the research aimed to investigate the applicability of BIMs in geospatial environment by focusing specifically on these two domains; site selection and fire response management. In the first phase of the research two use case scenarios were developed in order to understand the processes in these domains in a more detailed manner and to establish the scope of a possible software development for transferring information from BIMs into the geospatial environment. In the following phase of the research two data models were developed – a Schema-Level Model View and a geospatial data model. The Schema-Level Model View was used in simplifying the information acquired from the BIM, while the geospatial data model acted as the template for creating physical files and databases in the geospatial environment. Following this, three software components to transfer building information into the geospatial environment were designed, developed, and validated. The first component served for acquiring the building information from the BIM, while the latter two served for transforming the information into the geospatial environment. The overall research demonstrated that it is possible to transfer (high level of geometric and semantic) information acquired from BIMs into the geospatial environment. The results also demonstrated that BIMs provide a sufficient level and amount of (geometric and semantic) information (about the building) for the seamless automation of data management tasks in the site selection and fire response management processes. 2008 Elsevier Ltd. All rights reserved.
Credit Assignment Techniques in Stochastic Computation Graphs
(2019)

Stochastic computation graphs (SCGs) provide a formalism to represent structured optimization problems arising in artificial intelligence, including supervised, unsupervised, and reinforcement learning. Previous work has shown that an unbiased estimator of the gradient of the expected loss of SCGs can be derived from a single principle. However, this estimator often has high variance and requires a full model evaluation per data point, making this algorithm costly in large graphs. In this work, we address these problems by generalizing concepts from the reinforcement learning literature. We introduce the concepts of value functions, baselines and critics for arbitrary SCGs, and show how to use them to derive lower-variance gradient estimates from partial model evaluations, paving the way towards general and efficient credit assignment for gradient-based optimization. In doing so, we demonstrate how our results unify recent advances in the probabilistic inference and reinforcement learning literature.
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
(1987)

We present a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Our algorithm automatically solves all the multi-party protocol problems addressed in complexity-based cryptography during the last 10 years. It actually is a completeness theorem for the class of distributed protocols with honest majority. Such completeness theorem is optimal in the sense that, if the majority of the players is not honest, some protocol problems have no efficient solution [C].
Dictionary of protein secondary structure: pattern recognition of hydrogen-bonded and geometrical features.
(1983)

For a successful analysis of the relation between amino acid sequence and protein structure, an unambiguous and physically meaningful definition of secondary structure is essential. We have developed a set of simple and physically motivated criteria for secondary structure, programmed as a pattern-recognition process of hydrogen-bonded and geometrical features extracted from x-ray coordinates. Cooperative secondary structure is recognized as repeats of the elementary hydrogen-bonding patterns “turn” and “bridge.” Repeating turns are “helices,” repeating bridges are “ladders,” connected ladders are “sheets.” Geometric structure is defined in terms of the concepts torsion and curvature of differential geometry. Local chain “chirality” is the torsional handedness of four consecutive Ca positions and is positive for right-handed helices and negative for ideal twisted @-sheets. Curved pieces are defined as “bends.” Solvent “exposure” is given as the number of water molecules in possible contact with a residue. The end result is a compilation of the primary structure, including SS bonds, secondary structure, and solvent exposure of 62 different globular proteins. The presentation is in linear form: strip graphs for an overall view and strip tables for the details of each of 10,925 residues. The dictionary is also available in computer-readable form for protein structure prediction work.
Improved segmentation of abnormal cervical nuclei using a graph-search based approach
(2015)

Reliable segmentation of abnormal nuclei in cervical cytology is of paramount importance in automation-assisted screening techniques. This paper presents a general method for improving the segmentation of abnormal nuclei using a graph-search based approach. More specifically, the proposed method focuses on the improvement of coarse (initial) segmentation. The improvement relies on a transform that maps round-like border in the Cartesian coordinate system into lines in the polar coordinate system. The costs consisting of nucleus-specific edge and region information are assigned to the nodes. The globally optimal path in the constructed graph is then identified by dynamic programming. We have tested the proposed method on abnormal nuclei from two cervical cell image datasets, Herlev and H&E stained liquid-based cytology (HELBC), and the comparative experiments with recent state-of-the-art approaches demonstrate the superior performance of the proposed method.
The inferior parietal lobule and temporoparietal junction: A network perspective
(2017)

Information processing in specialized, spatially distributed brain networks underlies the diversity and complexity of our cognitive and behavioral repertoire. Networks converge at a small number of hubs - highly connected regions that are central for multimodal integration and higher-order cognition. We review one major network hub of the human brain: the inferior parietal lobule and the overlapping temporoparietal junction (IPL/TPJ). The IPL is greatly expanded in humans compared to other primates and matures late in human development, consistent with its importance in higher-order functions. Evidence from neuroimaging studies suggests that the IPL/TPJ participates in a broad range of behaviors and functions, from bottom-up perception to cognitive capacities that are uniquely human. The organization of the IPL/TPJ is challenging to study due to the complex anatomy and high inter-individual variability of this cortical region. In this review we aimed to synthesize findings from anatomical and functional studies of the IPL/TPJ that used neuroimaging at rest and during a wide range of tasks. The first half of the review describes subdivisions of the IPL/TPJ identified using cytoarchitectonics, resting-state functional connectivity analysis and structural connectivity methods. The second half of the article reviews IPL/TPJ activations and network participation in bottom-up attention, lower-order self-perception, undirected thinking, episodic memory and social cognition. The central theme of this review is to discuss how network nodes within the IPL/TPJ are organized and how they participate in human perception and cognition.
A Comparison of learning algorithms on the Arcade Learning Environment
(2014)

Reinforcement learning agents have traditionally been evaluated on small toy problems. With advances in computing power and the advent of the Arcade Learning Environment, it is now possible to evaluate algorithms on diverse and difficult problems within a consistent framework. We discuss some challenges posed by the arcade learning environment which do not manifest in simpler environments. We then provide a comparison of model-free, linear learning algorithms on this challenging problem set.
Robust Face Recognition Using Symmetric Shape-from-Shading
(1999)

Sensitivity to variations in illumination is a fundamental and challenging problem in face recognition. In this paper, we describe a new method based on symmetric shape-from-shading (SFS) to develop a face recognition system that is robust to changes in illumination. The basic idea of this approach is to use the symmetric SFS algorithm as a tool to obtain a prototype image which is illumination-normalized. Applying traditional SFS algorithms to real images of complex objects (in terms of their shape and albedo variations) such as faces is very challenging. It is shown that the symmetric SFS algorithm has a unique point-wise solution. In practice, given a single real face image with complex shape and varying albedo, even the symmetric SFS algorithm cannot guarantee the recovery of accurate and complete shape information. For the particular problem of face recognition, we utilize the fact that all faces share a similar shape making the direct computation of the prototype image from a given face image feasible. The symmetry property has been used to develop a new model-based source-from-shading algorithm which is more accurate than existing algorithms. Using the symmetric property, we are also able to gain insight into how changes in illumination a ect eigen-subspace based face recognition systems. Finally, to demonstrate the e cacy of our method, we have applied it to several publicly available face databases. We rst compare a new illumination-invariant measure to the measure proposed in (Jacobs et al., 1998), and then demonstrate signi cant performance improvement over existing face recognition systems using PCA and/or LDA for images acquired under variable lighting conditions.
Real-time lane detection and forward collision warning system based on stereo vision
(2017)

This paper presents a real-time and robust lane detection and forward collision warning technique based on stereo cameras. First, obstacles image is obtained through stereo matching and UV-disparity segmentation algorithm. Then, Inverse Perspective Mapping(IPM) and Sobel filtering are conducted to generate a low-noise top view of the road by fusing the obstacles image and the original image. Next, Hough Transformation for the top view map is completed and the extreme points(poles) are calculated as the detected lanes according to the traffic lanes model. Besides, the host lane is selected or supplemented among all the detected lanes and the nearest obstacle in this host lane is detected for the forward collision warning. Experimental results on the public data set indicate that our method can work effectively and real-timely in the normal structured environment.
DSP Implementation in the Loop of the Vector Control Drive of a Permanent Magnet Synchronous Machine
(2017)

The aim of this work is to design and implement the FOC (Field Oriented Control) of the permanent magnet synchronous machine (PMSM) on DSP in Hardware In the Loop (HIL). The MATLAB /Simulink, the IDE Code Composer Studio and the DSP TMS320F28335 platform will be used to perform the simulation, the code generation and the HIL.
 The obtained performances of this command (a speed response time of 10 ms and a zero static error vis-à-vis the setpoint and disruption) converge to those obtained with conventional simulation on SIMULINK
Automatic Vehicle Accident Detection and Messaging System Using GSM and GPS Modem
(2014)

The Rapid growth of technology and infrastructure has made our lives easier. The advent of technology has also increased the traffic hazards and the road accidents take place frequently which causes huge loss of life and property because of the poor emergency facilities. Our project will provide an optimum solution to this draw back. An accelerometer can be used in a car alarm application so that dangerous driving can be detected. It can be used as a crash or rollover detector of the vehicle during and after a crash. With signals from an accelerometer, a severe accident can be recognized. According to this project when a vehicle meets with an accident immediately Vibration sensor will detect the signal or if a car rolls over, and Micro electro mechanical system (MEMS) sensor will detects the signal and sends it to ARM controller. Microcontroller sends the alert message through the GSM MODEM including the location to police control room or a rescue team. So the police can immediately trace the location through the GPS MODEM, after receiving the information. Then after conforming the location necessary action will be taken. If the person meets with a small accident or if there is no serious threat to anyone`s life, then the alert message can be terminated by the driver by a switch provided in order to avoid wasting the valuable time of the medical rescue team. This paper is useful in detecting the accident precisely by means of both vibration sensor and Micro electro Mechanical system (MEMS) or accelerometer. As there is a scope for improvement and as a future implementation we can add a wireless webcam for capturing the images which will help in providing driver`s assistance.
Counting Graphlets: Space vs Time
(2017)

Counting graphlets is a well-studied problem in graph mining and social network analysis. Recently, several papers explored very simple and natural approaches based on Monte Carlo sampling of Markov Chains (MC), and reported encouraging results. We show, perhaps surprisingly, that this approach is outperformed by a carefully engineered version of color coding (CC) [1], a sophisticated algorithmic technique that we extend to the case of graphlet sampling and for which we prove strong statistical guarantees. Our computational experiments on graphs with millions of nodes show CC to be more accurate than MC. Furthermore, we formally show that the mixing time of the MC approach is too high in general, even when the input graph has high conductance. All this comes at a price however. While MC is very efficient in terms of space, CC's memory requirements become demanding when the size of the input graph and that of the graphlets grow. And yet, our experiments show that a careful implementation of CC can push the limits of the state of the art, both in terms of the size of the input graph and of that of the graphlets.
CommonSense: Collaborative learning of scene semantics by robots and humans
(2018)

The recent introduction of robots to everyday scenarios has revealed new opportunities for collaboration and social interaction between robots and people. However, high level interaction will require semantic understanding of the environment. In this paper, we advocate that co-existence of assistive robots and humans can be leveraged to enhance the semantic understanding of the shared environment, and improve situation awareness. We propose a probabilistic framework that combines human activity sensor data generated by smart wearables with low level localisation data generated by robots. Based on this low level information and leveraging colocation events between a user and a robot, it can reason about semantic information and track humans and robots across different rooms. The proposed system relies on two-way sharing of information between the robot and the user. In the first phase, user activities indicative of room utility are inferred from consumer wearable devices and shared with the robot, enabling it to gradually build a semantic map of the environment. This will enable natural language interaction and high-level tasks for both assistive and co-working robots. In a second phase, via colocation events, the robot is able to share semantic information with the user, by labelling raw user data with semantic information about room type. Over time, the labelled data is used for training an Hidden Markov Model for room-level localisation, effectively making the user independent from the robot.
Optimal Dynamic Hotel Pricing ∗
(2018)

We analyze a confidential reservation database provided by a luxury hotel, ”hotel 0”, based in a major US city that enables us to observe individual reservations and cancellations at a daily frequency over a 37 month period. We show how the hotel sets prices for various classes of customers and how its prices vary over time. Hotel pricing is a challenging high-dimensional problem since hotels must not only set prices for each current date, but they must also quote prices for a range of future dates, room types and customer types. Our data reveal the full path of room rates quoted for different types of rooms and customers in advance of the arrival date. We find large within and between week variability in room prices, as well as huge seasonal variations in average daily rates and occupancy rates, not only for the hotel we study but also for its direct competitors. We formulate and estimate a structural model of optimal dynamic hotel pricing using the Method of Simulated Moments (MSM). The estimated model provides accurate predictions of the actual prices set by this firm and resulting paths of bookings and cancellations. Prices quoted for bookings generally decline as the arrival date approaches on nonbusy days, but can increase dramatically in the final days before arrival on busy days when there is a high probability of sell-out. Hotel 0’s prices co-move strongly with its competitors’ prices and we show that a simple price-following strategy where hotel 0 undercuts its competitors’ average price by a fixed percentage provides a good first approximation to its pricing behavior. However we show that simple price-following is suboptimal: when hotel 0 expects to sell out, it is optimal to depart from price-following and increase its price significantly above its competitors. On non-busy days, it is not optimal for hotel 0 to cut its prices in the final days before arrival to try to increase occupancy unless its competitors cut their prices. Though price-following has the superficial appearance of collusive behavior mediated by the use of a commercial revenue management system (RMS), our results suggest that hotel 0’s pricing is competitive and is best described as a rational best response to its beliefs about demand and the prices set by its competitors. In fact hotel 0 regularly disregards the recommended prices of its RMS, which it regards as too low compared to the prices it actually sets.
Establishing rigour in qualitative research: the decision trail.
(1994)

The aim of this paper is to show the way in which the decision trail of a qualitative research process can be maintained. It is argued that the trustworthiness (rigour) of a study may be established if the reader is able to audit the events, influences and actions of the researcher. The actual study containing the recording of this decision trail aimed to express the concerns of older patients who were admitted to the acute care sector. The study took place in two care of the elderly wards in a 1000-bed National Health Service hospital in the UK, in 1991. Eventually, 14 patients were interviewed, each on several occasions, and their concerns are expressed in themes, namely: routine geriatric style of care, depersonalization, care deprivation and geriatric segregation. I describe the preparations that were undertaken before patient interviews could commence. The literature recording the process of the interviewer's experience as data in qualitative research is scarce. I show the researcher's participation in making the data as part of an existential phenomenological research process. Existential phenomenology relies on recording influences while generating data such as significant literature, media reports, my value position and journal data.
A balanced psychology and a full life.
(2004)

Psychology since World War II has been largely devoted to repairing weakness and understanding suffering. Towards that end, we have made considerable gains. We have a classification of mental illness that allows international collaboration, and through this collaboration we have developed effective psychotherapeutic or pharmacological treatments for 14 major mental disorders. However, while building a strong science and practice of treating mental illness, we largely forgot about everyday well-being. Is the absence of mental illness and suffering sufficient to let individuals and communities flourish? Were all disabling conditions to disappear, what would make life worth living? Those committed to a science of positive psychology can draw on the effective research methods developed to understand and treat mental illness. Results from a new randomized, placebo-controlled study demonstrate that people are happier and less depressed three months after completing exercises targeting positive emotion. The ultimate goal of positive psychology is to make people happier by understanding and building positive emotion, gratification and meaning. Towards this end, we must supplement what we know about treating illness and repairing damage with knowledge about nurturing well-being in individuals and communities.