




def 		lowerCamelCase__       (						_A	,      _A				):







	'''simple docstring'''





	if number < 0 or shift_amount < 0:
		raise ValueError("both inputs must be positive integers"				)

	snake_case_						       =	str(bin(_A				)				)
	binary_number += "0" * shift_amount
	return binary_number


def 		lowerCamelCase__       (						_A	,      _A				):







	'''simple docstring'''





	if number < 0 or shift_amount < 0:
		raise ValueError("both inputs must be positive integers"				)

	snake_case_						       =	str(bin(_A				)				)[2:]
	if shift_amount >= len(_A				):
		return "0b0"
	snake_case_						       =	binary_number[: len(_A				) - shift_amount]
	return "0b" + shifted_binary_number


def 		lowerCamelCase__       (						_A	,      _A				):







	'''simple docstring'''





	if number >= 0:  # Get binary representation of positive number
		snake_case_						       =	"0" + str(bin(_A				)				).strip("-"				)[2:]
	else:  # Get binary (2's complement) representation of negative number
		snake_case_						       =	len(bin(_A				)[3:]				)  # Find 2's complement of number
		snake_case_						       =	bin(abs(_A				) - (1 << binary_number_length)				)[3:]
		snake_case_						       =	(
		    "1" + "0" * (binary_number_length - len(_A				)) + binary_number
		)

	if shift_amount >= len(_A				):
		return "0b" + binary_number[0] * len(_A				)
	return (
	    "0b"
	    + binary_number[0] * shift_amount
	    + binary_number[: len(_A				) - shift_amount]
	)


if __name__ == "__main__":
		import doctest

		doctest.testmod()






import numpy as np


def 		lowerCamelCase__       (						_A				):







	'''simple docstring'''





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


if __name__ == "__main__":
		import doctest

		doctest.testmod()
