On approximate decidability of minimal programs

An index $e$ in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from $e$. Since the 1960's it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our first question, regarding the set of minimal indices, is whether there exists an algorithm which can correctly label 1 out of $k$ indices as either minimal or non-minimal. Our second question, regarding the function which computes minimal indices, is whether one can compute a short list of candidate indices which includes a minimal index for a given program. We give some negative results and leave the possibility of positive results as open questions

Extension of the MIRS computer package for the modeling of molecular spectra : from effective to full ab initio ro-vibrational hamiltonians in irreducible tensor form

The MIRS software for the modeling of ro-vibrational spectra of polyatomic molecules was considerably extended and improved. The original version (Nikitin, et al. JQSRT, 2003, pp. 239--249) was especially designed for separate or simultaneous treatments of complex band systems of polyatomic molecules. It was set up in the frame of effective polyad models by using algorithms based on advanced group theory algebra to take full account of symmetry properties. It has been successfully used for predictions and data fitting (positions and intensities) of numerous spectra of symmetric and spherical top molecules within the vibration extrapolation scheme. The new version offers more advanced possibilities for spectra calculations and modeling by getting rid of several previous limitations particularly for the size of polyads and the number of tensors involved. It allows dealing with overlapping polyads and includes more efficient and faster algorithms for the calculation of coefficients related to molecular symmetry properties (6C, 9C and 12C symbols for C_{3v}, T_{d}, and O_{h} point groups) and for better convergence of least-square-fit iterations as well. The new version is not limited to polyad effective models. It also allows direct predictions using full ab initio ro-vibrational normal mode hamiltonians converted into the irreducible tensor form. Illustrative examples on CH_{3} D, CH_{4}, CH_{3} Cl, CH_{3} F and PH_{3} are reported reflecting the present status of data available. It is written in C++ for standard PC computer operating under Windows. The full package including on-line documentation and recent data are freely available at [http://www.iao.ru/mirs/mirs.htm] or [http://xeon.univ-reims.fr/Mirs/||http://xeon.univ-reims.fr/Mirs/] or [http://icb.u-bourgogne.fr/OMR/SMA/SHTDS/MIRS.html].Comment: Journal of Quantitative Spectroscopy and Radiative Transfer (2012) xxx-xx

The Center for the Public Domain: A Short-Lived Venture Philanthropy

Case study examines a foundation that was conceived as a "venture philanthropy" that would spend down its assets over a relatively brief time in support of its mission to redefine the open source technology movement as a philosophy and apply it to sectors outside of technology

Direct Farm-to-Institution Marketing: The Common Challenges and Keys to Success of Northeast Producers

This research discovers what are the shared barriers Northeast producers engaged in the institutional market consistently face and what enables them to establish, maintain and strengthen a sales relationship with institutions. The findings can help producers understand the challenges and opportunities, how and when to approach, and provide strategies to enhance their success with the institutional market. The research concludes with implications for non-grower farm-to-institution stakeholders. The common challenges producers faced in establishing, maintaining and strengthening institutional sales relationships included buyers who focus on low price points, uncommitted buyers, food service management companies, demand for processed products and laws and regulations. Producers have been able to overcome some or all of these barriers with institutions through having wholesale experience and systems that allow producers to better access and serve institutional markets because of the product consistency, and lower price points they can provide. Producers have successfully established, maintained and strengthened relationships with champion buyers through effective initial and on-going communication that result in product satisfaction

Learning to Play Othello with N-Tuple Systems

This paper investigates the use of n-tuple systems as position value functions for the game of Othello. The architecture is described, and then evaluated for use with temporal difference learning. Performance is compared with previously de-veloped weighted piece counters and multi-layer perceptrons. The n-tuple system is able to defeat the best performing of these after just five hundred games of self-play learning. The conclusion is that n-tuple networks learn faster and better than the other more conventional approaches

Spartan Daily December 6, 2012

Volume 139, Issue 51https://scholarworks.sjsu.edu/spartandaily/1367/thumbnail.jp

Spartan Daily, February 16, 1939

Volume 27, Issue 86https://scholarworks.sjsu.edu/spartandaily/2876/thumbnail.jp