有理B样条曲面的区间隐式化

提出有理B样条曲面的区间隐式化方法,即对一个有理B样条曲面,寻求包含给定的曲面的区间隐式B样条曲面,使得区间隐式B样条曲面的"厚度"尽量小,同时尽量避免出现多余分支.该问题等价于求区间隐式B样条曲面的2个边界曲面.针对该问题建立一个最优化模型并求解.     

三维复杂曲面的手绘生成方法

为便于用户在概念设计时快速进行三维形状设计,将变分隐式曲面表示与手绘草图相结合,提出一种三维复杂曲面的交互生成方法.该方法分别采用膨胀变换、曲线交叉变换和弯曲变换,将轮廓、截面和骨架等3种交互笔画扩展生成三维约束点,支持用户以手绘草图方式来控制生成三维曲面的形状;通过对变分隐式曲面函数的局部化来实现曲面混合,保证三维复杂曲面交互生成的实时性.实验结果表明:文中方法能生成多种不同形状的三维复杂曲面,可有效地支持三维复杂形状的"分而治之"构造过程.     

三角网格上的代数曲面重建

提出一种用分片代数曲面构造三角曲面片的方法,利用具有公共边的2个三角形区域的4个顶点的函数值以及公共边2个端点的外法向量来构造一个二次曲面V(g)和一个截面V(h),其交V(g,h)即为2个三角曲面片的公共边界曲线.对每个已确定了边界条件的三角片内部进一步划分成3部分,每部分各自定义一个三次代数曲面.这3个三次代数曲面不仅在其交线处光滑拼接,而且分别沿三角形的边界与V(g)光滑拼接,从而构成一个具有GC1连续性的分片代数曲面.对于只属于一个三角片的边界留有一个自由度,可对曲面形状加以控制.     

带形状参数的Coons类曲面的构造与拼接

给出了一组带形状参数[λ1]、[λ2]的混合函数,分析了该组函数的性质。基于这组带形状参数的混合函数,构造了一种带形状参数的混合Coons类曲面片。所构造的曲面不仅保持了Coons曲面的良好边界插值性质,而且可通过调控形状参数来改变曲面的内部形状。讨论了带形状参数的混合Coons类曲面片光滑拼接的条件,通过实例说明了方法的实用性。     

基于推广B 样条细分方法的曲面混合

提出用推广B 样条细分曲面来混合多张曲面的方法,既适用于一般网格曲面,又适 用于推广B 样条参数曲面混合。根据需要选择阶数和张力参数,可全局调整整张混合曲面的形状。 中心点和谷点的计算都设置了形状参数,可局部调整混合部分形状。推导出二次曲面细分初始网 格计算公式,并将3 阶推广B 样条细分曲面混合方法用于多张二次曲面混合,与已有的二次曲面 混合方法相比具有明显的优势。     

隐式磨光曲面的保凸性研究

对隐式代数磨光曲面的保凸性进行了研究。证明了如果两个隐式代数曲面是凸的,则它们光滑拼接后,得到的磨光曲面在一定条件下仍然是凸的。以凸三面角为例,提出了利用代数样条磨光的方法并证明了利用这种磨光方法得到的磨光曲面具有保凸性。     

一类三次隐式代数曲面参数化研究

在CAGD中隐式曲面和参数曲面作为曲面的两种表示形式各有其内在的优点 ,多年来如何有效地实现二者的相互转换一直是CAGD的一个热点问题 对一类GC1拼接两个二次曲面的三次混合代数曲面进行了研究 ,提出一种基于同轴平面束与代数曲面相交的几何化参数化方法 与传统参数化方法相比 ,该方法结构直观且具有可使三次代数曲面位于 [0 ,1]× [0 ,1]参数区间内 ,以及曲面的边界位于等参数线上等特点 ,利用这种参数曲面可以方便地实现机器作图和各种操作 实验结果验证了方法的有效性     

异度隐函数样条曲线曲面

隐式曲线曲面被广泛应用于曲线曲面插值、逼近与拼接. 通过添加辅助曲线曲面,提出异度隐函数样条曲线曲面方法,并对其插值性、凸性与正则性进行分析. 具体实例表明,异度隐函数样条提供了次数低、构造简单、灵活性好的曲线曲面插值与拼接方法.     

拟三次三角样条插值曲线与曲面

在构造插值曲线与曲面时,传统的方法多基于多项式函数空间,而基于三角函数空间也能构造插值曲线与曲面.首先基于函数空间Ω =span{1,sint,cost,sin2t,cos2t}构造了一种样条插值曲线与曲面,称之为拟三次三角样条插值曲线与曲面.该曲线与曲面不仅满足C2连续,而且直接插值于给定的控制顶点,避免了通过方程组反求控制顶点.进一步地,为了使所构造的拟三角样条插值曲线与曲面具有局部可调性,利用奇异混合技术在拟三次三角样条插值曲线与曲面中引入了局部形状参数,修改某些形状参数的取值可实现对插值曲线与曲面的局部调整,为样条插值曲线与曲面的构造提供了两种新方法.     

用有理双三次Bézier曲面片混合二次曲面

提出一种二次曲面混合方法,混合曲面由2张有理双三次Bézier曲面片构成,它们之间保持G2连续,混合曲面与二次曲面间保持G1连续.给出了混合曲面片控制顶点的显式表示,通过修改2类混合参数可以直观地调节混合方向及混合曲面的形状.另外,混合5个圆锥曲面的例子表明,该方法为多个二次曲面的混合问题提供了有效途径.     

Experimenting with dynamic linking with ADA

An approach to achieving dynamic reconfiguration within the framework of Ada¹ is described. A technique for introducing a kernel facility for dynamic reconfiguration in Ada is illustrated, and its implementation using the Verdix VADS 5.5 Ada compiling system on a Sun3–120 running the 4.3 BSD Unix operating system is discussed. This experimental kernel allows an Ada program to change its own configuration dynamically, linking new pieces of code at run-time. It is shown how this dynamic facility can be integrated consistently at the Ada language level, without introducing severe inconsistencies with respect to the Standard semantics.     

Routing with Locality on Meshes with Buses

Routing with locality is studied for meshes with buses. In this problem, packets' distances are bounded by a value,d, which is less than the diameter of the network. This problem arises naturally when specific known algorithms are implemented on meshes. Solving this problem in ordinary meshes requires at least a routing time ofdsteps. To do better than this, we propose adding a kind of short bus to ordinary meshes. By using a technique which we call iterative walk-and-ride, we show how the routing time can be reduced by approximately one-third for solving the problem (including the multipacket version) on one- and two-dimensional short-bus meshes. The bounds we develop are tight.     

Model-checking timed automata with deadlines with Uppaal

Timed automata with deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time progress conditions are expressed by invariants). More precisely, we translate networks of TAD to the modeling language of Uppaal, a state-of-the-art verification tool for timed automata. We also describe an implementation of this translation, which allows Uppaal to aid the design and analysis of TAD models.     

Computing with words and its relationships with fuzzistics

Words mean different things to different people, and so are uncertain. We, therefore, need a fuzzy set model for a word that has the potential to capture their uncertainties. In this paper I propose that an interval type-2 fuzzy set (IT2 FS) be used as a FS model of a word, because it is characterized by its footprint of uncertainty (FOU), and therefore has the potential to capture word uncertainties. Two approaches are presented for collecting data about a word from a group of subjects and then mapping that data into a FOU for that word. The person MF approach, in which each person provides their FOU for a word, is limited to fuzzy set experts because it requires the subject to be knowledgeable about fuzzy sets. The interval end-points approach, in which each person provides the end-points for an interval that they associate with a word on a prescribed scale is not limited to fuzzy set experts. Both approaches map data collected from subjects into a parsimonious parametric model of a FOU, and illustrate the combining of fuzzy sets and statistics—type-2 fuzzistics.     

规则与统计结合分析汉语

在自然语言处理中,规则方法和统计方法各有优缺点。采用规则方法进行汉语切分、标注,并采用规则方法与切分标注评分结合进行消歧。对切分标注正确的句子进行句法分析,并采用规则方法与句法语义评分结合进行消歧。根据对多个结果的评分,选择出评分较大的结果,尽可能早地删除掉不正确的结果,从而加快汉语分析的速度,减少分析的空间消耗,提高分析的正确率。     

Almost periodic processes with conflict control with many participants

For a stationary process with conflict control with equal opportunities of the participants, sufficient conditions of the capture of an evader by a group consisting of a given number pursuers are obtained.     

In with the New, Out with the Old

Outgoing Editor-in-Chief John Dill and incoming Editor-in-Chief Maureen Stone discuss the magazine's successes and its future.     

Image steganalysis with entropy hybridized with chaotic grasshopper optimizer

We propose a hybrid grasshopper optimizer to reduce the size of the feature set in the steganalysis process using information theory and other stochastic optimization techniques. This paper results from the stagnancy of local minima and slow convergence rate by the grasshopper algorithm in optimization problems. Therefore, we enhance the grasshopper optimization (GOA) performance with chaotic maps to make it Chaotic GOA (CGOA). Then, we combine the CGOA with adaptive particle swarm optimization (APSO) to make it Chaotic Particle-Swarm Grasshopper Optimization Algorithm (CPGOA). Next, we use the proposed optimizer with entropy to find the best feature subset of the original Subtractive Pixel Adjacency Model (SPAM) and Spatial Rich Model (SRM) feature set. Finally, the proposed technique is experimented with to detect the spatial domain steganography with different embedding rates on the BOSSbase 1.01 grayscale image database. The results show the improved results from the proposed hybrid optimizer compared to the original GOA and other state-of-the-art feature selection methods in steganalysis.

     

基于UML MARTE处理AADL的端到端流延迟

AADL和MARTE都支持对实时嵌入式系统形式化建模的分析。利用MARTE的时间模型设备,研究MARTE是如何对实时嵌入式系统的建模和分析的,能够比较准确的通过事件或者数据端口的端到端流延迟分析,表达AADL周期性或非周期性任务。