检索结果-内蒙古大学图书馆

IEEE 6th International Conference on Cloud Computing (CLOUD)

作者： Ho, Li-Yung Wu, Jan-Jan Liu, Pangfeng Natl Taiwan Univ Dept Comp Sci & Informat Engn Acad Sinica Inst Informat Sci Taipei 10764 Taiwan Res Ctr Informat Technol Innovat Acad Sinica Inst Informat Sci Taipei 10764 Taiwan Natl Taiwan Univ Grad Inst Networking & Multimedia Dept Comp Sci & Informat Engn Taipei Taiwan

ISBN: (纸本)9780769550282

We present a data replication framework for distributed graph processing. First we partition a graph and store each partition in a machine. Then we replicate all partitions and assign replicas to machines, where each machine can store only a limited number of replicas. The goal is to replicate the partitions so that each partition has at least a certain number of replicated copies, and the cost is minimized. The cost is defined as the data traffic data traffic needed to run general graph processing algorithms. The cost metric is the overall transmission cost of all machines, and the maximum transmission cost of a single machine. We propose an optimal algorithm based on linear programming to solve the problem of minimizing the overall transmission cost. We also propose an optimal algorithm to solve a special problem of minimizing the maximum transmission cost of a node.

关键词： algorithm data replication binary integer programming minimum cost flow totally unimodular social networks

来源：评论

学校读者我要写书评

暂无评论

A Regeneration Placement, Routing and Spectrum Assignment Solution for Translucent Elastic Optical Networks: A Joint Optimization Approach 10th

A Regeneration Placement, Routing and Spectrum Assignment So...

引用

10th International Conference on Operations Research and Enterprise Systems (ICORES)

作者： Gonzalez, Claudio Jara, Nicolas Albornoz, Victor M. Univ Tecn Federico Santa Maria Dept Ind Campus Santiago Vitacura Vitacura Chile Univ Tecn Federico Santa Maria Dept Elect Engn Valparaiso Chile

ISBN: (纸本)9789897584855

In this paper, we propose a novel joint approach to solve the regeneration placement, routing, modulation level, and spectrum assignment (RP-RMLSA) problem using a binary integer program (BIP) model. Using a mock and real-world network topology, we conduct extensive numerical experiments testing the proposed optimization model's performance and analyzing the characteristics of the solutions found. Our results show that considering only an optimal solution occurs when signals in need of regeneration are concentrated in one regeneration node when considering the regeneration devices' capital and operational expenditure.

关键词： Regeneration Placement Routing Spectrum Assignment Elastic Optical Networks binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Adaptive Streaming over Popularity-driven Caching in Information-Centric Networks

Dynamic Adaptive Streaming over Popularity-driven Caching in...

引用

IEEE International Conference on Communications (ICC)

作者： Li, Wenjie Oteafy, Sharief M. A. Hassanein, Hossam S. Queens Univ Sch Comp Kingston ON Canada

ISBN: (纸本)9781467364324

The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for addressing this exponential growth in data-intensive services, of which video streaming is projected to dominate (in traffic size). In this paper, we present a novel strategy in ICNs for adaptive caching of variable video contents tailored to different sizes and bit rates. Our objective is to achieve optimal video caching to reduce access time for the maximal requested bit rate for every user. At its core, our approach capitalizes on a rigorous delay analysis and potentiates maximal serviceability for each user. We incorporate predictors for requested video objects based on a popularity index (Zipf distribution). In our proposed model, named DASCache, we present delay queuing analysis for cached objects, providing a cap on expected delay in accessing video content. In DASCache, we present a binary integer programming (BIP) formulation for the cache assignment problem, which operates in rounds based on changes in content requests and popularity scores. DASCache reacts to changes in network dynamics that impact bit rate choices by heterogeneous users and enables users to stream videos, maximizing Quality of Experience (QoE). To evaluate the performance of DASCache, in contrast to current benchmarks in video caching, we present an elaborate performance evaluation carried out on ndnSIM, over NS-3.

关键词： Dynamic adaptive streaming Content-centric network in-network caching Optimization Popularity index Queueing analysis binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Toward effective group formation in computer-supported collaborative learning

引用

INTERACTIVE LEARNING ENVIRONMENTS 2016年第3期24卷 382-395页

作者： Sadeghi, Hamid Kardan, Ahmad A. Amirkabir Univ Technol Dept Comp Engn & Informat Technol Adv E Learning Technol Lab Tehran Iran

Group formation task as a starting point for computer-supported collaborative learning plays a key role in achieving pedagogical goals. Various approaches have been reported in the literature to address this problem, but none have offered an optimal solution. In this research, an online learning environment was modeled as a weighted undirected complete graph in which each learner was implied as a node and the relationship between them was denoted as a weighted arc. The weight of each link indicated the similarity degree between the corresponding individuals. The similarity between two students was measured as the mean of their absolute interest levels. The graph was also represented through a symmetric adjacency matrix. Then, a novel binary integer programming formulation was proposed to model the group formation problem and optimally assign each learner to the most appropriate group. The method was utilized to divide an online class of 32 learners into 8 groups of size 4. Findings indicated that the suggested model was successful in optimally solving the problem in 20.53 seconds, on average. The performance of the method was also compared with a modified version of K-means clustering algorithm. Although, the running time of the suggested technique was not as good as the clustering algorithm, it generated better outcomes in theory and in practice.

关键词： computer-supported collaborative learning cooperative learning group formation binary integer programming graph-based modeling

来源：评论

学校读者我要写书评

暂无评论

Application of the Maximal Covering Location Problem to Habitat Reserve Site Selection: A Review

引用

INTERNATIONAL REGIONAL SCIENCE REVIEW 2016年第1期39卷 28-47页

作者： Snyder, Stephanie A. Haight, Robert G. US Forest Serv USDA No Res Stn St Paul MN 55108 USA

The Maximal Covering Location Problem (MCLP) is a classic model from the location science literature which has found wide application. One important application is to a fundamental problem in conservation biology, the Maximum Covering Species Problem (MCSP), which identifies land parcels to protect to maximize the number of species represented in the selected sites. We trace the evolution of the MCSP from the MCLP, review extensions, and offer suggestions for new lines of research related to the MCSP.

关键词： maximal covering species problem MCLP biological conservation p-median binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Exploiting Characteristics of Slow Fading Channels in OFDMA Scheduling 10

Exploiting Characteristics of Slow Fading Channels in OFDMA ...

引用

10th International Wireless Communications & Mobile Computing Conference (IWCMC)

作者： Tekinay, Mustafa Beard, Cory Medhi, Deep Univ Missouri Sch Comp & Engn Kansas City MO 64110 USA

ISBN: (纸本)9781479909599

The resource allocation problem has been a very hot topic since the migration from CDMA to OFDMA modulation schemes has taken place for the wireless communication systems. The scheduling problem has transformed into a rather more complex one due to the increased number of resource elements at hand. There have been numerous proposed scheduling algorithms with various analytical approaches to enhance the efficiency, QoS, fairness, or throughput of the systems that employ OFDMA. We propose an original multi-user downlink scheduling scheme for LTE where the problem is formulated as an optimization problem with minimum throughput limitations for the users. We introduce a time-window parameter to exploit the slow varying channel conditions if there are any. Specifically, this is accomplished by means of defining the minimum throughput limitation over a larger period of time than the scheduling time for users with relative slow varying channel conditions. The suggested algorithm is called the Two-Stage Time windowed Scheduling (TSTwS) and it achieves up to 30% higher average total downlink throughput than the equivalent model without the time-window approach.

关键词： Base station communication systems AMC OFDMA QoS scheduling schemes optimal resource allocation LTE slow fading channels binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Incorporating Triple Resonance Experiment Data Into NVR For NMR Protein Structure-Based Assignments

Incorporating Triple Resonance Experiment Data Into NVR For ...

引用

22nd IEEE Signal Processing and Communications Applications Conference (SIU)

作者： Ekren, Seyma Nur Apaydin, Mehmet Serkan Istanbul Sehir Univ Muhendisl & Doga Bilimleri Fak Istanbul Turkey

ISBN: (纸本)9781479948741

In NVR which is an NMR protein structure based assignment program, only N-15 labeled data has been used until now due to the cost of acquiring C-13 labeled data. Besides, in score function of NVR program, manually set parameters have been used for different proteins while calculating assignment probability of atoms. Nowadays, triple resonance experiments are standardized and obtaining C-13 labeled data is getting easier. In this work, we incorporated C-13 labeled data into NVR program. At the same time, by using new statistical values obtained from a larger protein database, we have prevented using different coefficients for different proteins. We have carried out the assignments for ubiquitin with and without C-13 labeled data by using NVR-BIP which applies binary integer programming to solve the assignment problem. As a result, we have observed that the new results obtained with the new score function by using C-13 labeled data have been improved.

关键词： NMR structure based protein assignment NVR score function triple resonance experiments binary integer programming

来源：评论

学校读者我要写书评

暂无评论

AN ALGORITHM TO EXTRACT THE GENERALIZED PHYSICAL CONTRADICTION

AN ALGORITHM TO EXTRACT THE GENERALIZED PHYSICAL CONTRADICTI...

引用

International Conference on Innovative Design and Manufacturing (ICIDM)

作者： Lin, Lei Dubois, Sebastien De Guio, Roland Rasovska, Ivana Design Engn Lab F-67000 Strasbourg France ICube UMR 7357 F-67412 Illkirch Graffenstaden France

ISBN: (纸本)9781479962709

Problem solving in design is one of the main studied topic of research, and especially methods for problem solving. Generally, two kinds of methods are differentiated, those dedicated to routine design, and those focused on inventive design. The authors aim at linking the two approaches and building a continuum between both. Thus they studied the link and direct extraction of contradictions out of experiments. To do so they built a generic model of contradictions, the Generalized System of Contradictions (GSC). This paper proposes an algorithm for identifying and extracting generalized physical contradictions, a part of the GSC, from experiments. First, the authors' design methodology to build the continuum from optimization till invention is introduced. The notion of Generalized System of Contradictions is presented and the focus is made on the notion of Generalized Physical Contradiction. This one is described through binary integer programming and an algorithm is proposed in order to identify and extract complete set of Generalized Technical Contradictions (GTCs) from experiments concerning the inventive problem.

关键词： TRIZ Generalized System of Contradictions binary integer programming

来源：评论

学校读者我要写书评

暂无评论

IT consolidation - an optimization approach

IT consolidation - an optimization approach

引用

14th IEEE International Enterprise Distributed Object Computing Conference (EDOCW)

作者： Franke, Ulrik Holschke, Oliver Buschle, Markus Narman, Per Rake-Revelant, Jannis Royal Inst Technol Ind Informat & Control Syst Stockholm Sweden Tech Univ Berlin Berlin Germany

ISBN: (纸本)9780769541648

Consolidation of IT resources is a frequently cited task for IT decision makers, aiming to remove redundancy and thereby to cut costs. However, while economically motivated, the methods described in the literature rarely address costs directly. Instead, the focus often remains on purely IT-related considerations. In this paper, IT consolidation is addressed from an operations research perspective, applying a binary integer programming model to find optimal solutions to consolidation problems. Since accurate cost estimates are vital to successful consolidation, and play an important role in the presented binary integer program, the paper also addresses the costs involved in consolidation, with a particular focus on the costs of modifying business processes. Applying the mathematical method, with accurate cost estimates, enables decision makers to make optimal decisions in a transparent and rigorous way. The use of the proposed method is demonstrated with an example based on a real consolidation problem from a large European power supplier.

关键词： IT consolidation binary integer programming Business process modifications

来源：评论

学校读者我要写书评

暂无评论

Strongly Connected Component Multi-Object Tracking 2

Strongly Connected Component Multi-Object Tracking

引用

2nd IEEE International Conference on Computer and Communications (ICCC)

作者： Sowah, Nii Longdon Wu, Qingbo Meng, Fanman Bo, Wu Ngan, King N. Univ Elect Sci & Technol China Dept Elect Engn Chengdu 611731 Sichuan Peoples R China Chinese Univ Hong Kong Dept Elect Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)9781467390262

Multi-object tracking (MOT) continues to gain more attention due to its relevance in the field of computer vision. Tracking-by-detection is one of the most used techniques in multi-object tracking, and this work follows that trend. Many methods generate tracklets in the initial step of tracking and generate final trajectories by optimization algorithms. An important challenge of such approaches is how to generate reliable tracklets which is crucial for generating final trajectories. Bounding box overlap and optical flow are two of such methods. A new clustering method is proposed for tracklet generation in our multi-object tracking algorithm. We present a novel approach that uses strongly connected component clusters in a K-NN directed graph with no defined class number for tracklet generation. We propose that such clusters of detections can accurately represent the tracklets of targets in a video. binary integer programming is used to merge initial tracklets into their final trajectories. Experimental results on four standard benchmark datasets demonstrate the superiority of the proposed method.

关键词： directed graph strongly connected component tracklet binary integer programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：