X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Association for Computing Machinery (ACM)  (24)
  • Mathematik  (24)
Medientyp
Verlag/Herausgeber
  • Association for Computing Machinery (ACM)  (24)
Person/Organisation
Sprache
Erscheinungszeitraum
Fachgebiete(RVK)
  • Mathematik  (24)
RVK
  • 1
    Online-Ressource
    Online-Ressource
    GOTO rankings considered helpful
    Association for Computing Machinery (ACM) ; 2019
    In:  Communications of the ACM Vol. 62, No. 7 ( 2019-06-24), p. 29-30
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 62, No. 7 ( 2019-06-24), p. 29-30
    Kurzfassung: Seeking to improve rankings by utilizing more objective data and meaningful metrics.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/3332803
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2019
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
  • 2
    Online-Ressource
    Online-Ressource
    Worst-case topological entropy and minimal data rate for state estimation of switched linear systems
    Association for Computing Machinery (ACM) ; 2022
    In:  Communications of the ACM Vol. 65, No. 2 ( 2022-02), p. 111-118
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 65, No. 2 ( 2022-02), p. 111-118
    Kurzfassung: In this paper, we study the problem of estimating the state of a switched linear system (SLS), when the observation of the system is subject to communication constraints. We introduce the concept of worst-case topological entropy of such systems, and we show that this quantity is equal to the minimal data rate (number of bits per second) required for the state estimation of the system under arbitrary switching. Furthermore, we provide a closed-form expression for the worst-case topological entropy of switched linear systems, showing that its evaluation reduces to the computation of the joint spectral radius (JSR) of some lifted switched linear system obtained from the original one by using tools from multilinear algebra, and thus can benefit from well-established algorithms for the stability analysis of switched linear systems. Finally, drawing on this expression, we describe a practical coder-decoder that estimates the state of the system and operates at a data rate arbitrarily close to the worst-case topological entropy.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/3505269
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2022
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
  • 3
    Online-Ressource
    Online-Ressource
    A Survey on Resilience in the IoT : Taxonomy, Classification, and Discussion of Resilience Mechanisms
    Association for Computing Machinery (ACM) ; 2022
    In:  ACM Computing Surveys Vol. 54, No. 7 ( 2022-09-30), p. 1-39
    Details
    In: ACM Computing Surveys, Association for Computing Machinery (ACM), Vol. 54, No. 7 ( 2022-09-30), p. 1-39
    Kurzfassung: Internet-of-Things (IoT) ecosystems tend to grow both in scale and complexity, as they consist of a variety of heterogeneous devices that span over multiple architectural IoT layers (e.g., cloud, edge, sensors). Further, IoT systems increasingly demand the resilient operability of services, as they become part of critical infrastructures. This leads to a broad variety of research works that aim to increase the resilience of these systems. In this article, we create a systematization of knowledge about existing scientific efforts of making IoT systems resilient. In particular, we first discuss the taxonomy and classification of resilience and resilience mechanisms and subsequently survey state-of-the-art resilience mechanisms that have been proposed by research work and are applicable to IoT. As part of the survey, we also discuss questions that focus on the practical aspects of resilience, e.g., which constraints resilience mechanisms impose on developers when designing resilient systems by incorporating a specific mechanism into IoT systems.
    Materialart: Online-Ressource
    ISSN: 0360-0300 , 1557-7341
    URL: Article
    DOI: 10.1145/3462513
    RVK:
    SA 2943
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2022
    ZDB Id: 215909-0
    ZDB Id: 1495309-2
    ZDB Id: 626472-4
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
  • 4
    Online-Ressource
    Online-Ressource
    Fast and accurate algorithms for protein side-chain packing
    Association for Computing Machinery (ACM) ; 2006
    In:  Journal of the ACM Vol. 53, No. 4 ( 2006-07), p. 533-557
    Details
    In: Journal of the ACM, Association for Computing Machinery (ACM), Vol. 53, No. 4 ( 2006-07), p. 533-557
    Kurzfassung: This article studies the protein side-chain packing problem using the tree-decomposition of a protein structure. To obtain fast and accurate protein side-chain packing, protein structures are modeled using a geometric neighborhood graph, which can be easily decomposed into smaller blocks. Therefore, the side-chain assignment of the whole protein can be assembled from the assignment of the small blocks. Although we will show that the side-chain packing problem is still NP -hard, we can achieve a tree-decomposition-based globally optimal algorithm with time complexity of O ( Nn rot tw + 1) and several polynomial-time approximation schemes (PTAS), where N is the number of residues contained in the protein, n rot the average number of rotamers for each residue, and tw = O ( N 2/3 log N ) the treewidth of the protein structure graph. Experimental results indicate that after Goldstein dead-end elimination is conducted, n rot is very small and tw is equal to 3 or 4 most of the time. Based on the globally optimal algorithm, we developed a protein side-chain assignment program TreePack, which runs up to 90 times faster than SCWRL 3.0, a widely-used side-chain packing program, on some large test proteins in the SCWRL benchmark database and an average of five times faster on all the test proteins in this database. There are also some real-world instances that TreePack can solve but that SCWRL 3.0 cannot. The TreePack program is available at http://ttic.uchicago.edu/~jinbo/TreePack.htm.
    Materialart: Online-Ressource
    ISSN: 0004-5411 , 1557-735X
    URL: Article
    DOI: 10.1145/1162349.1162350
    RVK:
    SA 3010
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2006
    ZDB Id: 2006500-0
    ZDB Id: 6759-3
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
  • 5
    Online-Ressource
    Online-Ressource
    Nearly optimal algorithms and bounds for multilayer channel routing
    Association for Computing Machinery (ACM) ; 1995
    In:  Journal of the ACM Vol. 42, No. 2 ( 1995-03), p. 500-542
    Details
    In: Journal of the ACM, Association for Computing Machinery (ACM), Vol. 42, No. 2 ( 1995-03), p. 500-542
    Kurzfassung: This paper presents algorithms for routing channels with L ≥2 layers. For the unit vertical overlap model, we describe a two-layer channel routing algorithm that uses at most d + O(√d) tracks to route two-terminal net problems and 2d + O(√d) tracks to route multiterminal nets. We also show that d + Ω(log d) tracks are required to route two-terminal net problems in the worst case even if arbitrary vertical overlap is allowed. We generalize the algorithm to unrestricted multilayer routing and use only d/(L -1) + O(√d/L + 1) 〉 tracks for two-terminal net problems (within O(√d/L + 1) tracks of optimal) and d/(L-2) +O(√d/L + 1) tracks for multiterminal net problems (within a factor of(L-1)/(L-2) times optimal). We demonstrate the generality of our routing strategy by showing that it can be used to duplicate some of the best previous upper bounds for other models (two-layer Manhattan routing and two and three-layer knock-knee routing of two-terminal, two-sided nets), and gives a new upper bound for rotuing with 45-degree diagonal wires.
    Materialart: Online-Ressource
    ISSN: 0004-5411 , 1557-735X
    URL: Article
    DOI: 10.1145/201019.201037
    RVK:
    SA 3010
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 1995
    ZDB Id: 2006500-0
    ZDB Id: 6759-3
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
    FH Potsdam
  • 6
    Online-Ressource
    Online-Ressource
    PlanAlyzer : assessing threats to the validity of online experiments
    Association for Computing Machinery (ACM) ; 2021
    In:  Communications of the ACM Vol. 64, No. 9 ( 2021-09), p. 108-116
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 64, No. 9 ( 2021-09), p. 108-116
    Kurzfassung: Online experiments are an integral part of the design and evaluation of software infrastructure at Internet firms. To handle the growing scale and complexity of these experiments, firms have developed software frameworks for their design and deployment. Ensuring that the results of experiments in these frameworks are trustworthy---referred to as internal validity ---can be difficult. Currently, verifying internal validity requires manual inspection by someone with substantial expertise in experimental design. We present the first approach for checking the internal validity of online experiments statically, that is, from code alone. We identify well-known problems that arise in experimental design and causal inference, which can take on unusual forms when expressed as computer programs: failures of randomization and treatment assignment, and causal sufficiency errors. Our analyses target PLANOUT, a popular framework that features a domain-specific language (DSL) to specify and run complex experiments. We have built PLANALYZER, a tool that checks PLANOUT programs for threats to internal validity, before automatically generating important data for the statistical analyses of a large class of experimental designs. We demonstrate PLANALYZER'S utility on a corpus of PLANOUT scripts deployed in production at Facebook, and we evaluate its ability to identify threats on a mutated subset of this corpus. PLANALYZER has both precision and recall of 92% on the mutated corpus, and 82% of the contrasts it generates match hand-specified data.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/3474385
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2021
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
  • 7
    Online-Ressource
    Online-Ressource
    A computer analysis method for thermal diffusion in biochemical systems
    Association for Computing Machinery (ACM) ; 1964
    In:  Communications of the ACM Vol. 7, No. 9 ( 1964-09), p. 547-551
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 7, No. 9 ( 1964-09), p. 547-551
    Kurzfassung: In the thermal detection of rapid biochemical reactions it is necessary to correct the temperature data for transient heat conduction losses in a cylindrical calorimeter. To handle the complexities arising from varying thermal-relaxation times of concentric insulating layers, a computer program was developed which gives the temperature distribution of the system as a function of radius and time. This distribution is corrected at each step by a subroutine which calculates the instantaneous chemical state of the reaction, as well as the heat produced by this reaction. The program is based on a direct statement of Fourier's law of heat conduction and the chemical rate equation to provide a “bookkeeping law” to follow the reactants and the flow of heat packets, in such a way that the computer continually stores the heat distribution. A computer analysis method is here regarded as one in which the physical laws of a process are used explicitly in the program. Usually this results in bypassing much of the mathematical procedures conventionally used.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/364847.364873
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 1964
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
    FH Potsdam
  • 8
    Online-Ressource
    Online-Ressource
    Software needs seatbelts and airbags
    Association for Computing Machinery (ACM) ; 2012
    In:  Communications of the ACM Vol. 55, No. 9 ( 2012-09), p. 48-53
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 55, No. 9 ( 2012-09), p. 48-53
    Kurzfassung: Finding and fixing bugs in deployed software is difficult and time-consuming. Here are some alternatives.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/2330667.2330683
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2012
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
    FH Potsdam
  • 9
    Online-Ressource
    Online-Ressource
    Effectiveness of anonymization in double-blind review
    Association for Computing Machinery (ACM) ; 2018
    In:  Communications of the ACM Vol. 61, No. 6 ( 2018-05-23), p. 30-33
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 61, No. 6 ( 2018-05-23), p. 30-33
    Kurzfassung: Assessing the effectiveness of anonymization in the review process.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/3208157
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2018
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
  • 10
    Online-Ressource
    Online-Ressource
    BLeak : automatically debugging memory leaks in web applications
    Association for Computing Machinery (ACM) ; 2020
    In:  Communications of the ACM Vol. 63, No. 11 ( 2020-10-22), p. 146-153
    Details
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 63, No. 11 ( 2020-10-22), p. 146-153
    Kurzfassung: Memory leaks in web applications are pervasive and difficult to debug. Leaks degrade responsiveness by increasing garbage collection costs and can even lead to browser tab crashes. Previous leak detection approaches designed for conventional applications are ineffective in the browser environment. Tracking down leaks currently requires intensive manual effort by web developers, which is often unsuccessful. This paper introduces BLEAK (Browser Leak debugger), the first system for automatically debugging memory leaks in web applications. BLEAK'S algorithms leverage the observation that in modern web applications, users often repeatedly return to the same (approximate) visual state (e.g., the inbox view in Gmail). Sustained growth between round trips is a strong indicator of a memory leak. To use BLEAK, a developer writes a short script (17-73 LOC on our benchmarks) to drive a web application in round trips to the same visual state. BLEAK then automatically generates a list of leaks found along with their root causes, ranked by return on investment. Guided by BLEAK, we identify and fix over 50 memory leaks in popular libraries and apps including Airbnb, AngularJS, Google Analytics, Google Maps SDK, and jQuery. BLEAK'S median precision is 100%; fixing the leaks it identifies reduces heap growth by an average of 94%, saving from 0.5MB to 8MB per round trip.
    Materialart: Online-Ressource
    ISSN: 0001-0782 , 1557-7317
    URL: Article
    DOI: 10.1145/3422598
    RVK:
    SA 3000
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2020
    ZDB Id: 80254-2
    ZDB Id: 2004542-6
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Open Access Wunsch
    Verfügbarkeit (elektronisch / print)
    BTU Cottbus
    EUV Frankfurt
    TH Wildau
Nichts oder nicht das Richtige gefunden? Bitte überprüfen Sie Ihre Suchanfrage oder benutzen Sie den Fernleihindex.
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz