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
.
Filters
The Self, the Stasi, the NSA: Privacy, Knowledge, and Complicity in the Surveillance State
2015
Social Science Research Network
It is difficult for explicit legal regulation to be similarly comprehensive, detailed, and flexible. ...
Accepting massive complicity means accepting the government as an observer in norm-governed transactions. ...
doi:10.2139/ssrn.2577308
fatcat:a56szxz42jbxbomu6lz6dqijcm
Drivers of grain price volatility: a cursory critical review
2018
Agricultural Economics (AGRICECON)
A close relationship exists between the storage and price volatility (Wright 2011; Serra and Gil : storage is an effective way to achieve price stabilization (Murphy 2009 ). ...
Aside policies to reduce the commodity price volatility, policymakers could improve the producers' flexibility in response to price changes by supporting contract farming and price insurance mechanisms ...
doi:10.17221/55/2017-agricecon
fatcat:dtrbpzbwxnebddpzjk2lvszvb4
The Main Obstacles and Possibilities of the Cooperative Movement in Lithuania
2017
Organizacijų Vadyba: Sisteminiai Tyrimai
Table 1 1 International APO functions and contributions to sustainable development
Julius RAMANAUSKAS, Rimantas STAŠYS, Francesco CONTÒ ...
Due to numerous reasons, commercial banks do not fully satisfy needs of farmers, therefore a more reliable and flexible financial system is needed. ...
doi:10.1515/mosr-2017-0006
fatcat:qnqgbqtpdfbx3gypdiku4qxxk4
Assembly, Annotation, and Integration of UNIGENE Clusters into the Human Genome Draft
2001
Genome Research
Stasis: An extensible transactional storage library Concurrent, high-performance transactional storage with ARIES-style recovery and application-specific on-disk data layout. ...
I am implementing these ideas as an open source library named "Stasis." ...
Stasis: Flexible Transactional Storage, OSDI 2006. • Marco Barreno, Blaine Nelson, Russell Sears, Anthony D. Joseph. ...
doi:10.1101/gr.gr-1645r
pmid:11337484
pmcid:PMC311045
fatcat:l7ucjl7usrgz3asyzem5kwl3mm
USE OF "KNOWLEDGE HOUSE", DWS, DMS AND DSS METHODOLOGY BY COMPLETING A COMPETITORS' ANALYSIS IN THE RAILWAY SECTOR
2016
Journal of Business Economics and Management
The method has such special feature as flexibility i.e. the capability of adapting for the mutability of competitive conditions. ...
Usually that is changing information, which is used in business everyday; that is copies of transaction data and so on. ...
doi:10.3846/16111699.2016.1251963
fatcat:rbfruw7glfc3dddyq2ay5bblou
NV-Heaps
2011
SIGPLAN notices
We implement search trees, hash tables, sparse graphs, and arrays using NV-heaps, BerkeleyDB, and Stasis. ...
However, the slow speed of persistent storage (i.e., disk) has restricted their design and limited their performance. ...
Then, we compare NV-heaps to Stasis [53] and BerkeleyDB [46] , transactional storage systems that target conventional block devices. ...
doi:10.1145/1961296.1950380
fatcat:knenlt3q3va2bl5wpdxlydufsm
NV-Heaps
2012
SIGPLAN notices
We implement search trees, hash tables, sparse graphs, and arrays using NV-heaps, BerkeleyDB, and Stasis. ...
However, the slow speed of persistent storage (i.e., disk) has restricted their design and limited their performance. ...
Then, we compare NV-heaps to Stasis [53] and BerkeleyDB [46] , transactional storage systems that target conventional block devices. ...
doi:10.1145/2248487.1950380
fatcat:ylep75ky55duvionhsilfzrzga
NV-Heaps
2011
SIGARCH Computer Architecture News
We implement search trees, hash tables, sparse graphs, and arrays using NV-heaps, BerkeleyDB, and Stasis. ...
However, the slow speed of persistent storage (i.e., disk) has restricted their design and limited their performance. ...
Then, we compare NV-heaps to Stasis [53] and BerkeleyDB [46] , transactional storage systems that target conventional block devices. ...
doi:10.1145/1961295.1950380
fatcat:uvasunu7ofch7juy7fmfk3nceu
We implement search trees, hash tables, sparse graphs, and arrays using NV-heaps, BerkeleyDB, and Stasis. ...
However, the slow speed of persistent storage (i.e., disk) has restricted their design and limited their performance. ...
Then, we compare NV-heaps to Stasis [53] and BerkeleyDB [46] , transactional storage systems that target conventional block devices. ...
doi:10.1145/1950365.1950380
dblp:conf/asplos/CoburnCAGGJS11
fatcat:6w5xtiax2bezbhawcew6lm46l4
REWIND
2015
Proceedings of the VLDB Endowment
Existing mechanisms for transactional updates are not appropriate in such a setting as they are optimized for block-based storage. ...
Recent non-volatile memory (NVM) technologies, such as PCM, STT-MRAM and ReRAM, can act as both main memory and storage. ...
We compare REWIND to Stasis [27] , a state-of-the-art storage manager for persistent data structures. ...
doi:10.14778/2735479.2735483
fatcat:e7skljfdffbtznkhegmbtvivmm
Disposable Yet Official Identities (DYOI) for Privacy-Preserving System Design - The case of COVID-19 digital document verification and credential-based access control in ad hoc outdoor and indoor settings (and beyond)
2020
Zenodo
Individuals, business and governments deal and transact by exchanging documents. ...
A wide range of devices can operate a "spatially flexible" control, from simple tablets to fixed and portable mobile screen scanners. ...
doi:10.5281/zenodo.4016976
fatcat:nf5idotsl5grlirtc6i47dtm6m
Segment-based recovery
2009
Proceedings of the VLDB Endowment
This makes the approach particularly applicable to large scale distributed systems, and enables a "cross pollination" of ideas from distributed systems and transactional storage. ...
Low priority transactions ensure that a fraction of Stasis' write queue is unused, reserving space for high-priority transactions. ...
Surprisingly, allocators have long-plagued implementers of transactional storage. ...
doi:10.14778/1687627.1687683
fatcat:7douadnwwvfq3kea22xwfcidcm
From ARIES to MARS
2013
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles - SOSP '13
Transaction-based systems often rely on write-ahead logging (WAL) algorithms designed to maximize performance on disk-based storage. ...
This paper presents a novel storage primitive, called editable atomic writes (EAW), that enables sophisticated, highly-optimized WAL schemes in fast NVM-based storage systems. ...
For example, ARIES offers flexible storage management by supporting objects of varying length. ...
doi:10.1145/2517349.2522724
dblp:conf/sosp/CoburnBSGS13
fatcat:ub6xqs5zmvee3bxvjp24p7q33y
Failure-atomic msync()
2013
Proceedings of the 8th ACM European Conference on Computer Systems - EuroSys '13
Existing approaches such as relational databases and transactional key-value stores restrict programming flexibility by mandating narrow data access interfaces. ...
failure-atomic msync() has preserved application data integrity across hundreds of whole-machine power interruptions and exhibits good microbenchmark performance on both spinning disks and solid-state storage ...
Ts'o for several helpful suggestions that guided our implementation strategy, and we thank Joe Tucek for helping us to design our whole-machine power-interruption tests to evaluate the reliability of storage ...
doi:10.1145/2465351.2465374
dblp:conf/eurosys/ParkKS13
fatcat:dtqapds4knapxexv3zcc36jnba
Process Ecology: A Transactional Worldview
[chapter]
2011
Ecodynamics: The Prigogine Legacy
The status of the transactions between the two trends can be gauged using information theory and is expressed in two complementary terms called the system 'overhead' and 'ascendency', respectively. ...
In spite of (and paradoxically, because of) such flexibility, dynamical order can persist. ...
Within the flexible framework of process ecology, chance -even radical, singular chance -does not necessarily unravel a system. ...
doi:10.2495/978-1-84564-654-7/13
fatcat:sk6xcajdubhv3l5om3sxize4g4
« Previous
Showing results 1 — 15 out of 655 results