@InProceedings{	  argyropoulos_microprocessors_1983,
  location	= {Finland},
  title		= {Microprocessors and Arithmetic Processors in Metallurgical
		  Applications},
  pages		= {537--552},
  booktitle	= {Proc. of {IFAC}, 4th {MMM} Symposium on Automation in
		  Mining Mineral and Metal Processing},
  author	= {Argyropoulos, S. A. and Ananthanarayanan, K. and Valiveti,
		  R. S.},
  editor	= {{T.Westerlund}},
  date		= {1983}
}

@Article{	  argyropoulos_facility_1983,
  title		= {A Facility for Local and Remote Acquisition and Data
		  Process Control in Metallurgy},
  volume	= {35},
  issn		= {1543-1851},
  url		= {https://doi.org/10.1007/BF03338387},
  doi		= {10.1007/BF03338387},
  abstract	= {Accurate measurement and control for low-level transducer
		  signals in metallurgical industry or laboratory is a
		  complicated process. Until now, no measurement and control
		  system was working truly at optimum cost and performance
		  for a relatively small number of channels. A facility for
		  remote and local data acquisition and process control
		  applications in harsh metallurgical environments is
		  presented in this paper. The system consists of a satellite
		  microperipheral for interfacing between the “real
		  world” and a host microcomputer. The satellite can
		  operate far away from the host. Software and hardware
		  aspects of this facility are presented. Metallurgical
		  applications in four research projects ranging from
		  laboratory tests to plant-scale tests are discussed.},
  pages		= {30--35},
  number	= {10},
  journaltitle	= {Journal of Metals},
  author	= {Argyropoulos, Stavros A. and Valiveti, Radhakrishna S. and
		  Closset, Bernard M.},
  date		= {1983-10-01}
}

Accurate measurement and control for low-level transducer signals in metallurgical industry or laboratory is a complicated process. Until now, no measurement and control system was working truly at optimum cost and performance for a relatively small number of channels. A facility for remote and local data acquisition and process control applications in harsh metallurgical environments is presented in this paper. The system consists of a satellite microperipheral for interfacing between the “real world” and a host microcomputer. The satellite can operate far away from the host. Software and hardware aspects of this facility are presented. Metallurgical applications in four research projects ranging from laboratory tests to plant-scale tests are discussed.

@InProceedings{	  argyropoulos_development_1984,
  title		= {Development of a Microprocessor Based System for Mining
		  and Metallurgical Applications},
  volume	= {77},
  pages		= {92--94},
  booktitle	= {{CIM} Bulletin},
  author	= {Argyropoulos, S. A. and Valiveti, R. S. and Closset, B.
		  M.},
  date		= {1984-10},
  note		= {Issue: 870}
}

@InProceedings{	  valiveti_new_1989,
  location	= {Hong Kong},
  title		= {A New Metric for Determining Dependence Trees for Pattern
		  Recognition},
  pages		= {474--479},
  booktitle	= {Proc. of International Conference on Computer Architecture
		  and Digital Signal Processing ({CA}-{DSP})},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1989-10}
}

@InProceedings{	  oommen_fast_1990,
  location	= {Charleston, South Carolina},
  title		= {A Fast Learning Automaton Solution to the Keyboard
		  Optimization Problem},
  isbn		= {0-89791-372-8},
  url		= {http://doi.acm.org/10.1145/98894.99108},
  doi		= {10.1145/98894.99108},
  series	= {{IEA}/{AIE} '90},
  pages		= {981--990},
  booktitle	= {Proc. of the Third International Conf. on Industrial
		  Engineering Applications of Artificial Intelligence and
		  Expert Systems ({IEA}/{AIE}-90)},
  publisher	= {{ACM}},
  author	= {Oommen, B. J. and Valiveti, R. S. and Zgierski, J.},
  date		= {1990-07},
  note		= {event-place: Charleston, South Carolina, {USA}}
}

@InProceedings{	  valiveti_problem_1990,
  location	= {Princeton, {NJ}},
  title		= {On the Problem of Recognizing Sources Which Generate
		  Random Strings},
  pages		= {972--977},
  booktitle	= {Proc. of the 24th Conference on Information Systems and
		  Sciences},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1990-03}
}

@InProceedings{	  valiveti_optimality_1990,
  location	= {Hawaii},
  title		= {The Optimality of the Chi-squared statistic for
		  Determining Dependence in Normal Vectors},
  pages		= {375--378},
  booktitle	= {Proc. of Intl. Symp. on Inform. Theory and its
		  applications ({ISITA} 90)},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1990-11}
}

@Article{	  valiveti_recognizing_1991,
  title		= {Recognizing sources of random strings},
  volume	= {13},
  pages		= {386--394},
  number	= {4},
  journaltitle	= {{IEEE} transactions on pattern analysis and machine
		  intelligence},
  author	= {Valiveti, Radhakrishna S and Oommen, B John},
  date		= {1991}
}

@Article{	  oommen_adaptive_1991,
  title		= {An adaptive learning solution to the keyboard optimization
		  problem},
  volume	= {21},
  issn		= {0018-9472},
  doi		= {10.1109/21.135704},
  abstract	= {The authors consider the problem of assigning more than
		  one symbol of a finite alphabet A to the same key on a
		  keyboard. Since multiple symbols of the alphabet A reside
		  on the same key, the representations of all the words in a
		  finite dictionary H need not be unique. The problem is one
		  of optimally assigning the symbols of the alphabet to the
		  keys of a given keyboard with a view to minimize the total
		  number of words that have ambiguous representation. The
		  problem is proven to be {NP}-hard. After presenting the
		  only reported solution to the problem, a fast
		  learning-automaton-based solution to this problem is
		  reported. Experimental results demonstrating the power of
		  this solution are presented.{\textless}{\textgreater}},
  pages		= {1608--1618},
  number	= {6},
  journaltitle	= {{IEEE} Transactions on Systems, Man, and Cybernetics},
  author	= {Oommen, B. J. and Valiveti, R. S. and Zgierski, J. R.},
  date		= {1991-11}
}

The authors consider the problem of assigning more than one symbol of a finite alphabet A to the same key on a keyboard. Since multiple symbols of the alphabet A reside on the same key, the representations of all the words in a finite dictionary H need not be unique. The problem is one of optimally assigning the symbols of the alphabet to the keys of a given keyboard with a view to minimize the total number of words that have ambiguous representation. The problem is proven to be NP-hard. After presenting the only reported solution to the problem, a fast learning-automaton-based solution to this problem is reported. Experimental results demonstrating the power of this solution are presented.\textless\textgreater

@InProceedings{	  valiveti_syntactic-statistical_1991,
  location	= {Zurich, Switzerland},
  title		= {A Syntactic-Statistical Pattern Recognition Approach to
		  Distinguishing between Encryption Keys},
  pages		= {122--124},
  booktitle	= {Proc. of {IASTED} Intl. Symp. on Artificial Intelligence
		  Applications and Neural Networks},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1991-07}
}

@InProceedings{	  valiveti_new_1991,
  location	= {Santiago, Chile},
  title		= {New absorbing and Ergodic Doubly-Linked Reorganizing
		  Heuristics},
  pages		= {170--181},
  booktitle	= {Proc. of Eleventh {SCCC} Intl. Conf. on Computer Science},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1991-10}
}

@InProceedings{	  valiveti_measuring_1991,
  location	= {Urbana Champaign, {IL}},
  title		= {On Measuring Presortedness in Ensembles of Data
		  Sequences},
  pages		= {518--523},
  booktitle	= {Proc. of Twenty-ninth Allerton Conf. on Communication,
		  Control, and Computing},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1991-10}
}

@InProceedings{	  valiveti_move--front_1991,
  location	= {Antalya, Turkey},
  title		= {The Move-to-Front Heuristic for Non-stationary Query
		  Distributions},
  pages		= {105--114},
  booktitle	= {Proc. of Sixth Intl. Symp. on Computer and Information
		  Sciences ({ISCIS} {VI})},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1991-10}
}

@InProceedings{	  valiveti_adaptive_1991,
  location	= {Berlin, Heidelberg},
  title		= {Adaptive linear list reorganization for a system
		  processing set queries},
  isbn		= {978-3-540-38391-8},
  abstract	= {The problem of reorganizing a linear list, when the
		  individual records are accessed independently, has been
		  well studied. In this paper, self-organizing linear list
		  heuristics are examined under a more general query system
		  which allows accesses to any subset of the list of
		  elements. We propose a pragmatic model for the query
		  generator, characterized by a set of parameters of size
		  equal to the number of elements in the list. We derive the
		  distribution of accesses to the individual records of the
		  list, and show that these accesses are statistically
		  dependent. Throughout this paper, the set accesses are
		  processed by serializing the set elements.},
  pages		= {405--414},
  booktitle	= {Fundamentals of Computation Theory},
  publisher	= {Springer Berlin Heidelberg},
  author	= {Valiveti, R. S. and Oommen, B. J. and Zgierski, J. R.},
  editor	= {Budach, L.},
  date		= {1991}
}

The problem of reorganizing a linear list, when the individual records are accessed independently, has been well studied. In this paper, self-organizing linear list heuristics are examined under a more general query system which allows accesses to any subset of the list of elements. We propose a pragmatic model for the query generator, characterized by a set of parameters of size equal to the number of elements in the list. We derive the distribution of accesses to the individual records of the list, and show that these accesses are statistically dependent. Throughout this paper, the set accesses are processed by serializing the set elements.

@Article{	  valiveti_using_1992,
  title		= {On using the chi-squared metric for determining stochastic
		  dependence},
  volume	= {25},
  pages		= {1389--1400},
  number	= {11},
  journaltitle	= {Pattern Recognition},
  author	= {Valiveti, Radhakrishna S and Oommen, B John},
  date		= {1992},
  note		= {Publisher: Elsevier}
}

@InProceedings{	  dehne_construction_1992,
  title		= {Construction of d-Dimensional Hyperoctrees on a Hypercube
		  Multiprocessor},
  pages		= {373--381},
  booktitle	= {Proc. of 30th Allerton Conference on Communication,
		  Control and Computing},
  author	= {Dehne, F. and Fabri, A. and Nassar, M. and Rau-Chaplin, A.
		  and Valiveti, R. S.},
  date		= {1992-09}
}

@InProceedings{	  valiveti_doubly-linked_1992,
  location	= {Santiago, Chile},
  title		= {A Doubly-Linked List Reorganization Heuristic with
		  Stochastic Move-to-End operations},
  pages		= {249--257},
  booktitle	= {Proc. of the Twelfth {SCCC} Intl. Conf. on Computer
		  Science},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1992-10}
}

@Article{	  valiveti_determining_1993,
  title		= {Determining Stochastic Dependence for Normally Distributed
		  Vectors Using the Chi-Squared Metric},
  volume	= {26},
  issn		= {0031-3203},
  url		= {http://www.sciencedirect.com/science/article/pii/0031320393900622},
  doi		= {https://doi.org/10.1016/0031-3203(93)90062-2},
  abstract	= {A fundamental problem in information theory and pattern
		  recognition involves computing and estimating the
		  probability density function associated with a set of
		  random variables. In estimating this density function, one
		  can either assume that the form of the density function is
		  known, and that we are merely estimating parameters that
		  characterize the distribution or that no information about
		  the density function is available. This problem has been
		  extensively studied if the random variables are
		  independent. If the random variables are dependent and are
		  of the discrete sort, the problem of capturing this
		  dependence between variables has been studied in Chow and
		  Liu ({IEEE} Trans. Inf. Theory14, 462–467 (May 1968)).
		  The analogous problem for normally distributed continuous
		  random variables has been tackled in Chow et al. (Comput.
		  Biomed. Res.12, 589–613 (1979)). In both these instances,
		  the determination of the best dependence tree hinges on the
		  well-known Expected Mutual Information Measure ({EMIM})
		  Metric. Recently Valiveti and Oommen studied the
		  suitability of the chi-squared based metric in-lieu of the
		  {EMIM} metric, for the discrete variable case (Pattern
		  Recognition25, 1389–1400 (1992)). In this paper, we
		  generalize the latter result and study the use of the
		  chi-squared metric for determining dependence trees for
		  normally distributed random vectors. We show that for such
		  vectors, the chi-squared metric yields the optimal tree and
		  that it is identical to the one obtained using the {EMIM}
		  metric. The computation of the maximum likelihood estimate
		  of the dependence tree is also discussed.},
  pages		= {975--987},
  number	= {6},
  journaltitle	= {Pattern Recognition},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1993}
}

A fundamental problem in information theory and pattern recognition involves computing and estimating the probability density function associated with a set of random variables. In estimating this density function, one can either assume that the form of the density function is known, and that we are merely estimating parameters that characterize the distribution or that no information about the density function is available. This problem has been extensively studied if the random variables are independent. If the random variables are dependent and are of the discrete sort, the problem of capturing this dependence between variables has been studied in Chow and Liu (IEEE Trans. Inf. Theory14, 462–467 (May 1968)). The analogous problem for normally distributed continuous random variables has been tackled in Chow et al. (Comput. Biomed. Res.12, 589–613 (1979)). In both these instances, the determination of the best dependence tree hinges on the well-known Expected Mutual Information Measure (EMIM) Metric. Recently Valiveti and Oommen studied the suitability of the chi-squared based metric in-lieu of the EMIM metric, for the discrete variable case (Pattern Recognition25, 1389–1400 (1992)). In this paper, we generalize the latter result and study the use of the chi-squared metric for determining dependence trees for normally distributed random vectors. We show that for such vectors, the chi-squared metric yields the optimal tree and that it is identical to the one obtained using the EMIM metric. The computation of the maximum likelihood estimate of the dependence tree is also discussed.

@Article{	  valiveti_self-organizing_1993,
  title		= {Self-organizing Doubly-linked Lists},
  volume	= {14},
  issn		= {0196-6774},
  url		= {http://www.sciencedirect.com/science/article/pii/S0196677483710059},
  doi		= {https://doi.org/10.1006/jagm.1993.1005},
  abstract	= {In this paper, we study the problem of maintaining a
		  doubly-linked list ({DLL}) in approximately optimal order,
		  with respect to the mean search time. We study two types of
		  {DLL} reorganization strategies. Move-To-End ({MTE}) [12]
		  and {SWAP} [14] are two memoryless {DLL} heuristics
		  obtained from natural extensions of the well-known
		  singly-linked-list ({SLL}) heuristics, move-to-front and
		  transposition, respectively. We first derive a general
		  sufficient condition which permits comparison of any two
		  {DLL} heuristics. We use this condition as a guideline to
		  identify families of access distributions for which {SWAP}
		  yields a lower expected cost than the {MTE}. We have also
		  presented an absorbing {DLL} heuristic. The strategy
		  requires one additional memory location and is analogous to
		  the scheme presented in [15]. The reorganization is
		  achieved by moving each element exactly once to its final
		  position in the reorganized list. The scheme is
		  stochastically absorbing and it is shown to be optimal for
		  a restricted family of distributions. Thus, for these
		  distributions, the probability of the scheme converging to
		  the optimal list order can be made as close to unity as
		  desired.},
  pages		= {88--114},
  number	= {6},
  journaltitle	= {Journal of Algorithms,},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1993}
}

In this paper, we study the problem of maintaining a doubly-linked list (DLL) in approximately optimal order, with respect to the mean search time. We study two types of DLL reorganization strategies. Move-To-End (MTE) [12] and SWAP [14] are two memoryless DLL heuristics obtained from natural extensions of the well-known singly-linked-list (SLL) heuristics, move-to-front and transposition, respectively. We first derive a general sufficient condition which permits comparison of any two DLL heuristics. We use this condition as a guideline to identify families of access distributions for which SWAP yields a lower expected cost than the MTE. We have also presented an absorbing DLL heuristic. The strategy requires one additional memory location and is analogous to the scheme presented in [15]. The reorganization is achieved by moving each element exactly once to its final position in the reorganized list. The scheme is stochastically absorbing and it is shown to be optimal for a restricted family of distributions. Thus, for these distributions, the probability of the scheme converging to the optimal list order can be made as close to unity as desired.

@Article{	  dehne_construction_1994,
  title		= {Construction of d-Dimensional Hyperoctrees on a Hypercube
		  Multiprocessor},
  volume	= {23},
  url		= {https://www.sciencedirect.com/science/article/abs/pii/S0743731584711373},
  doi		= {https://doi.org/10.1006/jpdc.1994.1137},
  pages		= {256--261},
  number	= {2},
  journaltitle	= {Journal of Parallel and Distributed Computing},
  author	= {Dehne, Frank and Fabri, Andreas and Nassar, Mostafa and
		  Rau-Chaplin, Andrew and Valiveti, Radhakrishna},
  date		= {1994-11}
}

@Article{	  valiveti_adaptive_1995,
  title		= {Adaptive Linear list Reorganization Under a Generalized
		  Query System},
  volume	= {32},
  pages		= {793--804},
  journaltitle	= {Journal of Applied Probability},
  author	= {Valiveti, R. S. and Oommen, B. J.},
  date		= {1995}
}

@InProceedings{	  anand_extending_2017,
  title		= {Extending Segment Routing into Optical Networks},
  url		= {http://www.osapublishing.org/abstract.cfm?URI=OFC-2017-Th1I.3},
  doi		= {10.1364/OFC.2017.Th1I.3},
  abstract	= {New extensions to Segment Routing are introduced here that
		  allow for an end-to-end path to include optical transport
		  network segments that steer packets across optical networks
		  for maximal performance with minimal operational changes.},
  pages		= {Th1I.3},
  booktitle	= {Optical Fiber Communication Conference},
  publisher	= {Optical Society of America},
  author	= {Anand, Madhukar and Subrahmaniam, Ramesh and Roy, Soumya
		  and Valiveti, Radhakrishna},
  date		= {2017},
  note		= {Journal Abbreviation: Optical Fiber Communication
		  Conference}
}

New extensions to Segment Routing are introduced here that allow for an end-to-end path to include optical transport network segments that steer packets across optical networks for maximal performance with minimal operational changes.

@InProceedings{	  anand_unifying_2017,
  title		= {Unifying Real-Time Telemetry for Fun and Profit in
		  Packet-Optical Networks},
  url		= {http://www.osapublishing.org/abstract.cfm?URI=Networks-2017-JTu4A.28},
  abstract	= {Emerging packet-optical networks have imposed new
		  flexibility requirements of network telemetry. We introduce
		  a framework based on programmable data planes to address
		  these requirements and unify telemetry across packet and
		  optical network segments.},
  pages		= {JTu4A.28},
  booktitle	= {Advanced Photonics 2017 ({IPR}, {NOMA}, Sensors, Networks,
		  {SPPCom}, {PS})},
  publisher	= {Optical Society of America},
  author	= {Anand, Madhukar and Subrahmaniam, Ramesh and Valiveti,
		  Radhakrishna},
  date		= {2017},
  note		= {Journal Abbreviation: Advanced Photonics 2017 ({IPR},
		  {NOMA}, Sensors, Networks, {SPPCom}, {PS})}
}

Emerging packet-optical networks have imposed new flexibility requirements of network telemetry. We introduce a framework based on programmable data planes to address these requirements and unify telemetry across packet and optical network segments.

@InProceedings{	  anand_point_2018,
  title		= {{POINT}: An Intent-Driven Framework for Integrated
		  Packet-Optical In-Band Network Telemetry},
  doi		= {10.1109/ICC.2018.8422785},
  pages		= {1--6},
  booktitle	= {2018 {IEEE} International Conference on Communications
		  ({ICC})},
  author	= {Anand, M. and Subrahmaniam, R. and Valiveti, R.},
  date		= {2018-05},
  note		= {{ISSN}: 1938-1883}
}

@InProceedings{	  sadasivarao_demonstration_2019,
  title		= {Demonstration of Advanced Open {WDM} Operations and
		  Analytics, Based on an Application-Extensible, Declarative,
		  Data Model Abstracted Instrumentation Platform},
  pages		= {1--3},
  booktitle	= {2019 Optical Fiber Communications Conference and
		  Exhibition ({OFC})},
  author	= {Sadasivarao, A. and Syed, S. and Lu, B. and Jain, S. and
		  Kunjidhapatham, A. and Gomes, P. and Valiveti, R. and
		  Paraschis, L. and Brar, J. and Raj, K.},
  date		= {2019-03}
}