Search results for "Logics"
showing 10 items of 124 documents
HRM models of online labor platforms : Strategies of market and corporate logics
2023
Studies on online labor platforms (OLPs) have revealed that OLPs can have extensive managerial control over independent workers, which affects their autonomy and precariousness. The permeability of the management makes some OLPs' roles as neutral intermediaries in labor exchanges questionable. While there are several platform work studies on the effects of human resource management (HRM) activities, earlier studies have focused more on certain types of OLP companies. Earlier OLP classifications did not make systematic distinctions between HRM activities either. This paper offers a classification to view how HRM activities manifest in OLPs. The study utilizes terms of service and webpage dat…
Versatile Direct and Transpose Matrix Multiplication with Chained Operations: An Optimized Architecture Using Circulant Matrices
2016
With growing demands in real-time control, classification or prediction, algorithms become more complex while low power and small size devices are required. Matrix multiplication (direct or transpose) is common for such computation algorithms. In numerous algorithms, it is also required to perform matrix multiplication repeatedly, where the result of a multiplication is further multiplied again. This work describes a versatile computation procedure and architecture: one of the matrices is stored in internal memory in its circulant form, then, a sequence of direct or transpose multiplications can be performed without timing penalty. The architecture proposes a RAM-ALU block for each matrix c…
Equivalence closure in the two-variable guarded fragment
2015
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
Concatenated logic functions using nanofluidic diodes with all-electrical inputs and outputs
2018
[EN] Nanopore-based logical schemes in ionic solutions typically involve single gates and chemical inputs. The design of computer-like functions requires the consecutive concatenation of several gates and the use of electrical potentials and currents to facilitate the downstream transfer of electrochemical information. We have demonstrated the robust operation of concatenated logic functions using biomimetic nanofluidic diodes based on single pore membranes. To this end, we have implemented first the logic functions AND and OR with combinations of single nanopores using all-electrical input and output signals. The concatenation of these gates allows the output of the OR gate to act as one o…
Frames for fusions of modal logics
2018
Let us consider multimodal logics and . We assume that is characterised by a class of connected frames, and there exists an -frame with a so-called -starting point. Similarly, the logic is characterised by a class of connected frames, and there exists an -frame with a -starting point. Using isomorphic copies of the frames and , we construct a connected frame which characterises the fusion . The frame thus obtained has some useful properties. Among others, is countable if both and are countable, and there is a special world of the frame such that any formula is valid in the frame if and only if it is valid at the point . We also describe a similar construction where we assume the existence o…
Scaffold and scaffold-free self-assembled systems in regenerative medicine.
2016
Self-assembly in tissue engineering refers to the spontaneous chemical or biological association of components to form a distinct functional construct, reminiscent of native tissue. Such self-assembled systems have been widely used to develop platforms for the delivery of therapeutic and/or bioactive molecules and various cell populations. Tissue morphology and functional characteristics have been recapitulated in several self-assembled constructs, designed to incorporate stimuli responsiveness and controlled architecture through spatial confinement or field manipulation. In parallel, owing to substantial functional properties, scaffold-free cell-assembled devices have aided in the developm…
Pileup and underlying event mitigation with iterative constituent subtraction
2019
Abstract The hard-scatter processes in hadronic collisions are often largely contaminated with soft background coming from pileup in proton-proton collisions, or underlying event in heavy-ion collisions. This paper presents a new background subtraction method for jets and event observables (such as missing transverse energy) which is based on the previously published Constituent Subtraction algorithm. The new subtraction method, called Iterative Constituent Subtraction, applies event-wide implementation of Constituent Subtraction iteratively in order to fully equilibrate the background subtraction across the entire event. Besides documenting the new method, we provide guidelines for setting…
On the Quantum and Classical Complexity of Solving Subtraction Games
2019
We study algorithms for solving Subtraction games, which are sometimes referred as one-heap Nim games.
Institutional Logics and the Internationalization of a State-Owned Enterprise : Evaluation of International Venture Opportunities by Telecom Finland …
2020
We contribute to the research on internationalization of state-owned enterprises (SOEs) by studying the coevolution of state governance of SOEs and SOEs’ evaluation of international venture opportunities during a shift in dominant institutional logic from state to market logic. Using a novel digital historical method to study Telecom Finland, we argue that as state governance mechanisms change due to a logic shift, rationales underlying SOEs’ internationalization can significantly change and impact SOEs’ geographical and partner preferences. However, a logic shift also affords SOEs significant influence over the formation of new state governance policies under the new dominant logic. peerRe…