def       A__   (						snake_case_			:		str							,					snake_case_			:		str   ):
 SCREAMING_SNAKE_CASE__: Optional[Any]=   len(snake_case_   )
 SCREAMING_SNAKE_CASE__: Optional[int]=   []
 for i in range(len(snake_case_   ) - pat_len + 1   ):
  SCREAMING_SNAKE_CASE__: List[str]=   True
  for j in range(snake_case_   ):
   if s[i + j] != pattern[j]:
    SCREAMING_SNAKE_CASE__: List[Any]=   False
    break
  if match_found:
   position.append(snake_case_   )
 return position


if __name__ == "__main__":
      assert naive_pattern_search('ABCDEFG', 'DE') == [3]
      print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))








import numpy as np







def   __lowerCamelCase   (				__a  :np.array       )						->							np.array:






		"""simple docstring"""

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







def   __lowerCamelCase   (				__a  :np.array       )						->							np.array:






		"""simple docstring"""

		return vector * sigmoid(1.702 * vector       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()



