Our Staff & Administrator will use the desktop & the online application with different access level.

It eliminates any overload with an access level that prevents the calling code from calling it.

它消除具有防止调用代码调用的访问级别的任何重载.

Select the access level of the module from the Access drop-down list.

从“访问”下拉列表中选择模块的访问级别.

Each access label specifies the access level of the succeeding member definitions.

每个访问标号指定了随后的成员定义的访问级别.

Select the access level of the structure from the Access drop-down list.

从“访问”下拉列表中选择结构的访问级别.

Select the access level of the interface from the Access drop-down list.

从“访问”下拉列表中选择接口的访问级别.

Access level-the permission for code to make use of the element.

访问级别 - 代码使用元素的权限.

In contrast, people given the importance attached to text compression is far not enough.

相比之下, 人们给予文本压缩的重视程度远为不够.

LZ algorithm is widely used in text compression.

LZ算法在文本压缩领域应用广泛.

Haffman text compression source code integrity, and can be used directly.

哈夫曼文本压缩源代码的完整性, 并可以直接使用.

Currently, the researchs of text compression and retrieval attract people's attention.

目前针对文本文件压缩和检索的研究已经受到大家的关注.

For the problem of Chinese string matching, a fast multiple pattern matching algorithm was provided.

针对中文字串匹配问题, 提出一种快速多模式匹配算法.

For the problem of Chinese string matching, an improved multiple pattern matching algorithm is provided.

针对中文字串匹配问题, 提出了一种改进的多模式匹配算法.

Traditional string matching algorithms cannot be efficiently applied to the q-attribute string matching problem.

传统的字串比对方法并无法直接应用在q重字串比对的问题上.

The master string matching algorithm.

掌握串的匹配算法.

An improved image recognition and registration algorithm based on convex hull and affine invariant was presented.

提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法.

That is multi-direction extreme value approximate convex hull algorithm, and is called MDEV for short.

提出并实现了平面点集凸壳的一种新的近似算法 —— 多方向极值法.

Classic convex hull algorithm. JAVA language. Absolutely correct.

经典的凸包算法. JAVA语言编写. 绝对正确.

Minimum Manhattan network problem is put forward in 1999 a world-class computational geometry important conjecture.

最小曼哈顿网络问题,是1999年提出的 世界级 计算几何重要猜想.

Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.

摘要简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用.

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

凸壳作为计算几何的一种基本的结构,对GIS的数据分析有着重要作用.