Research Outputs
Permanent URI for this communityhttps://hdl.handle.net/20.500.14288/2
Browse
38 results
Search Results
Publication Metadata only A mobile application for symptom management in patients with breast cancer(Oncology Nursing Society, 2022) Seven M.; N/A; N/A; Department of Computer Engineering; N/A; Paşalak, Şeyma İnciser; Bağçivan, Gülcan; Özkasap, Öznur; Selçukbiricik, Fatih; PhD Student; Faculty Member; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Health Sciences; School of Nursing; College of Engineering; School of Medicine; 125009; 261422; 113507; 202015OBJECTIVES: To evaluate the effect of a symptom management mobile application on quality of life and symptom severity in women with breast cancer undergoing chemotherapy. SAMPLE & SETTING: This parallel randomized pilot study consisted of women with breast cancer admitted to oncology outpatient clinics between November 2019 and January 2021 in Turkey. METHODS & VARIABLES: Participants (N = 40) were randomly assigned to the intervention (n = 20) or control group (n = 20). The intervention group used the mobile application in conjunction with usual care. The control group received usual care. Participants were assessed during the first, third, and last chemotherapy cycles. Data were collected using the European Organisation for Research and Treatment of Cancer Quality-of-Life Questionnaire–Core 30 and the Edmonton Symptom Assessment System. RESULTS: During the study, the decrease in general health and physical functioning and the increase in the severity of depression/sadness in the intervention group were statistically lower than in the control group. IMPLICATIONS FOR NURSING: The use of a mobile application for symptom management may promote general well-being and physical function and may alleviate symptoms of depression/sadness in women with breast cancer undergoing chemotherapy. Further studies are needed to evaluate the application in clinical settings with larger groups.Publication Metadata only A second-order adaptive network model for organizational learning and usage of mental models for a team of match officials(2022) Kuilboer, Sam; Sieraad, Wesley; van Ments, Laila; Treur, Jan; Department of Computer Engineering; Canbaloğlu, Gülay; Undergraduate Student; Department of Computer Engineering; College of Engineering; N/AThis paper describes a multi-level adaptive network model for mental processes making use of shared mental models in the context of organizational learning in team-related performances. The paper describes the value of using shared mental models to illustrate the concept of organizational learning, and factors that influence team performances by using the analogy of a team of match officials during a game of football and show their behavior in a simulation of the shared mental model. The paper discusses potential elaborations of the different studied concepts, as well as implications of the paper in the domain of teamwork and team performance, and in terms of organizational learning.Publication Metadata only Access pattern-aware data placement for hybrid DRAM/NVM(TUBITAKScientific and Technical Research Council Turkey, 2017) Department of Computer Engineering; Erten, Didem Unat; Faculty Member; Department of Computer Engineering; College of Engineering; 219274in recent years, increased interest in data-centric applications has led to an increasing demand for large capacity memory systems. Nonvolatile memory (NVM) technologies enable new opportunities in terms of process-scaling and energy consumption, and have become an attractive memory technology that serves as a secondary memory at low cost. However, NVM has certain disadvantages for write references, due to its high dynamic energy consumption for writes and low bandwidth compared to DRaM writes. in this paper, we propose an access-aware placement of objects in the application code for two types of memories. Given the desired power savings and acceptable performance loss, our placement algorithm suggests candidate variables for NVM. We present an evaluation of the proposed technique on two applications and study the energy and performance consequences of different placements.Publication Open Access Alpha-beta-conspiracy search(International Computer Games Association (ICGA), 2002) McAllester, David A.; Department of Computer Engineering; Yüret, Deniz; Faculty Member; Department of Computer Engineering; College of Engineering; 179996We introduce a variant of alpha-beta search in which each node is associated with two depths rather than one. The purpose of alpha-beta search is to find strategies for each player that together establish a value for the root position. A max strategy establishes a lower bound and the min strategy establishes an upper bound. It has long been observed that forced moves should be searched more deeply. Here we make the observation that in the max strategy we are only concerned with the forcedness of max moves and in the min strategy we are only concerned with the forcedness of min moves. This leads to two measures of depth - one for each strategy - and to a two-depth variant of alpha-beta called ABC search. The two-depth approach can be formally derived from conspiracy theory and the structure of the ABC procedure is justified by two theorems relating ABC search and conspiracy numbers.Publication Metadata only Analysis and pptimization on FlexDPDP: a practical solution for dynamic provable data possession(Springer-Verlag Berlin, 2015) N/A; Department of Computer Engineering; Department of Computer Engineering; Esiner, Ertem; Küpçü, Alptekin; Özkasap, Öznur; Master Student; Faculty Member; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 168060; 113507Security measures, such as proving data integrity, became more important with the increase in popularity of cloud data storage services. Dynamic Provable Data Possession (DPDP) was proposed in the literature to enable the cloud server to prove to the client that her data is kept intact, even in a dynamic setting where the client may update her files. Realizing that variable-sized updates are very inefficient in DPDP (in the worst case leading to uploading the whole file again), Flexible DPDP (FlexDPDP) was proposed. In this paper, we analyze FlexDPDP scheme and propose optimized algorithms. We show that the initial pre-processing phase at the client and server sides during the file upload (generally the most time-consuming operation) can be efficiently performed by parallelization techniques that result in a speed up of 6 with 8 cores. We propose a way of handling multiple updates at once both at the server and the client side, achieving an efficiency gain of 60% at the server side and 90% in terms of the client's update verification time. We deployed the optimized FlexDPDP on the large-scale network testbed PlanetLab and demonstrate the efficiency of our proposed optimizations on multi-client scenarios according to real workloads based on version control system traces.Publication Metadata only Application of data mining techniques to protein-protein interaction prediction(Springer, 2003) Atalay, R.; N/A; Department of Computer Engineering; Kocataş, Alper Tolga; Gürsoy, Attila; Master Student; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 8745Protein-protein interactions are key to understanding biological processes and disease mechanisms in organisms. There is a vast amount of data on proteins waiting to be explored. In this paper, we describe application of data mining techniques, namely association rule mining and ID3 classification, to the problem of predicting protein-protein interactions. We have combined available interaction data and protein domain decomposition data to infer new interactions. Preliminary results show that our approach helps us find plausible rules to understand biological processes.Publication Metadata only Automated and modular refinement reasoning for concurrent programs(Springer International Publishing Ag, 2015) Hawblitzel, Chris; Petrank, Erez; Qadeer, Shaz; Department of Computer Engineering; Taşıran, Serdar; Faculty Member; Department of Computer Engineering; College of Engineering; N/AWe present CIVL, a language and verifier for concurrent programs based on automated and modular refinement reasoning. CIVL supports reasoning about a concurrent program at many levels of abstraction. Atomic actions in a high-level description are refined to fine-grain and optimized lower-level implementations. A novel combination of automata theoretic and logic-based checks is used to verify refinement. Modular specifications and proof annotations, such as location invariants and procedure pre- and post-conditions, are specified separately, independently at each level in terms of the variables visible at that level. We have implemented CIVL as an extension to the BOOGIE language and verifier. We have used CIVL to refine a realistic concurrent garbage collection algorithm from a simple high-level specification down to a highly-concurrent implementation described in terms of individual memory accesses.Publication Metadata only Automatic construction of 3D animatable facial avatars(Wiley, 2010) Gao, Yujian; Zhao, Qinping; Hao, Aimin; Dodgson, Neil A.; Department of Computer Engineering; Sezgin, Tevfik Metin; Faculty Member; Department of Computer Engineering; College of Engineering; 18632Rigging for facial animation is an important but time-consuming task, which generally requires experienced artists with knowledge of facial anatomy. In this paper, we investigate whether it is possible to produce a good animatable avatar automatically, given only a 3D static triangle mesh of the head. An automatic mechanism is devised for constructing multi-layer animatable facial avatars for unseen faces. We evaluate our technique with a variety of models, and give a quantitative analysis of the constructed results. We also designed and conducted a user study for evaluating the perceived quality of the generated expressive animations. The results demonstrate that our method is an appropriate tool for naive users to customize their personal 3D avatars.Publication Open Access BlockSim-Net: a network-based blockchain simulator(TÜBİTAK, 2022) Ramachandran, Prashanthi; Agrawal, Nandini; Department of Computer Engineering; Biçer, Osman; Küpçü, Alptekin; Faculty Member; Department of Computer Engineering; College of Engineering; Graduate School of Sciences and Engineering; N/A; 168060Since its proposal by Eyal and Sirer (CACM '13), selfish mining attacks on proof-of-work blockchains have been studied extensively. The main body of this research aims at both studying the extent of its impact and defending against it. Yet, before any practical defense is deployed in a real world blockchain system, it needs to be tested for security and dependability. However, real blockchain systems are too complex to conduct any test on or benchmark the developed protocols. Instead, some simulation environments have been proposed recently, such as BlockSim (Maher et al., SIGMETRICS Perform. Eval. Rev. '19), which is a modular and easy-to-use blockchain simulator. However, BlockSim's structure is insufficient to capture the essence of a real blockchain network, as the simulation of an entire network happens over a single CPU. Such a lack of decentralization can cause network issues such as propagation delays being simulated in an unrealistic manner. In this work, we propose BlockSim-Net, a modular, efficient, high performance, distributed, network-based blockchain simulator that is parallelized to better reflect reality in a blockchain simulation environment.Publication Metadata only Building quadtrees for spatial data under local differential privacy(Springer Science and Business Media Deutschland Gmbh, 2023) Department of Computer Engineering; Alptekin, Ece; Gürsoy, Mehmet Emre; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of EngineeringSpatial decompositions are commonly used in the privacy literature for various purposes such as range query answering, spatial indexing, count-of-counts histograms, data summarization, and visualization. Among spatial decomposition techniques, quadtrees are a popular and well-known method. In this paper, we study the problem of building quadtrees for spatial data under the emerging notion of Local Differential Privacy (LDP). We first propose a baseline solution inspired from a state-of-the-art method from the centralized DP literature and adapt it to LDP. Motivated by the observation that the baseline solution causes large noise accumulation due to its iterative strategy, we then propose a novel solution which utilizes a single data collection step from users, propagates density estimates to all nodes, and finally performs structural corrections to the quadtree. We experimentally evaluate the baseline solution and the proposed solution using four real-world location datasets and three utility metrics. Results show that our proposed solution consistently outperforms the baseline solution, and furthermore, the resulting quadtrees provide high accuracy in practical tasks such as spatial query answering under conventional privacy levels.