Department of Computer Science

Permanent URI for this communityhttps://hdl.handle.net/10294/3192

The Department of Computer Science offers programs of study related to computing, information technology and software design and application. Our programs involve interdepartmental, multi-institutional and inter-institutional collaboration and have attracted faculty members, undergraduate and graduate students from all over the world. Students may pursue full-time or part-time study leading to a Certificate in Computer Science or to B.Sc., M.Sc., or Ph.D. degrees.

Browse

Now showing 1 - 15 of 15

Open Access
An Approach of Adjusting the Switch Probability based on Dimension Size: A Case Study for Performance Improvement of the Flower Pollination Algorithm
(arXiv, 2022-08-20) Aziz, Tahsin; Muhammad, Tashreef; Chowdhury, Md Rashedul Karim; Alam, Mohammad Shafiul
Numerous meta-heuristic algorithms have been influenced by nature. Over the past couple of decades, their quantity has been significantly escalating. The majority of these algorithms attempt to emulate natural biological and physical phenomena. This research concentrates on the Flower Pollination algorithm, which is one of several bio-inspired algorithms. The original approach was suggested for pollen grain exploration and exploitation in confined space using a specific global pollination and local pollination strategy. As a “swarm intelligence" meta-heuristic algorithm, its strength lies in locating the vicinity of the optimum solution rather than identifying the minimum. A modification to the original method is detailed in this work. This research found that by changing the specific value of “switch probability" with dynamic values of different dimension sizes and functions, the outcome was mainly improved over the original flower pollination method.
Open Access
Approximation and Visualization of Sets Defined by Iterated Function Systems
(University of Regina, 1991-03) Hepting, Daryl H.
An iterated function system (IFS) is defined to be a set of contractive affine transformations. When iterated, these transformations define a closed set, called the attractor of an IFS, which has fractal characteristics. Fractals of any sort are currently a topic of great popular appeal, largely due to the exciting images to which they lend themselves. Iterated function systems represent one of the newest sources of fractal images. Research to date has focused on exploiting IFS techniques for the generation of fractals and for use in modelling applications. Both areas of this research are well suited to computer graphics, and this thesis examine the IFS techniques from a computer graphics perspective. As a source of fractals, iterated function systems have some relationship to other methods of fractal generation. In particular, the relationship between IFS attractors and Julia sets will be examined throughout the thesis. Many insights can be gained from the previous work done by Peitgen, Richter and Saupe [32, 33] both in terms of methods for the generation of the fractal sets and methods for their visualization. The differences between the linear transformations which compose an IFS and the quadratic polynomials which define Julia sets are significant, but not moreso than their similarities. This thesis deals with the related questions of approximation and visualization. The method of constructing the approximating set of points is dependent upon the visualization method in use. Methods have been developed both to visualize the attractor and its complement. The two techniques used to examine the complement set are based on the distance and escape-time functions. The modelling power of standard IFS techniques is limited in that they cannot be used to model any object which is not strictly self-affine. To combat this, methods for controlling transformation application are examined which allow objects without strict self-affinity to be modelled. As part of this research, an extensible software system was developed to allow experimentation with the various concepts discussed. A description of that system is included in Chapter 6.
Open Access
Discernibility in the Analysis of Binary Card Sort Data
(Springer, 2013-10-11) Hepting, Daryl
In an open card sorting study of 356 facial photographs, each of 25 participants created an unconstrained number of piles. We consider all 63,190 possible pairs of photos: if both photos are in the same pile for a participant, we consider them as rated similar; otherwise we consider them as rated dissimilar. Each pair of photos is an attribute in an information system where the participants are the objects. We consider whether the attribute values permit accurate classification of the objects according to binary decision classes, without loss of generality. We propose a discernibility coefficient to measure the support of an attribute for classification according to a given decision class pair. We hypothesize that decision class pairs with the support of many attributes are more representative of the data than those with the support of few attributes. We present some computational experiments and discuss opportunities for future work.
Open Access
The Effects of Simulated Interruptions on Mobile Search Tasks
(Journal of the Association for Information Science and Technology, 2021-10) Hoeber, Orland; Harvey, Morgan; Dewan Sagar, Shaheed Ahmed; Pointon, Matthew
While it is clear that using a mobile device can interrupt real-world activities such as walking or driving, the effects of interruptions on mobile device use have been under-studied. We are particularly interested in how the ambient distraction of walking while using a mobile device, combined with the occurrence of simulated interruptions of different levels of cognitive complexity, affect web search activities. We have established an experimental design to study how the degree of cognitive complexity of simulated interruptions influence both objective and subjective search task performance. In a controlled laboratory study (n=27), quantitative and qualitative data were collected on mobile search performance, perceptions of the interruptions, and how participants reacted to the interruptions, using a custom mobile eye-tracking app, a questionnaire, and observations. As expected, more cognitively complex interruptions resulted in increased overall task completion times and higher perceived impacts. Interestingly, the effect on the resumption lag or the actual search performance was not significant, showing the resiliency of people to resume their tasks after an interruption. Implications from this study enhance our understanding of how interruptions objectively and subjectively affect search task performance, motivating the need for providing explicit mobile search support to enable recovery from interruptions.
Open Access
The Escape Buffer: Efficient Computation of Escape Time for Linear Fractals
(Canadian Human Computer Communications Society, 1995-05-17) Hepting, Daryl; Hart, John
The study of linear fractals has gained a great deal from the study of quadratic fractals, despite important differences. Methods for classifying points in the complement of a fractal shape were originally developed for quadratic fractals, to provide insight into their underlying dynamics. These methods were later modified for use with linear fractals. This paper reconsiders one such classification, called escape time, and presents a new algorithm for its computation that is significantly faster and conceptually simpler. Previous methods worked backwards, by mapping pixels into classified regions, whereas the new forward algorithm uses an "escape buffer" to map classified regions onto pixels. The efficiency of the escape buffer is justified by a careful analysis of its performance on linear fractals with various properties.
Open Access
Frequency Distribution of Prime Numbers between an Integer and its Square: A Case Study
(arXiv, 2022-09-26) Muhammad, Tashreef; Shahariar, GM; Aziz, Tahsin; Alam, Mohammad Shafiul
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has been captivating them. Until recently, it was firmly believed that prime numbers do not maintain any pattern of occurrence among themselves. This statement is conferred not to be completely true. This paper is also an attempt to discover a pattern in the occurrence of prime numbers. This work intends to introduce some mathematical well-known equations that point to the existence of a simplistic pattern in the number of primes within the range of a number and its square. We assume that the rigorous evaluation of the perceived pattern may benefit in many aspects such as applications of encryption, algorithms concerning prime numbers, and many more.
Open Access
Graduate Student Search Strategies within Academic Digital Libraries
(International Journal on Digital Libraries, 2023) Hoeber, Orland; Storie, Dale
Purpose: When searching within an academic digital library, a variety of information seeking strategies may be employed. The purpose of this study is to determine whether graduate students choose appropriate information seeking strategies for the complexity of a given search scenario, and to explore among other factors that could influence their decisions. Methods: We used a survey method in which participants (n=176) were asked to recall their most recent instance of an academic digital library search session that matched two given scenarios (randomly chosen from four alternatives), and for each scenario identify whether they employed search strategies associated with four different information seeking models. Results: Among the search strategies, only lookup search was used in a manner that was consistent with the complexity of the search scenario. Other factors that influenced the choice of strategy were the discipline of study and the type of academic search training received. Patterns of search tool use with respect to the complexity of the search scenarios were also identified. Conclusion: These findings highlight that not only is it important to train graduate students on how to conduct academic digital library searches, more work is needed to train them on matching the information seeking strategies to the complexity of their search tasks and developing interfaces that guide their search process.}
Open Access
A Linear Model for Three-Way Analysis of Facial Similarity
(Springer, Cham, 2018-05-18) Hepting, Daryl H.; Bin Amer, Hadeel Hatim; Yao, Yiyu
Card sorting was used to gather information about facial similarity judgments. A group of raters put a set of facial photos into an unrestricted number of different piles according to each rater’s judgment of similarity. This paper proposes a linear model for 3-way analysis of similarity. An overall rating function is a weighted linear combination of ratings from individual raters. A pair of photos is considered to be similar, dissimilar, or divided, respectively, if the overall rating function is greater than or equal to a certain threshold, is less than or equal to another threshold, or is between the two thresholds. The proposed framework for 3-way analysis of similarity is complementary to studies of similarity based on features of photos.
Open Access
On Graphical Modeling of Preference and Comfort
(2017) Ahmed, Sultan; Mouhoub, Malek
User's choices involve habitual behavior and genuine decisions. Habitual behavior is often represented using preferences. The conditional preference network (CP-net) is a graphical tool for representing and reasoning about conditional preferences. We argue that genuine decisions are environmentally influenced and we introduce the notion of "comfort" to represent this type of choices. In this paper, we propose a graphical model that we call CP-net with Comfort (CPC-net), to represent and reason about both user's preferences and comfort. The CPC-net extends the CP-net structure with a semantics that accounts user's comfort together with preferences. We indeed show that the CP-net is a special instance of the CPC-net. A CPC-net consists of two optimal outcomes, one for preference and another for comfort. These outcomes can be obtained in time linear on the number of variables for an acyclic CPC-net.
Open Access
Operationalizing Ethics in Food Choice Decisions
(Springer, 2014-06) Hepting, Daryl; Jaffe, JoAnn; Maciag, Timothy
There is a large gap between attitude and action when it comes to consumer purchases of ethical food. Amongst the various aspects of this gap, this paper focuses on the difficulty in knowing enough about the various dimensions of food production, distribution and consumption to make an ethical food purchasing decision. There is neither one universal definition of ethical food. We suggest that it is possible to support consumers in operationalizing their own ethics of food with the use of appropriate information and communication technology. We consider eggs as an example because locally produced options are available to many people on every continent. We consider the dimensions upon which food ethics may be constructed, then discuss the information required to assess it and the tools that can support it. We then present an overview of opportunities for design of a new software tool. Finally, we offer some points for discussion and future work.
Open Access
Rendering Methods for Iterated Function Systems
(North-Holland, 1991-12) Hepting, Daryl; Prusinkiewicz, Przemyslaw; Saupe, Dietmar
This paper describes rendering methods for iterated function systems (IFS’s). The rendering process consists of the generation of a field of data using an IFS and its visualization by means of computer graphics. Two groups of methods are presented: 1. Rendering of the attractor A of an IFS. These attracting methods may visualize the geometry and additionally the invariant measure supported by the attractor. 2. Rendering the complement of the attractor. There are three approaches, namely methods representing Euclidean distance from A; repelling methods, computing the escape time of a point from A, and methods using (electrostatic) potential functions of the attractor. The last of these methods calculates integrals with respect to the invariant measure of the attractor. An algorithm which generates an approximation of such integrals with prescribed tolerance is presented. This provides an alternative to the usual approach based on Elton's ergodic theorem and time average of trajectories generated by the “chaos game", where no error bound is available. Algorithms specifying the details of all methods are presented, some of them in the form of pseudocode. Examples of images obtained using these algorithms are given. The relationship to previously developed methods for visualizing Mandelbrot and Julia sets is also discussed.
Open Access
Simultaneous Tracking and Activity Recognition with Relational Dynamic Bayesian Networks
(Department of Computer Science, University of Regina, 2011-03-30) Manfredotti, Cristina Elena; Fleet, David James; Hamilton, Howard John; Zilles, Sandra
Taking into account relationships between interacting objects can improve the understanding of the dynamic model governing their behaviors. Moreover, maintaining a belief about the ongoing activity while tracking allows online activity recognition and improves the tracking task. We investigate the use of Relational Dynamic Bayesian Networks to represent the relationships for the tasks of multi-target tracking and explicitly consider a discrete variable in the state to represent the activity for online activity recognition. We propose a new transition model that accommodates relations and activities and we extend the Particle Filter algorithm to directly track relations between targets while recognizing ongoing activities.
Open Access
A Study of Visually Linked Keywords to Support Exploratory Browsing in Academic Search
(Journal of the Association for Information Science and Technology, 2022) Hoeber, Orland; Shukla, Soumya
While the search interfaces used by common academic digital libraries pro- vide easy access to a wealth of peer-reviewed literature, their interfaces pro- vide little support for exploratory browsing. When faced with a complex search task (such as one that requires knowledge discovery), exploratory browsing is an important first step in an exploratory search process. To more effectively support exploratory browsing, we have designed and implemented a novel academic digital library search interface (KLink Search) with two new features: visually linked keywords and an interactive workspace. To study the potential value of these features, we have conducted a controlled laboratory study with 32 participants, comparing KLink Search to a baseline digital library search interface modelled after that used by IEEE Xplore. Based on subjective opinions, objective performance, and behavioural data, we show the value of adding lightweight visual and interactive features to academic digital library search interfaces to support exploratory browsing.
Open Access
Three-Way Analysis of Facial Similarity Judgments
(2017-10-23) Hepting, Daryl H.; Bin Amer, Hadeel Hatim; Yao, Yiyu
The card sorting problem involves the similarity judgments of pairs of photos, taken from a set of photos, by a group of participants. Given the lack of an objective standard for judging similarity, different participants may be using different strategies in judging the similarity of photos. It could be very useful to identify and study these strategies. In this paper, we present a framework for three-way analysis of judgments of similarity. Based on judgments by the set of participants, we divide all pairs of photos into three classes: a set of similar pairs that are judged by at least 60% of participants as similar; a set of dissimilar pairs that are judged by at least 60% of participants as dissimilar; and a set of undecidable pairs that have conflicting judgments. A more refined three-way classification method is also suggested based on a quantitative description of the quality of similarity judgments. The classification in terms of three classes provides an effective method to examine the notions of similarity, dissimilarity, and disagreement.
Open Access
Utilizing Technical Data to Discover Similar Companies in Dhaka Stock Exchange
(arXiv, 2023-01-12) Muhammad, Tashreef; Aziz, Tahsin; Alam, Mohammad Shafiul
Stock market investment have been an ideal form of investment for many years. Investing capitals smartly in stock market yields high profit returns. But there are many companies available in a market. Currently there are more than 345 active companies who have stocks in Dhaka Stock Exchange (DSE). Analyzing all these companies is quite impossible. However, many companies tend to move together. This study aims at finding which companies in DSE have a close connection and move alongside each other. By analyzing this relation, the investors and traders will be able to analyze a lot of companies’ statistics from a calculating just a handful number of companies. The conducted experiment yielded promising results. It was found that though the system was not given anything other than technical data, it was able to identify companies that show domain specific outcomes. In other words, a relation between technical data and fundamental data was discovered from the conducted experiment.

Browse

Browsing Department of Computer Science by Title