The object of the study is process functioning enterprises grain product subcomplex. In course study, problem growth rate and peculiarities subcomplex were solved. An assessment was carried out Republic Kazakhstan using mathematical modeling, for which a methodology has been developed that allows considering factors with heterogeneous metric, includes following steps: 1) index analysis twenty-o...

Optimism is a powerful technique for increasing concurrency. A program can gain concurrency by making an optimistic assumption about its future state, and verifying the assumption in parallel with computations based on the optimistic assumption. To date, use of optimism has been restricted to specialized systems due to the diiculty of writing optimistic programs. In this paper, we deene and jus...

We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is expected to require only a small constant number of rounds in practice. To prove that our protocol is secure, we identify a weak property of concurrent schedules—called footer-freeness—that suffices for efficient simulat...

Emotions can bias human decisions- for example depressed or anxious people tend to make pessimistic judgements while those in positive affective states are often more optimistic. Several studies have reported that affect contingent judgement biases can also be produced in animals. The animals, however, cannot self-report; therefore, the valence of their emotions, to date, could only be assumed....

Barrier synchronization is a fundamental operation in parallel computation. In many contexts, at the point a processor enters a barrier it knows that it has already processed all work required of it prior to the synchronization. This paper treats the alternative case, when a processor cannot enter a barrier with the assurance that it has already performed all necessary pre-synchronization compu...

optimistic, replication, survey Replication is a key enabling technology in distributed data sharing systems for improving both availability and performance. This paper surveys optimistic replication algorithms, which allow replica contents to diverge in the short term, in order to support concurrent work and to tolerate failures in low-quality communication links. The importance of such techni...

We present a combination of Upper Confidence Tree (UCT) and domain specific solvers, aimed at improving the behavior of UCT for long term aspects of a problem. Results improve the state of the art, combining top performance on small boards (where UCT is the state of the art) and on big boards (where variants of CSP rule).

Replication is a powerful technique for increasing availability of a distributed service. Algorithms for replicating distributed services do however face a dilemma: they should be (1) efficient (low latency), while (2) ensuring consistency of the replicas, which are two contradictory goals. The paper concentrates on active replication, where all the replicas handle the clients’ requests. Active...

This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without making any timing assumptions or using any type of “failure detector.” Under normal circumstances, the protocol runs in an “optimistic mode,” with extremely low message and computational complexity — essentially, just perf...

by instrumenting their pages and monitoring the clickthrough behavior of its many users. Vijay Gurbani noted that the lack of labeled logs is primarily an issue with computer science education—students are taught how to program, but not how to properly organize their program’s log output nor how to label and then study the output to understand their programs. Also in response, Wei noted that la...