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.     

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.     

Pulse stream VLSI neural networks

EPSILON, a large, working, VLSI device, demonstrates pulse stream methods in the wider context of analog neural networks. EPSILON uses dynamic weight storage techniques, but a nonvolatile alternative is desirable. To that end, we have developed an amorphous silicon memory, which we present in experiments incorporating the device in a modest pulse stream neural chip. We have also developed a target-based training algorithm, which we demonstrate in a prototype learning device using a realistic problem. Finally, we explore system-level problems in experiments with a second version of EPSILON in a small, autonomous robot     

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.     

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.     

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.     

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.     

Low-cost telepresence for collaborative virtual environments

We present a novel low-cost method for visual communication and telepresence in a CAVEtrade-like environment, relying on 2D stereo-based video avatars. The system combines a selection of proven efficient algorithms and approximations in a unique way, resulting in a convincing stereoscopic real-time representation of a remote user acquired in a spatially immersive display. The system was designed to extend existing projection systems with acquisition capabilities requiring minimal hardware modifications and cost. The system uses infrared-based image segmentation to enable concurrent acquisition and projection in an immersive environment without a static background. The system consists of two color cameras and two additional b/w cameras used for segmentation in the near-IR spectrum. There is no need for special optics as the mask and color image are merged using image-warping based on a depth estimation. The resulting stereo image stream is compressed, streamed across a network, and displayed as a frame-sequential stereo texture on a billboard in the remote virtual environment     

A polynomial time computable metric between point sets

Measuring the similarity or distance between sets of points in a metric space is an important problem in machine learning and has also applications in other disciplines e.g. in computational geometry, philosophy of science, methods for updating or changing theories, . Recently Eiter and Mannila have proposed a new measure which is computable in polynomial time. However, it is not a distance function in the mathematical sense because it does not satisfy the trian gle inequality. We introduce a new measure which is a metric while being computable in polynomial time. We also present a variant which computes a normalised metric and a variant which can associate different weights with the points in the set. Received: 18 October 1999 / 8 January 2001     

Visiting Byzantine Agreement underlying Ad Hoc environment

The Mobile Ad Hoc Network (MANET) has become more popular because the MANET is a self-organizing, self-configuring, and an instantly deployable multi-hop wireless network that responds to application needs without any fixed infrastructure. Moreover, the MANET is fault-tolerant and reliable. A mechanism is needed in the MANET that allows a set of nodes to agree on a common value. The distributed Byzantine Agreement (BA) problem is one of the most important issues in designing a fault-tolerant system. In many cases, reaching a common agreement among fault-free nodes in coping with the influence from faulty components is crucial in a fault-tolerant system. When a common agreement is achieved, all fault-free nodes in the system can produce stable results without any influence from the faulty components. In this study, the BA problem is visited in a MANET, in which the components are subject to a malicious fault. The proposed protocol can tolerate the maximum number of allowable faulty nodes using a minimum number of message exchange rounds. Each fault-free node can reach a common agreement value for the BA problem in a MANET. The text was submitted by the authors in English.     

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.     

判别线面相交及面面相交可见性的假想墙法

针对判别直线与平面相交及平面与平面相交的可见性提出了一种假想墙的方法。 在直线与平面相交问题中探讨了 3 种典型的情况：一般位置直线与特殊位置平面相交、一般位 置直线与一般位置平面相交、特殊位置直线与一般位置平面相交;在平面与平面相交的问题中 探讨了 3 种典型的情况：特殊位置平面与特殊位置平面相交、一般位置平面与特殊位置平面相 交、一般位置平面与一般位置平面相交。通过假想墙方法,可快速准确地判断直线与平面相交 及平面与平面相交的可见性,为机械制图课程相关内容的学习及教学提供一些参考。     

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.     

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.     

OpenHCI for USB浅析

在嵌入式操作系统上实现USB Host可以使数码相机、新型手机和PDA脱离开PC直接与打印机和扫描仪等设备实现互连。如果能将USB Host内置于数码相机中,就能够将数码相机中的照片直接输出给USB打印机。本文对USB Host系统软件的协议框架OpenHCI进行了简单剖析。     

The Possibilities of Community OR in a Third World Country

This paper shows a few possibilities for the application of Community OR in a Third World country based on experience in Venezuela. These possibilities are discussed in a framework of the relationship between the state and community organizations. Emphasis lies in showing that Community OR in Venezuela requires a deep critical commitment to emancipation in order to help community organizations develop in a rather hostile environment. Lastly, results in dealing with community organizations in Venezuela using the Interpretive Systemology approach are presented.     

基于OpenGL的网格数据三维地形鼠标取值方法

在OpenGL的三维场景模拟中,通过鼠标取点得到该点的三维坐标一直是一个难题,而在三维地形模拟中则进一步要求通过鼠标取点得到该点在地形数据中的实际值,即用鼠标取值,因此OpenGL三维地形的鼠标取值一直是这类应用程序中的难点。文章在解决实际问题的基础上实现了一种解决基于OpenGL的网格数据的三维地形的鼠标取值方法。     

A Timed Verification of the IEEE 1394 Leader Election Protocol

The IEEE 1394 architecture standard defines a high performance serial multimedia bus that allows several components in a network to communicate with each other at high speed. In the physical layer of the architecture, a leader election protocol is used to find a spanning tree with a unique root in the network topology. If there is a cycle in the network, the protocol treats this as an error situation. This paper presents a formal model of the leader election protocol in the language IOA and a correctness proof. Hereby, it is shown that under certain timing restrictions the protocol behaves correctly. The timing parameters in the IEEE 1394 standard documentation obey the restrictions found in this proof.     

PSoC-based embedded design and quartz tuning fork for low-temperature measurement system design

This article describes a commercial quartz tuning fork (QTF), 8 mm in height by 3 mm in diameter, holding a two-terminal electronic component with a nominal frequency of 32.768 kHz and 12.5 pF typical load capacitance packed in a vacuum-sealed metal container, which has been used as a sensor for low-temperature measurement with good sensitivity, repeatability, and reliability. An embedded readout design with the support of a programmable system on-chip (PSoC) and virtual instrument control program, which uses a personal computer as an input/output device, provides online data acquisition of the QTF frequency data, which will in turn provide the measurement of the low-temperature bath in which the QTF is immersed. The embedded PSoC readout captures the varying frequency signals from the QTF as a response to the measurement temperature, processes it, and sends the frequency value to a personal computer, where LabVIEW, a graphical language ("G" language), displays the data in a graphical format. The QTFs for low temperature (300 K to 77 K) are well studied, whereas a sensor using a PSoC embedded design as a readout is a novel design implementation.     

A constructive algorithm to solve "convex recursive deletion" (CoRD) classification problems via two-layer perceptron networks.

A sufficient condition that a region be classifiable by a two-layer feedforward neural net (a two-layer perceptron) using threshold activation functions is that either it be a convex polytope or that intersected with the complement of a convex polytope in its interior, or that intersected with the complement of a convex polytope in its interior or... recursively. These have been called convex recursive deletion (CoRD) regions. We give a simple algorithm for finding the weights and thresholds in both layers for a feedforward net that implements such a region. The results of this work help in understanding the relationship between the decision region of a perceptron and its corresponding geometry in input space. Our construction extends in a simple way to the case that the decision region is the disjoint union of CoRD regions (requiring three layers). Therefore this work also helps in understanding how many neurons are needed in the second layer of a general three-layer network. In the event that the decision region of a network is known and is the union of CoRD regions, our results enable the calculation of the weights and thresholds of the implementing network directly and rapidly without the need for thousands of backpropagation iterations.