


import numpy as np


def 		lowercase_  (     _UpperCamelCase  ):


			'''simple docstring'''







			return (2 / (1 + np.exp(-2 * vector  ))) - 1


if __name__ == "__main__":
	import doctest

	doctest.testmod()






def 		lowercase_  (     _UpperCamelCase  ):


			'''simple docstring'''







			__lowercase 					=   len(_UpperCamelCase  )
			__lowercase 					=   len(matrix[0]  )
			__lowercase 					=   min(_UpperCamelCase       ,			_UpperCamelCase  )

			for row in range(_UpperCamelCase  ):
						# Check if diagonal element is not zero
						if matrix[row][row] != 0:
									# Eliminate all the elements below the diagonal
									for col in range(row + 1       ,			_UpperCamelCase  ):
												__lowercase 					=   matrix[col][row] / matrix[row][row]
												for i in range(_UpperCamelCase       ,			_UpperCamelCase  ):
															matrix[col][i] -= multiplier * matrix[row][i]
						else:
									# Find a non-zero diagonal element to swap rows
									__lowercase 					=   True
									for i in range(row + 1       ,			_UpperCamelCase  ):
												if matrix[i][row] != 0:
															__lowercase					, __lowercase 					=   matrix[i], matrix[row]
															__lowercase 					=   False
															break
									if reduce:
												rank -= 1
												for i in range(_UpperCamelCase  ):
															__lowercase 					=   matrix[i][rank]

            # Reduce the row pointer by one to stay on the same row
									row -= 1

			return rank


if __name__ == "__main__":
	import doctest

	doctest.testmod()


