<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[stary_yan的博客]]></title><description><![CDATA[数据爱好者。]]></description><link>https://blog.youkuaiyun.com/stary_yan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; stary_yan]]></copyright><item><title><![CDATA[系统分析与设计-第九次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/80865266</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/80865266</guid><author>stary_yan</author><pubDate>Sat, 30 Jun 2018 11:35:14 +0800</pubDate><description><![CDATA[系统分析与设计-Lesson16


  使用 ECB 实现 make reservation 用例的详细设计（包含用例简介，顺序图，类图） 
  逻辑设计类图映射到实际项目框架的包图。用树形结构表述实现的包和类




用例介绍

本用例是高度抽象的订酒店用例，其中包括：


用户登录系统
用户根据酒店名搜索酒店
用户根据地址搜索酒店
用户支付订单




顺序图





类图





逻辑...]]></description><category></category></item><item><title><![CDATA[系统分析与设计-第八次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/80638339</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/80638339</guid><author>stary_yan</author><pubDate>Sun, 10 Jun 2018 08:56:58 +0800</pubDate><description><![CDATA[系统分析与设计-第八次作业



第一问


  描述软件架构与框架之间的区别与联系。


框架是软件，架构不是软件。

框架是一种特殊的软件，它并不能提供完整无缺的解决方案，而是为你构建解决方案提供良好的基础。框架是半成品。典型地，框架是系统或子系统的半成品；框架中的服务可以被最终应用系统直接调用，而框架中的扩展点是供应用开发人员定制的“可变化点”。

软件架构不是软件，而是关于软件如何设计的重...]]></description><category></category></item><item><title><![CDATA[系统分析与设计-第七次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/80279201</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/80279201</guid><author>stary_yan</author><pubDate>Fri, 11 May 2018 11:30:57 +0800</pubDate><description><![CDATA[系统分析与设计-第七次作业


  请根据ofo共享单车App用车业务描述，绘制如下几个图：
  
  1、ofo共享单车App用车业务的用例图 
  2、ofo共享单车App用车业务的活动图 
  3、ofo共享单车App领域模型 
  4、ofo共享单车App用车业务的状态图 
  5、ofo共享单车App用车业务的系统顺序图与操作协议


问题链接



ofo共享单车App用车业务的用例图...]]></description><category></category></item><item><title><![CDATA[软件测试-第六次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/80181731</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/80181731</guid><author>stary_yan</author><pubDate>Thu, 03 May 2018 16:11:28 +0800</pubDate><description><![CDATA[软件测试第六次作业



使用 UML State Model


  建模对象： 参考 Asg_RH 文档， 对 Reservation/Order 对象建模。 
  建模要求： 参考练习不能提供足够信息帮助你对订单对象建模，请参考现在 定旅馆 的旅游网站，尽可能分析围绕订单发生的各种情况，直到订单通过销售事件（柜台销售）结束订单。






研究淘宝退货流程活动图，对退货业务对象状态建模

...]]></description><category></category></item><item><title><![CDATA[系统分析与设计-第五次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/80144224</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/80144224</guid><author>stary_yan</author><pubDate>Sun, 29 Apr 2018 17:27:56 +0800</pubDate><description><![CDATA[系统分析与设计-第五次作业



a. 阅读 Asg_RH 文档，按用例构建领域模型。

按 Task2 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸


说明：请不要受 PCMEF 层次结构影响。你需要识别实体（E）和 中介实体（M，也称状态实体）
在单页面应用（如 vue）中，E 一般与数据库构建有关， M 一般与 store 模式 有关
在 java web 应用中，E ...]]></description><category></category></item><item><title><![CDATA[系统分析与设计-第四次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/80032291</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/80032291</guid><author>stary_yan</author><pubDate>Sat, 21 Apr 2018 18:45:07 +0800</pubDate><description><![CDATA[系统分析与设计-第四次作业



1、用例建模

**a. 阅读 Asg_RH 文档，绘制用例图。 按 Task1 要求，请使用工具 UMLet，截图格式务必是 png 并控制尺寸 
b. 选择你熟悉的定旅馆在线服务系统（或移动 APP），如绘制用例图。并满足以下要求**：


对比 Asg_RH 用例图，请用色彩标注出创新用例或子用例
尽可能识别外部系统，并用色彩标注新的外部系统和服务




...]]></description><category></category></item><item><title><![CDATA[系统分析与设计-第二次作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/79599168</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/79599168</guid><author>stary_yan</author><pubDate>Sun, 18 Mar 2018 11:41:40 +0800</pubDate><description><![CDATA[Ex2 系统分析与设计-第二次作业



简答题



1、简述瀑布模型、增量模型、螺旋模型（含原型方法）的优缺点。

瀑布模型的优点：有利于大型软件开发过程中的组织管理 
瀑布模型的缺点：开发过程一般不能逆转，实际的项目开发很难严格按该模型进行； 
瀑布模型的使用范围：需求非常清楚全面，且在开发过程中没有或很少变化.

快速原型模型的优点：可以得到比较良好的需求定义，容易适应需求的变化，更友好。...]]></description><category></category></item><item><title><![CDATA[软件分析与设计作业]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/79535091</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/79535091</guid><author>stary_yan</author><pubDate>Tue, 13 Mar 2018 00:11:19 +0800</pubDate><description><![CDATA[软件分析与设计作业



1、简单题



软件工程的定义

软件工程的定义包为将系统化的、规范的、可度量的方法用于软件的开发、运行和维护的过程，即将工程化应用于软件开发中。



阅读经典名著“人月神话”等资料，解释 software crisis、COCOMO 模型

软件危机是早期计算机科学的一个术语，是指在软件开发及维护的过程中所遇到的一系列严重问题，这些问题皆可能导致软件产品的寿命缩短、...]]></description><category></category></item><item><title><![CDATA[[Python] GM(1, 1) 灰色模型]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/79325210</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/79325210</guid><author>stary_yan</author><pubDate>Wed, 14 Feb 2018 13:51:44 +0800</pubDate><description><![CDATA[GM(1, 1) 灰色模型

Reference



from pandas import Series
from pandas import DataFrame
import pandas as pd
import matplotlib.pyplot as plt


class Gray_model:
    def __init__(self):
        self.a_hat = ...]]></description><category></category></item><item><title><![CDATA[[Python]常用画图函数]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/79325189</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/79325189</guid><author>stary_yan</author><pubDate>Wed, 14 Feb 2018 13:43:18 +0800</pubDate><description><![CDATA[常用画图函数（Python）



Requirements



import numpy as np
import pandas as pd
import matplotlib.pyplot as plt



Colors array



colors = ['lightcoral', 'teal', 'chartreuse', 'lightskyblue', 'mediumorchid'...]]></description><category></category></item><item><title><![CDATA[NP-Complete Question]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78943560</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78943560</guid><author>stary_yan</author><pubDate>Sun, 31 Dec 2017 22:18:20 +0800</pubDate><description><![CDATA[NP-Complete Question
  Prove that the following problem is NP-complete: given an undirected graph G = (V, E) and an integer k, return a clique of size k as well as an independent set of size k, provide]]></description><category></category></item><item><title><![CDATA[[Leetcode] Union Find]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78881651</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78881651</guid><author>stary_yan</author><pubDate>Sat, 23 Dec 2017 19:07:24 +0800</pubDate><description><![CDATA[[Leetcode] Union FindThis week, I will solve two problems in the section union find. As we all known, union find is a kind of useful algorithm to find the circle in a directed graph, so it is necessary]]></description><category></category></item><item><title><![CDATA[[Leetcode] Binary Index Tree]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78801395</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78801395</guid><author>stary_yan</author><pubDate>Thu, 14 Dec 2017 12:49:20 +0800</pubDate><description><![CDATA[[Leetcode] Binary Index TreeIn this article we will discuss the Binary Indexed Trees structure. According to Peter M. Fenwick, this structure was first used for data compression. Now it is often used f]]></description><category></category></item><item><title><![CDATA[[Leetcode]Graph & Union Find]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78739007</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78739007</guid><author>stary_yan</author><pubDate>Thu, 07 Dec 2017 11:05:15 +0800</pubDate><description><![CDATA[Graph & Union FindThis time, I will talk about how to use union find to evaluate if there is a cycle in the graph. Union find is a useful method to evaluate the existence of cycle in a undirected graph]]></description><category></category></item><item><title><![CDATA[[Leetcode]Dynamic Programming]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78694618</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78694618</guid><author>stary_yan</author><pubDate>Sat, 02 Dec 2017 12:44:34 +0800</pubDate><description><![CDATA[[Leetcode]Dynamic ProgrammingRegular Expression MatchingAnalysisIt is easy to understand the problem. What we need to do is to find if the string can be matched by the pattern. At first, I think it wil]]></description><category></category></item><item><title><![CDATA[[Leetcode] Breadth-first Search]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78613666</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78613666</guid><author>stary_yan</author><pubDate>Thu, 23 Nov 2017 13:10:00 +0800</pubDate><description><![CDATA[[Leetcode] Breadth-first SearchDescriptionAnalysisIt is easy to understand the question. To be simple, we just need to reach the position in the graph in a specific order and calculate the minimal nece]]></description><category></category></item><item><title><![CDATA[[Leetcode]Dynamic Programming]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78548865</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78548865</guid><author>stary_yan</author><pubDate>Thu, 16 Nov 2017 11:03:51 +0800</pubDate><description><![CDATA[Dynamic Programming174. Dungeon GameDungeon GameAt first, I wanna use DFS to search all of the possible states, but I finally find that it will takes too much time. It is likely that there are some met]]></description><category></category></item><item><title><![CDATA[[Leetcode]Dynamic Programming]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78505827</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78505827</guid><author>stary_yan</author><pubDate>Sat, 11 Nov 2017 12:29:31 +0800</pubDate><description><![CDATA[Dynamic ProgrammingIn this blog, I will solve two problem in leetcode to introduce an important idea in dynamic programming. As we all know, dynamic programming is one of the hardest algorithms to unde]]></description><category></category></item><item><title><![CDATA[[Leetcode] Math & Dynamic]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78441700</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78441700</guid><author>stary_yan</author><pubDate>Sat, 04 Nov 2017 10:17:01 +0800</pubDate><description><![CDATA[[Leetcode] Math & DynamicIn this blog, I try to explain how to solve two similar question about Math & Dynamic. The idea in these two question is pretty similar, if you have mastered how to solve one o]]></description><category></category></item><item><title><![CDATA[[Leetcode] Greedy]]></title><link>https://blog.youkuaiyun.com/stary_yan/article/details/78354199</link><guid>https://blog.youkuaiyun.com/stary_yan/article/details/78354199</guid><author>stary_yan</author><pubDate>Thu, 26 Oct 2017 15:15:40 +0800</pubDate><description><![CDATA[[Leetcode] Greedy502 IPODescriptionAnalysisThis problem can be easily described as we need to find the most profitable projects with the ability to afford the necessary capital. The problem can be solv]]></description><category></category></item></channel></rss>