@article{TaniguchiYokoyamaShinanoetal.2015, author = {Taniguchi, Shusuke and Yokoyama, Ryohei and Shinano, Yuji and Ohkura, Masashi and Wakui, Tetsuya}, title = {エネルギー供給システムの設計および運用の階層的関係を考慮した最適化(多目的最適化におけるK-ベスト解の探索)}, journal = {エネルギー・資源学会第31回エネルギーシステム・経済・環境コンファレンス講演論文集}, pages = {267 -- 272}, year = {2015}, abstract = {A mixed-integer linear programming method utilizing the hierarchical relationship between design and operation variables proposed to solve the optimal design problem of energy supply systems efficiently is extended to search K-best solutions in multiobjective optimization: At the upper level, the optimal values of design variables are searched by the branch and bound method with operation variables relaxed to continuous ones; At the lower level, the values of operation variables are optimized independently at the respective periods set for variations in energy demands by the branch and bound method with the values of design variables given tentatively during the search at the upper level. A weighting method is employed for multiobjective optimization, and a weighted sum of the annual total cost and primary energy consumption is adopted as the objective function to be minimized. A practical case study on the optimal design of a cogeneration system is conducted. The validity and effectiveness of the proposed method are clarified, and the trade-off relationship between the annual total cost and primary energy consumption is confirmed.}, language = {ja} } @phdthesis{Wohlfeil2015, author = {Wohlfeil, Benjamin}, title = {Integrated fiber grating couplers in silicon photonics}, doi = {10.14279/depositonce-4521}, year = {2015}, language = {en} } @inproceedings{BazziFioriniPokuttaetal.2015, author = {Bazzi, Abbas and Fiorini, Samuel and Pokutta, Sebastian and Svensson, Ola}, title = {Small linear programs cannot approximate Vertex Cover within a factor of 2 - epsilon}, booktitle = {Proceedings of FOCS}, arxiv = {http://arxiv.org/abs/1503.00753}, year = {2015}, language = {en} } @inproceedings{BraunPokutta2015, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {The matching polytope does not admit fully-polynomial size relaxation schemes}, booktitle = {Proceeedings of SODA}, arxiv = {http://arxiv.org/abs/1403.6710}, year = {2015}, language = {en} } @inproceedings{BraunPokuttaZink2015, author = {Braun, G{\´a}bor and Pokutta, Sebastian and Zink, Daniel}, title = {Inapproximability of combinatorial problems via small LPs and SDPs}, booktitle = {Proceeedings of STOC}, arxiv = {http://arxiv.org/abs/1410.8816}, year = {2015}, language = {en} } @inproceedings{Pokutta2015, author = {Pokutta, Sebastian}, title = {Information Theory and Polyhedral Combinatorics}, booktitle = {Proceedings of 53rd Annual Allerton Conference on Communication, Control, and Computing}, year = {2015}, language = {en} } @inproceedings{SongXiePokutta2015, author = {Song, R. and Xie, Y. and Pokutta, Sebastian}, title = {Sequential Sensing with Model Mismatch}, booktitle = {Proceedings of ISIT}, year = {2015}, language = {en} } @inproceedings{XieLiPokutta2015, author = {Xie, Y. and Li, Q. and Pokutta, Sebastian}, title = {Supervised Online Subspace Tracking}, booktitle = {Proceedings of Asilomar Conference on Signals, Systems, and Computers}, year = {2015}, language = {en} } @article{BrietDadushPokutta2015, author = {Bri{\"e}t, Jop and Dadush, Daniel and Pokutta, Sebastian}, title = {On the existence of 0/1 polytopes with high semidefinite extension complexity}, volume = {153}, journal = {Mathematical Programming B}, number = {1}, arxiv = {http://arxiv.org/abs/1305.3268}, pages = {179 -- 199}, year = {2015}, language = {en} } @article{BraunFioriniPokuttaetal.2015, author = {Braun, G{\´a}bor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, D.}, title = {Approximation Limits of Linear Programs (Beyond Hierarchies)}, volume = {40}, journal = {Mathematics of Operations Research}, number = {3}, arxiv = {http://arxiv.org/abs/1204.0957}, pages = {179 -- 199}, year = {2015}, language = {en} } @article{BraunPokutta2015, author = {Braun, G{\´a}bor and Pokutta, Sebastian}, title = {The matching polytope does not admit fully-polynomial size relaxation schemes}, volume = {61}, journal = {IEEE Transactions on Information Theory}, number = {10}, arxiv = {http://arxiv.org/abs/1403.6710}, pages = {1 -- 11}, year = {2015}, language = {en} } @article{BraunPokuttaXie2015, author = {Braun, G{\´a}bor and Pokutta, Sebastian and Xie, Y.}, title = {Info-Greedy Sequential Adaptive Compressed Sensing}, volume = {9}, journal = {IEEE Journal of Selected Topics in Signal Processing}, number = {4}, arxiv = {http://arxiv.org/abs/1407.0731}, pages = {601 -- 611}, year = {2015}, language = {en} } @article{FioriniMassarPokuttaetal.2015, author = {Fiorini, Samuel and Massar, S. and Pokutta, Sebastian and Tiwary, H.R. and de Wolf, R.}, title = {Exponential Lower Bounds for Polytopes in Combinatorial Optimization}, volume = {62}, journal = {Journal of the ACM}, number = {2}, arxiv = {http://arxiv.org/abs/1111.0837}, pages = {1 -- 17}, year = {2015}, language = {en} } @misc{AustConradRempelDegkwitzetal.2015, author = {Aust, Sonja and Conrad-Rempel, Steffi and Degkwitz, Andreas and Golz, Bettina and Hasler, Tim and Heiss, Alexandra and Keidel, Petra and Koch, Thorsten and Kuberek, Monika and Lill, Monika and Lohrum, Stefan and M{\"u}ller, Anja and Peters-Kottig, Wolfgang and Quitzsch, Nicole and Rusch, Beate and Schwidder, Jens and Sischke, Gabriele and Stanek, Ursula and Taylor, Viola and Weihe, Signe and Wyrwol, Christiane and Happel, Hans-Gerd}, title = {KOBV Jahresbericht 2013-2014}, volume = {2013-2014}, number = {2013-2014}, organization = {Kooperativer Bibliotheksverbund Berlin-Brandenburg (KOBV)}, issn = {0934-5892}, pages = {1 -- 56}, year = {2015}, abstract = {Der KOBV-Jahresbericht informiert r{\"u}ckblickend im 2-Jahres-Rhythmus {\"u}ber die bibliothekarisch-fachlichen Entwicklungen im Verbund und die Projekte des Kooperativen Bibliotheksverbunds Berlin-Brandenburg (KOBV).}, language = {de} } @article{WilliePapPerkaetal.2015, author = {Willie, Bettina M. and Pap, Thomas and Perka, Carsten and Schmidt, Carsten Oliver and Eckstein, Felix and Arampatzis, Adamantios and Hege, Hans-Christian and Madry, Henning and Vortkamp, Andrea and Duda, Georg}, title = {OVERLOAD of joints and its role in osteoarthritis - Towards understanding and preventing progression of primary osteoarthritis}, volume = {76}, journal = {Zeitschrift f{\"u}r Rheumatologie}, number = {Suppl. 1}, doi = {10.1007/s00393-014-1561-2}, pages = {1 -- 4}, year = {2015}, abstract = {Intact joints are necessary for skeletal function and mobility in daily life. A healthy musculoskeletal system is the basis for a functional cardiovascular system as well as an intact immune system. Locomotion, physiotherapy, and various forms of patient activity are essential clinical therapies used in the treatment of neurodegeneration, stroke, diabetes, and cancer. Mobility is substantially impaired with degeneration of joints and, in advanced stages, nighttime pain and sleep disturbance are particularly cumbersome. Osteoarthritis (OA) is also known as degenerative joint disease. OA involves structural and compositional changes in the articular cartilage, as well as in the calcified cartilage, subchondral cortical bone, subchondral cancellous bone, meniscus, joint capsular tissue, and synovium; which eventually lead to degeneration of these tissues comprising synovial joints.}, language = {en} } @misc{Schoepke2015, type = {Master Thesis}, author = {Sch{\"o}pke, Jessica}, title = {Korrelation f{\"u}r lineare und nichtlineare Zusammenh{\"a}nge}, year = {2015}, language = {de} } @article{ConradShao2015, author = {Conrad, Tim and Shao, Borong}, title = {Are NoSQL data stores useful for bioinformatics researchers?}, volume = {3}, journal = {International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC)}, number = {3}, doi = {10.17762/ijritcc2321-8169.1503176}, pages = {1704 -- 1708}, year = {2015}, language = {en} } @article{ConradLenga2015, author = {Conrad, Tim and Lenga, Matthias}, title = {Non-convex regularization for supervised learning}, journal = {Technical Report}, year = {2015}, language = {en} } @article{ConradWallmeyerRamsetal.2015, author = {Conrad, Tim and Wallmeyer, Leonie and Rams, Mona and B{\"o}rno, Stefan and Timmermann, Bernd and Hedtrich, Sarah}, title = {Analyzing the Influence of Filaggrin on Other Skin Associated Genes in a Filaggrin Deficient Skin Model Using the Core Network Approach}, journal = {Technical Report}, year = {2015}, language = {en} } @article{ConradMireles2015, author = {Conrad, Tim and Mireles, Victor}, title = {Minimum-overlap clusterings and the sparsity of overcomplete decompositions of binary matrics}, volume = {51}, journal = {Procedia Computer Science}, doi = {10.1016/j.procs.2015.05.500}, pages = {2967 -- 2971}, year = {2015}, abstract = {Given a set of n binary data points, a widely used technique is to group its features into k clusters. In the case where n {\ensuremath{<}} k, the question of how overlapping are the clusters becomes of interest. In this paper we approach the question through matrix decomposition, and relate the degree of overlap with the sparsity of one of the resulting matrices. We present analytical results regarding bounds on this sparsity, and a heuristic to estimate the minimum amount of overlap that an exact grouping of features into k clusters must have. As shown below, adding new data will not alter this minimum amount of overlap.}, language = {en} }