ye_ruo的专栏

Current stable release (v1.1.0) 上传时间2019年二月 Julia 是一个面向科学计算的高性能动态高级程序设计语言。其语法与其他科学计算语言相似。在许多情况下拥有能与编译型语言相媲美的性能。Julia 是个灵活的动态语言，适合科学和数值计算，性能可与传统静态类型语言媲美。 Introduction Scientific computing has traditionally required the highest performance, yet domain experts have largely moved to slower dynamic languages for daily work. We believe there are many good reasons to prefer dynamic languages for these applications, and we do not expect their use to diminish. Fortunately, modern language design and compiler techniques make it possible to mostly eliminate the performance trade-off and provide a single environment productive enough for prototyping and efficient enough for deploying performance-intensive applications. The Julia programming language fills this role: it is a flexible dynamic language, appropriate for scientific and numerical computing, with performance comparable to traditional statically-typed languages. Because Julia's compiler is different from the interpreters used for languages like Python or R, you may find that Julia's performance is unintuitive at first. If you find that something is slow, we highly recommend reading through the Performance Tips section before trying anything else. Once you understand how Julia works, it's easy to write code that's nearly as fast as C. Julia features optional typing, multiple dispatch, and good performance, achieved using type inference and just-in-time (JIT) compilation, implemented using LLVM. It is multi-paradigm, combining features of imperative, functional, and object-oriented programming. Julia provides ease and expressiveness for high-level numerical computing, in the same way as languages such as R, MATLAB, and Python, but also supports general programming. To achieve this, Julia builds upon the lineage of mathematical programming languages, but also borrows much from popular dynamic languages, including Lisp, Perl, Python, Lua, and Ruby. The most significant departures of Julia from typical dynamic languages are: The core language imposes very little; Julia Base and the standard library is written in Julia itself, including primitive operations like integer arithmetic A rich language of types for constructing and describing objects, that can also optionally be used to make type declarations The ability to define function behavior across many combinations of argument types via multiple dispatch Automatic generation of efficient, specialized code for different argument types Good performance, approaching that of statically-compiled languages like C Although one sometimes speaks of dynamic languages as being "typeless", they are definitely not: every object, whether primitive or user-defined, has a type. The lack of type declarations in most dynamic languages, however, means that one cannot instruct the compiler about the types of values, and often cannot explicitly talk about types at all. In static languages, on the other hand, while one can – and usually must – annotate types for the compiler, types exist only at compile time and cannot be manipulated or expressed at run time. In Julia, types are themselves run-time objects, and can also be used to convey information to the compiler. While the casual programmer need not explicitly use types or multiple dispatch, they are the core unifying features of Julia: functions are defined on different combinations of argument types, and applied by dispatching to the most specific matching definition. This model is a good fit for mathematical programming, where it is unnatural for the first argument to "own" an operation as in traditional object-oriented dispatch. Operators are just functions with special notation – to extend addition to new user-defined data types, you define new methods for the + function. Existing code then seamlessly applies to the new data types. Partly because of run-time type inference (augmented by optional type annotations), and partly because of a strong focus on performance from the inception of the project, Julia's computational efficiency exceeds that of other dynamic languages, and even rivals that of statically-compiled languages. For large scale numerical problems, speed always has been, continues to be, and probably always will be crucial: the amount of data being processed has easily kept pace with Moore's Law over the past decades. Julia aims to create an unprecedented combination of ease-of-use, power, and efficiency in a single language. In addition to the above, some advantages of Julia over comparable systems include: Free and open source (MIT licensed) User-defined types are as fast and compact as built-ins No need to vectorize code for performance; devectorized code is fast Designed for parallelism and distributed computation Lightweight "green" threading (coroutines) Unobtrusive yet powerful type system Elegant and extensible conversions and promotions for numeric and other types Efficient support for Unicode, including but not limited to UTF-8 Call C functions directly (no wrappers or special APIs needed) Powerful shell-like capabilities for managing other processes Lisp-like macros and other metaprogramming facilities

a simple facepp sdk for python3 Face++官方提供的sdk所使用的python环境为python2.x， 此代码将原sdk中的python2.x特有的包替换为python3.x 能够使用的包，以适应python3.x环境。 API_KEY = "您的API_KEY" API_SECRET = "您的API_SECRET" api = API(key=API_KEY, secret=API_SECRET) ret = api.detect(image_file=File('人脸图片.jpeg'), return_landmark=0, return_attributes='none') print('*****' * 6) print(ret) ret = api.compare(image_file1=File('人脸图片1.jpeg'), image_file2=File('人脸图片2.jpeg')) print('*****' * 6) print(ret) ret = api.search(image_file=File('人脸图片.jpeg'), faceset_token="您的face set id") print('*****' * 6) print(ret)

《ASP.NET第一步:基于C#和ASP.NET 2.0》以清晰的条理、精炼的例子把初学者带入ASP.NET 2.0的世界。全书共分四个部分。“基础篇”在涵盖了基础知识的同时以留言簿的示例让初学者快速入门，迅速激发学习的热情。“技术篇”在覆盖常用技术的同时也涉及到了ASP.NET的一些底层实现。“提高篇”通过讲解进阶技术，帮助读者编写出更好的代码，开发出更强大的ASP.NET应用程序。“扩展篇”介绍了ASP.NET 2.0常见的企业级开发构架和技术，为读者以后的深入学习作好了铺垫。

《C算法》介绍了当今最重要的算法，共分3卷，《C算法(第1卷):基础、数据结构、排序和摸索》是第1卷。第1卷分4部分、共16章。第一部分“基础知识”（第1～2章）介绍了基本算法分析原理。第二部分“数据结构”（第3～5章）讲解算法分析中必须掌握的数据结构知识。主要包括基本数据结构、抽象数据结构、递归和树。第三部分“排序”（第6～11章）按章节顺序分别讨论了基本排序方法（如选择排序、插入排序、冒泡排序、希尔排序等）、快速排序方法，归并和归并排序方法、优先队列与堆排序方法、基数排序方法以及特殊目的排序方法，并比较了各种排序方法的性能特征。第四部分“搜索”（第12～16章）在进一步讲解符号表、树等抽象数据类型的基础上，重点讨论哈希方法、基数搜索以及外部搜索方法。