<?xml version="1.0" encoding="UTF-8"?>
<!--Sample XML file generated by XMLSPY v2004 rel. 3 U (http://www.xmlspy.com)-->
<osel xmlns="os.optimizationservices.org" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="os.optimizationservices.org
http://www.optimizationservices.org/schemas/OSeL.xsd">
	<entityHeader>
		<serviceURI>http://www.northwestern.edu/~JunMa/SolverService.jws</serviceURI>
		<serviceName>Jun Ma's Test Service</serviceName>
		<message>This is an optional message</message>
		<creationTime>2010-03-07T09:30:47-05:00</creationTime>
		<registrationTime>2010-03-20T09:30:47-05:00</registrationTime>
		<lastModificationTime>2010-03-09T09:30:47-05:00</lastModificationTime>
		<licenseRequired>false</licenseRequired>
		<userNameRequired>false</userNameRequired>
		<passwordRequired>false</passwordRequired>
		<keyWords numberOfKeyWords="2">
			<keyWord>linear</keyWord>
			<keyWord>mixed integer</keyWord>
		</keyWords>
		<otherInformation numberOfOtherInfo="2">
			<other name="COIN-OR" link="http://www.coin-or.org">COmputational INfrastructure for Operations Research</other>
			<other name="NEOS" link="http://www-neos.mcs.anl.gov/">The NEOS server</other>
		</otherInformation>
	</entityHeader>
	<entityData>
		<provider>
			<association type="education">
				<name>Northwestern University</name>
				<description>A private university</description>
				<address>Evason, IL</address>
				<phone>8472569854</phone>
				<fax>8472569854</fax>
				<web>http://www.northwestern.edu</web>
				<email>contact@northwestern.edu</email>
				<logoImageURL uri="http://www.northwestern.edu/images/headers/nu_logo.gif">nu logo</logoImageURL>
			</association>
			<contacts numberOfContacts="2">
				<contact isMain="true">
					<name>
						<title>Mr.</title>
						<lastName>Ma</lastName>
						<middleName>Y.</middleName>
						<firstName>Jun</firstName>
						<suffix>Sr.</suffix>
					</name>
					<role>Creator and Project Manager</role>
					<description>Peronsal Provider</description>
					<address>1234 N. Oakton Ave., Evanston, IL 60201</address>
					<phone>8472745896</phone>
					<fax>8542598456</fax>
					<web>http://www.northwestern.edu/~JunMa</web>
					<email>junma@northwestern.edu</email>
					<association type="education">
						<name>Northwestern University</name>
						<description>A private university</description>
						<address>Evason, IL</address>
						<phone>8472569854</phone>
						<fax>8472569854</fax>
						<web>http://www.northwestern.edu</web>
						<email>contact@northwestern.edu</email>
						<logoImageURL uri="http://www.northwestern.edu/images/headers/nu_logo.gif">nu logo</logoImageURL>
					</association>
				</contact>
				<contact isMain="false">
					<name>
						<title>Ms.</title>
						<lastName>Xu</lastName>
						<middleName>H.</middleName>
						<firstName>Yan</firstName>
					</name>
					<role>contributor</role>
					<description>a helper</description>
					<address>34 Main Str., Chicago, IL 62589</address>
					<phone>8952364158</phone>
					<fax>5689632541</fax>
					<web>http://www.abc.com/Xu/index.html</web>
					<email>xuh@hotmail.com</email>
					<association type="company">
						<name>Bowe Bell and Howell</name>
						<description>Document processing company</description>
						<address>568 S. Hill St., Chicago, IL 65894</address>
						<phone>8569874582</phone>
						<fax>2365984144</fax>
						<web>http://www.bbh.com</web>
						<email>contact@bbh.com</email>
						<logoImageURL uri="http://www.bowebellhowell.com/images/logo_bbh.gif">bbh logo</logoImageURL>
					</association>
				</contact>
			</contacts>
			<keyWords numberOfKeyWords="2">
				<keyWord>northwestern university</keyWord>
				<keyWord>industrial engineering</keyWord>
			</keyWords>
			<otherInformation numberOfOtherInfo="1">
				<other name="University of Chicago" link="http://www.chicago.edu">University of Chicago</other>
			</otherInformation>
		</provider>
		<system>
			<description>a not very fast computer</description>
			<dedication isFullyDedicated="false">most dedicated, but occasionally used for other purposes</dedication>
			<operatingSystem>Microsoft Windows XP Professional version 2002, Service Pack 3</operatingSystem>
			<diskSpace unit="gigabyte" description="quite big and fast Hitachi XX.3.7">100</diskSpace>
			<memory unit="megabyte" description="Direct memory access controller">900</memory>
			<cpuSpeed unit="gigahertz" description="Genuine Intel, fastest of all the four">1.6</cpuSpeed>
			<cpuNumber description="dual core">4</cpuNumber>
			<networkSpeed unit="megabyte/s" description="comcast cable">
				<downloadSpeed>2.5</downloadSpeed>
				<uploadSpeed>1.2</uploadSpeed>
			</networkSpeed>
			<keyWords numberOfKeyWords="3">
				<keyWord>Intel</keyWord>
				<keyWord>Microsoft</keyWord>
				<keyWord>HP</keyWord>
			</keyWords>
			<otherInformation numberOfOtherInfo="1">
				<other name="Microsoft Windows" link="http://www.microsoft.com/windows">Windows</other>
			</otherInformation>
		</system>
		<service>
			<description>A solver service</description>
			<type>solver</type>
			<wsdlLocation>http://www.northwestern.edu/~JunMa/SolverService.jws?wsdl</wsdlLocation>
			<version>1.0</version>
			<software>
				<name>CBC Solver</name>
				<version>2.1</version>
				<description>CBC mixed integer solver</description>
				<author>John Forest</author>
				<license>CPL</license>
				<language>C++</language>
				<algorithm>branch and bound on integer, simplex on continuous</algorithm>
				<otherInformation numberOfOtherInfo="2">
					<other name="simplex algorithm" link="http://en.wikipedia.org/wiki/Simplex_algorithm">a popular algorithm for numerically solving linear programming problems</other>
					<other name="Branch and bound" link="http://en.wikipedia.org/wiki/Branch_and_bound">a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization</other>
				</otherInformation>
			</software>
			<maxJobs>50</maxJobs>
			<keyWords numberOfKeyWords="3">
				<keyWord>Jun Ma</keyWord>
				<keyWord>simplex</keyWord>
				<keyWord>branch and bound</keyWord>
			</keyWords>
			<otherInformation numberOfOtherInfo="2">
				<other name="Jun Ma Solver Service 2" link="http://www.northwestern.edu/~JunMa/SolverService2.jws">Jun Ma's nonlinear solver service</other>
				<other name="Jun Ma Solver Service 3" link="http://www.northwestern.edu/~JunMa/SolverService3.jws">Jun Ma's constraint programming solver service</other>
			</otherInformation>
		</service>
		<job>
			<description>The solver service takes almost any job, but no guarantee that a job will be successfully run`.</description>
			<maxTime unit="hour">10</maxTime>
			<systemRestriction>If the diskspace on the system is lower than 1 giga, no jobs will be taken.</systemRestriction>
			<keyWords numberOfKeyWords="0"/>
			<otherInformation numberOfOtherInfo="0"/>
		</job>
		<optimization>
			<problem>
				<type>mixed integer linear</type>
				<maxSize unit="megabyte">5</maxSize>
				<keyWords numberOfKeyWords="2">
					<keyWord>mixed integer</keyWord>
					<keyWord>linear</keyWord>
				</keyWords>
				<otherInformation numberOfOtherInfo="2">
					<other name="integer program" link="http://en.wikipedia.org/wiki/Integer_programming">integer program</other>
					<other name="linear program" link="http://en.wikipedia.org/wiki/Linear_programming">linear program</other>
				</otherInformation>
			</problem>
			<variables minNumberOfVariables="1" maxNumberOfVariables="1">
				<type>
					<continuous minNumber="1">moreGeneral</continuous>
					<binary maxNumber="200">specialized</binary>
					<integer maxNumber="100">specialized</integer>
					<string>none</string>
					<other minNumber="1" maxNumber="200" value="semicontinuous" description="variables that must take a value between their minimum and maximum or zero" link="http://lpsolve.sourceforge.net/5.5/semi-cont.htm">approximate</other>
				</type>
				<boundedness>
					<leftBounded minNumber="1" maxNumber="500">moreGeneral</leftBounded>
					<rightBounded minNumber="1" maxNumber="500">moreGeneral</rightBounded>
					<bounded minNumber="1" maxNumber="200">specialized</bounded>
					<equallyBounded minNumber="1" maxNumber="2">moreGeneral</equallyBounded>
					<unbounded minNumber="1">moreGeneral</unbounded>
				</boundedness>
				<linearity>
					<linear minNumber="1" maxNumber="999">specialized</linear>
					<quadratic minNumber="1" maxNumber="999">specialized</quadratic>
					<nonlinear minNumber="1">none</nonlinear>
				</linearity>
			</variables>
			<objectives minNumberOfObjectives="1" maxNumberOfObjectives="1">
				<linearity>
					<constant minNumber="1">moreGeneral</constant>
					<linear minNumber="1" maxNumber="1">specialized</linear>
					<quadratic minNumber="1">none</quadratic>
					<nonlinear minNumber="1">none</nonlinear>
				</linearity>
				<convexity>
					<constant minNumber="1">moreGeneral</constant>
					<linear minNumber="1">specialized</linear>
					<convex minNumber="1" maxNumber="2">none</convex>
					<convexStrict minNumber="1">none</convexStrict>
					<nonconvex minNumber="1">none</nonconvex>
					<concave minNumber="1">none</concave>
					<concaveStrict minNumber="1">none</concaveStrict>
					<nonconcave minNumber="1">none</nonconcave>
					<notConvexOrConcave minNumber="1">none</notConvexOrConcave>
				</convexity>
				<continuity>
					<continuous minNumber="1" maxNumber="500">specialized</continuous>
					<discontinuous minNumber="1">none</discontinuous>
				</continuity>
				<differentialbility>
					<differentiable minNumber="1" order="1">approximate</differentiable>
					<differentiable minNumber="1" order="2">specialized</differentiable>
					<differentiable minNumber="1" order="3">irrelevant</differentiable>
					<nondifferentiable minNumber="1" order="1">none</nondifferentiable>
				</differentialbility>
				<other numberOfCategories="2" name="monotonicity" link="http://en.wikipedia.org/wiki/Monotonic_function">
					<category value="monotonous">specialized</category>
					<category value="non-monotonous">none</category>
				</other>
			</objectives>
			<constraints minNumberOfConstraints="0" maxNumberOfConstraints="1">
				<constraintRegion>
					<convexity>
						<linear minNumber="1">specialized</linear>
						<convex minNumber="1">none</convex>
						<nonconvex minNumber="1">none</nonconvex>
					</convexity>
				</constraintRegion>
				<boundedness>
					<leftBounded minNumber="1" maxNumber="500">moreGeneral</leftBounded>
					<rightBounded minNumber="1" maxNumber="500">moreGeneral</rightBounded>
					<bounded minNumber="1" maxNumber="200">specialized</bounded>
					<equallyBounded minNumber="1" maxNumber="2">moreGeneral</equallyBounded>
					<unbounded minNumber="1">moreGeneral</unbounded>
				</boundedness>
				<linearity>
					<constant minNumber="1">moreGeneral</constant>
					<linear minNumber="1" maxNumber="1">specialized</linear>
					<quadratic minNumber="1">none</quadratic>
					<nonlinear minNumber="1">none</nonlinear>
				</linearity>
				<convexity>
					<constant minNumber="1">moreGeneral</constant>
					<linear minNumber="1">specialized</linear>
					<convex minNumber="1" maxNumber="2">none</convex>
					<convexStrict minNumber="1">none</convexStrict>
					<nonconvex minNumber="1">none</nonconvex>
					<concave minNumber="1">none</concave>
					<concaveStrict minNumber="1">none</concaveStrict>
					<nonconcave minNumber="1">none</nonconcave>
					<notConvexOrConcave minNumber="1">none</notConvexOrConcave>
				</convexity>
				<continuity>
					<continuous minNumber="1" maxNumber="500">specialized</continuous>
					<discontinuous minNumber="1">none</discontinuous>
				</continuity>
				<differentialbility>
					<differentiable minNumber="1" order="1">approximate</differentiable>
					<differentiable minNumber="1" order="2">specialized</differentiable>
					<nondifferentiable minNumber="1" order="1">none</nondifferentiable>
				</differentialbility>
				<other numberOfCategories="0" name="symmetry" value="symmetric" matchType="specialized" description="left=right agaist the middle" link="http://en.wikipedia.org/wiki/Symmetric_function"/>
			</constraints>
			<linearConstraintCoefficient minNumberOfValues="0" maxNumberOfValues="10000">
				<size>
					<maxNumberOfRows>1000</maxNumberOfRows>
					<maxNumberOfColumns>200</maxNumberOfColumns>
					<maxNumberOfSpecifiedValues>0</maxNumberOfSpecifiedValues>
					<maxNumberOfNonzeroValues>1000</maxNumberOfNonzeroValues>
					<maxDensity>1.0</maxDensity>
				</size>
				<other numberOfCategories="2" name="smallNumber">
					<category value="small">moreGeneral</category>
					<category value="big">specialized</category>
				</other>
			</linearConstraintCoefficient>
			<quadraticCoefficients minNumberOfQuadraticTerms="0" maxNumberOfQuadraticTerms="1">
				<maxNumberOfQuadraticVariables>1</maxNumberOfQuadraticVariables>
				<maxNumberOfQuadraticObjectives>1</maxNumberOfQuadraticObjectives>
				<maxNumberOfQuadraticConstraints>1</maxNumberOfQuadraticConstraints>
			</quadraticCoefficients>
			<nonlinearExpressions minNumberOfNonlinearExpressions="0" maxNumberOfNonlinearExpressions="1">
				<nodes>
					<nodeSetSupported NumberOfEl="1">
						<el>plus</el>
						<el>times</el>
						<el>square</el>
					</nodeSetSupported>
					<statistics>
						<maxNumberOfExpressionRootNodes>1000</maxNumberOfExpressionRootNodes>
						<maxNumberOfAllNodes>1000</maxNumberOfAllNodes>
						<maxNumberOfArithmeticFunctions>1000</maxNumberOfArithmeticFunctions>
						<maxNumberOfElementaryFunctions>1000</maxNumberOfElementaryFunctions>
						<maxNumberOfTrigonometricFunctions>1000</maxNumberOfTrigonometricFunctions>
						<maxNumberOfStatisticsAndProbabilityFunctions>10000000</maxNumberOfStatisticsAndProbabilityFunctions>
						<maxNumberOfTerminalNodes>0</maxNumberOfTerminalNodes>
						<maxNumberOfConstantNodes>0</maxNumberOfConstantNodes>
						<maxNumberOfVariableNodes>0</maxNumberOfVariableNodes>
						<maxNumberOfObjectiveNodes>0</maxNumberOfObjectiveNodes>
						<maxNumberOfConstraintNodes>0</maxNumberOfConstraintNodes>
						<maxNumberOfParameterNodes>0</maxNumberOfParameterNodes>
						<maxNumberOfRandomVariableNodes>0</maxNumberOfRandomVariableNodes>
						<maxNumberOfLogicAndRelationalNodes>0</maxNumberOfLogicAndRelationalNodes>
						<maxNumberOfMatrixFunctions>0</maxNumberOfMatrixFunctions>
						<maxNumberOfQuadraticNodes>0</maxNumberOfQuadraticNodes>
						<maxNumberOfSimNodes>0</maxNumberOfSimNodes>
						<maxNumberOfUserFNodes>0</maxNumberOfUserFNodes>
						<maxNumberOfXPathNodes>0</maxNumberOfXPathNodes>
						<maxNumberOfNoderefNodes>0</maxNumberOfNoderefNodes>
						<maxNumberOfArcRefNodes>0</maxNumberOfArcRefNodes>
						<maxNumberOfComplementsNodes>0</maxNumberOfComplementsNodes>
					</statistics>
				</nodes>
				<maxNumberOfNonlinearVariables>0</maxNumberOfNonlinearVariables>
				<maxNumberOfNonlinearObjectives>0</maxNumberOfNonlinearObjectives>
				<maxNumberOfNonlinearConstraints>0</maxNumberOfNonlinearConstraints>
				<linearity>
					<constant minNumber="1">moreGeneral</constant>
					<linear minNumber="1" maxNumber="1">specialized</linear>
					<quadratic minNumber="1">none</quadratic>
					<nonlinear minNumber="1">none</nonlinear>
				</linearity>
				<convexity>
					<constant minNumber="1">moreGeneral</constant>
					<linear minNumber="1">specialized</linear>
					<convex minNumber="1" maxNumber="2">none</convex>
					<convexStrict minNumber="1">none</convexStrict>
					<nonconvex minNumber="1">none</nonconvex>
					<concave minNumber="1">none</concave>
					<concaveStrict minNumber="1">none</concaveStrict>
					<nonconcave minNumber="1">none</nonconcave>
					<notConvexOrConcave minNumber="1">none</notConvexOrConcave>
				</convexity>
				<continuity>
					<continuous minNumber="1" maxNumber="500">specialized</continuous>
					<discontinuous minNumber="1">none</discontinuous>
				</continuity>
				<differentialbility>
					<differentiable minNumber="1" order="1">approximate</differentiable>
					<differentiable minNumber="1" order="2">specialized</differentiable>
					<nondifferentiable minNumber="1">none</nondifferentiable>
				</differentialbility>
				<other numberOfCategories="2" name="monotonicity" link="http://en.wikipedia.org/wiki/Monotonic_function">
					<category value="monotonous">specialized</category>
					<category value="non-monotonous">none</category>
				</other>
			</nonlinearExpressions>
			<specialOrderedSets>Text</specialOrderedSets>
			<matrices>Text</matrices>
			<cones>Text</cones>
			<matrixProgramming>Text</matrixProgramming>
			<disjunctiveInformation>Text</disjunctiveInformation>
			<timeDomain>Text</timeDomain>
			<robustOptimization>Text</robustOptimization>
			<stochasticInformation>Text</stochasticInformation>
			<softConstraints>Text</softConstraints>
			<ambiguityResolution>Text</ambiguityResolution>
			<modifications>Text</modifications>
			<realTimeData>Text</realTimeData>
			<userFunctions>Text</userFunctions>
			<simulations>Text</simulations>
			<xmlData>Text</xmlData>
		</optimization>
		<defaultOption>
			<general>
				<solverToInvoke>CBC</solverToInvoke>
				<contact transportType="smtp"/>
				<otherOptions numberOfOtherOptions="1">
					<other name="generalName1" value="generalValue1" description="none"/>
				</otherOptions>
			</general>
			<system>
				<minDiskSpace unit="byte">0.0</minDiskSpace>
				<minMemorySize unit="byte">0.0</minMemorySize>
				<minCPUSpeed unit="hertz">0.0</minCPUSpeed>
				<minCPUNumber>1</minCPUNumber>
				<otherOptions numberOfOtherOptions="2">
					<other name="systemName1" value="systemValue1" description="desc1"/>
					<other name="systemName2" value="systemValue2" description="desc2"/>
				</otherOptions>
			</system>
			<service>
				<type>solver</type>
				<otherOptions numberOfOtherOptions="0"/>
			</service>
			<job>
				<maxTime unit="hour">10</maxTime>
				<requestedStartTime>1970-01-01T00:00:00-00:00</requestedStartTime>
				<dependencies numberOfJobIDs="0"/>
				<requiredDirectories numberOfPaths="0"/>
				<requiredFiles numberOfPaths="0"/>
				<directoriesToMake numberOfPaths="0"/>
				<filesToMake numberOfPaths="0"/>
				<inputDirectoriesToMove numberOfPathPairs="0"/>
				<inputFilesToMove numberOfPathPairs="0"/>
				<outputDirectoriesToMove numberOfPathPairs="0"/>
				<outputFilesToMove numberOfPathPairs="0"/>
				<filesToDelete numberOfPaths="0"/>
				<directoriesToDelete numberOfPaths="0"/>
				<processesToKill numberOfProcesses="1">
					<process>XLS</process>
				</processesToKill>
				<otherOptions numberOfOtherOptions="0"/>
			</job>
			<optimization numberOfVariables="-1" numberOfObjectives="-1" numberOfConstraints="-1">
				<variables numberOfOtherVariableOptions="1">
					<other numberOfVar="0" name="defaultInitialValue" value="0" category="proprocess" type="integer" description="default initial values"/>
				</variables>
				<objectives numberOfOtherObjectiveOptions="1"/>
				<constraints numberOfOtherConstraintOptions="1">
					<other numberOfCon="0" name="startFromFeasible" value="true" category="optimization" type="boolean" description="start from feasible"/>
				</constraints>
				<solverOptions numberOfSolverOptions="3">
					<solverOption name="linearAlgorithm" value="interiorPoint" solver="CLP" category="optimization" type="String" description="use interior point"/>
					<solverOption name="depthFirst" value="true" type="boolean" description="integer branch and bound search order"/>
				</solverOptions>
			</optimization>
		</defaultOption>
	</entityData>
</osel>
