Filters








51,428 Hits in 5.5 sec

Is distributed locking harder?

Paris C. Kanellakis, Christos H. Papadimitriou
1982 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '82  
The problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules is examined.  ...  A new graphtheoretic technique is employed and an G(n') test for the special case of databases distributed between two sites is provided.  ...  The node v is a direct descendant of all middle nodes that are direct descendants of u. IS DISTRIBUTED LOCKING HARDER?  ... 
doi:10.1145/588111.588129 dblp:conf/pods/KanellakisP82 fatcat:vehgz7ahsvehjcxn3c6g2rigfu

Is distributed locking harder?

Paris C. Kanellakis, Christos H. Papadimitriou
1982 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '82  
The problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules is examined.  ...  A new graphtheoretic technique is employed and an G(n') test for the special case of databases distributed between two sites is provided.  ...  The node v is a direct descendant of all middle nodes that are direct descendants of u. IS DISTRIBUTED LOCKING HARDER?  ... 
doi:10.1145/588127.588129 fatcat:y6im6mcm6rb25l4no3vylui4cy

Is distributed locking harder?

Paris C. Kanellakis, Christos H. Papadimitriou
1984 Journal of computer and system sciences (Print)  
The problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules is examined.  ...  A new graphtheoretic technique is employed and an G(n') test for the special case of databases distributed between two sites is provided.  ...  The node v is a direct descendant of all middle nodes that are direct descendants of u. IS DISTRIBUTED LOCKING HARDER?  ... 
doi:10.1016/0022-0000(84)90078-3 fatcat:i7ybv3xvmfe35mf5fr6cp23egi

The Harder Problem of Consciousness

Ned Block
2002 Journal of Philosophy  
Finally, the Harder Problem reveals an epistemic tension or at least discomfort in our ordinary conception of consciousness that is not suggested by the Hard Problem, and so in one respect it is harder  ...  This is the Hard Problem of Consciousness. 3 The aim of this paper is to present another problem of consciousness. The Harder Problem as I will call it is more epistemological than the Hard Problem.  ...  This is a first pass at saying what the Harder Problem is.  ... 
doi:10.2307/3655621 fatcat:wwivjhugzranhiqakvi26j35u4

Uniform consensus is harder than consensus

Bernadette Charron-Bost, André Schiper
2004 Journal of Algorithms  
We show that if uniform agreement is required, one additional round is needed to decide, and so uniform consensus is also harder than consensus for crash failures.  ...  This is based on a new lower bound result for the synchronous model that we state for the uniform consensus problem. Finally, an algorithm is presented that achieves this lower bound.  ...  It is a pleasure to thank the anonymous referees for their precise comments and suggestions on the first version of this paper, and Michael Merritt and Yoram Moses for the communication of their papers  ... 
doi:10.1016/j.jalgor.2003.11.001 fatcat:7c2kqmwjkzelnmilc2qgktyfiu

Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability [chapter]

Oksana Denysyuk, Philipp Woelfel
2015 Lecture Notes in Computer Science  
These results separate lock-freedom from wait-freedom under strong linearizability.  ...  In randomized algorithms, replacing atomic shared objects with linearizable [1] implementations may affect probability distributions over outcomes [2] .  ...  The negative results show that in a system with atomic registers, strong linearizability is significantly harder to obtain than linearizability.  ... 
doi:10.1007/978-3-662-48653-5_5 fatcat:j5ipukcd6nfereye2qzlcfuapa

Antipredictable Sequences: Harder to Predict Than Random Sequences

Huaiyu Zhu, Wolfgang Kinzel
1998 Neural Computation  
This implies that any predictor with good performance must rely on some (usually implicitly) assumed prior distributions of the problem.  ...  For any discrete-state sequence prediction algorithm A, it is always possible, using an algorithm B no more complicated than A, to generate a sequence for which A's prediction is always wrong.  ...  As we have seen, half of all possible binary sequences are harder to predict than a random one.  ... 
doi:10.1162/089976698300017043 pmid:9804679 fatcat:vk3og6nnxzhnnal5lkuafurwqu

How soft materials control harder ones: routes to bioorganization

Marshall Stoneham
2007 Reports on progress in physics (Print)  
The term 'self-organization' is often used, but this description is facile, giving no hint as to the range or variety of mechanisms.  ...  Ordering can occur in circumstances commonly associated with disorder, as in the irradiation of metals to high doses; it can also occur when soft, flexible materials organize structures of harder, rigid  ...  The author is greatly indebted to many friends and colleagues for input and discussions, notably John Harding and Dorothy Duffy, and to John Evans for providing the superb micrograph of the void lattice  ... 
doi:10.1088/0034-4885/70/7/r02 fatcat:sudf6o36dbep3nns2sgry4dfv4

Petrus Hispanus Lectures 2003. The harder problem of consciousness

Ned Block
2003 Disputatio  
Is the Harder Problem harder than the Hard Problem? If the Harder Problem is the Hard Problem plus something else problematic, then it is trivially Harder.  ...  Now there is no problem about dispositions being caused: spraying my bicycle lock with liquid nitrogen causes it to become fragile.  ... 
doi:10.2478/disp-2003-0007 fatcat:xp7dg5ftzreyzeel77d7arrjqm

AutoLock: Why Cache Attacks on ARM Are Harder Than You Think [article]

Marc Green, Leandro Rodrigues-Lima, Andreas Zankl, Gorka Irazoqui, Johann Heyszl, Thomas Eisenbarth
2017 arXiv   pre-print
AutoLock's presence on system-on-chips (SoCs) is not publicly documented, yet knowing that it is implemented is vital to correctly assess the risk of cache attacks.  ...  A threshold of 700 clock cycles clearly separates the two timing distributions, which indicates that AutoLock is not present.  ...  The two timing distributions clearly overlap, which indicates that AutoLock inhibits the eviction.  ... 
arXiv:1703.09763v1 fatcat:daykpvsb2jh4znhcex35i6mucq

Make Workers Work Harder: Decoupled Asynchronous Proximal Stochastic Gradient Descent [article]

Yitan Li, Linli Xu, Xiaowei Zhong, Qing Ling
2016 arXiv   pre-print
To be specific, DAP-SGD achieves an O( T/T) rate when the step-size is diminishing and an ergodic O(1/√(T)) rate when the step-size is constant, where T is the number of total iterations.  ...  This strategy yields an easy-to-parallelize algorithm, whose performance is justified by theoretical convergence analyses.  ...  Singular value decomposition (SVD) is calculated by eigen3 2 . The parameters are locked while they are being updated.  ... 
arXiv:1605.06619v1 fatcat:e4iy4wlmizhb7dybiwsyqeu7gu

Bad things come easier to the mind but harder to the body: Evidence from brain oscillations

Christof Kuhbandner, Philipp Spachtholz, Bernhard Pastötter
2016 Cognitive, Affective, & Behavioral Neuroscience  
An intriguing finding of research on emotional processing is a discrepancy between perception and behavior.  ...  Behaviorally, a similarly robust finding is that response times are slower for negative than for positive stimuli.  ...  By these means, null distributions were created from random permutation runs, and the critical p values for the empirically derived time-frequency clusters were calculated.  ... 
doi:10.3758/s13415-016-0429-0 pmid:27383376 fatcat:eflkmhf5orhvjhgqxxxph3mgji

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction [article]

Krishnendu Chatterjee and Wolfgang Dvořák and Monika Henzinger and Veronika Loitzenbauer
2016 arXiv   pre-print
A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for  ...  Thus also the disjunction of one-pair Rabin objectives is harder than their conjunction. Remark about Streett and Rabin objective separation.  ...  Lock-step means that one step in each of the searches is executed before the next step of a search is started and all searches are stopped as soon as one search finishes.  ... 
arXiv:1602.02670v1 fatcat:sfdoobct3rawxgpby2d7azqrhm

Effect double-primer placement for improving the fragmentation on harder material in stemming column: a case study

M R Ipmawati, D R Nainggolan, B Wiyono, R Sunarya
2018 IOP Conference Series: Earth and Environment  
The fragmentation is one of the indicator of the successful blasting operation, because the next step is loading the blasted material which is the equipment productivity is depend on the bucket fill factor  ...  Then, increasing distance from the source of VoD the energy is getting lower. The simply way to improve fragmentation is increasing the Powder Factor (PF), but it has any side effects.  ...  In this study, the stemming material used was drill cutting, the type is free flowing solids which has mechanism inertia-mechanism that only has weight and viscosity and does not lock in to place and typically  ... 
doi:10.1088/1755-1315/212/1/012064 fatcat:uc4lzkaienahfbip3ikxqqhpki

Representations of the Body of the New Nation in The Harder They Come and Rockers

Ifeona Fulani
2005 Anthurium A Caribbean Studies Journal  
The raid is successful; the men load the contents of the warehouse-stolen TVs, washing machines, furniture, and the like-into a fleet of borrowed vehicles and distribute the goods amongst people in the  ...  a cadre of wealthy men by making distribution deals with a few small-scale record manufacturers.  ... 
doi:10.33596/anth.30 fatcat:swlvvy4o7bbi3cs72nio524kti
« Previous Showing results 1 — 15 out of 51,428 results