Zoho bests Google in mobile app suite?

Opinion: Why your next phone will be a wallet

Mobile commerce

Phone Interview Tips

绿坝软件侵犯BSD开源软件许可协议

Browse US openings

Genentech

What is O3D?

Careers

Welcome to ZeroC™, the Home of Ice™

Introducing JSON

How to hide Login User?

ct: [oops report analysis] hfs_bnode_split() one (Arjan's #2753)

X86 Assembly/GAS Syntax

[edit] Basic architecture of a stack

Energy War

日文中的1 2 3 4 5 6 7 8 9 0 这几个数字的平假名和片假名各是怎么写的？

Connection closed by remote host

ssh_exchange_identification: Connection closed by remote host (solved)

Compiling dependent module

Residential Leasing and Management is the Southwest's premier property management company

Get Started on your Rental / Lease Agreement (Residential):

usage

Multiple Kernel Versions Source Files

Writing and Compiling A Simple Program For OpenWrt

日文中的1 2 3 4 5 6 7 8 9 0 这几个数字的平假名和片假名各是怎么写的？

Inside the Linux Packet Filter

民建中央呼吁立法加强保护个人信息数据安全

民建界别建议发展我国软件产业开放标准

Carma Hinton

做小生意必备的头脑

黄光裕死结：中关村 借壳者鉴

环球企业家：国美癌变全解剖

一个主操盘手披露的真实坐庄内幕

Russia, Looking Eastward, Opens a Gas Plant to Supply Asian Markets

Welcome to the Social Dance Club at the University of Houston

Technology's next frontier: In-car computing

Crunchies

长短经

Neuro-linguistic programming

4万亿投资重点刺激9产业 钢铁汽车振兴规划将出

 后来我在上海微软任总经理时,手下的员工里有很多人毕业于复旦。我也去复旦作过很多次演讲。看着他们,心里还是有一点感触。但我是比较乐观的人,我很庆幸自己没有去读复旦。如若当年真考入自己心目中理想的学校、理想的专业,或许如今的我只是众多80年代大学毕业生中的普通一员,在某个政府机关或某家国有企业担任不大不小的领导职务,或者在某所大学里任教,为教授评选资格熬白了头发。我的人生轨迹可能就因此而完全不同了。所以,我特别想告诉很多年轻朋友:

    其实这也是很多公司和职场人的通病:战略上理想化、浪漫化,而战术上很苦、很累。其结果往往是徒劳无功。所以,

在硅谷的这次座谈会上，还碰到很多其他创业优秀的留学人员，也有很多在跨国公司任职的高管，如雅虎的高级执行副总裁陆奇博士等。他们在硅谷的成功得益于硅谷的创业环境、创业文化和创业条件。正如朱敏所说，他们在硅谷主要就是BtoB，BtoC，但回到中国，还需要BtoG（government政府），创业条件赶不上硅谷。希望国内能进一步改进创业环境，提倡创业文化，能吸引更多的留学人员回国创业。

中国留学生为何偏爱在美国硅谷创业

温家宝：赞同教育资金来源多样化

呼唤企业家精神 坚持梦想敢于担当 (2008/12/08 17:25)

马云悟道

“阿米巴经营”的秘密

Matrilineality

在他的团队中有两个很重要的门徒李鸿新和严镜海，李小龙常常有一些关于武术锻炼器 材的构想，然后告诉这两名弟子，并且让他们负责制造出这种训练器材。

　　这种制度颇有点类似爱迪生的发明办公室，实际上爱迪生当年的很多发明也是由其本人提出设想，他的助手负责去具 体制造和完善。李小

40、经营者要善用人才，并创造一个让员工能发挥所长的环境。学历就好比商品上的标签，论才用人要看品质，不要只注重标签价码。

39、人才是企业成败的关键，惟有顺其自然，不凭自己的好恶用人，容忍与自己个性不合的人，并尽量发挥其优点，才能造就人才。提拔年青人时，不可只提升他的职位，还应该给予支持，帮他建立威信。

38、没有研究心的人不会进步。所以，中央研究的成立，就是要以电器的研究，来促进人类繁荣与同业的发展，就如同开发新药一样，不断研究新电器供应世人。

26、虽然起步迟，只要不畏挫折，坚持到底，照样能超越他人。

24、做生意，要有洞察先机、先发制人的能力、因为这是真刀真枪的决斗，只许赢，不许输。

16、不论处在任何状况，都要有发现光明之路的能力，有视祸为福的坚毅决心。

如果你坚持要上二楼，就会想到搬扶梯；你只想试一试，那就什么都想不到。

参议院议员中村锐一说：松下先生会被实业界称为“神”，大概是因为他以实益性去说服人。 大阪人不喜欢管恩斯如何、加尔布雷斯如何；他只是以电脑般的察觉力，用平实易懂的话来谈：“要怎样赚钱呢？”等等。同样是刻苦成功的人，松下先生丝毫没有自夸的高论，而且他那种人格自然流露无比的说服力，是无法模仿的。或许是关西腔的柔和、率直，会使人产生“对这人可以放心了吧”的想法。这无比的说服力，或许就是基于他“让我们站在同一边，肩并肩（不是面对面）地谈吧”这种根本哲学。

参议院议员安西爱子评价说：松下先生身为世界级的大企业家，对正直人应有的态度，仍时时不离脑海。日本战败后，道德教育全被删除，他忍不住去查遍其他国家严格的教育制度，连文教委员也不如他研究得透彻。今后，已逐渐从学历转移为学习社会。松下先生的生存奋斗方式，将更受重视。即使时代背景不同，这位大前辈对现代青年，永远是不可少的鼓励和心灵寄托。

1.天下的事情，没有轻轻松松，舒舒服服让你能获得的，凡事一定要经过苦心追求，才能真正明了其中的奥妙而有所收获。
　　2.追求舒适与快乐的代价，就是刻苦耐劳。
　　3.一根火柴不过一毛钱，一栋房子价值数百万，但一根火柴可以烧毁一栋房子。
　　4.要挖洞，就要挖大洞;要借钱，就要借大钱，不要到处借小钱。
　　5.我个人认为，我们输给人家的地方是生活以及工作的观念和态度。

王永庆在总结台塑企业的发展过程时说：“如果台湾不是幅员如此狭窄，发展经济深为缺乏资源所苦，台塑企业可以不必这样辛苦地致力于谋求合理化经营就能求得生存及发展的话，我们是否能做到今天的PVC塑胶粉粒及其他二次加工均达世界第一，不能不说是一个疑问。他又说：“研究经济发展的人都知道，为什么工业革命和经济先进国家会发源于温带国家，主要是由于这些国家气候条件较差，生活条件较难，不得不求取一条生路，这就是压力条件之一。日本工业发展得很好，也是在地瘠民困之下产生的，这也是压力所促成的；今日台湾工业的发展，也可说是在“退此一步即无死所”的压力条件下产生的。”

在世界化工行业，台塑董事长王永庆在台湾是一个家喻户晓的传奇式人物。他把台湾塑胶集团推进到世界化工工业的前50名。台塑集团取得如此辉煌的成就，是与王永庆善于用人分不开。多年的经营管理实践令王永庆创造出一套科学用人之道，其中最为精辟的是“压力管理”和“奖励管理”两套方法，
　　王永庆经营成功的八个秘诀：
　　追根究底：对问题不追究到水落石出，绝不罢休
　　务本精神：凡事只求根本，只求合理，不问结果
　　瘦鹅理论：忍饥耐饿，坚韧不屈，等待机会的到来
　　基层做起：脚踏实地，按部就班，从基层做起，成功的机会就愈大
　　实力主义：学历不等于实力，实务经验愈丰富，成功的机会就愈大
　　切身感：制定让员工有切身感的管理制度，发挥员工最大潜能
　　价廉物美：坚持供应价廉物美的原料给下游客户，企业得以蓬勃发展
　　客户至上：买卖双方唇齿相依，给客户利益自己才能有最大利益

Chinese buy into currency war plot

The Singularity Is Near

Go to Singularity The Movie

This is a significant first for China, both strategically and diplomatically. China's navy has tended to operate relatively close to its home ports.

Google

Google Answer to Filling Jobs Is an Algorithm

Jobs: Android Hurts Google More Than It Helps

自由主义与新左派之争

Telecommunications industry in China

A third observation about the example is that the objective function in this case does not account for the variation in outcomes. The model minimizes an expected cost, and its optimal policy gives costs of $1100, $1400, and $1700 under each scenario. If this were a one-shot decision then this spread of outcomes might be seen as unacceptable for the gas company owner if they are unwilling to accept some outcome that costs $1700. Modelling different attitudes to risk is possible in the stochastic programming framework by using piecewise linear, or more general nonlinear, objective functions.

本书的主角武藏，终其一生皆在为这种本能之苦而战斗。宿命之苦永无止境，武藏生存在浩瀚无涯的天地之间，相形之下，他的剑渺小得犹如一根针。虽然如此，剑却代表了武藏内心的形象。

An important (current) restriction for stochastic programming problems - in contrast to dynamic programming problems - is that the probability distributions of the random parameters are assumed to be given, and cannot depend on the decisions taken.

The 26-year-old, a former Microsoft employee who helped put together the Windows Home Server product, founded a company called Esgut within months of the debut of Facebook's developer platform in May 2007. Esgut is a portfolio of Facebook applications, and a few of them, like Superlatives and Entourage, became genuine viral hits.

Artificial Intelligence Techniques Enhance Business Forecasts

Incompressible flow

Peak oil

Petroleum politics

it does not have any nontrivial realization whose a±ne span
is Rh, where h > d. ???
unique  realization
uniquely localizable
strongly localizable
A is SDP -> tr(A) all none negative??
Yij^2<YiiYjj if Y is SDP??

Six-Day War

Lanchester's laws

Lanchester's laws and business strategy

In the 1960s Lanchester's laws found favour with a segment of the Japanese business community ^[2] popularised by the business consultant Nobuo Taoka. The laws were used to formulate plans and strategies to attack market shares. The Canon–Xerox copier battle in the UK, for example, reads like a classic People's war campaign. In this case, the laws were used firstly through the establishment of a "Revolutionary base area" by concentrating resources on a single geographical area until dominance could be achieved, in this case in Scotland. After this, they carefully defined regions to be individually attacked again with a more focused allocation of resources. The sales and distribution forces built up to support these regions in turn was used in the final "determined push in London with a numerically larger salesforce".

If __all__ is not defined, the statement from sound.effects import * does not import all submodules from the package sound.effects into the current namespace; it only ensures that the package sound.effects has been imported (possibly running any initialization code in __init__.py) and then imports whatever names are defined in the package. This includes any names defined (and submodules

PAC Model-Free Reinforcement Learning
 

China Prepares for Urban Revolution

By 2025, at least 220 Chinese cities likely will have more than 1 million people. Such a colossal population shift requires massive building

"The No. 1 challenge for China will be creating enough jobs—and many of those will have to come from the service sector," says Woetzel.

Surprise: Japanese, Korean Carmakers Want a Detroit Bailout

For Toyota, Honda, and Hyundai, a collapse of GM, Ford, or Chrysler would create more problems than opportunities

How the Philippines Can Be a Solar Power

With SunPower and Solaria already operating solar manufacturing plants here, the Philippines could become a profitable "Solar Valley"

The Adventures of Johnny Bunko: The Last Career Guide You'll Ever Need (Paperback)

 802.11 back off

CAAM 554: Convex Optimization, Fall 2008
simplex method
interior-point methods

Apr 8, 2007 ... Add/Change #3965 ([patch] Slovenian Django javascript translation). Your email or username:. Comment (you may use WikiFormatting here): ...

Nan's Games & Comics Too

Meet Django

Programming Ruby

The Pragmatic Programmer's Guide

First Edition (*)

ruby:
http://www.rubycentral.com/pickaxe

some books:

	Principles of corporate finance / Richard Brealey ... [et al.]		31131009720075	DUE 08-30-08 RENEWED Now due 08-30-08 Renewed 2 times	HG4026 .P73 1986
	Time series analysis : forecasting and control / George E.P. Box, Gwilym M. Jenkins, Gregory C. Rein		31131021739319	DUE 08-30-08 RENEWED Now due 08-30-08 Renewed 2 times	QA280 .B67 1994
	Time series : theory and methods / Peter J. Brockwell, Richard A. Davis		31131015419266	DUE 08-30-08 RENEWED Now due 08-30-08 Renewed 2 times	QA280.B76 1991
	Nonlinear and mixed-integer optimization : fundamentals and applications / Christodoulos A. Floudas		31131018229555	DUE 08-30-08 RENEWED Now due 08-30-08 Renewed 2 times	QA402.5 .F587 1995
	Handbook on modelling for discrete optimization / edited by Gautam Appa, Leonidas Pitsoulis, H. Paul		31131034356804	DUE 08-30-08 RENEWED Now due 08-30-08 Renewed 2 times	QA402.5 .H36 2006

 

paper reading:
 

http://www.sciencenet.cn/

 http://www.businessweek.com/globalbiz/content/aug2008/gb2008088_236082.htm

What Will the Olympics Do for China?

Potential problems range from too much pollution to an act of terrorism. But a successful Olympics could improve Beijing's standing in the world

It is also worth noting that Thorp's blackjack research is one of the very few examples where results from such reached the public first, completely bypassing the usual academic journal publications and peer review process cycle. Moreover, Thorp became one of the very few, if any, applied mathematicians who risked physical harm in verifying a computer simulation. He has also stated that he considered the whole experiment an academic exercise.^[4] This also marked the first time in the history of computing that a computer was used as a gambling aid.

Free Ebook!!!
http://www.ebookee.com/

 

paper reading: a tutorial on decomposition methods for network utility maximization

http://www.reghardware.co.uk/2008/06/05/smartphone_os_linux/
http://www.limofoundation.org/what-is-the-platform.html
http://code.google.com/android/
http://www.osimworld.com/newt/l/handsetsvision/osim08/
http://www.gizmos2go.com/hp-ipaq-hw6515-mobile-messenger-fa639aaba.html
http://www.linuxdevices.com/products/PD7399900675.html
http://en.wikipedia.org/wiki/Access_Linux_Platform

UNIX
CMS
BSD Virtual Memory
 page referenced bit
LRU
SWS
PR-bit, valid bit, two context switches
Multics Clock policy
two hand policy

What space is the memory management process running?

Mach
http://en.wikipedia.org/wiki/Mach_kernel
multi-processor support
Threads vs
copy-on-write

Distributed Shared Memory
Munin
http://citeseer.ist.psu.edu/5317.html
eager release
TreadMarks
http://www.cs.rice.edu/~willy/TreadMarks/overview.html
lazy release
Midway
http://citeseer.ist.psu.edu/bershad91midway.html
??

 ping pong effect
??invalidation protocal
Cache replacement policy
2Q?
ARC
Spin
??collocation
modula 3
why can spin overcome the speed issue of microkernel os?
Nooks
PCC
SAFE KERNEL EXTENSIONS WITHOUT RUN-TIME CHECKING
formal safety proof
proof validation
http://raw.cs.berkeley.edu/pcc.html#experiments
http://en.wikipedia.org/wiki/First-order_logic
http://en.wikipedia.org/wiki/LF_(logical_framework)
??forged proof?

Midterm
fast file system
block size consideration
cylinder group
internal fragmentation: sub-blocks

VM
context switch overhead: clock hand scan rate
swap area?
evolving page policies:two hands

page on file system
dirty code segement?
address map

limitation of LRU:
not scanning resistent

kernel
fine grained protection domain

copy kernel data structure for extension:
kernel structure won't be left in undefined state
extension doesn't do inconsistent modification of the kernel
easy to recover: restart extension
overhead: checking, copying kernel data structure
can't recover file system inconsistency
?scan resistant
sequential process communication
csp
http://en.wikipedia.org/wiki/Communicating_sequential_processes
Totem
Lamport’s causal order
multiple ring: dummy message
http://en.wikipedia.org/wiki/Venona_project
Kerberos
???
short ticket time: short delay between password and full action

RAID
http://www.pcguide.com/ref/hdd/perf/raid/levels/singleLevel3-c.html
http://www.pcguide.com/ref/hdd/perf/raid/concepts/perf_ReadWrite.htm
small write problem
raid 3?
larger memory : cache will capture most read accesses? no

Log based file system
synchronism writes
http://www.usenix.org/publications/library/proceedings/als01/full_papers/venkatesh/venkatesh_html/node21.html
inode map
write cost


http://www.eecs.berkeley.edu/Research/Projects/CS/sprite/sprite.html

Journaling vs soft updates
delete directory inode first , then file inode?
wafs
NFS


Midterm
Friday: review session
sequential sharing
toteom: how to guruntee total order of messages.
security: skip confinement problem.
raid 1, raid 5, small write problem
LFS paper. how LFS improve FFS
Journaling and softupdates:
NFS: statelessness, robustlessness, performance price
lamport physical clock protocal.
what's the function of
NFS stale file handle: file generation number

A Case For Adapting Channel Width in Wireless Networks
??
 The gain is maximum in the Far-near case because sharing the same channel introduces the rate
anomaly problem by which the slower flow reduces total capacity.
narrower channels have a smaller per-packet relative overhead.

??
"
We note that even though we do not increase total spectrum
usage by splitting flows, we do increase total transmit
power because narrower channels have higher power (although
the same energy). It is thus an open question if the
gain from such division persists in large-scale systems.
"
can't we ajust the transmission power accordingly?

"
Clearly,
probing this entire search space is inefficient and we need
methods that quickly converge to the optimal point.
"
well, it's only 32
"T (B) = B · R(B)"
data rate and modulation?

Wrap testbed deployment:
ahdemo mode of madwifi driver:
wlanconfig ath0 create wlandev wifi0 wlanmode ahdemo

agent process deployment:
deploy one complete image
copy its fs

online new system install

business simulation games:
single player games:
capitalism
capitalism II
industry tycoon(basicly it's a supply chain game)
http://titan.ja.org/ : only one industry: holo gen!
http://www.informatist.net/: text only
http://www.industryplayer.com/ : real time online multilayer game. yes, real time!!

non-linear and mixed integer optimization:fundamentals and applications

page 53
the gradient of equality constraints are linearly independent(i.e., x is a regular point)
in general x=x(b), lambda=lambda(b)
page 117
l1 or l(inf) sum of constraint violations
l1-minimization problem: minimization of L1 norm: http://mathworld.wolfram.com/L1-Norm.html
l inf-minimization problem: minimization of L inf norm: http://mathworld.wolfram.com/L-Infinity-Norm.html
page 117: minimization is not

??
persudo convex
quasi-convex
subgradient: http://en.wikipedia.org/wiki/Subderivative
use hessian to determine convexity(concavity) if a function:
http://www.economics.utoronto.ca/osborne/MathTutorial/CVNF.HTM
affine function
http://mathworld.wolfram.com/AffineFunction.html
page 87
?? the master is greater than dual

http://mathworld.wolfram.com/k-ConnectedGraph.html
 

Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks
Murali Kodialam
Bell Labs, Lucent Technologies
Holmdel, NJ 07733. USA
muralik@lucent.com
Thyaga Nandagopal
Bell Labs, Lucent Technologies
Holmdel, NJ 07733. USA
thyaga@lucent.com

a network model for multi-channel wireless network.
necessary condition for rate vector
static/dynamic channel assignment scheme

Capacity of Multi-Channel Wireless Networks:Impact of Number of Channels and Interfaces

"In this paper, we have derived the lower and upper
bounds on the capacity of static multi-channel wireless
networks. We have shown that in an arbitrary network,
there is a loss in network capacity when the number
of interfaces per node is smaller than the number of
channels. However, we have shown that surprisingly, in a
random network, a single interface suffices for utilizing
multiple channels, as long as the number of channels
is not too large. We have also shown that interface
switching delay has no impact on capacity, provided
each node is provisioned with a few extra interfaces.
It is part of our ongoing work to extend these results
to mobile networks as well. We also plan to apply the
insights gained from this work to build practical routing
and MAC algorithms that approach the capacity limit
"
The above results are for channel model 1, in which the total bandwidth utilized doesn't vary.
The network capacity is measured in terms of “bit-meters/sec”
For channel model 2:
When c/m == O(logn), network capacity is O(Wc sqr(logn/n))
switching delay won't have much impact on the network
provided that every node has a few extra interfaces.

visualization
http://en.wikipedia.org/wiki/Visualization_(graphic)
http://www.opendx.org/
http://mayavi.sourceforge.net/docs/guide/index.html 

animation on linux
ktoon
synfig

 Routing and Link-layer Protocols for Multi-Channel Multi-Interface Ad Hoc Wireless Networks
We propose a link layer protocol to manage multiple channels, and it can be implemented over existing IEEE 802.11 hardware. We also propose a routing protocol that operates over
the link layer protocol, and is specifically designed for multichannel, multi-interface ad hoc wireless networks.
"Several researchers have proposed MAC protocols for utilizing
multiple channels [7]–[12]. These multi-channel protocols
require changes to existing standards, such as IEEE
802.11, and therefore cannot be deployed by using commodity
hardware. In contrast, our proposal can be implemented with
standard 802.11 interfaces.
Adya et al. [13] propose a link-layer solution for striping
data over multiple interfaces, but their solution is designed for
the scenario where number of interfaces is equal to number of
channels. Bahl et al. [14] propose SSCH, a link layer solution
that uses a single interface, and can run over unmodified IEEE
802.11 MAC. In contrast, our link layer protocol is designed
for multi-interface networks, and we complement the link layer
protocol with a routing protocol as well.
"
"For simplifying the description of the protocol, we assume M = 2;K = 1 for all nodes, i.e., there is one fixed, and one switchable interface"

cunqing's assignment paper:
mixed interger non linear programming
bender's decomposition
primal/master
dual problem
Infeasible primal
 

reading notes: Dichotomy: A Practical Architecture for Multi-channel IEEE 802.11 Multi-hop Networks
round robin
RDT
MMAC
SSCH
802.11 TSF

virtue of Dichotomy:
flexible link level channel switching
hopper/anchor seperation

scatter net reading:
scatternet:
optimization is not extensively studied in this area.
so called optimizations are just distributed local optimization
common approaches:
1. start from a plausible structure.
2. define "moves" to vary upon this structure
3. use moves to do local optimization.


Bluetooth Scatternet Optimization with Hop Count Minimization:

Our work builds on an optimization problem regarding the
hop count minimization in scatternets. We provide a formal
definition to this problem taking advantage of our matrixbased
scatternet model that reflects the links and relationships
between the nodes of the scatternet topology. For solving this
optimization problem we defined and implemented four types
of so-called moves, which are series of modifications on the
master-slave relationship of the nodes. Thus, by performing a
move, a node can switch to a new master (SS move), create
a new piconet by becoming a master itself (SM move), give
up its role of master and connect its slaves to other masters
(MS move) and merge to its own piconet that of another master
(MM move). Taking advantage of these moves and the matrixbased
scatternet model we defined a set of algorithms capable
of reconfiguring the scatternet topology such that to reduce the
number of hops between the communicating nodes [5].




Distributed Self-Healing and Variable Topology Optimization Algorithms for QoS Provisioning in Scatternets
In [13], loop scatternet formation is presented
In [15],Tan et al. introduce the tree scatternet formation (TSF) protocol;
Some other works discuss scatternet topology optimization. This issue is faced in [23] and [6] by adopting centralized approaches.
"A scatternet must be formed by means of distributed algorithms
running on each device. By means of these algorithms, nodes
must discover their neighbors, establish links, and interconnect
piconets, leading to a suitable topology."

Furthermore, a scatternet formation algorithm should have the
following properties:
a) guarantee full connectivity to all the involved devices
even in multihop scenarios, when devices are scattered
in an area where not all of them are within radio range of
each other (also referred to as multihop scenario);
b) achieve full connectivity after limited time;
c) guarantee a self-healing behavior in variable network
conditions; in particular the algorithm should handle:
i) entrance of new nodes in the network;
ii) mobility or failure/deactivation of nodes;
d) guarantee multiple and short paths between any pair of
nodes;
e) optimize the topology according to suitable performance
metrics (e.g., overall network capacity).
SHAPER-OPT:
A. Step 1: Forming a Connected Tree via SHAPER
B. Step 2: Optimizing the Topology via DSOA
C. Step 3: Maintaining the Logical Tree for the Self-Healingness



Ad hoc networking with Bluetooth: key metrics and distributed protocols for scatternet formation
"a distributed algorithm for scatternet topology optimization is introduced, that supports the formation of a "locally optimal" scatternet
based on a selected metric. Numerical results obtained by adopting this distributed approach to ‘‘optimize’’ the network topology are shown to be close to the global optimum."


Combinatorial optimization
http://en.wikipedia.org/wiki/Combinatorial_optimization
metaheuristic algorithms
 

optimization
Optimization Using Neural Networks
http://portal.acm.org/citation.cfm?id=126183.126194
"The design of feedback (or recurrent) neural networks to produce good solutions to complex optimization problems is discussed. The theoretical basis for applying neural networks to optimization problems is reviewed, and a design rule that serves as a primitive for constructing a wide class of constraints is introduced. The use of the design rule is illustrated by developing a neural network for producing high-quality solutions to a probabilistic resource allocation task. The resulting neural network has been simulated on a high-performance parallel processor that has been optimized for neural network simulation."

Mixed-Integer Nonlinear Programming
www.gamsworld.org/minlp/siagopt.pdf
"    Recent research has also focused on combining of Random Search (RS), such
as Tabu, Scatter Search, Simulated Annealing or Genetic Algorithms, with NLP
methods. Recent implementations like OQNLP [12, 30] and LaGO [21, 22] have
proven to be quite successful.
    Finally, the area of Disjunctive Programming uses disjunctions and logic
propositions to represent the discrete decisions in the continuous and discrete
space respectively. Disjunctive programs, conveniently modeled and automat-
ically reformulated in big M or convex region models, give access to a rich
area of applications. Widespread interest in such models has spawned a new
computing environment (LogMIP [31]), developed specifically for generalized
disjunctive programming.
"

disunctive programming
www.gams.com/presentations/present_disj.pdf
""


Nonlinear and mixed-integer optimization : fundamentals and applications / Christodoulos A. Floudas
http://library.uh.edu/search?/Xnonlinear%20and%20Mixed%20Integer%20Optimization&CFID=298573&CFTOKEN=91041869&SORT=D/Xnonlinear%20and%20Mixed%20Integer%20Optimization&CFID=298573&CFTOKEN=91041869&SORT=D&SUBKEY=nonlinear%20and%20Mixed%20Integer%20Optimization/1%2C2%2C2%2CB/frameset&FF=Xnonlinear%20and%20Mixed%20Integer%20Optimization&CFID=298573&CFTOKEN=91041869&SORT=D&1%2C1%2C

nonlinear programming, dimitri P. 
 regular
feasible: constraints satisfied
feasible variation:
first order feasible variation:
??
strict local minimum
Weierstrass's theorem

some old stuff that i don't remember:
http://en.wikipedia.org/wiki/Vector_calculus
http://en.wikipedia.org/wiki/Matrix_calculus


something wrong with the proof in page 288:
A*inv(A'*A)*A'!=I

d(F)t/dX=(dF/dX)t

\nabla\left|\left|x^2\right|\right| = 2x

http://mathworld.wolfram.com/VectorDerivative.html

Bruce Lee: Tao of Jeet Kune Do (selections from the book)

Who are the super financiers of biotechnology?
http://www.nature.com/bioent/2003/030501/full/bioent733.html

IP/Technology Transfer

http://www.nature.com/bioent/2008/080401/full/bioe.2008.4.html 

三、简要会计报表
一）合并资产负债表主要数据
（二）合并利润表主要数据
(三）合并现金流量表主要数据
流动比率
速动比率


审计报告

古之成大 事者，规模远大与综理密微，二者阙一不可