A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Active learning for inference and regeneration of computer programs that store and retrieve data
2018
Proceedings of the 2018 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software - Onward! 2018
Preserved Fulltext
By providing a productive new mechanism for capturing and encapsulating knowledge about how to use modern complex interfaces, this new approach promises to greatly reduce the developer effort required ...
This regenerated code contains boilerplate code for the complex programming interfaces that the target computing platform presents. ...
In the example the inference algorithm discovers that enroll/name is a store/retrieve pair mediated by the id/name parameters of the enroll operation, enroll/id is a store/retrieve pair mediated by the ...
doi:10.1145/3276954.3276959
dblp:conf/oopsla/RinardSM18
fatcat:3dbemxjfnjdh7hsn7n36fryo3u
Very concurrent mark-&-sweep garbage collection without fine-grain synchronization
1998
Proceedings of the first international symposium on Memory management - ISMM '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We describe a new incremental algorithm for the concurrent reclamation of a program's allocated, y et unreachable, data. ...
Our algorithm is a variant of mark-&-sweep collection that|unlike p rior designs|runs m utator, marker, and sweeper threads concurrently without explicit ne-grain synchronization on shared-memory multiprocessors ...
Figure 1 : 1 The V CGC algorithm operates a s a s e r i e s o f e pochs. ...
doi:10.1145/286860.286878
dblp:conf/iwmm/HuelsbergenW98
fatcat:34rqu5stnreqddhcqojp3sz43y
Very concurrent mark-&-sweep garbage collection without fine-grain synchronization
1999
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We describe a new incremental algorithm for the concurrent reclamation of a program's allocated, y et unreachable, data. ...
Our algorithm is a variant of mark-&-sweep collection that|unlike p rior designs|runs m utator, marker, and sweeper threads concurrently without explicit ne-grain synchronization on shared-memory multiprocessors ...
Figure 1 : 1 The V CGC algorithm operates a s a s e r i e s o f e pochs. ...
doi:10.1145/301589.286878
fatcat:5u4obkubrndglo4gfqqasx4dpu
A perspective on Advanced Peer-to-Peer Networking
1987
IBM Systems Journal
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In 1971 he joined the product development group responsible for the micro- code for the IBM 3741/2 Data Station. ...
As for other session types, the primary side of LU 0 and 6.2 and the secondary side of LU 0, 1, 2, 3, 6.2, and P reside in the Communication Feature. ...
doi:10.1147/sj.264.0414
fatcat:yukqe3wutrcdrgtl4edp6j66iq
Unifying aspect- and object-oriented design
2009
ACM Transactions on Software Engineering and Methodology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The contribution of this work is the design and evaluation of a programming language model that unifies aspects and classes as they appear in AspectJ-like languages. ...
The contribution of this work is the design and evaluation of a programming language model that unifies aspects and classes, as they appear in AspectJ-like languages. ...
Consider the following five cases: (1) |Mij | |Ni| = 1, (2) |Mij | |Ni| → 1, (3) 1 − δ > |Mij | |Ni| > δ, where δ → 0, (4) |Mij | |Ni| → 0, (5) |Mij | |Ni| = 0. ...
doi:10.1145/1555392.1555396
fatcat:l5qiuqi7vzfsvawcvhyw4f3rw4
Variation in humpback whale (Megaptera novaeangliae) song length in relation to low-frequency sound broadcasts
2003
Journal of the Acoustical Society of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Songs that ended within a few minutes of the most recent ping tended to be longer than songs sung during control periods. ...
The longest songs were sung between 1 and 2 h after the last ping. Humpbacks responded to louder broadcasts with longer songs. ...
ACKNOWLEDGMENTS The successful completion of this multi-faceted research project was the result of close cooperation by a large team. ...
doi:10.1121/1.1573637
pmid:12822811
fatcat:qv3jfd6tmzbknoxkyblzpnrdla
A Bayesian Method for Analyzing Lateral Gene Transfer
2014
Systematic Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The best currently available LGT algorithms are parsimony-based phylogenetic methods, which require a pre-computed gene tree and cannot choose between sometimes wildly differing most parsimonious solutions ...
In a wider perspective, there is a growing body of studies highlighting the role of LGT in enabling organisms to occupy new niches or adapt to environmental changes. ...
ACKNOWLEDGMENTS J.L. and A.T. devised the algorithmic underpinnings; J.S. developed the software; J.L., J.S., B.S., and L.A. performed analyses; V.D. provided the data; all authors wrote, read, and approved ...
doi:10.1093/sysbio/syu007
pmid:24562812
fatcat:jwtjn7ctxrgrjfxu53jks6lfoa
Execution transactions for defending against software failures: use and evaluation
2006
International Journal of Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Our hypothesis is that we can treat each code function as a transaction that can be aborted when an attack is detected, without affecting the application's ability to correctly execute. ...
We implement a stand-alone tool, DYBOC, which we use to instrument a number of vulnerable applications. ...
[35] , Consh [3] , Mapbox [1] , OpenBSD's systrace [66] , and the Mediating Connectors [6] . ...
doi:10.1007/s10207-006-0083-6
fatcat:6wtsvxahznbill35gog3pjm4lm
XLynx—An FPGA-based XML filter for hybrid XQuery processing
2013
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As part of our XLynx implementation-an FPGAbased XML filter-we present skeleton automata, which is a design principle for data-intensive hardware circuits that offers high expressiveness and quick re-configuration ...
Skeleton automata provide a generic implementation for a class of finite-state automata. ...
The pseudo code in Algorithm 1 can straightforwardly be translated into a VHDL circuit description. Note that in hardware this code is not executed as sequential code. ...
doi:10.1145/2536800
fatcat:3zlqnjgdhndg3ecc2vd2ksnotq
AntNet: Distributed Stigmergetic Control for Communications Networks
1998
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The algorithms' performance is evaluated over a set of realistic testbeds. ...
We compare our algorithm with six state-of-the-art routing algorithms coming from the telecommunications and machine learning fields. ...
Acknowledgements This work was supported by a Madame Curie Fellowship awarded to Gianni Di Caro CEC-TMR Contract N. ERBFMBICT 961153. Marco Dorigo is a Research Associate with the FNRS. ...
doi:10.1613/jair.530
fatcat:swtq4pdyjfd5vh6v4hrapkhdmu
Constraint automata with memory cells and their composition
2017
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In Fig. 1 , we distinguish connectors' white boundary nodes from their shaded mixed nodes. Every sink channel end coincident on a node serves as a data source for that node. ...
cases where the standard approach to such computation does not work well, propose an alternative algorithm (including a proof of its correctness in Hoare logic), and empirically evaluate this algorithm ...
Similarly, we take the Cartesian product of Q 0 1 and Q 0 2 as the new set of initial states. • We take the union of P all 1 and P all 2 as the new set of all ports. ...
doi:10.1016/j.scico.2017.03.006
fatcat:iyndmcz7obfajoa6f5yf64zhzu
Proper static potential in classical lattice gauge theory at finite T
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We compute the proper real-time interaction potential between a static quark and antiquark in classical lattice gauge theory at finite temperature. ...
−1, 0, 0]. ...
Z no src D[A]Tr exp ig dtA 0 (x 1 , t) exp − ig dtA 0 (x 2 , t) e −S gluon [A] = 1 Z no src D[A]exp − S gluon [A] − g d 4 x ReTr A 0 (x)M δ (3) (x − x 1 ) − δ (3) (x − x 2 ) = 1 Z no src D[A]exp − S gluon ...
arXiv:2012.10089v1
fatcat:bsdsglsgsrcvjhy4obycjc72la
Concepts and principles in the analysis of brain networks
2011
Annals of the New York Academy of Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
These tools can be employed to understand how the brain's behavioral repertoire is mediated by the interactions of objects of information processing. ...
The brain is a large-scale network, operating at multiple levels of information processing ranging from neurons, to local circuits, to systems of brain areas. ...
For every cell IJ , the presence of a tie of friendship between the corresponding individuals I and J is denoted by a "1" and colored gray, whereas the absence of friendship is denoted by a "0." ...
doi:10.1111/j.1749-6632.2010.05947.x
pmid:21486299
fatcat:ydo64gypavcorod2n7rxuww4bm
Like a Grinding Stone: How Crowdfunding Platforms Create, Perpetuate, and Value Health Inequities
2021
Medical Anthropology Quarterly
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Drawing on the problematic figure of the "black box" in health disparities research and technology studies, I offer ethnography as a tool for unpacking often inscrutable and complex pathways through which ...
By leveraging both online and traditional research strategies-a platform analysis and paired narratives of crowdfunders' disparate experiences, drawn from open-ended interviews-this article explores how ...
At various periods, Aaron Davis, Emily Fuller, Christine Hahn, Cadence Luchsinger, Chelsea Rios, and Wanjiku Wainaina graciously assisted with recruitment, data coding, and transcription efforts. ...
doi:10.1111/maq.12639
pmid:33711178
fatcat:2jajjksfgzcmtfdaqpbii6f3mq
MiR-16-5p mediates a positive feedback loop in EV71-induced apoptosis and suppresses virus replication
2017
Scientific Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore, miR-16-5p is a positive feedback regulator in EV71-induced apoptosis and a suppressor of virus replication. ...
Moreover, EV71-induced caspase activation facilitates the processing of pri-miR-16-1. We also revealed that miR-16-5p can promote EV71-induced nerve cells apoptosis through activating caspase-3. ...
The miR-15a and miR-16-1 cluster is located in the intronic region of Dleu2 and encodes a long non-coding RNA at the chromosome band 13q14 55, 58 . ...
doi:10.1038/s41598-017-16616-7
pmid:29180670
pmcid:PMC5703983
fatcat:4mgpnrrpenbzddkelxkfm4mcfy
« Previous
Showing results 1 — 15 out of 126 results