Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 14191 - 14220 of 63038

Full-Text Articles in Computer Sciences

Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen Jul 2022

Time Dependent Orienteering Problem With Time Windows And Service Time Dependent Profits, M. Khodadadian, A. Divsalar, C. Verbeeck, Aldy Gunawan, P. Vansteenwegen

Research Collection School Of Computing and Information Systems

This paper addresses the time dependent orienteering problem with time windows and service time dependent profits (TDOPTW-STP). In the TDOPTW-STP, each vertex is assigned a minimum and a maximum service time and the profit collected at each vertex increases linearly with the service time. The goal is to maximize the total collected profit by determining a subset of vertices to be visited and assigning appropriate service time to each vertex, considering a given time budget and time windows. Moreover, travel times are dependent of the departure times. To solve this problem, a mixed integer linear model is formulated and a …

Go to article

Digbug: Pre/Post-Processing Operator Selection For Accurate Bug Localization, Kisub Kim, Sankalp Ghatpande, Kui Liu, Anil Koyuncu, Dongsun Kim, Tegawendé F. Bissyande, Jacques Klein, Yves Le Traon Jul 2022

Digbug: Pre/Post-Processing Operator Selection For Accurate Bug Localization, Kisub Kim, Sankalp Ghatpande, Kui Liu, Anil Koyuncu, Dongsun Kim, Tegawendé F. Bissyande, Jacques Klein, Yves Le Traon

Research Collection School Of Computing and Information Systems

Bug localization is a recurrent maintenance task in software development. It aims at identifying relevant code locations (e.g., code files) that must be inspected to fix bugs. When such bugs are reported by users, the localization process become often overwhelming as it is mostly a manual task due to incomplete and informal information (written in natural languages) available in bug reports. The research community has then invested in automated approaches, notably using Information Retrieval techniques. Unfortunately, reported performance in the literature is still limited for practical usage. Our key observation, after empirically investigating a large dataset of bug reports as …

Go to article

Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao Jul 2022

Hakg: Hierarchy-Aware Knowledge Gated Network For Recommendation, Yuntao Du, Xinjun Zhu, Lu Chen, Baihua Zheng, Yunjun Gao

Research Collection School Of Computing and Information Systems

Knowledge graph (KG) plays an increasingly important role to improve the recommendation performance and interpretability. A recent technical trend is to design end-to-end models based on information propagation mechanism. However, existing propagationbased methods fail to (1) model the underlying hierarchical structures and relations, and (2) capture the high-order collaborative signals of items for learning high-quality user and item representations. In this paper, we propose a new model, called Hierarchy-Aware Knowledge Gated Network (HAKG), to tackle the aforementioned problems. Technically, we model users and items (that are captured by a user-item graph), as well as entities and relations (that are captured …

Go to article

Proceedings Of The 13th International Workshop On Graph Computation Models (Gcm 2022), Reiko Heckel, Christopher M. Poskitt Jul 2022

Proceedings Of The 13th International Workshop On Graph Computation Models (Gcm 2022), Reiko Heckel, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

This volume contains the proceedings of the Thirteenth International Workshop on Graph Computation Models (GCM 2022) , which was held in Nantes, France on 6th July 2022 as part of the STAF federation of conferences. Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering, and beyond, including computer science, biology, and business process modelling. Graph computation models constitute a class of very high-level models where graphs are first-class citizens. The aim of the International GCM Workshop series is to bring together researchers interested in all aspects …

Go to article

Xss For The Masses: Integrating Security In A Web Programming Course Using A Security Scanner, Lwin Khin Shar, Christopher M. Poskitt, Kyong Jin Shim, Li Ying Leonard Wong Jul 2022

Xss For The Masses: Integrating Security In A Web Programming Course Using A Security Scanner, Lwin Khin Shar, Christopher M. Poskitt, Kyong Jin Shim, Li Ying Leonard Wong

Research Collection School Of Computing and Information Systems

Cybersecurity education is considered an important part of undergraduate computing curricula, but many institutions teach it only in dedicated courses or tracks. This optionality risks students graduating with limited exposure to secure coding practices that are expected in industry. An alternative approach is to integrate cybersecurity concepts across non-security courses, so as to expose students to the interplay between security and other sub-areas of computing. In this paper, we report on our experience of applying the security integration approach to an undergraduate web programming course. In particular, we added a practical introduction to secure coding, which highlighted the OWASP Top …

Go to article

Npc: Neuron Path Coverage Via Characterizing Decision Logic Of Deep Neural Networks, Xiaofei Xie, Tianlin Li, Jian Wang, Lei Ma, Qing Guo, Felix Juefei-Xu, Yang Liu Jul 2022

Npc: Neuron Path Coverage Via Characterizing Decision Logic Of Deep Neural Networks, Xiaofei Xie, Tianlin Li, Jian Wang, Lei Ma, Qing Guo, Felix Juefei-Xu, Yang Liu

Research Collection School Of Computing and Information Systems

Deep learning has recently been widely applied to many applications across different domains, e.g., image classification and audio recognition. However, the quality of Deep Neural Networks (DNNs) still raises concerns in the practical operational environment, which calls for systematic testing, especially in safety-critical scenarios. Inspired by software testing, a number of structural coverage criteria are designed and proposed to measure the test adequacy of DNNs. However, due to the blackbox nature of DNN, the existing structural coverage criteria are difficult to interpret, making it hard to understand the underlying principles of these criteria. The relationship between the structural coverage and …

Go to article

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu Jul 2022

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu

Research Collection School Of Computing and Information Systems

Hitherto statistical type inference systems rely thoroughly on supervised learning approaches, which require laborious manual effort to collect and label large amounts of data. Most Turing-complete imperative languages share similar control- and data-flow structures, which make it possible to transfer knowledge learned from one language to another. In this paper, we propose a cross-lingual transfer learning framework, Plato, for statistical type inference, which allows us to leverage prior knowledge learned from the labeled dataset of one language and transfer it to the others, e.g., Python to JavaScript, Java to JavaScript, etc. Plato is powered by a novel kernelized attention mechanism …

Go to article

Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan Jul 2022

Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan

Research Collection School Of Computing and Information Systems

Software bug database and benchmark are the wheels of advancing automated software testing. In practice, real bugs often occur sparsely relative to the amount of software code, the extraction and curation of which are quite labor-intensive but can be essential to facilitate the innovation of testing techniques. Over the past decade, several milestones have been made to construct bug databases, pushing the progress of automated software testing research. However, up to the present, it still lacks a real bug database and benchmark for game software, making current game testing research mostly stagnant. The missing of bug database and framework greatly …

Go to article

Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua Jul 2022

Structured And Natural Responses Co-Generation For Conversational Search, Chenchen Ye, Lizi Liao, Fuli Feng, Wei Ji, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Generating fluent and informative natural responses while maintaining representative internal states for search optimization is critical for conversational search systems. Existing approaches either 1) predict structured dialog acts first and then generate natural response; or 2) map conversation context to natural responses directly in an end-to-end manner. Both kinds of approaches have shortcomings. The former suffers from error accumulation while the semantic associations between structured acts and natural responses are confined in single direction. The latter emphasizes generating natural responses but fails to predict structured acts. Therefore, we propose a neural co-generation model that generates the two concurrently. The key …

Go to article

What Makes The Story Forward?: Inferring Commonsense Explanations As Prompts For Future Event Generation, Li Lin, Yixin Cao, Lifu Huang, Shu Ang Li, Xuming Hu, Lijie Wen, Jianmin Wang Jul 2022

What Makes The Story Forward?: Inferring Commonsense Explanations As Prompts For Future Event Generation, Li Lin, Yixin Cao, Lifu Huang, Shu Ang Li, Xuming Hu, Lijie Wen, Jianmin Wang

Research Collection School Of Computing and Information Systems

Prediction over event sequences is critical for many real-world applications in Information Retrieval and Natural Language Processing. Future Event Generation (FEG) is a challenging task in event sequence prediction because it requires not only fluent text generation but also commonsense reasoning to maintain the logical coherence of the entire event story. In this paper, we propose a novel explainable FEG framework, Coep. It highlights and integrates two types of event knowledge, sequential knowledge of direct event-event relations and inferential knowledge that reflects the intermediate character psychology between events, such as intents, causes, reactions, which intrinsically pushes the story forward. To …

Go to article

On Measuring Network Robustness For Weighted Networks, Jianbing Zheng, Ming Gao, Ee-Peng Lim, David Lo, Cheqing Jin, Aoying Zhou Jul 2022

On Measuring Network Robustness For Weighted Networks, Jianbing Zheng, Ming Gao, Ee-Peng Lim, David Lo, Cheqing Jin, Aoying Zhou

Research Collection School Of Computing and Information Systems

Network robustness measures how well network structure is strong and healthy when it is under attack, such as vertices joining and leaving. It has been widely used in many applications, such as information diffusion, disease transmission, and network security. However, existing metrics, including node connectivity, edge connectivity, and graph expansion, can be suboptimal for measuring network robustness since they are inefficient to be computed and cannot directly apply to the weighted networks or disconnected networks. In this paper, we define the RR-energy as a new robustness measurement for weighted networks based on the method of spectral analysis. RR-energy can cope …

Go to article

Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim Jul 2022

Harnessing Confidence For Report Aggregation In Crowdsourcing Environments, Hadeel Alhosaini, Xianzhi Wang, Lina Yao, Zhong Yang, Farookh Hussain, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Crowdsourcing is an effective means of accomplishing human intelligence tasks by leveraging the collective wisdom of crowds. Given reports of various accuracy degrees from workers, it is important to make wise use of these reports to derive accurate task results. Intuitively, a task result derived from a sufficient number of reports bears lower uncertainty, and higher uncertainty otherwise. Existing report aggregation research, however, has largely neglected the above uncertainty issue. In this regard, we propose a novel report aggregation framework that defines and incorporates a new confidence measure to quantify the uncertainty associated with tasks and workers, thereby enhancing result …

Go to article

Early Rumor Detection Using Neural Hawkes Process With A New Benchmark Dataset, Fengzhu Zeng, Wei Gao Jul 2022

Early Rumor Detection Using Neural Hawkes Process With A New Benchmark Dataset, Fengzhu Zeng, Wei Gao

Research Collection School Of Computing and Information Systems

Little attention has been paid on EArly Rumor Detection (EARD), and EARD performance was evaluated inappropriately on a few datasets where the actual early-stage information is largely missing. To reverse such situation, we construct BEARD, a new Benchmark dataset for EARD, based on claims from fact-checking websites by trying to gather as many early relevant posts as possible. We also propose HEARD, a novel model based on neural Hawkes process for EARD, which can guide a generic rumor detection model to make timely, accurate and stable predictions. Experiments show that HEARD achieves effective EARD performance on two commonly used general …

Go to article

Dynamic Topic Models For Temporal Document Networks, Ce Zhang, Hady Wirawan Lauw Jul 2022

Dynamic Topic Models For Temporal Document Networks, Ce Zhang, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Dynamic topic models explore the time evolution of topics in temporally accumulative corpora. While existing topic models focus on the dynamics of individual documents, we propose two neural topic models aimed at learning unified topic distributions that incorporate both document dynamics and network structure. For the first model, by adding a time dimension, we propose Time-Aware Optimal Transport, which measures the probability of a link between two differently timestamped documents using their semantic distance. Since the gradually evolving topological structure of network may also influence the establishment of a new link, for the second model, we further design a Temporal …

Go to article

Cosm2ic: Optimizing Real-Time Multi-Modal Instruction Comprehension, Weerakoon Mudiyanselage Dulanga Kaveesha Weerakoon, Vigneshwaran Subbaraju, Minh Anh Tuan Tran, Archan Misra Jul 2022

Cosm2ic: Optimizing Real-Time Multi-Modal Instruction Comprehension, Weerakoon Mudiyanselage Dulanga Kaveesha Weerakoon, Vigneshwaran Subbaraju, Minh Anh Tuan Tran, Archan Misra

Research Collection School Of Computing and Information Systems

Supporting real-time, on-device execution of multi-modal referring instruction comprehension models is an important challenge to be tackled in embodied Human-Robot Interaction. However, state-of-the-art deep learning models are resource-intensive and unsuitable for real-time execution on embedded devices. While model compression can achieve a reduction in computational resources up to a certain point, further optimizations result in a severe drop in accuracy. To minimize this loss in accuracy, we propose the COSM2IC framework, with a lightweight Task Complexity Predictor, that uses multiple sensor inputs to assess the instructional complexity and thereby dynamically switch between a set of models of varying computational intensity …

Go to article

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau Jul 2022

Enhancing A Qubo Solver Via Data Driven Multi-Start And Its Application To Vehicle Routing Problem, Whei Yeap Suen, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Quadratic unconstrained binary optimization (QUBO) models have garnered growing interests as a strong alternative modelling framework for solving combinatorial optimization problems. A wide variety of optimization problems that are usually studied using conventional Operations Research approaches can be formulated as QUBO problems. However, QUBO solvers do not guarantee optimality when solving optimization problems. Instead, obtaining high quality solutions using QUBO solvers entails tuning of multiple parameters. Here in our work, we conjecture that the initial states adjustment method used in QUBO solvers can be improved, where careful tuning will yield overall better results. We propose a data-driven multi-start algorithm that …

Go to article

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo Jul 2022

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo

Research Collection School Of Computing and Information Systems

Modern software engineering projects often depend on open-source software libraries, rendering them vulnerable to potential security issues in these libraries. Developers of client projects have to stay alert of security threats in the software dependencies. While there are existing tools that allow developers to assess if a library vulnerability is reachable from a project, they face limitations. Call graphonly approaches may produce false alarms as the client project may not use the vulnerable code in a way that triggers the vulnerability, while test generation-based approaches faces difficulties in overcoming the intrinsic complexity of exploiting a vulnerability, where extensive domain knowledge …

Go to article

A Recommendation System Approach To Tune A Qubo Solver, Siong Thye Goh, Jianyuan Bo, Matthieu Parizy, Hoong Chuin Lau Jul 2022

A Recommendation System Approach To Tune A Qubo Solver, Siong Thye Goh, Jianyuan Bo, Matthieu Parizy, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

There are two major challenges to solving constrained optimization problems using a QuadraticUnconstrained Binary Optimization or QUBO solver (QS). First, we need to tune both the underlyingproblem parameters and the algorithm parameters. Second, the solution returned from a QSmight not be feasible. While it is common to use automated tuners such as SMAC and Hyperopt totune the algorithm parameters, the initial search ranges input for the auto tuner affect the performanceof the QS. In this paper, we propose a framework that resembles the Algorithm Selection(AS) framework to tune algorithm parameters for an annealing-based QS. To cope with constraints,we focus on …

Go to article

A Mean-Field Markov Decision Process Model For Spatial Temporal Subsidies In Ride-Sourcing Markets, Zheng Zhu, Jintao Ke, Hai Wang Jul 2022

A Mean-Field Markov Decision Process Model For Spatial Temporal Subsidies In Ride-Sourcing Markets, Zheng Zhu, Jintao Ke, Hai Wang

Research Collection School Of Computing and Information Systems

Ride-sourcing services are increasingly popular because of their ability to accommodate on-demand travel needs. A critical issue faced by ride-sourcing platforms is the supply-demand imbalance, as a result of which drivers may spend substantial time on idle cruising and picking up remote passengers. Some platforms attempt to mitigate the imbalance by providing relocation guidance for idle drivers who may have their own self-relocation strategies and decline to follow the suggestions. Platforms then seek to induce drivers to system-desirable locations by offering them subsidies. This paper proposes a mean-field Markov decision process (MF-MDP) model to depict the dynamics in ride-sourcing markets …

Go to article

3pc: Three Point Compressors For Communication-Efficient Distributed Training And A Better Theory For Lazy Aggregation, Peter Richtarik, Igor Sokolov, Ilyas Fatkhullin, Elnur Gasanov, Zhize Li, Eduard Gorbunov Jul 2022

3pc: Three Point Compressors For Communication-Efficient Distributed Training And A Better Theory For Lazy Aggregation, Peter Richtarik, Igor Sokolov, Ilyas Fatkhullin, Elnur Gasanov, Zhize Li, Eduard Gorbunov

Research Collection School Of Computing and Information Systems

We propose and study a new class of gradient communication mechanisms for communication-efficient training -- three point compressors (3PC) -- as well as efficient distributed nonconvex optimization algorithms that can take advantage of them. Unlike most established approaches, which rely on a static compressor choice (e.g., Top-$K$), our class allows the compressors to {\em evolve} throughout the training process, with the aim of improving the theoretical communication complexity and practical efficiency of the underlying methods. We show that our general approach can recover the recently proposed state-of-the-art error feedback mechanism EF21 (Richt\'arik et al., 2021) and its theoretical properties as …

Go to article

Prototypical Graph Contrastive Learning, Shuai Lin, Chen Liu, Pan Zhou, Zi-Yuan Hu, Shuojia Wang, Ruihui Zhao, Yefeng Zheng, Liang Lin, Eric Xing, Xiaodan Liang Jul 2022

Prototypical Graph Contrastive Learning, Shuai Lin, Chen Liu, Pan Zhou, Zi-Yuan Hu, Shuojia Wang, Ruihui Zhao, Yefeng Zheng, Liang Lin, Eric Xing, Xiaodan Liang

Research Collection School Of Computing and Information Systems

Graph-level representations are critical in various real-world applications, such as predicting the properties of molecules. But in practice, precise graph annotations are generally very expensive and time-consuming. To address this issue, graph contrastive learning constructs instance discrimination task which pulls together positive pairs (augmentation pairs of the same graph) and pushes away negative pairs (augmentation pairs of different graphs) for unsupervised representation learning. However, since for a query, its negatives are uniformly sampled from all graphs, existing methods suffer from the critical sampling bias issue, i.e., the negatives likely having the same semantic structure with the query, leading to performance …

Go to article

Legal And Regulatory Issues On Artificial Intelligence, Machine Learning, Data Science, And Big Data, Wai Yee Wan, Michael Tsimplis, Keng Siau, Wei T. Yue, Fiona Fui-Hoon Nah, Gabriel M. Yu Jul 2022

Legal And Regulatory Issues On Artificial Intelligence, Machine Learning, Data Science, And Big Data, Wai Yee Wan, Michael Tsimplis, Keng Siau, Wei T. Yue, Fiona Fui-Hoon Nah, Gabriel M. Yu

Research Collection School Of Computing and Information Systems

Technological innovation creates numerous opportunities for businesses, organizations, and societies. Artificial intelligence, machine learning, data science, and big data provide opportunities for developing self-controlling systems emulating human intelligence. In some instances, these systems surpass the performance of humans. The relationship of innovative technology with the law is an important underpinning factor that is often overlooked. Law may encourage innovation but may also inhibit its development and application by adopting stringent regulatory provisions and liability regimes. This article examines the legal and regulatory issues related to new technologies such as artificial intelligence, machine learning, data science, and big data.

Go to article

Identifying Legal And Ethical Values In Ai, Keng Siau, Fiona Nah, Chunyan Ding, Fiona Fui-Hoon Nah Jul 2022

Identifying Legal And Ethical Values In Ai, Keng Siau, Fiona Nah, Chunyan Ding, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Artificial intelligence (AI) applications in health care, education, finance, mining, communications, and arts have brought about rapid and dramatic advances in these fields (Hyder et al., 2019). The rapidly expanding potential of AI in the economy and society has raised a set of legal and ethical issues (Wang and Siau, 2019; Siau and Wang, 2020). In-depth research into the ethical and legal aspects of AI to enable policymakers to introduce effective legislation and regulate AI development and applications is needed. This research uses a systematic qualitative research methodology, Value-Focused Thinking (VFT) (Keeney, 1996; Sheng et al., 2007), to identify the …

Go to article

Smart Property Valuation. Problem Solving For Industry, David Silva, Luiz Augusto Dias, Raul M. Fuzita Jul 2022

Smart Property Valuation. Problem Solving For Industry, David Silva, Luiz Augusto Dias, Raul M. Fuzita

ICT

The analysis of this project it is used the CRISP-DM method. Smart Property Valuation (SPV) is a fictional company created by David Silva, Luiz Dias, and Raul Fuzita to analyse, explore, and prove the conception of a model capable of predicting or estimating prices for properties. They believe they can benefit common people, realtors, and construction companies with their solutions. This research is for educational purposes and should be treated as such.

Go to article

Actor-Critic Reinforcement Learning For Bidding In Bilateral Negotiation, Furkan Arslan, Reyhan Aydoğan Jul 2022

Actor-Critic Reinforcement Learning For Bidding In Bilateral Negotiation, Furkan Arslan, Reyhan Aydoğan

Turkish Journal of Electrical Engineering and Computer Sciences

Designing an effective and intelligent bidding strategy is one of the most compelling research challenges in automated negotiation, where software agents negotiate with each other to find a mutual agreement when there is a conflict of interests. Instead of designing a hand-crafted decision-making module, this work proposes a novel bidding strategy adopting an actor-critic reinforcement learning approach, which learns what to offer in a bilateral negotiation. An entropy reinforcement learning framework called Soft Actor-Critic (SAC) is applied to the bidding problem, and a self-play approach is employed to train the model. Our model learns to produce the target utility of …

Go to article

On The Performance Analysis Of Flexible Pairing Between Uav And Gu In Noma, Man Hee Lee, Soo Young Shin Jul 2022

On The Performance Analysis Of Flexible Pairing Between Uav And Gu In Noma, Man Hee Lee, Soo Young Shin

Turkish Journal of Electrical Engineering and Computer Sciences

The wireless communications regarding unmanned aerial vehicles (UAVs) have been investigated for the usage of base stations (BS) to provide Internet access. This paper presents the usage of a UAV as a pairing user to enhance the sum capacity by flexible pairing in nonorthogonal multiple access (NOMA). In the proposed scheme, the UAVs and the ground users (GUs) get paired to promote the line-of-sight (LoS) characteristics. The performance of flexible pairing is presented in terms of sum capacity, outage probability, and throughput with the LoS path loss. Channel modeling is necessary to apply flexible pairing by utilizing the LoS characteristic …

Go to article

Content Loss And Conditional Space Relationship In Conditional Generative Adversarial Networks, Enes Eken Jul 2022

Content Loss And Conditional Space Relationship In Conditional Generative Adversarial Networks, Enes Eken

Turkish Journal of Electrical Engineering and Computer Sciences

In the machine learning community, generative models, especially generative adversarial networks (GANs) continue to be an attractive yet challenging research topic. Right after the invention of GAN, many GAN models have been proposed by the researchers with the same goal: creating better images. The first and foremost feature that a GAN model should have is that creating realistic images that cannot be distinguished from genuine ones. A large portion of the GAN models proposed to this end have a common approach which can be defined as factoring the image generation process into multiple states for decomposing the difficult task into …

Go to article

Using A Static Naming Approach To Implement Remote Scope Promotion, Ayşe Yilmazer Jul 2022

Using A Static Naming Approach To Implement Remote Scope Promotion, Ayşe Yilmazer

Turkish Journal of Electrical Engineering and Computer Sciences

GPUs employ simple coherence mechanisms and require explicit use of costly synchronization operations for data integrity. Local-scoped synchronization can be utilized to lower the performance penalty of synchronization when sharing is within a subgroup of threads. Unfortunately, in asymmetric sharing (which is an important dynamic sharing pattern), it is necessary to use global-scoped synchronization due to possible accesses by remote sharers. Remote Scope Promotion (RSP) was introduced to take advantage of local-scoped synchronization at regular accesses while using scope promotion at occasional remote accesses. First implementation of RSP makes use of a simple approach that performs costly cache operations on …

Go to article

Development Of A Hybrid System Based On Abc Algorithm For Selection Of Appropriate Parameters For Disease Diagnosis From Ecg Signals, Ersi̇n Ersoy, Gazi̇ Erkan Bostanci, Mehmet Serdar Güzel Jul 2022

Development Of A Hybrid System Based On Abc Algorithm For Selection Of Appropriate Parameters For Disease Diagnosis From Ecg Signals, Ersi̇n Ersoy, Gazi̇ Erkan Bostanci, Mehmet Serdar Güzel

Turkish Journal of Electrical Engineering and Computer Sciences

The number of people who die due to cardiovascular diseases is quite high. In our study, ECG (electrocar-diogram) signals were divided into segments and waves based on temporal boundaries. Signal similarity methods such as convolution, correlation, covariance, signal peak to noise ratio (PNRS), structural similarity index (SSIM), one of the basic statistical parameters, arithmetic mean and entropy were applied to each of these sections. In addition, a square error-based new approach was applied and the difference of the signs from the mean sign was taken and used as a feature vector. The obtained feature vectors are used in the artificial …

Go to article

Automatic Keyword Assignment System For Medical Research Articles Using Nearest-Neighbor Searches, Fati̇h Di̇lmaç, Adi̇l Alpkoçak Jul 2022

Automatic Keyword Assignment System For Medical Research Articles Using Nearest-Neighbor Searches, Fati̇h Di̇lmaç, Adi̇l Alpkoçak

Turkish Journal of Electrical Engineering and Computer Sciences

Assigning accurate keywords to research articles is increasingly important concern. Keywords should be selected meticulously to describe the article well since keywords play an important role in matching readers with research articles in order to reach a bigger audience. So, improper selection of keywords may result in less attraction to readers which results in degradation in its audience. Hence, we designed and developed an automatic keyword assignment system (AKAS) for research articles based on k-nearest neighbor (k-NN) and threshold-nearest neighbor (t-NN) accompanied with information retrieval systems (IRS), which is a corpus-based method by utilizing IRS using the Medline dataset in …

Go to article

First Prev Next Last