𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extend the product cycle

✍ Scribed by Gilbert Held


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
66 KB
Volume
9
Category
Article
ISSN
1055-7148

No coin nor oath required. For personal study only.

✦ Synopsis


From the Editor

Extend the Product Cycle

O

ver the past few years network managers and LAN administrators have had to cope with a never-ending series of hardware and software upgrades, revisions, fixes, and service packs. Just when you finally configured that new PC and server to participate on the LAN and become reachable via the corporate frame relay connection, it seems that one or more vendors will announce a new product with great fanfare or place a software patch or service pack on their Web site with minimal notification, even though such software may be what is necessary to correct one or more problems your network users periodically encounter.

While it is just plain wrong to hamper innovation, I sincerely believe product cycles are far too short. By the time an organization appears to have evaluated, installed, learned to work with and trained their base of end-users to work with version x of a product, typically version xC1 or x.1 is announced. This rush to the marketplace with ever-decreasing product life cycles is most expensive for organizations in terms of training, budgeting, and effort. While truly innovative products will always find a receptive audience, do we really need three-month, six-month, or even yearly product upgrades? In my opinion vendors would better serve their customer base by better planning the features to incorporate into their major product releases and by extending the time between releases. This approach will also allow them the luxury of time to do that 'minor' item that most vendors forget about -consult with their customer base to determine those features users of their products would like to have in future revisions! As a beta tester of several popular software programs, I am always amazed that many vendors release a new upgrade for testing to its cadre of testers without asking them for feedback concerning features to place in the next release. While beta testing is primarily oriented towards locating bugs, those testers also have the experience of working with the product over a period of cycles that could be put to good use to denote potential product changes. Perhaps if vendors would focus their attention more on the features of their products and obtain greater feedback from customers and testers instead of keeping their eyes on the competitor's product cycle, we wouldn't have the large number of patches, fixes, recovery modules, and service packs to apply. As my Macon TV announcer would say: 'That's my opinion. What's yours?' -Gilbert Held


πŸ“œ SIMILAR VOLUMES


Paths extendable to cycles
✍ T. D. Parsons πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract Let __k__ be a positive integer, and __S__ a nonempty set of positive integers. Suppose that __G__ is a connected graph containing a path of length __k__, and that each path __P__ of length __k__ in __G__ is contained in some cycle __C__(__P__) of length s ∈ __S__. We prove that every p

Hamiltonian cycles in n-extendable graph
✍ Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 88 KB

## Abstract A graph __G__ of order at least 2__n__+2 is said to be __n__‐extendable if __G__ has a perfect matching and every set of __n__ independent edges extends to a perfect matching in __G__. We prove that every pair of nonadjacent vertices __x__ and __y__ in a connected __n__‐extendable graph

Orthogonal double covers by super-extend
✍ Christian Bey; Sven Hartmann; Uwe Leck; Volker Leck πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 115 KB

## Abstract An Orthogonal Double Cover (ODC) of the complete graph __K__~__n__~ by an almost‐hamiltonian cycle is a decomposition of 2__K__~__n__~ into cycles of length __n__βˆ’1 such that the intersection of any two of them is exactly one edge. We introduce a new class of such decompositions. If __n

Search for relationship between duration
✍ A.G. Tlatov πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 102 KB πŸ‘ 1 views

## Abstract Duration of the extended solar cycles is taken into the consideration. The beginning of cycles is counted from the moment of polarity reversal of large‐scale magnetic field in high latitudes, occurring in the sunspot cycle n till the minimum of the cycle __n__ + 2. The connection betwee