l*********o
发帖数: 736 | 1 这个坑之前几年前已经挖的差不多了。当年奥巴马炒的时候，大家一窝蜂。现在风向早
转到大数据，IOT上去了。学校做smart grid的很多还是原来做信号处理，信息论，优
化的自娱自乐，真被industry的人看了会气死。要是做的非常好还可以试试GE,IBM,BBN
的lab,就怕半吊子，屠龙之术回industry找工作会很郁闷。
还是先想清楚想以后干什么，累死累活发几篇infocom的努力用来刷leetcode说不定就
去flg了。要是真心喜欢research就另当别论了。 |
|
s**********e
发帖数: 33562 | 2 其实smart grid 的一个问题是对通信的需求没那么大. 电网的变化挺慢的。 |
|
发帖数: 1 | 3 本人EE PhD quit，已工作，准备申请绿卡。之前Research主要做Low Power System
Design，包括NoC，Smart Grid，Energy Storage System，有publication和review。
求班上大神有paper review机会可以refer我，多谢！ |
|
|
|
|
d*****e
发帖数: 270 | 7 这是我的代码，但是结果是把pOutFClass所有的pologon都转成GRID了，怎么搞？
我只想要我选择的，在SelectionSet里面polygon。
‘从FeatureClass中得到SelectionSet
Set pSelectionSet = pOutFClass.Select(pSpatialFilter,
esriSelectionTypeHybrid, esriSelectionOptionNormal, pWS)
Dim pFCDescriptor As IFeatureClassDescriptor
Set pFCDescriptor = New FeatureClassDescriptor
pFCDescriptor.CreateFromSelectionSet pSelectionSet, Nothing, "GRIDCODE
"
Dim pFCExtract As IFeatureClass
Set p |
|
c***r
发帖数: 3965 | 8 【 以下文字转载自 Chemistry 讨论区,原文如下 】
发信人: cider (苹果甜汤·找呀找呀找mm), 信区: Chemistry
标 题: TEM grid有正反面嘛?
发信站: Unknown Space - 未名空间 (Thu Apr 7 19:08:13 2005) WWW-POST
看上去好象不太一样,怎么分辨 |
|
y***e
发帖数: 6082 | 9 有膜的呀，上样品的时候肯定膜在下呀，如果反了，TEM的Imaging上面一层东西－－－膜
【 以下文字转载自 Chemistry 讨论区,原文如下 】
发信人: cider (苹果甜汤·找呀找呀找mm), 信区: Chemistry
标 题: TEM grid有正反面嘛?
发信站: Unknown Space - 未名空间 (Thu Apr 7 19:08:13 2005) WWW-POST
看上去好象不太一样,怎么分辨 |
|
t*n
发帖数: 14458 | 10 any good books or articles on body-fitted grids in CFD? havn't touch it
for years and almost forgot it all. Thanks. |
|
k*****a
发帖数: 1518 | 11 what's body-fitted grid?
are you using FEM? |
|
f*******y
发帖数: 19 | 12 大家制备TEM样品时，样品应该滴在grid哪一面？在铜网那一面还是黑的（C）一面？ |
|
|
l**i
发帖数: 2 | 14 Etch your grid with HNO3 (vapor) before picking up Carbon, and make sure
your carbon film is not too thick. |
|
w*******y
发帖数: 60932 | 15 PRODUCT LINK: Link:
http://gorillagadgets.com/ipad-case-the-grid-en.html
1. This is NOT a re-post
2. There are no cheaper cases that I was able to find. For those that ARE
close, free shipping is NOT available as it is for these ones. Google
Product Search Link:
http://www.google.com/#hl=en&safe=off&q=where is the iphone 4 activation number&aq=f&aqi=&aql=&oq=&gs_rfai=&fp=fc73e1eef0adcd34
#hl=en&safe=off&q=where+is+the+iphone+4+activation+number&aq=f&aqi=&aql=&oq=
&gs_rfai=&fp=fc73e1eef0adcd34 |
|
w*******y
发帖数: 60932 | 16 You must be a residential electric customer of National Grid or NSTAR
Electric to qualify.
(I am not sure if they service any states other than MA)
Buy any Digital 7-day programmable or ENERGY STAR qualified thermostat
trough December 31, 2010, and you are qualified for up to $25 rebate. The
details are in the attached rebate form.
For example, buy Honeywell 5-2 Day Programmable Thermostat with Backlight
Model # RTH2300B (Link:
http://www.homedepot.com/Building-Materials-Heating-Venting-Cooling... 阅读全帖 |
|
w*******y
发帖数: 60932 | 17 Possible FS to store if you add stores to list and check.
Link:
http://www.finishline.com/store/product/saucony-grid-flex-mens-
___Current Coupon codes below:___
quote
Available Finish Line Coupons and Finish Line Coupon Codes:
$10 off $50
Use Finish Line Coupon Code XV9TM27IEM
$10 off $60 online & In-store
* Online: Use Finish Line Coupon RG2010 [Exp. 12/01] or CJ1060 or SHOE1060
or FATHERSDAY or SUMMERFUN or GAN2011 [Exp. 08/01]
* In-store: In-store Printable Finish Line Coupon [Exp. 10/15]
$1... 阅读全帖 |
|
|
w*******y
发帖数: 60932 | 19 If you're a fan of old school, grid based RPG dungeon crawlers, this is
probably a game to keep an eye on. I've always been a huge fan, dating back
to Dungeons of Daggorath on the Tandy Color Computer 2, which makes me...
older.
Right now, it's 20% off for pre-orders, for it's $11.99 as opposed to the
regular $14.99. If you order directly from the developers site, you get a
Steam key, the option to download directly from the developers site, and a
bunch of pre-order goodies.
Link:
http://www.gri... 阅读全帖 |
|
|
i********8
发帖数: 2 | 21 10.4-10.6
Gaithersburg, MD
1st international conference on smart grid communications
同去的可以share hotel和car rental，女生
站内联系～～ |
|
f*********m
发帖数: 726 | 22 A robot is located at the top-left corner of a m x n grid (marked ‘Start’
in the diagram below). The robot can only move either down or right at any
point in time. The robot is trying to reach the bottom-right corner of the
grid (marked ‘Finish’ in the diagram below). How many possible unique
paths are there?
Follow up for "Unique Paths":
Now consider if some obstacles are added to the grids. How many unique paths
would there be?
An obstacle and empty space is marked as 1 and 0 respectively in t... 阅读全帖 |
|
f**********g
发帖数: 2252 | 23 Ener1 and Federal Grid Company to Demonstrate Lithium-Ion Distributed Energy
Storage System at St. Petersburg International Economic Forum
49 minutes ago - PR Newswire via Comtex
PR NewswireEner1, Inc. (NASDAQ: HEV) and the Russian Federal Grid Company (
FGC) (MICEX: FEES) today announced they will display a fully operational,
lithium-ion, distributed energy storage system as part of the 15th annual St
. Petersburg International Economic Forum which will be held June 16-18 in
Russia. The Forum w... 阅读全帖 |
|
d*****g
发帖数: 441 | 24 老美体会到了中央集权的好处了。
What U.S. utilities can learn from China’s smart grid expansion
China’s state-owned State Grid Company of China signed a strategic
cooperation agreement last month with General Electric to develop smart grid
protocols in the country. The news was another step toward opening the
world’s second-largest consumer of electricity to cutting edge smart grid
technology. The State Grid Company had previously set an aggressive target
of building a robust smart grid in China by 2020 and pla... 阅读全帖 |
|
X*4
发帖数: 101 | 25 这个好复杂
其实可以优化armstrong12的方法
假设初设strength为0，然后找从左上到右下角的最大strength。
结果路径最大，那么中间每一步都最大。
所以 f(i,j) = max( f(i-1,j), f(i,j-1) ) + grid(i,j) .
初始值f(0,1)=grid(0,1), f(1,0)=grid(1,0)，从(0,0)算到(n-1,m-1).
这个方法的问题在于 能保证 任何时刻如果你的strength > 0
先看一维的情况
-5 1 -3
armstrong12方法给出的结果 f[n-1] = grid[n] + f[n-1], 从后往前
f = [-7, -2, -3], 有的地方strength < 0, 所以不对
改进, 增加一个数目m, m[i]表示进入grid[i]之前需要的最小strength
grid[2] = -3.
所以要想保证 每步strength > 0, 进入grid[2]之前， strength 至少 > 3
m[i] = 3,
f = [,,0]
m = [,,3]
grid[1] = 1, 根据公式
f = [,... 阅读全帖 |
|
i**********e
发帖数: 1145 | 26 I think you need to do DFS from all possible starting points in the grid, not just the top left point.
My code below for reference (does not return the path but return if the word is in the grid or not, should be easy to modify to return the path) :
#include
#include
using namespace std;
const int MAX_ROWS = 100;
const int MAX_COLS = 100;
bool dfs(char grid[][MAX_COLS], int row, int col, int m, int n,
int charIndex, string target, bool visited[][MAX_COLS]) {
if (ro... 阅读全帖 |
|
h***y
发帖数: 4936 | 27 http://www.boston.com/business/news/2012/07/31/power-grids-acro
NEW DELHI (AP) — India’s energy crisis cascaded over half the country
Tuesday when three of its regional grids collapsed, leaving 620 million
people without government-supplied electricity for several hours in, by far,
the world’s biggest blackout.
Hundreds of trains stalled across the country and traffic lights went out,
causing widespread traffic jams in New Delhi. Electric crematoria stopped
operating, some with bodies half burnt... 阅读全帖 |
|
i**********e
发帖数: 1145 | 28 我写的 boggle 游戏算法，DFS + trie.
一秒以内给出所有 5x5 的答案。
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct Trie {
bool end;
Trie *children[26];
Trie() {
end = false;
memset(children, NULL, sizeof(children));
}
void insert(const char *word) {
const char *s = word;
Trie *p = this;
while (*s) {
int j = *s-'A';
assert(0 <= j && j < 26);
if (!p->childre... 阅读全帖 |
|
d*********g
发帖数: 38 | 29 可以过80%的test cases，一个很大的grid结果总是差1。哪位高人看看下面code逻辑有
什么问题吗？不超时。刚才上eclipse跑，数1数的眼睛都快瞎了。
public int numIslands(char[][] grid) {
if(grid==null || grid.length==0 || grid[0].length==0)
return 0;
int row=grid.length, col=grid[0].length;
int res=0;
for(int i=0; i
for(int j=0; j
if(grid[i][j]=='1'){
bfs(i, j, grid);
res++;
}
}
}
... 阅读全帖 |
|
|
j**********3
发帖数: 3211 | 31 我的代码，Time Limit Exceeded.
自己拖下来放到eclipse里边，跑到死机了。。。到底哪里出错了？
public int numIslands(char[][] grid) {
if(grid == null){
return 0;
}
int m = grid.length;
if(m == 0){
return 0;
}
int n = grid[0].length;
char c = 'A';
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
if (grid[i][j] == '1') {
bfs(grid, i, j, c, m, n);
c = (char)(c + 1)... 阅读全帖 |
|
g********e
发帖数: 1638 | 32 196 阳晓宇
(ME) 男 1976/03/18 武汉理工大学 工程与材料科学 2007年12月
毕业于[比利时]鲁汶大学联盟和平圣母大学和吉林大学(联合培养) [比利时]比利时
国家科学研究基金委员会 责任研究员/Chargé de Recherch
这位青年千人喜欢写书，有两本。Journal文章不多，会议的不少。
本人有主页。
https://sites.google.com/site/kevnyang/publications
Selected Publications
Book
1. Author: Xiaoyu Yang
Book Title: “Toward Environmental Sustainability and Energy Efficiency: A
Methodology and Tools for Realising Product Service Systems Using Software
Agent”
Publisher: Lambert Academic publishing, Ger... 阅读全帖 |
|
u***r
发帖数: 4825 | 33 http://www.nytimes.com/2011/12/27/business/global/chinas-push-f
GUANGZHOU, China — Three years ago, as part of its green-energy policy, the
Chinese government set an ambitious goal: by the end of 2011, the nation
would be able to produce at least 500,000 hybrid or all-electric cars and
buses a year.
With only about a week to go, it is clear China will fall far short of that
target. Despite dozens of electric-vehicle demonstration projects around the
country, analysts put China’s actual annual pr... 阅读全帖 |
|
a****1
发帖数: 654 | 34 BYD 和国家电网在张北合建了世界最大的36MW的储能电站。
只是个开始， 如果储能电站能突破的话， 风能， 太阳能等再生能源就真正活了。
2011年12月30号yahoo上的消息，链接上还有图片。 总共140MW的可再生能源电站建设
完毕， 其中100MW风能， 40MW太阳能， 36MW的储能电站
http://finance.yahoo.com/news/China-State-Grid-BYD-Launch-bw-24
China’s State Grid and BYD Launch World’s Largest Battery Energy Storage
Station
ZHANGBEI, China--(BUSINESS WIRE)-- BYD and the State Grid Corporation of
China (SGCC) have finished construction on what may be the world’s largest
battery energy storage station. This large utility-scal... 阅读全帖 |
|
O***O
发帖数: 1854 | 35 没错，300万亿。3后面跟很多很多很多零那个三百万亿。
川普说修堵破墙都让MSM笑掉了牙，中共没什么不敢计划的。
阿三再能吹，好像目前也没有这个数量级的PPT。
=========================
https://futurism.com/building-big-forget-great-wall-china-wants-build-50-
trillion-global-power-grid-2050/
CHINESE MEGAPROJECT
It seems that China likes building big things. Take the Great Wall of China.
The country has been constructing bigger (and sometimes better) things than
the rest of the world for centuries.
Now, the Chinese are at it again, but this time it’s on a global scale.
Chin... 阅读全帖 |
|
j*********6
发帖数: 407 | 36 求大牛讲解一下 第四题 substring range 的解法
再贴一个 第四题 第二问 哈利波特 的 2D dp 解法 求大神看看 有什么问题
public static int smallestStrengthValue(int[][] grid){
if( grid == null || grid.length == 0 ||
grid[0] == null || grid[0].length == 0){
throw new IllegalArgumentException("State of grid is illegal!");
}
int row = grid.length;
int col = grid[0].length;
int[][] max = new int[row][col];
for(int i = 0; i < row; i++){
for(int j =... 阅读全帖 |
|
l****z
发帖数: 29846 | 37 But your 'leccy bill will keep going up to buy more of it
By Lewis Page
Posted in Environment, 7th April 2011 09:36 GMT
A new analysis of wind energy supplied to the UK National Grid in recent
years has shown that wind farms produce significantly less electricity than
had been thought, and that they cause more problems for the Grid than had
been believed.
The report (28-page PDF/944 KB) was commissioned by conservation charity the
John Muir Trust and carried out by consulting engineer Stuart You... 阅读全帖 |
|
l****o
发帖数: 315 | 38 我以为能懂的。那我直接贴代码吧。不过写的不够好。
public int minPathSum(int[][] grid) {
int[] g = new int[grid[0].length], f = new int[grid[0].length];
int n = grid.length;
int m = grid[0].length;
for (int j = 0; j < m; j++) {
f[j] = Integer.MAX_VALUE;
}
f[0] = grid[0][0];
g[0] = grid[0][0];
for (int i = 0; i < n; i++) {
if (i > 0) {
g = f.clone();
for (int j = 0; j < m; j++) {
... 阅读全帖 |
|
j*******e
发帖数: 1058 | 39 public int minPathSum3(int[][] grid) {
// Start typing your Java solution below
// DO NOT write main() function
return minPathSum3(grid, grid.length, grid[0].length);
}
public int minPathSum3(int[][] grid, int m, int n) {
int[][] min = new int[1][n];
min[0][0] = grid[0][0];
for (int i = 1; i < n; i++) {
min[0][i] = min[0][i-1] + grid[0][i];
... 阅读全帖 |
|
a****t
发帖数: 1056 | 40 about $20,000 if you want to have 2000 度电/month
http://www.wholesalesolar.com/
SolarEdge ET Grid-tie Solar System 2,450 watts
2,450/2,213 Not Included** up to 331.95 kWh 10 1 SE3000A
-US 1059620 $2.00
$4,902
SolarEdge ET Grid-tie Solar System 3,675 watts
3,675/3,319.5 Not Included** up to 497.93 kWh 15 1
SE3800A-US 1059621 $1.79
$6,562
SolarEdge ET Grid-tie Solar System 4,900 watts
4,900/4,426 Not Included** up to 663.90... 阅读全帖 |
|
发帖数: 1 | 41 QUANTUM SPACE ELEMENTS (QSE)
INTRODUCTION
This is a non-mathematical proposal introducing a cosmological model that is
cyclic, deterministic and infinity-free. For the purpose of achieving this
objective a number of new concepts are introduced. The framework of this
proposal is structured over a number of assumptions, leading to various
considerations of cosmological concerns. Furthermore, verification methods
are suggested of both, observational and mathematical nature.
ASSUMPTIONS
Space is dis... 阅读全帖 |
|
X*****s
发帖数: 2767 | 42 都在下面的链接里
http://www.ener1.com/?q=content/tr-press-releases
Ener1 Reports Fourth Quarter and Year-End Results for 2010
Year-Over-Year Revenue Increases 122%
Gross Profit Margin Increases to 17.9%
Financial tables attached
NEW YORK, March 10, 2011 /PRNewswire via COMTEX/ --
Ener1, Inc. (NASDAQ: HEV), a leading manufacturer of lithium-ion energy
storage systems for transportation, utility grid and industrial applications
, today announced financial results for the fourth quarter and full year
endin... 阅读全帖 |
|
i**********e
发帖数: 1145 | 43 我写的代码如下。
这样打印出来的所有路线还真不是一般的多，
我在想题目的原意是不是指只要路线有相交就不允许？
例如：
1->9->7->3 就不允许，因为 7->3 与 1->9 相交。
如果有以上的条件的话，用 visited cells 就不能解决了。
似乎比较复杂。
#include
#include
using namespace std;
int crossPoint[10][10] = {
{0},
{0, 0, 0, 2, 0, 0, 0, 4, 0, 5},
{0, 0, 0, 0, 0, 0, 0, 0, 5, 0},
{0, 2, 0, 0, 0, 0, 0, 5, 0, 6},
{0, 0, 0, 0, 0, 0, 5, 0, 0, 0},
{0},
{0, 0, 0, 0, 5, 0, 0, 0, 0, 0},
{0, 4, 0, 5, 0, 0, 0, 0, 0, 8},
{0, 0, 5, 0, 0, 0, 0, 0, 0, 0},
{0, 5, 0, 6, 0, 0, 0, 8... 阅读全帖 |
|
f**********t
发帖数: 1001 | 44 int harryPotterGrid(vector &grid, size_t col) {
if (grid.empty() || col == 0) {
return 0;
}
size_t row = grid.size() / col;
if (row == 0) {
return 0;
}
vector strengths(grid.size());
strengths[row * col - 1] = 0;
for (size_t i = row - 1; ; --i) {
for (size_t k = col - 1; ; --k) {
size_t x = i * col + k;
if (i + 1 != row) {
size_t xx = (i + 1) * col + k;
strengths[x] = 1 + strengths[xx] - grid[xx];
}
if (k + 1 != col) {... 阅读全帖 |
|
S*********n
发帖数: 440 | 45
it's not true. there's a broad scope of geographic regions where solar PV
can produces electricity at low LCOE.
i wasn't implying the existing nuclear industr would be wiped out. but the
new capacity is inevitably put on hold.
i watch the smart grid space on a daily basis. most of my knowledge can't be
found via google. :o) having said that, i did a quick google search -
billions of dollars of sales in smart grid are being made this year.
多数人都在炒作概念
every booming sector has some hype. that's oka... 阅读全帖 |
|
c********w
发帖数: 2438 | 46 import java.util.*;
public class Solution{
public int minPathSum(int[][] grid){
int m=grid.length;
int n=grid[0].length;
int[] f=new int[n];
f[0]=grid[0][0];
for(int j=1;j
f[j]=grid[0][j]+f[j-1];
for(int i=1;i
f[0]+=grid[i][0];
for(int j=1;j
f[j]=grid[i][j]+Math.min(f[j], f[j-1]);
}
}
return f[n-1];
}
}
我的也木有comment，而且写的很不简洁…… |
|
k********n
发帖数: 18523 | 47 Thank you Barbara, Great Find!
DOW JONES NEWSWIRES
Nokia Siemens Networks said Thursday it has been selected by The State Grid
Corporation of China to supply its
optical transmission platform to help ensure consistent power supply for a
Qinghai-Tibet power grid it is building.
MAIN FACTS: -The power grid is the largest construction project in the
region and is scheduled to be operational by
mid 2012.
-The project is connecting Tibet's grid with the northwest China grid,
integrating all provinces... 阅读全帖 |
|
发帖数: 1 | 48 Silicon Carbide: Smaller, Faster, Tougher
Meet the material that will supplant silicon in hybrid cars and the electric
grid
Illustration: Anatomy Blue
Some technological revolutions are flashy, and some are almost invisible. We
’re quite familiar with the flashy ones; they’ve given us powerful
computers we can hold in the palms of our hands, devices that can pinpoint
our locations by way of orbiting satellites, and the ability to bank and
shop without leaving our homes.
But none of these innovat... 阅读全帖 |
|
h*********n
发帖数: 11319 | 49 I think your idea is exactly like the idea from the book.
Key is always start from lowest edge grid->fill water from the edge grid to
the same height as the edge grid itself -> desert all flooded grids-->find t
he new lowest edge grid.
this way we can avoid the complicated judgement of whether a grid will spill
to the edge when water level rise. |
|
