스킵네비게이션

본문 바로가기 주메뉴 메인메뉴 국립장애인도서관홈페이지 바로가기

닫기

보존용자료이용 안내

닫기

책표지

검색히스토리

닫기

검색히스토리

* 보유한도 건수는 10건입니다.
검색히스토리 목록
자료구분 검색질의어 검색건수
     

상세검색

상세검색 닫기
자료구분 선택
단행자료
연속자료
멀티미디어자료
장애인자료
웹정보자료
선택된 자료구분
  • 자료구분 선택
도서 상세 검색
도서 상세 검색
분류기호 참조
청구기호 검색
한국대학명
코드명
대학명 참조
한국정부기관명
코드명
정부기관명 참조
도서 상세 검색
발행년도 년 부터
소장기관 검색
판종유형/판종
내용형식
KDC 주제
주제명을 이용한 검색

주제명을 통해 자료를 검색할 수 있습니다.

1. 주제를 입력하세요

주제명찾기
주제어 찾기

이용안내

검색방식 안내. 전방일치: 입력하신 키워드로 시작하는 주제어, 후방일치:입력하신 키워드로 끝나는 주제어, 부분일치:입력하신 키워드 포함하는 주제어

  • ① 검색방식
    • 전방일치- 입력하신 키워드로 시작하는 주제어
    • 후방일치- 입력하신 키워드로 끝나는 주제어
    • 부분일치- 입력하신 키워드 포함하는 주제어
  • ② 주제 입력란에 검색어를 입력하시고 [주제어 찾기]버튼을 클릭합니다.

2. 주제어를 선택하세요

목록

3. 주제어를 모아 검색할 수 있습니다.

선택된 주제명

[검색결과: 0건] 주제명을 선택하세요

도서

Energy principles and variational methods in applied mechanics

표제/저자사항
Energy principles and variational methods in applied mechanics / J.N. Reddy
Reddy, J. N.[1945-]   Reddy, J.N.   
판사항
Third edition
발행사항
Hoboken, NJ : Wiley, 2017
형태사항
xxvi, 730 pages : illustrations ; 25 cm
주기사항
Includes bibliographical references (pages 701-709) and index
표준번호/부호
ISBN 9781119087373 (Paperback)
ISBN 1119087376 (Paperback)
분류기호
듀이십진분류법-> 515.64
주제명
Mechanics, Applied -- Mathematics    Calculus of variations    Finite element method    Force and energy
내용유형
text
매체유형
unmediated
수록매체유형
volume

권별정보

권별정보 목록
편/권차 편제 저작자 발행년도 ISBN 청구기호 자료이용하는곳 자료상태
J.N. Reddy 2017 9781119087373 (Paperback) W515.64-19-1 보존 서고 신청후이용(보존)
CONTENTS
Constructing Independent Spanning Trees on Bubble-Sort Networks / Shih-Shun Kao ; Jou-Ming Chang ; Kung-Jui Pai ; Ro-Yu Wu = 1
Exact Algorithms for Finding Partial Edge-Disjoint Paths / Yunyun Deng ; Longkun Guo ; Peihuang Huang = 14
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications / Haitao Jiang ; Lianrong Pu ; Letu Qingge ; David Sankoff ; Binhai Zhu = 26
Contextual Dependent Click Bandit Algorithm for Web Recommendation / Weiwen Liu ; Shuai Li ; Shengyu Zhang = 39
LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering / Takuro Fukunaga = 51
Approximation Algorithms for a Two-Phase Knapsack Problem / Kameng Nip ; Zhenbo Wang = 63
More Routes for Evacuation / Katsuhisa Yamanaka ; Yasuko Matsui ; Shin-ichi Nakano = 76
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem / Alan Diêgo Aurélio Carneiro ; Fábio Protti ; Uéverton S. Souza = 84
Approximating Global Optimum for Probabilistic Truth Discovery / Shi Li ; Jinhui Xu ; Minwei Ye = 96
Online Interval Scheduling to Maximize Total Satisfaction / Koji M. Kobayashi = 108
Properties of Minimal-Perimeter Polyominoes / Gill Barequet ; Gil Ben-Shachar = 120
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons / Gill Barequet ; Minati De ; Michael T. Goodrich = 130
Polygon Queries for Convex Hulls of Points / Eunjin Oh ; Hee-Kap Ahn = 143
Synergistic Solutions for Merging and Computing Planar Convex Hulls / Jérémy Barbay ; Carlos Ochoa = 156
Cophenetic Distances: A Near-Linear Time Algorithmic Framework / Paweł Górecki ; Alexey Markin ; Oliver Eulenstein = 168
Computing Coverage Kernels Under Restricted Settings / Jérémy Barbay ; Pablo Pérez-Lantero ; Javiel Rojas-Ledesma = 180
Weak Mitoticity of Bounded Disjunctive and Conjunctive TruthTable Autoreducible Sets / Liyu Zhang ; Mahmoud Quweider ; Hansheng Lei ; Fitra Khan = 192
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph / Yinhui Cai ; Guangting Chen ; Yong Chen ; Randy Goebel ; Guohui Lin ; Longcheng Liu ; An Zhang = 205
On Contact Representations of Directed Planar Graphs / Chun-Hsiang Chan ; Hsu-Chun Yen = 218
Computation and Growth of Road Network Dimensions / Johannes Blum ; Sabine Storandt = 230
Car-Sharing Between Two Locations : Online Scheduling with Flexible Advance Bookings / Kelin Luo ; Thomas Erlebach ; Yinfeng Xu = 242
Directed Path-Width and Directed Tree-Width of Directed Co-graphs / Frank Gurski ; Carolin Rehs = 255
Generalized Graph k-Coloring Games / Raffaello Carosi ; Gianpiero Monaco = 268
On Colorful Bin Packing Games / Vittorio Bilò ; Francesco Cellinese ; Giovanna Melideo ; Gianpiero Monaco = 280
Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality / Nanao Kita = 293
The Path Set Packing Problem / Chenyang Xu ; Guochuan Zhang = 305
Manipulation Strategies for the Rank-Maximal Matching Problem / Pratik Ghosal ; Katarzyna Paluch = 316
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search / Alessio Conte ; Roberto Grossi ; Andrea Marino ; Luca Versari = 328
An FPT Algorithm for Contraction to Cactus / R. Krithika ; Pranabendu Misra ; Prafullkumar Tale = 341
An Approximation Framework for Bounded Facility Location Problems / Wenchang Luo ; Bing Su ; Yao Xu ; Guohui Lin = 353
Reconfiguration of Satisfying Assignments and Subset Sums : Easy to Find, Hard to Connect / Jean Cardinal ; Erik D. Demaine ; David Eppstein ; Robert A. Hearn ; Andrew Winslow = 365
Solving the Gene Duplication Feasibility Problem in Linear Time / Alexey Markin ; Venkata Sai Krishna Teja Vadali ; Oliver Eulenstein = 378
An Efficiently Recognisable Subset of Hypergraphic Sequences / Syed M. Meesum = 391
Partial Homology Relations - Satisfiability in Terms of Di-Cographs / Nikolai Nøjgaard ; Nadia El-Mabrouk ; Daniel Merkle ; Nicolas Wieseke ; Marc Hellmuth = 403
Improved Algorithm for Finding the Minimum Cost of Storing and Regenerating Datasets in Multiple Clouds / Yingying Wang ; Kun Cheng ; Zimao Li = 416
Reconfiguring Spanning and Induced Subgraphs / Tesshu Hanaka ; Takehiro Ito ; Haruka Mizuta ; Benjamin Moore ; Naomi Nishimura ; Vijay Subramanya ; Akira Suzuki ; Krishna Vaidyanathan = 428
Generalizing the Hypergraph Laplacian via a Diffusion Process with Mediators / T.-H. Hubert Chan ; Zhibin Liang = 441
Efficient Enumeration of Bipartite Subgraphs in Graphs / Kunihiro Wasa and Takeaki Uno = 454
Bipartite Graphs of Small Readability / Rayan Chikhi ; Vladan Jovičić ; Stefan Kratsch ; Paul Medvedev ; Martin Milanič ; Sofya Raskhodnikova ; Nithin Varma = 467
Maximum Colorful Cliques in Vertex-Colored Graphs. . . . . . . . . . . . . . . . . 480
Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, and Hong Phong Pham Partial Sublinear Time Approximation and Inapproximation for Maximum Coverage / Bin Fu = 492
Characterizing Star-PCGs / Mingyu Xiao ; Hiroshi Nagamochi = 504
Liar’s Dominating Set in Unit Disk Graphs / Ramesh K. Jallu ; Sangram K. Jena ; Gautam K. Das = 516
Minimum Spanning Tree of Line Segments / Sanjana Dey ; Ramesh K. Jallu ; Subhas C. Nandy = 529
Improved Learning of k-Parities / Arnab Bhattacharyya ; Ameet Gadekar ; Ninad Rajgopal = 542
On a Fixed Haplotype Variant of the Minimum Error Correction Problem / Axel Goblet ; Steven Kelk ; Matúš Mihalák ; Georgios Stamoulis = 554
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces / Boris Aronov ; Mark de Berg ; Aleksandar Markovic ; Gerhard Woeginger = 567
Amplitude Amplification for Operator Identification and Randomized Classes / Debajyoti Bera = 579
Reconstruction of Boolean Formulas in Conjunctive Normal Form / Evgeny Dantsin ; Alexander Wolpert = 592
A Faster FPTAS for the Subset-Sums Ratio Problem / Nikolaos Melissinos ; Aris Pagourtzis = 602
A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time / Paniz Abedin ; Arnab Ganguly ; Wing-Kai Hon ; Yakov Nekrich ; Kunihiko Sadakane ; Rahul Shah ; Sharma V. Thankachan = 615
Non-determinism Reduces Construction Time in Active Self-assembly Using an Insertion Primitive / Benjamin Hescott ; Caleb Malchik ; Andrew Winslow = 626
Minimum Membership Hitting Sets of Axis Parallel Segments / N. S. Narayanaswamy ; S. M. Dhannya ; C. Ramya = 638
Minimum Transactions Problem / Niranka Banerjee ; Varunkumar Jayapaul ; Srinivasa Rao Satti = 650
Heuristic Algorithms for the Min-Max Edge 2-Coloring Problem / Radu Stefan Mincu ; Alexandru Popa = 662
Geometric Spanners in the MapReduce Model / Sepideh Aghamolaei ; Fatemeh Baharifard ; Mohammad Ghodsi = 675
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands / T.-H. Hubert Chan ; Bintao Sun = 688
Lower Bounds for Special Cases of Syntactic Multilinear ABPs / C. Ramya ; B. V. Raghavendra Rao = 701
Approximation Algorithms on Multiple Two-Stage Flowshops / Guangwei Wu ; Jianer Chen = 713
Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem / Mugang Lin ; Bin Fu ; Qilong Feng = 726
New Bounds for Energy Complexity of Boolean Functions / Krishnamoorthy Dinesh ; Samir Otiv ; Jayalal Sarma = 738
Hitting and Covering Partially / Akanksha Agrawal ; Pratibha Choudhary ; Pallavi Jain ; Lawqueen Kanesh ; Vibha Sahlot ; Saket Saurabh = 751
Author Index = 765

펼쳐보기

알림

닫기
바구니 담기가 완료 되었습니다.
‘바구니’로 이동 하시겠습니까?

퀵메뉴

  • 메일링서비스 신청
  • 협약도서관 안내
  • 사서에게물어보세요
  • 프로그램 다운로드
맨위로
  • 페이지 위로
  • 페이지 아래로