| 1. |
- Gamukama, Elly Amani, et al.
(författare)
-
A descriptive model for aligning the goals of the Internet stakeholders in LDCs
- 2014
-
Ingår i: Procedia Computer Science. - : Elsevier BV. - 1877-0509. ; 31, s. 900-909
-
Tidskriftsartikel (refereegranskat)abstract
- The Internet as a platform for services provision and delivery is adopted world over. To least developed countries it is further perceived as a medium for fostering development. A perception that is likely not to be easily achieved because the decisions that led to its existence in such countries never addressed the need of aligning the stakeholders' goals which inherit the misalignments in present Internet architectural model. We present a model based on AHP theory that lays strategies through which informed decisions for aligning stakeholders' goals can be made to use the Internet as medium for enhancing national development initiatives.
|
|
| 2. |
- Holmgren, Johan, et al.
(författare)
-
Agent-based simulation of freight transport between geographical zones
- 2013
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 19, s. 829-834
-
Konferensbidrag (refereegranskat)abstract
- We present TAPAS-Z, which is an agent-based freight transport analysis model for simulation of decision-making and transport activities. TAPAS-Z is a further development of a simulation model called TAPAS, and it has improved support for simulation of transport in large geographical regions. It is based on the principles that shipments are simulated for chosen supplier-consumer relations in a geographic region, and that the geographic locations of suppliers and consumers are randomly varied for each shipment. In TAPAS-Z, one supplier represents all real-world suppliers in a geographic zone, and one consumer represents all real-world consumers in a zone. In that way, TAPAS-Z is able to capture some of the diversity in freight transport that is caused by the varying geographic locations of senders and receivers, and which is important when assessing the impact of transport policy and infrastructural measures.
|
|
| 3. |
- Kleyko, Denis, Ph.D. 1990-, et al.
(författare)
-
Fly-The-Bee : A Game Imitating Concept Learning in Bees
- 2015
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 71, s. 25-30
-
Konferensbidrag (refereegranskat)abstract
- This article presents a web-based game functionally imitating a part of the cognitive behavior of a living organism. This game is a prototype implementation of an artificial online cognitive architecture based on the usage of distributed data representations and Vector Symbolic Architectures. The game emonstrates the feasibility of creating a lightweight cognitive architecture, which is capable of performing rather complex cognitive tasks. The cognitive functionality is implemented in about 100 lines of code and requires few tens of kilobytes of memory for its operation, which make the concept suitable for implementing in low-end devices such as minirobots and wireless sensors.
|
|
| 4. |
- Kleyko, Denis, Ph.D. 1990-, et al.
(författare)
-
On bidirectional transitions between localist and distributed representations : The case of common substrings search using Vector Symbolic Architecture
- 2014
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 41, s. 104-113
-
Konferensbidrag (refereegranskat)abstract
- The contribution of this article is twofold. First, it presents an encoding approach for seamless bidirectional transitions between localist and distributed representation domains. Second, the approach is demonstrated on the example of using Vector Symbolic Architecture for solving a problem of finding common substrings. The proposed algorithm uses elementary operations on long binary vectors. For the case of two patterns with respective lengths L1 and L2 it requires Θ(L1 + L2 – 1) operations on binary vectors, which is equal to the suffix trees approach – the fastest algorithm for this problem. The simulation results show that in order to be robustly detected by the proposed approach the length of a common substring should be more than 4% of the longest pattern.
|
|
| 5. |
- Ruivo, Pedro, et al.
(författare)
-
Differences in ERP Value between Iberian Manufacturing and Services SMEs
- 2017
-
Ingår i: Procedia Computer Science. - : Elsevier BV. - 1877-0509. ; 121, s. 707-715
-
Tidskriftsartikel (refereegranskat)abstract
- Enterprise Resource Planning (ERP) system literature reports little research on the specificities of an industry analysis. Based on a theoretical model we assess ERP Value between Manufacturing and Services industries in Small and Medium Enterprises (SMEs) across the Iberian region (Portugal and Spain). The empirical test was conducted through structural equation modeling, using data from 261 firms. Results show that Firm size, Analytics and Collaboration contribute to ERP Value in those industries, with Analytics being more important for the Services industry.
|
|
| 6. |
- Abd Nikooie Pour, Mina, et al.
(författare)
-
Phrase2Onto: A Tool to Support Ontology Extension
- 2023
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 225, s. 1415-1424, s. 1415-1424
-
Tidskriftsartikel (refereegranskat)abstract
- Due to importance of data FAIRness (Findable, Accessible, Interoperable, Reusable), ontologies as a means to make data FAIR have attracted more and more attention in different communities and are being used in semantically-enabled applications. However, to obtain good results while using ontologies in these applications, high quality ontologies are needed of which completeness is one of the important aspects. An ontology lacking information can lead to missing results. In this paper we present a tool, Phrase2Onto, that supports users in extending ontologies to make the ontologies more complete. It is particularly suited for ontology extension using a phrase-based topic model approach, but the tool can support any extension approach where a user needs to make decisions regarding the appropriateness of using phrases to define new concepts. We describe the functionality of the tool and a user study using Pizza Ontology. The user study showed a good usability of the system and high task completion. Further, we report on a real application where we extend the Materials Design Ontology.
|
|
| 7. |
- Abid, Muhammad Adil, et al.
(författare)
-
A Genetic Algorithm for Optimizing Mobile Stroke Unit Deployment
- 2023
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 225, s. 3536-3545
-
Tidskriftsartikel (refereegranskat)abstract
- A mobile stroke unit (MSU) is an advanced ambulance equipped with specialized technology and trained healthcare personnel to provide on-site diagnosis and treatment for stroke patients. Providing efficient access to healthcare (in a viable way) requires optimizing the placement of MSUs. In this study, we propose a time-efficient method based on a genetic algorithm (GA) to find the most suitable ambulance sites for the placement of MSUs (given the number of MSUs and a set of potential sites). We designed an efficient encoding scheme for the input data (the number of MSUs and potential sites) and developed custom selection, crossover, and mutation operators that are tailored according to the characteristics of the MSU allocation problem. We present a case study on the Southern Healthcare Region in Sweden to demonstrate the generality and robustness of our proposed GA method. Particularly, we demonstrate our method's flexibility and adaptability through a series of experiments across multiple settings. For the considered scenario, our proposed method outperforms the exhaustive search method by finding the best locations within 0.16, 1.44, and 10.09 minutes in the deployment of three MSUs, four MSUs, and five MSUs, resulting in 8.75x, 16.36x, and 24.77x faster performance, respectively. Furthermore, we validate the method's robustness by iterating GA multiple times and reporting its average fitness score (performance convergence). In addition, we show the effectiveness of our method by evaluating key hyperparameters, that is, population size, mutation rate, and the number of generations.
|
|
| 8. |
- Abid, Muhammad Adil, et al.
(författare)
-
Ambulance Travel Time Estimation using Spatiotemporal Data
- 2024
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 238, s. 265-272
-
Tidskriftsartikel (refereegranskat)abstract
- Ambulance travel time estimations play a pivotal role in ensuring timely and efficient emergency medical care by predicting the duration for an ambulance to reach a specific location. Overlooking factors such as local traffic situations, day of the week, hour of the day, or the weather may create a risk of inaccurately estimating the ambulance travel times, which might lead to delayed emergency response times, potentially impacting patient outcomes. In the current paper, we propose a novel framework for accurately estimating ambulance travel times using machine learning paradigms, employing real-world spatiotemporal ambulance data from the Skane region, Sweden. Our framework includes data preprocessing and feature engineering, with a focus on variables significantly correlated with travel time. First, through a comprehensive exploratory data analysis, we highlight the main characteristics, patterns, and underlying trends of the considered ambulance data set. Then, we present an extensive empirical analysis comparing the performance of different machine learning models across different ambulance travel trip scenarios and feature sets, revealing insights into the importance of each feature in improving the estimation accuracy. Our experiments indicate that the aforementioned factors play a significant role when estimating the travel time.
|
|
| 9. |
- Aguilar, Xavier, et al.
(författare)
-
Online MPI trace compression using event flow graphs and wavelets
- 2016
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; , s. 1497-1506
-
Konferensbidrag (refereegranskat)abstract
- Performance analysis of scientific parallel applications is essential to use High Performance Computing (HPC) infrastructures efficiently. Nevertheless, collecting detailed data of large-scale parallel programs and long-running applications is infeasible due to the huge amount of performance information generated. Even though there are no technological constraints in storing Terabytes of performance data, the constant flushing of such data to disk introduces a massive overhead into the application that makes the performance measurements worthless. This paper explores the use of Event flow graphs together with wavelet analysis and EZW-encoding to provide MPI event traces that are orders of magnitude smaller while preserving accurate information on timestamped events. Our mechanism compresses the performance data online while the application runs, thus, reducing the pressure put on the I/O system due to buffer flushing. As a result, we achieve lower application perturbation, reduced performance data output, and the possibility to monitor longer application runs.
|
|
| 10. |
- Aguilar, Xavier, et al.
(författare)
-
Visual MPI Performance Analysis using Event Flow Graphs
- 2015
-
Ingår i: Procedia Computer Science. - : Elsevier. - 1877-0509. ; 51, s. 1353-1362
-
Tidskriftsartikel (refereegranskat)abstract
- Event flow graphs used in the context of performance monitoring combine the scalability and low overhead of profiling methods with lossless information recording of tracing tools. In other words, they capture statistics on the performance behavior of parallel applications while pre- serving the temporal ordering of events. Event flow graphs require significantly less storage than regular event traces and can still be used to recover the full ordered sequence of events performed by the application. In this paper we explore the usage of event flow graphs in the context of visual performance analysis. We show that graphs can be used to quickly spot performance problems, helping to better understand the behavior of an application. We demonstrate our performance analysis approach with MiniFE, a mini-application that mimics the key performance aspects of finite- element applications in High Performance Computing (HPC).
|
|
