C^＋＋中＋＋运算符重载的研究与设计

本文对Ｃ＾＋＋中的＋＋（－－）运算符的重载进行了深入研究，对于有序可数的离散事件，提出了一套应用＋＋（－－）运算符求后继的方法，以素数和Ａｃｋｅｒｍａｎｎ函数为例，探讨了＋＋（－－）运算符的前缀形式和后缀形式的重载技巧，并给出了类定义实例。     

DC＋＋：具有分布并行机制的C＋＋

ＤＣ＋＋是一种具有分布并行设施的面对向对象编程语言。它是由面向对象语言Ｃ＋＋向上兼容扩充得到的。本文介绍ＤＣ＋＋语言的设计与实现。     

C＋＋程序设计教学研究

C＋＋语言程序设计是计算机专业的一门主干课程。本文根据教学实践，分析总结得出优秀的教学模式应该以程序设计为主线、以C＋＋语言语法规则为辅，灵活地运用多种方法进行课堂教学；且注意加强实践技术技能的训练，重视面向对象思想的培养，在应用中提高学生分析问题、编程解决问题的能力。     

MicrosoftC／C＋＋和BorlandC＋＋编程环境比较

本文从ＭｉｃｒｏｓｏｆｔＣ／Ｃ＋＋和ＢｏｒｌａｎｄＣ＋＋在编程环境，编程工具，内存模式，关键字，浮点数结构等方面的详细比较，旨在为程序员提供一些资料，帮助编程环境转换。     

动态C^＋＋对象的复用

机械设计目前已全面应用ＣＡＤ方法即借助电脑软件实现建模及修改等。为了利用Ｃ＋＋的类封装机制，人们常常开发基于Ｃ＾＋＋的高层面向对象语言来编制机械设计软件。带有虚拟函数或虚拟基类的Ｃ＾＋＋对象包含动态内存指针，这些指针超出创建它们程序生存期即告无效，但开发基于Ｃ＾＋＋的高层面向对象语言必须使用稳固对象。本文分析隐含指针问题并讨论实现对象转储的途径。     

C＋＋与FoxPro混合程序设计技术

本文讨论了Ｃ＋＋与ＦｏｘＰｒｏ混合程序设计技术，阐明了用Ｃ＋＋语言修改Ｆｏｘ－Ｐｒｏ内存变量的技巧，论述了用Ｃ＋直接读取数据库文件的方法，并且给出了关键程序。     

V2C＋＋——一个用C＋＋实现的VHDL翻译型模拟器

由于面向对象的Ｃ＋＋语言更贴近描述硬件对象的ＶＨＤＬ语言Ｃ＋＋实现翻译型ＶＨＤＬ模拟器，并利用Ｃ＋＋本身的编译器的优化功能，可以得到运行的时间和空间方面效率较高的ＶＨＤＬ模拟器，Ｖ２Ｃ＋＋的原型设计和初步实践表明，用Ｃ＋＋实现ＶＨＤＬ翻译性模拟器比解释性模拟器具有较高效率，利于较大规模的电路的模拟。     

Microsoft Visual C＋＋4.0特色一二

C或者C＋十是当今最为重要的编程语言，其作为开发工具一向是大软件厂商的必争之地。以往BOrland的产品总被公认略胜一筹。但自93年推出VisualC＋十以来，Microsoft渐渐地占了上风，进入96年后，Microsoft又接踵推出了VC＋＋4．0、4．正和4．2版本，使它的竞争优势进一步得到了加强。下面介绍的VC＋＋4．X版的新功能，虽然只是其中的一部分，但仍能对它的强大功能有所了解。DeveloperStudio——既熟悉又陌生的开发环境VC＋＋4．0的最大变化莫过于它采用了一个独立于VC＋＋，又与VC＋十紧密集成的新开发环境，即DeveloperStudio。…     

用C^＋＋绘制多种二维曲线

二维曲线在计算机应用中是经常使用的。本文介绍用Ｃ＾＋＋及其面向对象方法实现各种参数化曲线的技术，并给出了主要的Ｃ＾＋＋源程序。     

WIN32下C＋＋与VFP间通信

介绍了ＶｉｓｕａｌＦｏｘｐｒｏ与Ｃ＋＋程序间的动态数据交换方法,并引用了具体实例详细介绍了ＶＦＰ与Ｃ＋＋程序之间的数据交换方法。     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

A simulation-based heuristic algorithm for disposition of direction finders

A direction finder is a military weapon that is used to find locations of targets that emit radio frequencies. Multiple direction finders are used in a direction finder system for finding locations of targets in an area of interest. We present a two-stage heuristic algorithm for disposing direction finders in a direction finder system for the objective of maximizing the accuracy of estimation of the location of a target that is assumed to be located in the area of interest. In the suggested heuristic algorithm, a simulation-based method is used for estimating the probability of coverage, the probability that a target is in a given region (of a given size) surrounding the estimated location of the target, and another simulation-based method and a local search method are used to determine locations of direction finders that result in the maximum probability of coverage. Performance of the suggested algorithm is evaluated through computational experiments and results show that the algorithm gives a good disposition plan in a reasonable amount of computation time.     

Visual displays: the highlighting paradox

Office computer users view well over a billion displays in a given year. The savings of only a fraction of a second in the time it takes users to process each display can potentially lead to enormous time and cost savings. In recent research investigators have shown that on average subjects are quicker to find a target option in a highlighted display than in a display without highlighting. Paradoxically, in related research other investigators have shown that subjects are slower to find a target in a highlighted display than in a display without highlighting. In an attempt to resolve this paradox, an additional set of experiments was performed. Results from these experiments suggest that in order to determine whether highlighting will be of benefit, one must know the type of highlighting, the level of highlighting validity, and the probability that subjects attend first to the highlighted options.     

Fermion confinement induced by geometry

We consider a five-dimensional model in which fermions are confined in a hypersurface due to an interaction with a purely geometric field. Inspired by the Rubakov-Shaposhnikov field-theoretical model, in which massless fermions can be localized in a domain wall through the interaction of a scalar field, we show that particle confinement may also take place if we endow the five-dimensional bulk with a Weyl integrable geometric structure, or if we assume the existence of a torsion field acting in the bulk. In this picture, the kind of interaction considered in the Rubakov-Shaposhnikov model is replaced by an interaction of fermions with a geometric field, namely a Weyl scalar field or a torsion field. We show that in both cases the confinement is independent of the energy and mass of the fermionic particle. We generalize these results to the case in which the bulk is an arbitrary n-dimensional curved space.     

Motion of a rigid cylinder between parallel plates in stokes flow : Part 1: Motion in a quiescent fluid and sedimentation

A general numerical scheme for solution of two-dimensional Stokes equations in a multiconnected domain of arbitrary shape [1, 2] is applied to the motion of a rigid circular cylinder between plane parallel boundaries. Numerically generated boundary-conforming coordinates are used to transform the flow domain into a domain with rectilinear boundaries. The transformed Stokes equations in vorticity-stream function form are then solved on a uniform grid using an iterative algorithm. In Part I coefficients of the resistance matrix representing the forces and torque on the cylinder due to its translational motion parallel or perpendicular to the boundaries or due to rotation about its axis are calculated. The solutions are obtained for a wide range of particle radii and positions across the channel. It is found that the force on a particle translating parallel to the boundaries without rotation exhibits a minimum at a position between the channel centerline and the wall and a local maximum on the centerline.

The resistance matrix is utilized to calculate translational and angular velocities of a free particle settling under gravity in a vertical channel. It is found that the translational velocity has a maximum at some lateral position and a minimum on the centerline; the particle angular velocity is opposite in sign to that of a particle rolling along the nearer channel wall except when the gap between the particle and the wall is very small. These results are compared with existing analytical solutions for a small cylindrical particle situated on the channel centerline, and with solutions of related 3-D problems for a spherical particle in a circular tube and in a place channel. It is shown that the behavior of cylindrical and spherical particles in a channel in many cases is qualitatively different. This is attributed to different flow patterns in these two cases. The motion of a spherical particle in a circular tube has qualitative and quantitative features similar to those for a cylindrical particle in a plane channel.     

Optical merger of direct vision with virtual images for scaled teleoperation

Scaled teleoperation is increasingly prevalent in medicine, as well as in other applications of robotics. Visual feedback in such systems is essential and should make maximal use of natural hand-eye coordination. This paper describes a new method of visual feedback for scaled teleoperation in which the operator manipulates the handle of a remote tool in the presence of a registered virtual image of the target in real time. The method adapts a concept already used successfully in a new medical device called the sonic flashlight, which permits direct in situ visualization of ultrasound during invasive procedures. The sonic flashlight uses a flat-panel monitor and a half-silvered mirror to merge the visual outer surface of a patient with a simultaneous ultrasound scan of the patient's interior. Adapting the concept to scaled teleoperation involves removing the imaging device and the target to a remote location and adding a master-slave control device. This permits the operator to see his hands, along with what appears to be the tool, and the target, merged in a workspace that preserves natural hand-eye coordination. Three functioning prototypes are described, one based on ultrasound and two on light microscopy. The limitations and potential of the new approach are discussed.     

Completing codes in a sofic shift

We define a code in a sofic shift as a set of blocks of symbols of the shift such that any block of the shift has at most one decomposition into code words. It is maximal if it is not strictly included in another one. Such a code is complete in the sofic shift if any block of the shift occurs within some concatenation of code words. We prove that a maximal code in an irreducible sofic shift is complete in this shift. We give an explicit construction of a regular completion of a regular code in a sofic shift. This extends the well known result of Ehrenfeucht and Rozenberg to the case of codes in sofic systems. We also give a combinatorial proof of a result concerning the polynomial of a code in a sofic shift.     

Dynamic setup scheduling and flow control in manufacturing systems

We propose a method for flow control of parts in a manufacturing system with machines that require setups. The setup scheduling problem is investigated in the context of a multilevel hierarchy of discrete events with distinct frequencies. The higher level of the hierarchy calculates a target trajectory in the surplus/backlog space of the part types which must be tracked at the level of setups. We consider a feedback setup scheduling policy which usescorridors in the surplus/backlog space of the part types to determine the timing of the set-up changes in order to guide the trajectory in the desired direction. An interesting case in which the trajectory leads to a target point (e.g., a hedging point) is investigated in detail. It is shown that in this case the surplus/backlog trajectory at the setup level can lead to a limit cycle. Conditions for linear corridors which result in a stable limit cycle are determined.     

Reinterpretable Imager: Towards Variable Post‐Capture Space,Angle and Time Resolution in Photography

We describe a novel multiplexing approach to achieve tradeoffs in space, angle and time resolution in photography. We explore the problem of mapping useful subsets of time‐varying 4D lightfields in a single snapshot. Our design is based on using a dynamic mask in the aperture and a static mask close to the sensor. The key idea is to exploit scene‐specific redundancy along spatial, angular and temporal dimensions and to provide a programmable or variable resolution tradeoff among these dimensions. This allows a user to reinterpret the single captured photo as either a high spatial resolution image, a refocusable image stack or a video for different parts of the scene in post‐processing. A lightfield camera or a video camera forces a‐priori choice in space‐angle‐time resolution. We demonstrate a single prototype which provides flexible post‐capture abilities not possible using either a single‐shot lightfield camera or a multi‐frame video camera. We show several novel results including digital refocusing on objects moving in depth and capturing multiple facial expressions in a single photo.     

A method for taxonomy development and its application in information systems

A fundamental problem in many disciplines is the classification of objects in a domain of interest into a taxonomy. Developing a taxonomy, however, is a complex process that has not been adequately addressed in the information systems (IS) literature. The purpose of this paper is to present a method for taxonomy development that can be used in IS. First, this paper demonstrates through a comprehensive literature survey that taxonomy development in IS has largely been ad hoc. Then the paper defines the problem of taxonomy development. Next, the paper presents a method for taxonomy development that is based on taxonomy development literature in other disciplines and shows that the method has certain desirable qualities. Finally, the paper demonstrates the efficacy of the method by developing a taxonomy in a domain in IS.