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

Physical Sciences and Mathematics Commons™

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

Theory and Algorithms

PDF

Series

2021

Institution
Keyword
Publication

Articles 31 - 60 of 67

Full-Text Articles in Physical Sciences and Mathematics

Mmconv: An Environment For Multimodal Conversational Search Across Multiple Domains, Lizi Liao, Le Hong Long, Zheng Zhang, Minlie Huang, Tat-Seng Chua Jul 2021

Mmconv: An Environment For Multimodal Conversational Search Across Multiple Domains, Lizi Liao, Le Hong Long, Zheng Zhang, Minlie Huang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Although conversational search has become a hot topic in both dialogue research and IR community, the real breakthrough has been limited by the scale and quality of datasets available. To address this fundamental obstacle, we introduce the Multimodal Multi-domain Conversational dataset (MMConv), a fully annotated collection of human-to-human role-playing dialogues spanning over multiple domains and tasks. The contribution is two-fold. First, beyond the task-oriented multimodal dialogues among user and agent pairs, dialogues are fully annotated with dialogue belief states and dialogue acts. More importantly, we create a relatively comprehensive environment for conducting multimodal conversational search with real user settings, structured …

Go to article

The Multi-Vehicle Cycle Inventory Routing Problem: Formulation And A Metaheuristic Approach, Vincent F. Yu, Audrey Tedja Widjaja, Aldy Gunawan, Pieter Vansteenwegen Jul 2021

The Multi-Vehicle Cycle Inventory Routing Problem: Formulation And A Metaheuristic Approach, Vincent F. Yu, Audrey Tedja Widjaja, Aldy Gunawan, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

This paper presents a new variant of the Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) which aims to determine a subset of customers to be visited, the appropriate number of vehicles used, and the corresponding cycle time and route sequence, such that the total cost (e.g. transportation, inventory, and rewards) is minimized. The MV-CIRP is formulated as a mixed-integer nonlinear programming model. We propose a Simulated Annealing (SA) based algorithm to solve the problem. SA is first tested on the available benchmark Single-Vehicle CIRP (SV-CIRP) instances and compared to the state-of-the-art algorithms. SA is then tested on the benchmark MV-CIRP instances …

Go to article

Rotating Scatter Mask For Directional Radiation Detection And Imaging, Darren Holland, Robert Olesen, Larry Burggraf, Buckley O'Day, James E. Bevins Jun 2021

Rotating Scatter Mask For Directional Radiation Detection And Imaging, Darren Holland, Robert Olesen, Larry Burggraf, Buckley O'Day, James E. Bevins

AFIT Patents

A radiation imaging system images a distributed source of radiation from an unknown direction by rotating a scatter mask around a central axis. The scatter mask has a pixelated outer surface of tangentially oriented, flat geometric surfaces that are spherically varying in radial dimension that corresponds to a discrete amount of attenuation. Rotation position of the scatter mask is tracked as a function of time. Radiation counts from gamma and/or neutron radiation are received from at least one radiation detector that is positioned at or near the central axis. A rotation-angle dependent detector response curve (DRC) is generated based on …

Go to article

The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares Jun 2021

The “Knapsack Problem” Workbook: An Exploration Of Topics In Computer Science, Steven Cosares

Open Educational Resources

This workbook provides discussions, programming assignments, projects, and class exercises revolving around the “Knapsack Problem” (KP), which is widely a recognized model that is taught within a typical Computer Science curriculum. Throughout these discussions, we use KP to introduce or review topics found in courses covering topics in Discrete Mathematics, Mathematical Programming, Data Structures, Algorithms, Computational Complexity, etc. Because of the broad range of subjects discussed, this workbook and the accompanying spreadsheet files might be used as part of some CS capstone experience. Otherwise, we recommend that individual sections be used, as needed, for exercises relevant to a course in …

Go to article

First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro Jun 2021

First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro

Research Collection School Of Computing and Information Systems

Subway system is the main mode of transportation for city dwellers and is a quite signif-icant backbone to a city's operations. One of the challenges of subway network operation is the scheduling of the first trains each morning and its impact on transfers. To deal with this challenge, some cities (e.g. Beijing) use bus 'bridging' services, temporarily substitut -ing segments of the subway network. The present paper optimally identifies when to start each train and bus bridging service in an intermodal transit network. Starting from a mixed integer nonlinear programming model for the first train timetabling problem, we linearize and …

Go to article

Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan Jun 2021

Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan

Research Collection School Of Computing and Information Systems

This research introduces an extension of the Orienteering Problem (OP), known as Set Team Orienteering Problem with Time Windows (STOPTW), in which customers are first grouped into clusters. Each cluster is associated with a profit that will be collected if at least one customer within the cluster is visited. The objective is to find the best route that maximizes the total collected profit without violating time windows and time budget constraints. We propose an adaptive large neighborhood search algorithm to solve newly introduced benchmark instances. The preliminary results show the capability of the proposed algorithm to obtain good solutions within …

Go to article

Self-Adaptive Graph Traversal On Gpus, Mo Sha, Yuchen Li, Kian-Lee Tan Jun 2021

Self-Adaptive Graph Traversal On Gpus, Mo Sha, Yuchen Li, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

GPU’s massive computing power offers unprecedented opportunities to enable large graph analysis. Existing studies proposed various preprocessing approaches that convert the input graphs into dedicated structures for GPU-based optimizations. However, these dedicated approaches incur significant preprocessing costs as well as weak programmability to build general graph applications. In this paper, we introduce SAGE, a self-adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph representations directly. We propose Tiled Partitioning and Resident Tile Stealing to fully exploit the computing power of GPUs in a runtime and self-adaptive manner. We also propose Sampling-based Reordering to further …

Go to article

The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall May 2021

The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall

University Scholar Projects

The Riemann Hypothesis, posed in 1859 by Bernhard Riemann, is about zeros
of the Riemann zeta-function in the complex plane. The zeta-function can be repre-
sented as a sum over positive integers n of terms 1/ns when s is a complex number
with real part greater than 1. It may also be represented in this region as a prod-
uct over the primes called an Euler product. These definitions of the zeta-function
allow us to find other representations that are valid in more of the complex plane,
including a product representation over its zeros. The Riemann Hypothesis says that
all …

Go to article

A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu May 2021

A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu

Research Collection School Of Computing and Information Systems

This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic based on column generation is proposed. The first phase focuses on generating a set of feasible candidate routes in both pickup and delivery processes by implementing an adaptive large neighborhood search algorithm. A set of destroy and repair operators are …

Go to article

Cross-Modal Food Retrieval: Learning A Joint Embedding Of Food Images And Recipes With Semantic Consistency And Attention Mechanism;, Hao Wang, Doyen Sahoo, Chenghao Liu, Ke Shu, Achananuparp Palakorn, Ee Peng Lim, Steven Hoi May 2021

Cross-Modal Food Retrieval: Learning A Joint Embedding Of Food Images And Recipes With Semantic Consistency And Attention Mechanism;, Hao Wang, Doyen Sahoo, Chenghao Liu, Ke Shu, Achananuparp Palakorn, Ee Peng Lim, Steven Hoi

Research Collection School Of Computing and Information Systems

Food retrieval is an important task to perform analysis of food-related information, where we are interested in retrieving relevant information about the queried food item such as ingredients, cooking instructions, etc. In this paper, we investigate cross-modal retrieval between food images and cooking recipes. The goal is to learn an embedding of images and recipes in a common feature space, such that the corresponding image-recipe embeddings lie close to one another. Two major challenges in addressing this problem are 1) large intra-variance and small inter-variance across cross-modal food data; and 2) difficulties in obtaining discriminative recipe representations. To address these …

Go to article

Action Selection For Composable Modular Deep Reinforcement Learning, Vaibhav Gupta, Daksh Anand, Praveen Parachuri, Akshat Kumar May 2021

Action Selection For Composable Modular Deep Reinforcement Learning, Vaibhav Gupta, Daksh Anand, Praveen Parachuri, Akshat Kumar

Research Collection School Of Computing and Information Systems

In modular reinforcement learning (MRL), a complex decision making problem is decomposed into multiple simpler subproblems each solved by a separate module. Often, these subproblems have conflicting goals, and incomparable reward scales. A composable decision making architecture requires that even the modules authored separately with possibly misaligned reward scales can be combined coherently. An arbitrator should consider different module’s action preferences to learn effective global action selection. We present a novel framework called GRACIAS that assigns fine-grained importance to the different modules based on their relevance in a given state, and enables composable decision making based on modern deep RL …

Go to article

Implications Of The Quantum Dna Model For Information Sciences, F. Matthew Mihelic Apr 2021

Implications Of The Quantum Dna Model For Information Sciences, F. Matthew Mihelic

Faculty Publications

The DNA molecule can be modeled as a quantum logic processor, and this model has been supported by pilot research that experimentally demonstrated non-local communication between cells in separated cell cultures. This modeling and pilot research have important implications for information sciences, providing a potential architecture for quantum computing that operates at room temperature and is scalable to millions of qubits, and including the potential for an entanglement communication system based upon the quantum DNA architecture. Such a system could be used to provide non-local quantum key distribution that could not be blocked by any shielding or water depth, would …

Go to article

Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang Apr 2021

Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang

Mathematical Sciences Spring Lecture Series

Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …

Go to article

Technological Tethereds: Potential Impact Of Untrustworthy Artificial Intelligence In Criminal Justice Risk Assessment Instruments, Sonia M. Gipson Rankin Apr 2021

Technological Tethereds: Potential Impact Of Untrustworthy Artificial Intelligence In Criminal Justice Risk Assessment Instruments, Sonia M. Gipson Rankin

Faculty Scholarship

Issues of racial inequality and violence are front and center in today’s society, as are issues surrounding artificial intelligence (AI). This Article, written by a law professor who is also a computer scientist, takes a deep dive into understanding how and why hacked and rogue AI creates unlawful and unfair outcomes, particularly for persons of color.

Black Americans are disproportionally featured in criminal justice, and their stories are obfuscated. The seemingly endless back-to-back murders of George Floyd, Breonna Taylor, and Ahmaud Arbery, and heartbreakingly countless others have finally shaken the United States from its slumbering journey towards intentional criminal justice …

Go to article

Urban Perception: Sensing Cities Via A Deep Interactive Multi-Task Learning Framework, Weili Guan, Zhaozheng Chen, Fuli Feng, Weifeng Liu, Liqiang Nie Apr 2021

Urban Perception: Sensing Cities Via A Deep Interactive Multi-Task Learning Framework, Weili Guan, Zhaozheng Chen, Fuli Feng, Weifeng Liu, Liqiang Nie

Research Collection School Of Computing and Information Systems

Social scientists have shown evidence that visual perceptions of urban attributes, such as safe, wealthy, and beautiful perspectives of the given cities, are highly correlated to the residents' behaviors and quality of life. Despite their significance, measuring visual perceptions of urban attributes is challenging due to the following facts: (1) Visual perceptions are subjectively contradistinctive rather than absolute. (2) Perception comparisons between image pairs are usually conducted region by region, and highly related to the specific urban attributes. And (3) the urban attributes have both the shared and specific information. To address these problems, in this article, we present a …

Go to article

A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan Apr 2021

A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The k-regret minimizing set (k-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large database P of tuples with multiple numerical attributes, the k-RMS problem returns a size-r subset Q of P such that, for any possible ranking function, the score of the top-ranked tuple in Q is not much worse than the score of the kth-ranked tuple in P. Although the k-RMS problem has been extensively studied in the literature, existing methods …

Go to article

Quantum Simulation Of Schrödinger's Equation, Mohamed Eltohfa Mar 2021

Quantum Simulation Of Schrödinger's Equation, Mohamed Eltohfa

Capstone and Graduation Projects

Quantum computing is one of the promising active areas in physics research. This is because of the potential of quantum algorithms to outperform their classical counterparts. Grover’s search algorithm has a quadratic speed-up compared to the classical linear search. The quantum simulation of Schrödinger’s equation has an exponential memory save-up compared to the classical simulation. In this thesis, the ideas and tools of quantum computing are reviewed. Grover’s algorithm is studied and simulated as an example. Using the Qiskit quantum computing library, a code to simulate Schrödinger’s equation for a particle in one dimension is developed, simulated locally, and run …

Go to article

Wg2An: Synthetic Wound Image Generation Using Generative Adversarial Network, Salih Sarp, Murat Kuzlu, Emmanuel Wilson, Ozgur Guler Mar 2021

Wg2An: Synthetic Wound Image Generation Using Generative Adversarial Network, Salih Sarp, Murat Kuzlu, Emmanuel Wilson, Ozgur Guler

Engineering Technology Faculty Publications

In part due to its ability to mimic any data distribution, Generative Adversarial Network (GAN) algorithms have been successfully applied to many applications, such as data augmentation, text-to-image translation, image-to-image translation, and image inpainting. Learning from data without crafting loss functions for each application provides broader applicability of the GAN algorithm. Medical image synthesis is also another field that the GAN algorithm has great potential to assist clinician training. This paper proposes a synthetic wound image generation model based on GAN architecture to increase the quality of clinical training. The proposed model is trained on chronic wound datasets with various …

Go to article

Improving Multi-Hop Knowledge Base Question Answering By Learning Intermediate Supervision Signals, Gaole He, Yunshi Lan, Jing Jiang, Wayne Xin Zhao, Ji Rong Wen Mar 2021

Improving Multi-Hop Knowledge Base Question Answering By Learning Intermediate Supervision Signals, Gaole He, Yunshi Lan, Jing Jiang, Wayne Xin Zhao, Ji Rong Wen

Research Collection School Of Computing and Information Systems

Multi-hop Knowledge Base Question Answering (KBQA) aims to find the answer entities that are multiple hops away in the Knowledge Base (KB) from the entities in the question. A major challenge is the lack of supervision signals at intermediate steps. Therefore, multi-hop KBQA algorithms can only receive the feedback from the final answer, which makes the learning unstable or ineffective. To address this challenge, we propose a novel teacher-student approach for the multi-hop KBQA task. In our approach, the student network aims to find the correct answer to the query, while the teacher network tries to learn intermediate supervision signals …

Go to article

An Angle-Based Stochastic Gradient Descent Method For Machine Learning: Principle And Application, Chongya Song Feb 2021

An Angle-Based Stochastic Gradient Descent Method For Machine Learning: Principle And Application, Chongya Song

FIU Electronic Theses and Dissertations

In deep learning, optimization algorithms are employed to expedite the resolution to accurate models through the calibrations of the current gradient and the associated learning rate. A major shortcoming of these existing methods is the manner in which the calibration terms are computed, only utilizing the previous gradients during their computations. Because the gradient is a time-sensitive variable computed at a specific moment in time, it is possible that older gradients can introduce significant deviation into the calibration terms. Although most algorithms alleviate this situation by combining the exponential moving average of the previous gradients, we found that this method …

Go to article

Optimizing Large-Scale Hyperparameters Via Automated Learning Algorithm, Bin Gu, Guodong Liu, Yanfu Zhang, Xiang Geng, Heng Huang Feb 2021

Optimizing Large-Scale Hyperparameters Via Automated Learning Algorithm, Bin Gu, Guodong Liu, Yanfu Zhang, Xiang Geng, Heng Huang

Machine Learning Faculty Publications

Modern machine learning algorithms usually involve tuning multiple (from one to thousands) hyperparameters which play a pivotal role in terms of model generalizability. Black-box optimization and gradient-based algorithms are two dominant approaches to hyperparameter optimization while they have totally distinct advantages. How to design a new hyperparameter optimization technique inheriting all benefits from both approaches is still an open problem. To address this challenging problem, in this paper, we propose a new hyperparameter optimization method with zeroth-order hyper-gradients (HOZOG). Specifically, we first exactly formulate hyperparameter optimization as an A-based constrained optimization problem, where A is a black-box optimization algorithm (such …

Go to article

Unsupervised Data Mining Technique For Clustering Library In Indonesia, Robbi Rahim, Joseph Teguh Santoso, Sri Jumini, Gita Widi Bhawika, Daniel Susilo, Danny Wibowo Feb 2021

Unsupervised Data Mining Technique For Clustering Library In Indonesia, Robbi Rahim, Joseph Teguh Santoso, Sri Jumini, Gita Widi Bhawika, Daniel Susilo, Danny Wibowo

Library Philosophy and Practice (e-journal)

Organizing school libraries not only keeps library materials, but helps students and teachers in completing tasks in the teaching process so that national development goals are in order to improve community welfare by producing quality and competitive human resources. The purpose of this study is to analyze the Unsupervised Learning technique in conducting cluster mapping of the number of libraries at education levels in Indonesia. The data source was obtained from the Ministry of Education and Culture which was processed by the Central Statistics Agency (abbreviated as BPS) with url: bps.go.id/. The data consisted of 34 records where the attribute …

Go to article

Fine-Grained Generalization Analysis Of Vector-Valued Learning, Liang Wu, Antoine Ledent, Yunwen Lei, Marius Kloft Feb 2021

Fine-Grained Generalization Analysis Of Vector-Valued Learning, Liang Wu, Antoine Ledent, Yunwen Lei, Marius Kloft

Research Collection School Of Computing and Information Systems

Many fundamental machine learning tasks can be formulated as a problem of learning with vector-valued functions, where we learn multiple scalar-valued functions together. Although there is some generalization analysis on different specific algorithms under the empirical risk minimization principle, a unifying analysis of vector-valued learning under a regularization framework is still lacking. In this paper, we initiate the generalization analysis of regularized vector-valued learning algorithms by presenting bounds with a mild dependency on the output dimension and a fast rate on the sample size. Our discussions relax the existing assumptions on the restrictive constraint of hypothesis spaces, smoothness of loss …

Go to article

Norm-Based Generalisation Bounds For Deep Multi-Class Convolutional Neural Networks, Antoine Ledent, Waleed Mustafa, Yunwen Lei, Marius Kloft Feb 2021

Norm-Based Generalisation Bounds For Deep Multi-Class Convolutional Neural Networks, Antoine Ledent, Waleed Mustafa, Yunwen Lei, Marius Kloft

Research Collection School Of Computing and Information Systems

We show generalisation error bounds for deep learning with two main improvements over the state of the art. (1) Our bounds have no explicit dependence on the number of classes except for logarithmic factors. This holds even when formulating the bounds in terms of the Frobenius-norm of the weight matrices, where previous bounds exhibit at least a squareroot dependence on the number of classes. (2) We adapt the classic Rademacher analysis of DNNs to incorporate weight sharing—a task of fundamental theoretical importance which was previously attempted only under very restrictive assumptions. In our results, each convolutional filter contributes only once …

Go to article

Divide And Capture: An Improved Cryptanalysis Of The Encryption Standard Algorithm Rsa, Willy Susilo, Joseph Tonien, Guomin Yang Feb 2021

Divide And Capture: An Improved Cryptanalysis Of The Encryption Standard Algorithm Rsa, Willy Susilo, Joseph Tonien, Guomin Yang

Research Collection School Of Computing and Information Systems

RSA is a well known standard algorithm used by modern computers to encrypt and decrypt messages. In some applications, to save the decryption time, it is desirable to have a short secret key d compared to the modulus N. The first significant attack that breaks RSA with short secret key given by Wiener in 1990 is based on the continued fraction technique and it works with d < 1/4 root 18 N-.(25). A decade later, in 2000, Boneh and Durfee presented an improved attack based on lattice technique which works with d < N-.(292). Until this day, Boneh-Durfee attack remain as the best attack on RSA with short secret key. In this paper, we revisit the continued fraction technique and propose a new attack on RSA. Our main result shows that when d < root t (2 root 2 + 8/3) N-.(75)/root e, where e is the public exponent and t is a chosen parameter, our attack can break the RSA with the running time of O(tlog (N)). Our attack is especially well suited for the case where e is much smaller than N. When e approximate to N, the Boneh-Durfee attack outperforms ours. As a result, we could simultaneously run both attacks, our new attack and the classical Boneh-Durfee attack as a backup.

Go to article

Mimoa: A Membrane-Inspired Multi-Objective Algorithm For Green Vehicle Routing Problem With Stochastic Demands, Yunyun Niu, Yongpeng Zhang, Zhiguang Cao, Kaizhou Gao, Jianhua Xiao, Wen Song, Fangwei Zhang Feb 2021

Mimoa: A Membrane-Inspired Multi-Objective Algorithm For Green Vehicle Routing Problem With Stochastic Demands, Yunyun Niu, Yongpeng Zhang, Zhiguang Cao, Kaizhou Gao, Jianhua Xiao, Wen Song, Fangwei Zhang

Research Collection School Of Computing and Information Systems

Nowadays, an increasing number of vehicle routing problem with stochastic demands (VRPSD) models have been studied to meet realistic needs in the field of logistics. In this paper, a bi-objective vehicle routing problem with stochastic demands (BO-VRPSD) was investigated, which aims to minimize total cost and customer dissatisfaction. Different from traditional vehicle routing problem (VRP) models, both the uncertainty in customer demands and the nature of multiple objectives make the problem more challenging. To cope with BO-VRPSD, a membrane-inspired multi-objective algorithm (MIMOA) was proposed, which is characterized by a parallel distributed framework with two operation subsystems and one control subsystem, …

Go to article

Visual Analysis Of Discrimination In Machine Learning, Qianwen Wang, Zhenghua Xu, Zhutian Chen, Yong Wang, Shixia Liu, Huamin Qu Feb 2021

Visual Analysis Of Discrimination In Machine Learning, Qianwen Wang, Zhenghua Xu, Zhutian Chen, Yong Wang, Shixia Liu, Huamin Qu

Research Collection School Of Computing and Information Systems

The growing use of automated decision-making in critical applications, such as crime prediction and college admission, has raised questions about fairness in machine learning. How can we decide whether different treatments are reasonable or discriminatory? In this paper, we investigate discrimination in machine learning from a visual analytics perspective and propose an interactive visualization tool, DiscriLens, to support a more comprehensive analysis. To reveal detailed information on algorithmic discrimination, DiscriLens identifies a collection of potentially discriminatory itemsets based on causal modeling and classification rules mining. By combining an extended Euler diagram with a matrix-based visualization, we develop a novel set …

Go to article

Reduced Multiplicative Complexity Discrete Cosine Transform (Dct) Circuitry, Sirani Kanchana Mututhanthrige Perera Jan 2021

Reduced Multiplicative Complexity Discrete Cosine Transform (Dct) Circuitry, Sirani Kanchana Mututhanthrige Perera

Publications

System and techniques for reduced multiplicative complex­ity discrete cosine transform (DCT) circuitry are described herein. An input data set can be received and, upon the input data set, a self-recursive DCT technique can be performed to produce a transformed data set. Here, the self-recursive DCT technique is based on a product of factors of a specified type of DCT technique. Recursive components of the technique are of the same DCT type as that of the DCT technique. The transformed data set can then be produced to a data con­sumer.

Go to article

Hybrid Models As Transdisciplinary Research Enablers, Andreas Tolk, Alison Harper, Navonil Mustafee Jan 2021

Hybrid Models As Transdisciplinary Research Enablers, Andreas Tolk, Alison Harper, Navonil Mustafee

Computational Modeling & Simulation Engineering Faculty Publications

Modelling and simulation (M&S) techniques are frequently used in Operations Research (OR) to aid decision-making. With growing complexity of systems to be modelled, an increasing number of studies now apply multiple M&S techniques or hybrid simulation (HS) to represent the underlying system of interest. A parallel but related theme of research is extending the HS approach to include the development of hybrid models (HM). HM extends the M&S discipline by combining theories, methods and tools from across disciplines and applying multidisciplinary, interdisciplinary and transdisciplinary solutions to practice. In the broader OR literature, there are numerous examples of cross-disciplinary approaches in …

Go to article

Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration Jan 2021

Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration

Computer Science Faculty Publications

Assessing the credibility of research claims is a central, continuous, and laborious part of the scientific process. Credibility assessment strategies range from expert judgment to aggregating existing evidence to systematic replication efforts. Such assessments can require substantial time and effort. Research progress could be accelerated if there were rapid, scalable, accurate credibility indicators to guide attention and resource allocation for further assessment. The SCORE program is creating and validating algorithms to provide confidence scores for research claims at scale. To investigate the viability of scalable tools, teams are creating: a database of claims from papers in the social and behavioral …

Go to article

First Prev Next Last