Showing papers by "Techno India published in 1993"
06 Sep 1993
TL;DR: This work proposes a solution based on so-called process chunks which are generic process frames to resolve the issue stated by a generic requirements engineering (RE) situation.
Abstract: Reusability of project components, either at the code level or at the conceptual specification level, is considered a fundamental aspect in application development. More recently it as been argued that project histories can support reuse of design decisions. We propose a solution based on so-called process chunks which are generic process frames to resolve the issue stated by a generic requirements engineering (RE) situation. Chunks are classified into micro-chunks and macro-chunks. The latter support the decision making process whereas the former help in implementing the decision. The RE activity based on these chunks consists of (1) recognising a situation as belonging to the class of situations treated by a chunk and (2) the instanciation of the process frame. The benefit expected from this approach is threefold: (1) to speed up the requirements engineering process; (2) to improve the quality of the conceptual specifications; and (3) to offer an extensible way for capturing generic RE process knowledge.
19 citations
TL;DR: This paper identifies a sufficiently general class of swept objects and classify the sweep rules, and presents computational methods for directly evaluating the boundary representation which implicitly simulate the sweep process.
Abstract: Many systems support the design of two-dimensional (2D) regions and three-dimensional (3D) volumes by sweeping a generator contour over a spine Well-established and widely used rendering systems accept high-level boundary descriptions of regions and solids but not in the contour-spine form Hence the swept object design specification must be such as to lend itself to efficient evaluation of a compact and high-level boundary description In this paper, we identify a sufficiently general class of swept objects and classify the sweep rules We also present computational methods for directly evaluating the boundary representation which implicitly simulate the sweep process The boundary is generated as a set of piecewise curves/surfaces in a compact form suitable for direct input to rendering systems like Post-Script(R) in 2D and Renderman(R) in 3D
19 citations
TL;DR: In this article, a simple sinusoidal oscillator based on opamp compensation poles was proposed, which employs only four components, two internally compensated opamps, one resistor and a grounded capacitor.
Abstract: The Letter introduces a new, extremely simple, sinusoidal oscillator based on opamp compensation poles. The circuit employs only four components, two internally compensated opamps, one resistor and a grounded capacitor, and can generate sinusoidal oscillations of frequencies up to the gain bandwidth product of the opamps. with modification(s), using an additional opamp or two analogue multipliers, the circuit can be readily converted into a VCO. Experimental results and SPICE simulations have confirmed the workability of the various modes of operation of the proposed configuration.
15 citations
24 Sep 1993
Abstract: Abstract not available.
3 citations
09 Apr 1993
TL;DR: It is shown that, if the authors restrict their domain of binary images then Minkowski addition (direct sum) (also called dilation) turns out to be the addition of two such hypercomplex numbers.
Abstract: The indecomposable sets are those which cannot be expressed as a Minkowski sum in any nontrivial manner. In this paper we concentrate on the indecomposability problem for sets in the domain of binary images. We show that, it is possible to express a binary image as a hypercomplex algebraic number. More interestingly, if we restrict our domain of binary images then Minkowski addition (direct sum) (also called dilation) turns out to be the addition of two such hypercomplex numbers. In that process the indecomposability problem is transformed into a number theoretic problem. As a by-product our treatment of the problem produces an efficient algorithm for computing Minkowski addition of two binary images.
1 citations