Sunday, April 25, 2010

Top 5 Web Trends of 2009: Internet of Things

Written by Richard MacManus / September 11, 2009
This week ReadWriteWeb is running a series of posts analyzing the 5 biggest Web trends of 2009. So far we've explored these trends: Structured Data, The Real-Time Web, Personalization, Mobile Web / Augmented Reality. The fifth and final part of our series is about the Internet of Things, when real world objects (such as fridges, lights and toasters) get connected to the Internet. In 2009, this trend has ramped up and is adding a significant amount of new data to the Web.
In this post we'll see how companies as big as IBM and as small as Pachube are building up this new world of Internet data and services.



What is The Internet of Things?

The Internet of Things is a network of Internet-enabled objects, together with web services that interact with these objects. Underlying the Internet of Things are technologies such as RFID (radio frequency identification), sensors, and smartphones.
The Internet fridge is probably the most oft-quoted example of what the Internet of Things will enable. Imagine a refrigerator that monitors the food inside it and notifies you when you're low on milk. It also perhaps monitors all of the best food websites, gathering recipes for your dinners and adding the ingredients automatically to your shopping list. This fridge knows what kinds of foods you like to eat, based on the ratings you have given to your dinners. Indeed the fridge helps you take care of your health, because it knows which foods are good for you.
However, we're not quite at that level of sophistication yet in the Internet of Things. As we discovered in our Internet Fridges State of the Market in July, current internet fridges are more about entertainment than utility.

IBM and The Internet of Things

One of the leading big companies in Internet of Things is IBM, which offers a range of RFID and sensor technology solutions. IBM has been busy working with various manufacturers and goods suppliers in recent months, to introduce those solutions to the world.
For example IBM announced a deal at the end of June with Danish transportation company Container Centralen. By February 2010, Container Centralen undertakes to use IBM sensor technology "to allow participants in the horticultural supply chain to track the progress of shipments as they move from growers to wholesalers and retailers across 40 countries in Europe." Specifically this refers to transportation of things like flowers and pot plants, which are very sensitive to the environment they travel in. Having sensors as part of the entire travel chain will allow participants to monitor conditions and climate during travel. Essentially it makes the travel process very transparent.

Pachube: Building a Platform for Internet-Enabled Environments

IBM is a leading bigco active in the Internet of Things. At the other end of the spectrum is a small UK startup which has impressed us a lot this year: Pachube. It was one of 5 Internet of Things services that we profiled in February and we followed up with an in-depth look at the service in May. Pachube, (pronounced "PATCH-bay") lets you tag and share real time sensor data from objects, devices, buildings and environments both physical and virtual. In a blog pos by Tish Shute, Pachube founder Usman Haque explained that Pachube is about "environments" moreso than "sensors." In other words, Pachube aims to be responsive to and influence your environment - for example your home.

Conclusion

What's the point of all this new object data from the Internet of Things? As well as the new types of functionalities it will enable, such as health monitoring by Internet fridges, the sheer amount of new data about an object should lead to better quality goods and better decision-making by consumers. For example when you buy a loaf of bread from the grocery store, it will have its own RFID tag - which theoretically can tell you when it was produced, when it was packaged, how long it traveled to get to the store, whether the temperature during its travel was optimal, the pricing history of the product, what the precise ingredients are and associated health benefits (or dangers), and much more information.

That ends our look at the 5 biggest trends of the Web in 2009. First thing next week we will post a round-up, along with a downloadable presentation.
ReadWriteWeb's Top 5 Web Trends of 2009:
  1. Structured Data
  2. The Real-Time Web
  3. Personalization
  4. Mobile Web & Augmented Reality
  5. Internet of Things

Wednesday, April 14, 2010

King's College


世界好大, 我好渺小...
我的極限在哪裡呢?

Tuesday, March 23, 2010

怎麼都沒印象啦

媽的!
電機機械我學了兩次,怎麼連最基本的都不知道。那時是怎麼學的(搥牆)!

Monday, March 22, 2010

Latex 測試

在 Blogger 上用 Latex 寫數學式子。

http://watchmath.com/vlog/?p=438 (此網頁已經掛了,所以要補充一下怎麼作的)

  1. 在 [版面配置] 裡按 [新增小工具]
  2. 選擇 [基本] 中的 [HTML/JavaScript] 模組
  3. 將此網誌描述的程式碼貼入 [內容] 中就 (標題可以不用填) 


  • 完成!

  • 之後要寫就用 $ 符號把數學式框起來就可以了。


    說真的還蠻好用的,雖然在編輯預覽時候沒辦法正確顯示,要等到正式發佈才知道是否正確。

    測試: $x^n+y^n=z^n$


    Thursday, August 03, 2006

    2006/08/04 Today's Works

    [Works]
    1. Derive and verify the misclassification of probability for retransmission algorithm.
    2. Effective retransmission algorithm (derive effective cost function).
    [Note]

    These are difficult !!

    Wednesday, August 02, 2006

    2006/08/03 Today's Works

    [Works]

    1. Procedure for Registers. (not yet)
    2. Derive the effective redetection and retransmission algorithm. (50%)
    3. Simulation revision programs about retransmission algorithm. (AWGN channel ok!)

    Tuesday, July 18, 2006

    2006/07/19 Achievements and Future Works

    [Achievements]
    [Future Works]
    • Identify the validity of the simulation program (robust version).
    • The belance-load retransmission mechanism is poor and weak. Improve it ! (Considering the reliability of channel and observations individually could solve unbalence-load problem beautifully. )
    • Huge mission: derive the misclassification probability of DCSD approach theoretically.

    Sunday, July 02, 2006

    2006/07/03 Achievements and Future Works

    [Achievements]

    • Simulations for evaluating the performance of deterministic local decision rules.
    • Simulations of NEW retransmission mechanism.
    [Future Works]
    • Evaluations of NEW retransmission mechanism (draft for WANS06').
    • Evaluation of Combination and Adaptive retx mechanism in math.
    • Simulating the faulty sensor condition in adaptive retransmission mechanism (draft for IJAHUC)

    Sunday, June 25, 2006

    2006/06/26 Achievements and Future Works

    [Achievements]

    • I have Completed 80% of "Performances and Retransmission Times Comparisons of the Retransmission Mechanisms for Distributed Detection in Wireless Sensor Networks." (prepared to submit to WANS06')

    [Future Works]
    • Simulations and evaluations of retransmission mechanism (draft for WANS06').
    • Evaluation of Combination and Adaptive retx mechanism in math.
    • Simulating the faulty sensor condition in adaptive retransmission mechanism (draft for IJAHUC)

    Saturday, June 10, 2006

    2006/06/11 Achievements and Future Works

    [Achievements of This Week]
    1. I gave a talk in AHUC2006 (TaiChung). The topic is "Adaptive Retransmission for Distributed Detecion in Wireless Sensor Networks."
    2. Take a break in TaiChung ^^.

    [Future Works]
    1. Simulations: the sensors which have all decision rules for one code matrix are considered and the sensor asked to retransmission is chose randomly with equal probability.
    2. Draft of MSN06'.
    3. Reading Papaer "On the Reliability-Order-Based Decoding Algorithms for Binary Linear Block Codes."

    Wednesday, July 13, 2005

    Paper Review of PBPO

    Decentralized detection
    Tsitsiklis has shown that the computational complexity of determining the optimal strategy is exponential in the number of sensors.

    An algorithm for determining the decision thresholds in a distributed detection problem
    Tang et al. have addressed a number of issues, e.g., the effect of different starting points, variations in costs, number and quality of local detectors, etc.

    Optimization of detection networks. I. Tandem structures

    Optimization of detection networks. II. Tree structures
    Tang found the PBPO algorithm was most efficient but more sensitive to initial larg number of sensors. But the other three algorithms were found to be more robust to initial conditions.

    Friday, July 08, 2005

    Direction of Research About Fault Tolerance


    Optimal 4x10 Code Matrix (min. Hamm dist = 5)

    1 1 1 1 1 0 0 0 0 0
    1 1 1 1 1 1 1 1 1 1
    0 0 0 0 0 1 1 1 1 1
    0 0 0 0 0 0 0 0 0 0

    Proof ?
    Design ?


    Monday, July 04, 2005

    Direction of The Recent Research

    1. Tolerance to the certain sensors in specail cases.
    2. Simulated annealing algorithm for the large code matrix.
    3. Proof of the same tolerance for the same characterized codematrix.
    4. (Hans) Simplify the process of PBPO.

    Thursday, June 30, 2005

    The Note for Full Paper


    1. Introduction

      • WSN

      • Wang's paper

    2. Problem Statements and Previous Works

    3. Our scheme

      1. Two-Dimensional code

        • Better performance

        • higher

      2. Repetition code

        • work performance

        • lower cost

        • flexible

    4. Analyze

    5. New Code design & Faluty tolerance (Proof)

    6. Simulations

    7. Conclusion





    Wednesday, June 29, 2005

    中央的研討會 WASN 截稿日

    今天是中央研討會 WASN 的截稿日。雖然只是台灣一個小小的 conference,但這是我進入 wireless sensor networks 這個領域以來,「比較」屬於自己的(用「比較」這個詞,代表老闆還是出了一些關鍵性的意見,學弟 Hans 也在開始的時候幫了不少忙)。雖然是中文寫的,不過句型都很明朗簡單,將來翻成英文應該不難。關於證明的部分,所長建議再補證一些部分,應該可以很快完成。

    摘錄要點如下:

    當在 DCFECC 方法中,code matrix 若符合下列條件,則具有相同特性(錯誤率)
    • 任意 column 互換組合。
    • 任意 column 中,每個元素反相。
    • 矩陣上下顛倒。
    因此,根據上述規則,我們可以縮少要尋找的 code matrix 個數,達到搜尋 global optimal code matrix 的目的。


    接下來就全力衝 ICPADS 的 presentation了。

    Sunday, April 24, 2005

    The best code mtarix (4 x 20)

    Code Name: Hans-Tain Code #2


    RCOST = 0.199613

    codematrix = [
    1 0 0 1 0 1 0 0 1 1 0 0 0 1 0 1 0 0 1 1;
    0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 1 0 1;
    0 0 1 0 1 0 1 1 0 0 1 1 1 0 1 0 1 1 0 0;
    1 1 0 1 1 1 1 0 0 0 0 1 0 1 1 1 1 0 0 0; ]

    Friday, March 25, 2005

    Achievement 20050325

    By the aid of Hans, the C program for simulated annealing (SA) algorithm could be ran in the server (pear.ce.ntpu.edu.tw) successfully. The problem occurred when the program was compiled by gcc was solved by the following command.

    gcc -0 OuputFileName FileName.o -lm -L/usr/lib -L/usr/include -lstdc++


    The speed of this program is about six times faster than the program simulated by the matlab codes. The sub-optimal code matrix will be found and saved in the file "log.txt".

    The sub-optimal code matrix (4 by 20) will be performed in the multi-detection & different multi-conveyance bit scheme for wireless sensor networks.


    Monday, March 14, 2005

    Test !!

    Test !!
    中文測試!!