Filtry
wszystkich: 1329
-
Katalog
- Publikacje 753 wyników po odfiltrowaniu
- Czasopisma 228 wyników po odfiltrowaniu
- Konferencje 34 wyników po odfiltrowaniu
- Osoby 183 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Kursy Online 25 wyników po odfiltrowaniu
- Wydarzenia 5 wyników po odfiltrowaniu
- Dane Badawcze 99 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: computer science
-
International Conference on Relational and AlgebraicMethods in Computer Science (International Conference on Relational Methods in Computer Science [RelMiCS])
Konferencje -
Post-Graduate ADFA Conference on Computer Science
Konferencje -
International Symposium on Mathematical Foundations of Computer Science
Konferencje -
International Workshop on Logic and Complexity in Computer Science
Konferencje -
Foundations of Software Technology and Theoretical Computer Science
Konferencje -
IFIP International Conference on Theoretical Computer Science
Konferencje -
International Symposium on Theoretical Aspects of Computer Science
Konferencje -
Current Trends in Theory and Practice of Computer Science
Konferencje -
World Congress in Computer Science, Computer Engineering, and Applied Computing
Konferencje -
Computer Assisted Methods in Engineering and Science
Czasopisma -
International Conference on Theoretical and Mathematical Foundations of Computer Science
Konferencje -
International Conference on Discrete Mathematics and Theoretical Computer Science
Konferencje -
Annual Conference on Innovation and Technology in Computer Science Education
Konferencje -
University of Western Australia Computer Science Research Conference
Konferencje -
International Workshop on Graph-Theoretic Concepts in Computer Science
Konferencje -
ACM Special Interest Group on Computer Science Education Conference
Konferencje -
International Conference on Relations, Orders and Graphs: Interaction with Computer Science
Konferencje -
Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities
Konferencje -
Assessment of risks introduced to safety critical software by agile practices - a software engineer's perspective
PublikacjaIn this article we investigate the problem of applying agile practices into safety-critical projects.The goal of our research is to investigate potential benefits from introducing agile practicesinto safety-critical environment and to present a solution providing for balancing agileapproach with more disciplined assurance techniques, bringing the best of the two worlds together.In the article we present the supporting ideas such...
-
The Application Of A Noise Mapping Tool Deployed In Grid Infrastructure For Creating Noise Maps Of Urban Areas
PublikacjaThe concept and implementation of the system for creating dynamic noise maps in PL-Grid infrastructure are presented. The methodology of dynamic acoustical maps creating is introduced. The concept of noise mapping, based on noise source and propagation models, was developed and employed in the system. The details of incorporation of the system to the PL-Grid infrastructure are presented. The results of simulations performed by...
-
Using Redis supported by NVRAM in HPC applications
PublikacjaNowadays, the efficiency of storage systems is a bottleneck in many modern HPC clusters. High performance in the traditional approach – processing using files – is often difficult to obtain because of a model’s complexity and its read/write patterns. An alternative approach is to apply a key-value database, which usually has low latency and scales well. On the other hand, many key-value stores suffer from a limitation of memory...
-
Exploring Impact of Requirements Engineering on Other IT Project Areas – Case Study
PublikacjaRequirements Engineering (RE) is recognized as one of the most important (yet difficult) areas of software engineering that has a significant impact on other areas of IT projects and their final outcomes. Empirical studies investigating this impact are hard to conduct, mainly due to the great effort required. It is thus difficult for both researchers and industry practitioners to make evidence-based evaluations about how decisions...
-
From Linear Classifier to Convolutional Neural Network for Hand Pose Recognition
PublikacjaRecently gathered image datasets and the new capabilities of high-performance computing systems have allowed developing new artificial neural network models and training algorithms. Using the new machine learning models, computer vision tasks can be accomplished based on the raw values of image pixels instead of specific features. The principle of operation of deep neural networks resembles more and more what we believe to be happening...
-
International Science Conference on Computer Networks
Konferencje -
Computer modeling and testing of structural metamaterials
Publikacja -
A note on the affective computing systems and machines: a classification and appraisal
PublikacjaAffective computing (AfC) is a continuously growing multidisciplinary field, spanning areas from artificial intelligence, throughout engineering, psychology, education, cognitive science, to sociology. Therefore, many studies have been devoted to the aim of addressing numerous issues, regarding different facets of AfC solutions. However, there is a lack of classification of the AfC systems. This study aims to fill this gap by reviewing...
-
Aiming at methods’ wider adoption: Applicability determinants and metrics
PublikacjaNumerous computer science methods and techniques have been proposed by the scientific community. However, depending on the domain, only their minor fraction has met wider adoption. This paper brings attention to the concept of applicability - the notion that is well acknowledged in the scientific field but have not been analysed with respect to determinants, metrics and systematisation. The primary objective of the study was to...
-
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Image projection in Immersive 3D Visualization Laboratory
PublikacjaIn recent years, many centers in the world attempted to build a virtual reality laboratory. The main idea of such laboratory is to allow the user to “immerse” into and move in a computer-generated virtual world. In the paper, the underlying principles of the system of virtual reality (VR) are described. The selected implementations constructed by the research centers of the world are also presented. The cave automatic virtual environment...
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublikacjaArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
Connected searching of weighted trees
PublikacjaW pracy pokazano, że problem spójnego przeszukiwania drzew ważonych jest silnie NP-zupełny. Problem pozostaje trudnym dla drzew z jednym wierzchołkiem o stopniu większym niż 2. Ponadto, przedstawiony został wielomianowy optymalny algorytm dla klasy drzew z ograniczonym stopniem.
-
Synchronous black hole search in directed graphs
PublikacjaThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Universal Augmentation Schemes for Network Navigability
PublikacjaRozważano problem uzupełniania grafu (reprezentującego np. sieci społeczne) poprzez dodanie w każdym węźle jednego dodatkowego skierowanego połączenia (długodystansowego). Dokładniej, dla każdego węzła definiuje się listę prawdopodobieństw istnienia połączenia wychodzącego z danego węzła do wszystkich pozostałych węzłów; wartości tych prawdopodobieństw muszą sumować się do jedności. Routing zachłanny w takiej sieci polega na przekazywaniu...
-
Smaller representation of finite state automata
PublikacjaThis paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory (Daciuk, 2000)[4]. We investigate several techniques for reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve...
-
Approximate search strategies for weighted trees
PublikacjaW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
The Hybrid Fuzzy - SOEKS Approach to the Polish Internet Mortgage Market
PublikacjaThe paper presents the hybrid fuzzy- SOEKS approach to the Polish Internet mortgage market, which is treated as an example of a fast changing market. Firstly, the market and market problems are described. Then, the first approach to the market problems is presented: the complete fuzzy model which was built basing on the rules. The fuzzy model is presented on one real data case. Next, the new approach, called Set of Experience Knowledge...
-
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
VIBRATION DIAGNOSTICS OF FOOTBRIDGE WITH USE OF ROTATION SENSOR
PublikacjaThe benefits of the additional measurement of rotational degrees of free-dom on the performance of the vibration diagnosis of bridges are studied in this paper. The common vibrational diagnostics that uses translational degrees of freedom is extended by measurements of rotations. The study is curried out on a footbridge and the presence of damage as well as its location and size is determined with use of FEM updating procedure....
-
Optimization model of agile team’s cohesion
PublikacjaTeam’s cohesion is one of the most important factors of IT project execution effectiveness. Optimization of team’s cohesion gives the possibility of reducing the risk of project failure. It also allows to increase the teamwork efficiency and thus optimize time of tasks execution, increase the guarantee of maintaining the scope of the project and the chance of achieving a given level of products quality. This article presents determination...
-
Phutball is PSPACE-hard
PublikacjaW pracy dowodzimy, że gra ''Phutball'' (Philosopher's Football) jest PSPACE-trudna.
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublikacjaOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
Modeling of Imaging Mass Spectrometry Data and Testing by Permutation for Biomarkers Discovery in Tissues
Publikacja -
Implementation of algebraic procedures on the GPU using CUDA architecture on the example of generalized eigenvalue problem
Publikacja -
Application of crowdfunding to video game projects financing
Publikacja -
Three levels of fail-safe mode in MPI I/O NVRAM distributed cache
PublikacjaThe paper presents architecture and design of three versions for fail-safe data storage in a distributed cache using NVRAM in cluster nodes. In the first one, cache consistency is assured through additional buffering write requests. The second one is based on additional write log managers running on different nodes. The third one benefits from synchronization with a Parallel File System (PFS) for saving data into a new file which...
-
The searchlight problem for road networks
PublikacjaWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Distinguishing views in symmetric networks: A tight lower bound
PublikacjaThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Virtual Engineering Object / Virtual Engineering Process: A specialized form of Cyber Physical System for Industrie 4.0
PublikacjaThis paper reviews the theories, parallels and variances between Virtual Engineering Object (VEO) / Virtual Engineering Process (VEP) and Cyber Physical System (CPS). VEO and VEP is an experience based knowledge representation of engineering objects and processes respectively. Cyber–physical systems (CPSs) are the next generation of engineered systems in which computing, communication, and control technologies are tightly integrated....
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
TISAX - optimization of IT risk management in the automotive industry
Publikacja