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

Record of Proceedings - The 21st annual Simulation symposium.

ISBN: (纸本)0818608455

The symposium materials contain 15 papers. The following topics are dealt with: a proposed college curriculum in simulation;Ada simulation;multisensor, concurrent signal processor simulation;clustering algorithm performance;order sequencing in flow-shop production system;simulation of pick-and-place robot;heuristic airlaunch trainer;simulation of consistency algorithms for replicated files;disk cache performance study;object-oriented modeling using C plus;simulation of market model for distributed control;distributed application development;distributed processing network simulation;distributed discrete-event simulation.

关键词： COMPUTER SIMULATION

来源：评论

学校读者我要写书评

暂无评论

A realistic evaluation of consistency algorithms for replicated files 21

A realistic evaluation of consistency algorithms for replica...

引用

21st annual symposium on Simulation, ANSS 1988

作者： Pâris, Jehan-François Long, Darrell D.E. Glockner, Alexander Computer Systems Research Group Department of Computer Science and Engineering University of California San Diego San DiegoCA92093 United States

ISBN: (纸本)0818608455

Data are often replicated in distributed systems to protect them against site failures and network malfunctions. When this is the case, an access policy must be chosen to insure that a consistent view of the data is always presented. Voting protocols guarantee consistency of replicated data in the presence of any scenario involving non-Byzantine site failures and network partitions. While static Majority Consensus Voting protocols use static quorums, Dynamic Voting protocols, like Dynamic Voting and Lexicographic Dynamic Voting, dynamically adjust quorums to changes in the status of the network of sites holding the copies. The availabilities of replicated data managed by these three protocols are compared using a simulation model with realistic parameters. Dynamic Voting is found to perform better than Majority Consensus Voting for all files having more than three copies while Lexicographic Dynamic Voting performs much better than the two other protocols for all eleven configurations under study.

关键词： discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Mobile Image Search for Tourist Information Using ACCC Algorithm

Mobile Image Search for Tourist Information Using ACCC Algor...

引用

21st annual IEEE International symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Premchaiswadi, Wichian Tungkatsathan, Anucha Premchaiswadi, Nucharee Siam Univ Grad Sch Informat Technol Business Bangkok Thailand Dhurakijpandit Univ Fac Informat Technol Bangkok Thailand

ISBN: (纸本)9781424480166

Almost all mobile image search applications available in the market only support text queries, which it is sometimes difficult to describe the needs in text and the text input is inconvenient on small devices. This paper proposed a mobile phone image search application that can perform practical image search processing in real-time. The early stage of the project is aimed to develop the application for the tourists who can use it as a guidance tool for travelling in the country. The application can run on hundreds of different mobile phone types and platforms. In older to speed up the visual computation for searching images, the Auto Color Correlogram (ACC) and correlation (ACCC) algorithms based on Correlogram technique were developed. Applying the ACCC algorithm, it reduces the computational complexity of index construction and similarity measurement for images from O(m(2)d) to O(md) when compared to previous algorithm, Color correlogram.

关键词： Mobile Search and Retrieval Mobile Image Searh Content-Based Image Retrieval Tourist Information ACCC Algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal discrete spreading factor determination for uplink resource allocation in multiservice UMTS and HSUPA networks

Optimal discrete spreading factor determination for uplink r...

引用

21st annual IEEE International symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Vivier, Emmanuelle Terre, Michel ISEP 28 Rue Notre Dame Champs F-75006 Paris France Conservatoire Natl Arts & Metiers F-75003 Paris France

ISBN: (纸本)9781424480166

Attention to resource allocation algorithms for multiservice Code Division Multiple Access CDMA networks has focused on algorithms maximizing the uplink aggregate throughput. In the present paper we address the problem of the joint power and spreading factor (SF) allocation to non real-time (NRT) terminals on the uplink, once real time constraints are satisfied. An optimal algorithm is proposed, that maximizes the uplink aggregate NRT throughput while allocating SF in a set of discrete values, as those used in 3G systems. It is shown that the results obtained are close to the theoretical upper bound, and that thanks to power control, more NRT services can be admitted. Compared to Univeral Mobile Telecommunications System (UMTS) services, the High Speed Uplink Packet Access (HSUPA) services increase the aggregate uplink NRT throughput, especially at low cell's load, and decrease the interferences generated at the base station level at high cell's load. In return, the number of simultaneously served NRT services is significantly lower.

关键词： 3G mobile communication CDMA networks HSUPA networks code division multiple access high speed uplink packet access multiservice UMTS multiservice code division multiple access optimal discrete spreading factor determination packet reservation multiple access resource allocation spreading factor allocation uplink resource allocation

来源：评论

学校读者我要写书评

暂无评论

discrete-Rate Allocation Schemes in Multi-Cell Scenarios with Power Adaptation

Discrete-Rate Allocation Schemes in Multi-Cell Scenarios wit...

引用

21st annual IEEE International symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Giordano, Lorenzo Galati Reggiani, Luca Dossi, Laura Politecn Milan Dip Elettron & Informaz I-20133 Milan Italy IEIIT CNR Politec Milano Milan Italy

ISBN: (纸本)9781424480166

Interference mitigation and adaptive multi-user resource allocation are among the most promising technological breakthroughs that should improve capacity of future broadband wireless communications. In a multi-cell scenario, where co-channel interference is the performance limiting factor, discrete-rate resource allocation algorithms, selecting those channels with best Signal-to-Interference and Noise-Ratio (SINR), can reduce the transmission power in each base station, acting indirectly on the co-channel interference levels. In this paper we investigate multi-cell systems in which power adaptation acts as a positive factor for the interference reduction. We are interested here in the convergence properties of the dynamic model of the system and in the role of the number and position of SINR thresholds of the discrete-rate profiles. We find that, in multi-cell scenarios, the application of power reduction makes the spectral efficiency of the system relatively insensitive to the number of discrete-rate profiles, once fixed the minimum and maximum SINR thresholds.

关键词： SINR thresholds adaptive multiuser resource allocation algorithm base station broadband wireless communications cochannel interference cochannel interference discrete-rate allocation schemes discrete-rate profiles interference mitigation interference reduction interference suppression multicell scenarios multicell systems power adaptation power reduction radio networks resource allocation signal-to-interference and noise-ratio spectral efficiency

来源：评论

学校读者我要写书评

暂无评论

string Synchronizing Sets Sublinear-Time BWT Construction and Optimal LCE Data structure 2019

String Synchronizing Sets Sublinear-Time BWT Construction an...

引用

51st annual acm SIGACT symposium on Theory of Computing (stOC)

作者： Kempa, Dominik Kociumaka, Tomasz Univ Warwick Dept Comp Sci Ctr Discrete Math & Its Applicat Coventry W Midlands England Bar Ilan Univ Dept Comp Sci Ramat Gan Israel Univ Warsaw Inst Informat Warsaw Poland

ISBN: (纸本)9781450367059

Burrows-Wheeler transform (BWT) is an invertible text transformation that, given a text T of length n, permutes its symbols according to the lexicographic order of suffixes of T. BWT is one of the most heavily studied algorithms in data compression with numerous applications in indexing, sequence analysis, and bioinformatics. Its construction is a bottleneck in many scenarios, and settling the complexity of this task is one of the most important unsolved problems in sequence analysis that has remained open for 25 years. Given a binary string of length n, occupying O(n/ log n) machine words, the BWT construction algorithm due to Hon et al. (siam J. Comput., 2009) runs in O(n) time and O(n/ log n) space. Recent advancements (Belazzougui, stOC 2014, and Munro et al., SODA 2017) focus on removing the alphabet-size dependency in the time complexity, but they still require O(n) time. Despite the clearly suboptimal running time, the existing techniques appear to have reached their limits. In this paper, we propose the first algorithm that breaks the O(n)-time barrier for BWT construction. Given a binary string of length n, our procedure builds the Burrows-Wheeler transform in O(n/root log n) time and O(n root log n) space. We complement this result with a conditional lower bound proving that any further progress in the time complexity of BWT construction would yield faster algorithms for the very well studied problem of counting inversions: it would improve the state-of-the-art O(m root log m)-time solution by Chan and Patrascu (SODA 2010). Our algorithm is based on a novel concept of string synchronizing sets, which is of independent interest. As one of the applications, we show that this technique lets us design a data structure of the optimal size O(n/log n) that answers Longest Common Extension queries (LCE queries) in O(1) time and, furthermore, can be deterministically constructed in the optimal O(n/log n) time.

关键词： Burrows-Wheeler transform Longest Common Extension queries Longest Common Prefix queries packed strings

来源：评论

学校读者我要写书评

暂无评论

USING CONTINUOUS SIMULATION CLOCK TO CONTROL DIstRIBUTED discrete-EVENT SIMULATION.

USING CONTINUOUS SIMULATION CLOCK TO CONTROL DISTRIBUTED DIS...

引用

Record of Proceedings - The 21st annual Simulation symposium.

作者： Zhao, Wei Amherst Coll MA USA Amherst Coll MA USA

ISBN: (纸本)0818608455

A novel scheme to control distributed discrete-event simulation is proposed in which the simulation clocks, despite being used for local or global (communication) control, run continuously. In the context of local control, this means that at a node, between the simulation of two consecutive discrete-events the processor may be idle for a while, making it possible for any message which arrives during this 'idle' interval to arrive harmlessly, i. e. , without causing any rollback. If the nodes of the distributed system upon which simulation is carried out are connected by a multiaccess network, then, in the context of global communication control, the continuous clock can be used to implement a minimum-receive-time-first transmission policy. This also helps reduce the number of rollbacks. The performance of the scheme is evaluated through simulation. The results indicate that the scheme is not very sensitive to the parameter selection and is better than a scheme without continuous clocks.

关键词： COMPUTER SIMULATION

来源：评论

学校读者我要写书评

暂无评论

Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets

Z-Skip-Links for Fast Traversal of ZDDs Representing Large-S...

引用

21st annual European symposium on algorithms (ESA)

作者： Minato, Shin-Ichi Hokkaido Univ Grad Sch Informat Sci & Technol JST ERATO MINATO Discrete Struct Manipulat Syst P Sapporo Hokkaido 060 Japan

ISBN: (纸本)9783642404504

ZDD (Zero-suppressed Binary Decision Diagram) is known as an efficient data structure for representing and manipulating large-scale sets of combinations. In this article, we propose a method of using Z-Skip-Links to accelerate ZDD traversals for manipulating large-scale sparse datasets. We discuss average case complexity analysis of our method, and present the optimal parameter setting. Our method can be easily implemented into the existing ZDD packages just by adding one link per ZDD node. Experimental results show that we obtained dozens of acceleration ratio for the instances of the large-scale sparse datasets including thousands of items.

关键词： Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

COMPUTING THE discrete FRECHET DIstANCE WITH IMPRECISE INPUT

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2012年第1期22卷 27-44页

作者： Ahn, Hee-Kap Knauer, Christian Scherfenberg, Marc Schlipf, Lena Vigneron, Antoine POSTECH Dept Comp Sci & Engn Pohang South Korea Univ Bayreuth Inst Comp Sci D-95440 Bayreuth Germany Free Univ Berlin Inst Comp Sci D-14195 Berlin Germany King Abdullah Univ Sci & Technol Geometr Modeling & Sci Visualizat Ctr Thuwal Saudi Arabia

We consider the problem of computing the discrete Frechet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2(O(d2))m(2)n(2)log(2)(mn) the minimum Frechet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the planar case with running time O(mn log(3)(mn) + (m(2)+n(2)) log(mn)). In the d-dimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L-infinity distance, we give an O(dmn log(dmn))-time algorithm. We also give efficient O(dmn)-time algorithms to approximate the maximum Frechet distance, as well as the minimum and maximum Frechet distance under translation. These algorithms achieve constant factor approximation ratios in "realistic" settings (such as when the radii of the balls modelling the imprecise points are roughly of the same size).

关键词： Shape matching Frechet distance imprecise input

来源：评论

学校读者我要写书评

暂无评论

Approximation and Hardness Results for the Maximum Edge q-coloring Problem

引用

21st annual International symposium on algorithms and Computations (ISAAC)

作者： Adamaszek, Anna Popa, Alexandru Univ Warwick Ctr Discrete Math & Applicat DIMAP Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Bristol Dept Comp Sci Bristol Avon England

ISBN: (纸本)9783642175138

We consider the problem of coloring edges of a graph subject to the following constraint: for every vertex v, all the edges incident to v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraint and using the maximum number of colors. This problem has been studied in the past from the combinatorial and algorithmic point of view. The optimal coloring is known for some special classes of graphs. There is also an approximation algorithm for general graphs, which in the case q = 2 gives a 2-approximation. However, the complexity of finding the optimal coloring was not known. We prove that for any integer q >= 2 the problem is NP-Hard and APX-Hard. We also present a 5/3-approximation algorithm for q = 2 for graphs with a perfect matching.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：