首先,所讀這一篇的論文名稱為『Agile Development and User Experience Design Integration as an Ongoing Achievement in Practice』 所以著重點在于用戶體驗設計要怎麼融入敏捷開發的探討。
http://morris821028.github.io/2014/05/14/hw-agile-paper/
This document provides guidance on conducting quality assurance for an independent, negotiable, valuable, and testable investment. It recommends kicking off the QA process with a one-page document that outlines the essential details of the investment to be evaluated. The document emphasizes keeping the QA process simple while still thoroughly investigating and testing the investment.
1) O documento descreve a história e objetivos da SADC, uma organização regional formada na África Austral para promover a cooperação econômica e integração.
2) A SADC enfrenta desafios em estabelecer um bloco regional viável devido às disparidades econômicas entre seus membros, liderados pela economia da África do Sul.
3) A organização tem metas ambiciosas de integração econômica gradual, incluindo uma união aduaneira, mercado comum e moeda única.
This document provides guidance on conducting quality assurance for an independent, negotiable, valuable, and testable investment. It recommends kicking off the QA process with a one-page document that outlines the essential details of the investment to be evaluated. The document emphasizes keeping the QA process simple while still thoroughly investigating and testing the investment.
1) O documento descreve a história e objetivos da SADC, uma organização regional formada na África Austral para promover a cooperação econômica e integração.
2) A SADC enfrenta desafios em estabelecer um bloco regional viável devido às disparidades econômicas entre seus membros, liderados pela economia da África do Sul.
3) A organização tem metas ambiciosas de integração econômica gradual, incluindo uma união aduaneira, mercado comum e moeda única.
Honey's Data Dinner#13 跨領域專案開發經驗談(User Story Mapping)beehivedata
【跨領域專案開發經驗談-User Story Mapping】
講者:彭聲揚
主辦單位:蜂巢數據 (Beehive Data Group)
採團隊模式執行專案開發時,常是不同領域的專家們與前後端不同屬性的工程師一同作業,如何溝通、攜手合作來創造最大產值?本次研討會將以實際經驗與心得來作分享,與大家共同探討,使用者故事對照(User Story Mapping)應如何導入軟體專案開發流程中?期能用最好的方式打開跨領域之間的對話。
Honey's Data Dinner#13 跨領域專案開發經驗談(User Story Mapping)beehivedata
【跨領域專案開發經驗談-User Story Mapping】
講者:彭聲揚
主辦單位:蜂巢數據 (Beehive Data Group)
採團隊模式執行專案開發時,常是不同領域的專家們與前後端不同屬性的工程師一同作業,如何溝通、攜手合作來創造最大產值?本次研討會將以實際經驗與心得來作分享,與大家共同探討,使用者故事對照(User Story Mapping)應如何導入軟體專案開發流程中?期能用最好的方式打開跨領域之間的對話。
This document presents an algorithm for finding the minimum local disk cover sets for broadcasting in heterogeneous wireless ad hoc networks. It defines the problem and introduces the concept of a "skyline set" to represent the solution. It then proves several lemmas about the geometry of intersecting disks and uses mathematical induction to show that the number of arcs in any skyline set is upper bounded by 2n, where n is the number of disks. This allows the algorithm to run in O(n log n) time by using a divide-and-conquer approach to merge partial skyline sets.
This document discusses using n-grams as features for sentiment classification. It explores using high order n-grams to capture positive and negative expressions that are difficult to model with patterns. It describes combining unigrams and bigrams to improve performance over using bigrams alone. The document also discusses reducing n-gram data to reduce computational complexity and picking top features based on statistical measures. It presents experiments comparing language models, passive-aggressive, and Winnow classifiers on sentiment classification tasks.
1) The document discusses problems related to complexity classes P and NP. It shows that several problems are NP-complete, including the Hamiltonian cycle problem, subgraph isomorphism problem, 0-1 integer programming problem, and Hamiltonian path problem.
2) It provides algorithms and reductions to prove several problems are NP-complete, such as reducing Hamiltonian cycle to the subgraph isomorphism problem and reducing 3-SAT to the 0-1 integer programming problem.
3) It also discusses properties of complexity classes P and NP, such as showing P is closed under certain operations and contained within NP intersect co-NP.
The document discusses algorithms for solving various optimization problems related to knapsack problems and scheduling problems. It begins by describing an efficient linear-time algorithm to find the largest subrectangle of 1s in a binary matrix using dynamic programming. It then discusses improvements to the space complexity of the 0/1 knapsack problem and algorithms for variants where items have unlimited quantities or values. Finally, it proposes algorithms for problems involving scheduling jobs on a single machine to maximize profit while meeting deadlines and partitioning a list into subsets with minimal sum difference.
The document discusses solutions to several algorithm questions.
For Q1, it summarizes that incrementing and resetting a binary counter can be done in O(n) time by keeping a pointer to the highest set bit.
For Q2, it shows that a queue can be implemented with two stacks in O(1) amortized time by pushing and popping between the stacks as needed.
For Q3, it explains that while the amortized costs of insert and extract-min for a binary heap are O(logn) and O(1) respectively, this does not imply the overall time complexity of heapsort is O(n).
For Q4, it proposes a solution
The document contains solutions to several algorithm problems. For problem 1, it provides two solutions: 1) A divide-and-conquer algorithm that finds the rank of points in O(n log n) time by sorting and merging. 2) A sweep line algorithm using a binary indexed tree that also runs in O(n log n) time. For problem 2, it describes a selection algorithm solution that finds the median in O(n) time and partitions the items around the median, recursively solving in halves. For problem 3, it uses a pigeonhole principle argument to identify good chips in O(n) tests by randomly pairing chips and eliminating inconsistent results.
This document contains solutions to 10 algorithm problems. It begins by providing efficient O(n) time algorithms to: 1) Remove digits from an integer to maximize its value. 2) Find a subsequence of integers that sums to a given value k. It then provides linear time algorithms to: 3) Find the largest square submatrix of 1s in a binary matrix. 4) Find a maximum independent set on trees. It also provides efficient algorithms to: 5) Find the maximum/minimum product substrings. 6) Find the maximum sum substring of length <=L. 7) Find a weight maximizing increasing value subsequence. Finally, it provides two algorithms to solve Problem 10154 on finding maximum weight within a strength limit.
The document contains the solutions to several algorithm questions. It begins by discussing a recursive Fibonacci number program, calculating that it performs Gn = Fn - 1 additions for the nth term. It then provides two more efficient algorithms using dynamic programming with an array or matrix exponentiation with O(log n) time. Subsequent questions discuss quicksort's O(log n) space complexity, deriving a closed formula for a divide-and-conquer recurrence, and proving properties about the minimum of |x-xi| and maximum product partition of a number.
11. 對話記錄(2)
分工上的隔閡,沒有察覺到這樣對於開發不好
[UX designer]: “That was never explicitly said
to me … I thinks there was and still is
visibility issues to do with what they’re doing
and what their timeline are.”
11
12. 對話記錄(3)
敏捷開發中的 feedback 對於 UX team 不適應
[senior UX designer]: “The visual designs are
pretty much parallel to the wireframes …
what kind of feedback do you want to give ?”
12
18. 會議記錄(1)
[developer]: How should tabs appear, is ad always right-
most tab ? … UX designer tells the developer what would
happen: As new chats come in ad tab moves over to right-
most tab.
分頁到底該如何呈現,而廣告要固定在最右側的分頁嗎?
… UX designer 告訴我們應該「當新的聊天訊息進來時,
廣告要移動到最右邊的分頁嗎?」
[Product owner]: Still waiting on response for some
questions from the client.
這仍然在等待顧客的回報訊息
18
19. [QA]: Kind of hard to do QA if we don't have the answers
… wary of starting stories without behaviours which
means we might have to change things and that wastes
time.
這件事情很難做確認,如果我們沒有接收到回報,做的任
何修改也許只是浪費時間,無法確定品質。
[UX designer]: Do them anyway, they might need to go
through a number of iterations before they agree this is
what they want … it's better if they see something
working as soon as possible.
先把這問題放一旁,這需要多次迭代才能確定這是他們想
要的 … 如果他們需要高效工作,則這個方式可能比較好。
19
20. [QA]: What if an ad comes in at exactly the
same time as a chat?
那如果廣告作為一個新的聊天訊息出場的話呢
?
[UX designer]: That's an extreme edge case
and probably very hard to test. So leave it. QA
agrees.
這是一個相當極端的方式,非常難測試,所以
先不要管這個。
20
27. 對話記錄(1)
[UX designer]: This style of working means we can
collaborate in order to get our points across, rather than
dictate because there’s no communication going on.
這種工作方式可以讓我們的觀點交換,而不是因為沒有溝通
合作的命令。
[Head of UX]: And when we first met with the client, the
first thing they did was to present to us the findings of that
initial research. So we can then go and propose what
would bee the next step, which is quite different from any
other type of work we’ve been invited to get involved in.
27