Adopting an alternative, yet complimentary view to the traditional, performance-based task/technology fit perspective, we examine the post-adoption of social network sites (SNS) by extending the concept of IT desirability as a central predictor of SNS continuous-use. We conceptualize SNS desirability as reflecting the affective relationship individuals experience with SNS, an approach that emph...

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

Of concern is a network in which the conductance of certain branches are variable. The problem posed is the maximization of the joint conductance subject to a bound on the <t norm of the variable conductances. It is shown that at P an optimum state the conductance of a variable branch is proportional to the 2/(p+l) power of the current through the branch. l*his relation together with a dual var...

Given a directed network G = (V, A) with positive capacity for each a ∈ A, and a specified set of source-sink pairs of vertices, the objective is to remove a set of arcs with minimum capacity so that the resulting network stops all communication from sources to their respective sinks. We study the facial structure of the polytope associated with the solutions of this problem and identify a gen...

Users of data envelopment analysis (DEA) often presume efficiency estimates to be robust. While traditional DEA has been exposed to various sensitivity studies, network DEA (NDEA) has so far escaped similar scrutiny. Thus, there is a need to investigate the sensitivity of NDEA, further compounded by the recent attention it has been receiving in literature. NDEA captures the underlying performan...

We consider a specific variant of the survivable network design problem suitable to model real world scenarios occurring in the extension of fiber optic networks. In this article, two mixed integer programming models, which can be solved by branch-and-price, are discussed and compared to existing approaches theoretically as well as by a computational study. We further discuss the usage of alter...

Convolutional Neural Network (CNN) image classifiers are traditionally designed to have sequential convolutional layers with a single output layer. This is based on the assumption that all target classes should be treated equally and exclusively. However, some classes can be more difficult to distinguish than others, and classes may be organized in a hierarchy of categories. At the same time, a...

The Berkeley Open Infrastructure for Network Computing (BOINC) is an opensource middleware system for volunteer and desktop grid computing. In this paper, we propose BNBTEST, a BOINC version of the distributed branch-andbound method. The crucial issues of the distributed branch-and-bound method are traversing the search tree and loading the balance. We developed a subtask packaging method and t...

This paper presents the modified design that can reject harmonic components in the branch-line coupler. After adding open stubs at the center of branch lines of the traditional design, their new network parameters can be found in order to maintain the conventional function at an operating frequency and suppress its harmonic terms chosen. Experimental results show the second and third harmonic s...

Purpose This paper aims to propose a solution for detecting and grading diabetic retinopathy (DR) in retinal images using convolutional neural network (CNN)-based approach. It could classify input into normal class or an abnormal class, which would be further split four stages of abnormalities automatically. Design/methodology/approach The proposed is developed based on newly CNN architecture, ...