LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 8 of total 8

Search options

  1. Article: Climatic Classification of India for Building Design Using Data Analytics

    Jain, Kshitij / Gupta, Gargi / Verma, Kamal Kant / Agarwal, Anurag

    National Academy science letters. 2022 June, v. 45, no. 3

    2022  

    Abstract: The buildings are designed to provide the thermal comfort to the occupants. The most important consideration for the design of building is the extent to which it exposed to climatic condition. Climatic classification helps to design comfortable and ... ...

    Abstract The buildings are designed to provide the thermal comfort to the occupants. The most important consideration for the design of building is the extent to which it exposed to climatic condition. Climatic classification helps to design comfortable and energy efficient buildings. For the energy efficient building design, zoning of climatic classification, for the country into different regions is essential to differentiate the climate region wise. This paper focuses on the study of climatic classification of India considering the latest climatic data of India using multivariate technique, factor–cluster analysis. The outcome of study gives additional sub-climatic regions for India as compared to present five major climatic zones, (i) hot-dry (ii) warm-humid (iii) cold (iv) temperate and (v) composite, as defined in the climatic data handbook of CBRI (Bureau of Indian Standards, SP -72: National Lighting Code, CSIR-CBRI, 2010) and also National Building Code 2016 (in National Building Code of India 1:1–1226, 2016).
    Keywords climate classification ; climatic factors ; climatic zones ; data analysis ; energy efficiency ; multivariate analysis ; India
    Language English
    Dates of publication 2022-06
    Size p. 235-239.
    Publishing place Springer India
    Document type Article
    ZDB-ID 2677544-X
    ISSN 2250-1754 ; 0250-541X
    ISSN (online) 2250-1754
    ISSN 0250-541X
    DOI 10.1007/s40009-022-01109-7
    Database NAL-Catalogue (AGRICOLA)

    Full text online

    More links

    Kategorien

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

  2. Book ; Online: Unsupervised Multilingual Alignment using Wasserstein Barycenter

    Lian, Xin / Jain, Kshitij / Truszkowski, Jakub / Poupart, Pascal / Yu, Yaoliang

    2020  

    Abstract: We study unsupervised multilingual alignment, the problem of finding word-to-word translations between multiple languages without using any parallel data. One popular strategy is to reduce multilingual alignment to the much simplified bilingual setting, ... ...

    Abstract We study unsupervised multilingual alignment, the problem of finding word-to-word translations between multiple languages without using any parallel data. One popular strategy is to reduce multilingual alignment to the much simplified bilingual setting, by picking one of the input languages as the pivot language that we transit through. However, it is well-known that transiting through a poorly chosen pivot language (such as English) may severely degrade the translation quality, since the assumed transitive relations among all pairs of languages may not be enforced in the training process. Instead of going through a rather arbitrarily chosen pivot language, we propose to use the Wasserstein barycenter as a more informative "mean" language: it encapsulates information from all languages and minimizes all pairwise transportation costs. We evaluate our method on standard benchmarks and demonstrate state-of-the-art performances.

    Comment: Code is available at https://github.com/alixxxin/multi-lang
    Keywords Computer Science - Computation and Language ; Computer Science - Machine Learning ; Statistics - Machine Learning ; I.2.7
    Subject code 410
    Publishing date 2020-01-28
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  3. Book ; Online: Online terrain estimation for autonomous vehicles on deformable terrains

    Dallas, James / Jain, Kshitij / Dong, Zheng / Cole, Michael P. / Jayakumar, Paramsothy / Ersal, Tulga

    2019  

    Abstract: In this work, a terrain estimation framework is developed for autonomous vehicles operating on deformable terrains. Previous work in this area usually relies on steady state tire operation, linearized classical terramechanics models, or on ... ...

    Abstract In this work, a terrain estimation framework is developed for autonomous vehicles operating on deformable terrains. Previous work in this area usually relies on steady state tire operation, linearized classical terramechanics models, or on computationally expensive algorithms that are not suitable for real-time estimation. To address these shortcomings, this work develops a reduced-order nonlinear terramechanics model as a surrogate of the Soil Contact Model (SCM) through extending a state-of-the-art Bekker model to account for additional dynamic effects. It is shown that this reduced-order surrogate model is able to accurately replicate the forces predicted by the SCM while reducing the computation cost by an order of magnitude. This surrogate model is then utilized in a unscented Kalman filter to estimate the sinkage exponent. Simulations suggest this parameter can be estimated within 4% of its true value for clay and sandy loam terrains. It is also shown that utilizing this estimated parameter can reduce the prediction errors of the future vehicle states by orders of magnitude, which could assist with achieving more robust model-predictive autonomous navigation strategies.
    Keywords Electrical Engineering and Systems Science - Systems and Control
    Subject code 629
    Publishing date 2019-07-31
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  4. Book ; Online: Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs

    Biedl, Therese / Biniaz, Ahmad / Irvine, Veronika / Jain, Kshitij / Kindermann, Philipp / Lubiw, Anna

    2019  

    Abstract: Theta_6$-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower ... ...

    Abstract $\Theta_6$-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower bounds on the size of maximum matchings in these graphs. The best known lower bound is $n/3$, where $n$ is the number of vertices of the graph. Babu et al. (2014) conjectured that any $\Theta_6$-graph has a (near-)perfect matching (as is true for standard Delaunay graphs). Although this conjecture remains open, we improve the lower bound to $(3n-8)/7$. We also relate the size of maximum matchings in $\Theta_6$-graphs to the minimum size of a blocking set. Every edge of a $\Theta_6$-graph on point set $P$ corresponds to an empty triangle that contains the endpoints of the edge but no other point of $P$. A blocking set has at least one point in each such triangle. We prove that the size of a maximum matching is at least $\beta(n)/2$ where $\beta(n)$ is the minimum, over all theta-six graphs with $n$ vertices, of the minimum size of a blocking set. In the other direction, lower bounds on matchings can be used to prove bounds on $\beta$, allowing us to show that $\beta(n)\geq 3n/4-2$.
    Keywords Computer Science - Computational Geometry
    Subject code 511
    Publishing date 2019-01-05
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  5. Book ; Online: Face flips in origami tessellations

    Akitaya, Hugo A. / Dujmovi, Vida / Eppstein, David / Hull, Thomas C. / Jain, Kshitij / Lubiw, Anna

    2019  

    Abstract: Given a flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment $\mu:E\to\{-1,1\}$ indicating which creases in $E$ bend convexly (mountain) or concavely ( ... ...

    Abstract Given a flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment $\mu:E\to\{-1,1\}$ indicating which creases in $E$ bend convexly (mountain) or concavely (valley), we may \emph{flip} a face $F$ of $G$ to create a new MV assignment $\mu_F$ which equals $\mu$ except for all creases $e$ bordering $F$, where we have $\mu_F(e)=-\mu(e)$. In this paper we explore the configuration space of face flips for a variety of crease patterns $G$ that are tilings of the plane, proving examples where $\mu_F$ results in a MV assignment that is either never, sometimes, or always flat-foldable for various choices of $F$. We also consider the problem of finding, given two foldable MV assignments $\mu_1$ and $\mu_2$ of a given crease pattern $G$, a minimal sequence of face flips to turn $\mu_1$ into $\mu_2$. We find polynomial-time algorithms for this in the cases where $G$ is either a square grid or the Miura-ori, and show that this problem is NP-hard in the case where $G$ is the triangle lattice.
    Keywords Mathematics - Combinatorics ; Computer Science - Computational Geometry ; 52C45 ; 68U05
    Subject code 511
    Publishing date 2019-10-12
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  6. Book ; Online: Representation Learning for Dynamic Graphs

    Kazemi, Seyed Mehran / Goel, Rishab / Jain, Kshitij / Kobyzev, Ivan / Sethi, Akshay / Forsyth, Peter / Poupart, Pascal

    A Survey

    2019  

    Abstract: Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. However, ...

    Abstract Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. However, many applications involve evolving graphs. This introduces important challenges for learning and inference since nodes, attributes, and edges change over time. In this survey, we review the recent advances in representation learning for dynamic graphs, including dynamic knowledge graphs. We describe existing models from an encoder-decoder perspective, categorize these encoders and decoders based on the techniques they employ, and analyze the approaches in each category. We also review several prominent applications and widely used datasets and highlight directions for future research.

    Comment: Accepted at JMLR, 73 pages, 2 figures
    Keywords Computer Science - Machine Learning ; Statistics - Machine Learning
    Subject code 006
    Publishing date 2019-05-27
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  7. Book ; Online: Reconfiguring Undirected Paths

    Demaine, Erik D. / Eppstein, David / Hesterberg, Adam / Jain, Kshitij / Lubiw, Anna / Uehara, Ryuhei / Uno, Yushi

    2019  

    Abstract: We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We show that this ... ...

    Abstract We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either end of the path and remove an edge from the other end. We show that this problem may be solved in linear time in trees, and is fixed-parameter tractable when parameterized either by the cyclomatic number of the input graph or by the length of the path. However, it is PSPACE-complete for paths of unbounded length in graphs of bounded bandwidth.

    Comment: 24 pages, 15 figures. Extended version of a paper to appear in the Proceedings of the 16th Algorithms and Data Structures Symposium (WADS 2019)
    Keywords Computer Science - Data Structures and Algorithms
    Publishing date 2019-05-01
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  8. Book ; Online: Token Swapping on Trees

    Biniaz, Ahmad / Jain, Kshitij / Lubiw, Anna / Masárová, Zuzana / Miltzow, Tillmann / Mondal, Debajyoti / Naredla, Anurag Murty / Tkadlec, Josef / Turcotte, Alexi

    2019  

    Abstract: The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a minimum number of ... ...

    Abstract The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge. We present some results about token swapping on a tree, also known as "sorting with a transposition tree": 1. An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a "happy leaf"), disproving a conjecture of Vaughan. 2. Any algorithm that fixes happy leaves -- as all known approximation algorithms for the problem do -- has approximation factor at least $4/3$. Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2. 3. A generalized problem -- weighted coloured token swapping -- is NP-complete on trees, even when they are restricted to be subdivided stars, but solvable in polynomial time on paths and stars. In this version, tokens and vertices have colours, and colours have weights. The goal is to get every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved.

    Comment: 37 pages, Discrete Mathematics and Theoretical Computer Science, DMTCS vol. 24:2, 2022, #9
    Keywords Computer Science - Computational Complexity ; Computer Science - Data Structures and Algorithms ; 03D15 ; 05C05 ; 68R05 ; F.2.0
    Subject code 511
    Publishing date 2019-03-16
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

To top