52 research outputs found
VARIETY OF VIDEO APPLICATIONS IN FOREIGN LANGUAGE CLASSES
No full textPoór Zoltan, Variety o f video applications in foreign language classes, „Neodidagmata”
XX, Poznań 1991, Adam Mickiewicz University Press, pp. 123 -129. ISBN 0077-653 X. Received:
June 1988.
The work contains examples of using video and tv camera in foreign language classes.
A proposition of classification of the ways using TVZ in education is interesting. The characteristic
feature is drawing attention by the author to the specific effects which can be achieved by means of
particular didactic aids. The approach to TV as a didactic aid is characteristic for the conception of
multimedial teaching
Living at the Edge: Running IPFS and Ethereum Client Software on Single-board Computers
No full textBlockchains and decentralized file systems like the
InterPlanetary File System (IPFS) are frequently named as
means to share data among different devices and stakeholders
in Internet of Things (IoT) scenarios. Very often, the idea is to
connect lightweight IoT-based data sources, e.g., sensor nodes,
to a ledger or a file system via a Single-board Computer (SBC),
i.e., using computational resources at the edge of the network for
providing an interface between the data sources and the ledger
or file system.
However, SBCs like a Raspberry Pi naturally possess only
limited resources, and therefore may not be suitable to provide
an interface between IoT-based data sources and decentralized
ledgers and file systems. Within this paper, we evaluate the
applicability and performance of common SBCs, namely the
Raspberry Pi 3, the Odroid-XU4, and the Intel Galileo Gen2,
when used in order to run IPFS and Ethereum client software
Secure data processing in the cloud
No full textData protection is a key issue in the adoption of cloud services. The project “RestAssured – Secure Data Processing in the Cloud,” financed by the European Union’s Horizon 2020 research and innovation programme, addresses the challenge of data protection in the cloud with a combination of innovative security solutions, data lifecycle management techniques, run-time adaptation, and automated risk management. This paper gives an overview about the pro-ject’s goals and current statu
Accelerating SAT solving with best-first-search
No full textSolvers for Boolean satisfiability (SAT), like other algorithms for NP-complete problems, tend to have a heavy-tailed runtime distribution. Successful SAT solvers make use of frequent restarts to mitigate this problem by abandoning unfruitful parts of the search space after some time. Although frequent restarting works fairly well, it is a quite simplistic technique that does not do anything explicitly to make the next try better than the previous one. In this paper, we suggest a more sophisticated method: using a best-first-search approach to quickly move between different parts of the search space. This way, the search can always focus on the most promising region. We investigate empirically how the performance of frequent restarts, best-first-search, and a combination of the two compare to each other. Our findings indicate that the combined method works best, improving 36-43\% on the performance of frequent restarts on the used set of benchmark problems
Numbering action vertices in workflow graphs
No full textNumbering action vertices in workflow graphsWorkflow graphs, consisting of actions, events, and logical switches, are used to model business processes. In order to easily identify the actions within a workflow graph, it is useful to number them in such a way that the numbering reflects the structure of the workflow. However, available tools offer only rudimental numbering schemes. In the paper, a set of natural requirements is defined that a logical numbering should fulfill. It is investigated under what conditions there is an appropriate numbering at all, when it is uniquely defined by the set of requirements, and when it can be computed efficiently. It is shown that for an important special class of workflow graphs, namely, structured workflow graphs, the answer to all these questions is affirmative. For general workflow graphs, a set of requirements is presented that can always be fulfilled, but the numbering is not necessarily unique. An algorithm based on a depth-first search can be used to compute an appropriate numbering efficiently.</jats:p
- …
