f********o
发帖数: 1163 | 1 Does any one know why
expr "4" : '-\?[0-9]\+$' returns 0 on Mac OS X and 1 on Linux? |
|
c*********o
发帖数: 471 | 2 【 以下文字转载自 FleaMarket 讨论区 】
发信人: ckhillsboro (ck128), 信区: FleaMarket
标 题: [超老ID出售] Amazon Prime $17 (Expr. 11/30/2015)
发信站: BBS 未名空间站 (Sun Nov 30 07:39:18 2014, 美东)
二手交易风险自负！请自行验证是否合法和一手卡！:
Y
我想卖的物品:
Amazon Prime Membership $17 (till 11/30/15)
单张面值:
$99
可接受价格(必须明码标价！):
$17. 谢绝神医/护士
物品新旧要求:
11/30/14 - 11/30/15
邮寄方式要求:
The following information is needed:
first name
last name
amazon account email
birth date (MM/DD only. doesn't need to be real, just remember which one you
used)
买卖双方谁承担邮寄损失(Require... 阅读全帖 |
|
r**u
发帖数: 1567 | 3 【 以下文字转载自 Linux 讨论区 】
发信人: raou (raou), 信区: Linux
标 题: grep + perl regular expr
发信站: BBS 未名空间站 (Thu Feb 25 16:08:55 2010, 美东)
想用grep+perl regular expression在文件里找一些东西，但是遇到这个问题。如何解
决？多谢
grep: Support for the -P option is not compiled into this --disable-perl-
regexp binary |
|
d******g
发帖数: 2060 | 4 刚收到那个说有50k的卡，打电话确认50k/2y ，打个几个电话，都是这个部门推那个
部门，最后一个哥们听完要confirm offer的要求，hold 1 min， 直接说，不好意思我
的电脑“忽然”有点问题，注意是忽然，问我要不要转到下一个csr，我一听哈哈大笑
，说哥们不用了，其他电脑也会有问题的，那哥们笑着说了谢谢 。。。
大家今天估计也不用打了，等着把 看amer expre 有什么新消息 |
|
d******g
发帖数: 2060 | 5 也是申请了50k／2yrs， 然后昨天写了邮件要75k，用bouns id 5894，今天登录帐号已经看到75k，真快啊，我才花
了300刀啊！我先写了要50k／2yrs的，同意，昨天第2次在写要75k，立马也批准。以下是在帐号的points查询状态，
以及2个amer expr 的2个回复信, 所以要75k，赶紧骚扰，杯具了在发，基本能成功，不过这是我的第一张amer exp
卡。FYI
Date Description Number of Points
May 24, 2011 Earned : Premier Rewards Gold Card-xxxxx 65,000
2. Response (Dot Childs) 05/24/2011 10:29 AM
Hello xxx,
Our records show that you were solicited for 10,000 after the first purchase... 阅读全帖 |
|
m******r
发帖数: 1033 | 6 问题看似极其简单， 是从?eval抄录而来，略作修改。
ev <- function() {
a <- expression(x+y)
list(eval = eval(a ) )
}
tst.ev <- function(a = 7) { x <- pi; y <- 1; ev() }
tst.ev() #-> aa : 7, eval : 4.14
上面这个运行不通，如果加上第二个参数，parent.frame() 就可以了。
按照eval的定义：
Usage
eval(expr, envir = parent.frame(),
enclos = if(is.list(envir) || is.pairlist(envir))
parent.frame() else baseenv())
我不理解的地方是：如果我只指定一个参数，按照eval定义， R应该会默认如下：
eval(a, envir=parent.frame(), enclos = parent.frame())
因为我没有指定envi... 阅读全帖 |
|
s**********t
发帖数: 680 | 7 Crit Rev Eukaryot Gene Expr. 2000;10(2):179-212.
Title: Chromosome territories, interchromatin domain compartment, and
nuclear matrix: an integrated view of the functional nuclear architecture.
Cremer T, Kreth G, Koester H, Fink RH, Heintzmann R, Cremer M, Solovei I,
Zink D, Cremer C.
Journal link:http://www.begellhouse.com/journals/6dbf508d3b17c437,0e3100b11d4c829b,09458a4d2245ffe0.html
Pubmed link: http://www.ncbi.nlm.nih.gov/pubmed/11186332
Please send it to: b************[email protected]
Thank ... 阅读全帖 |
|
s********l
发帖数: 1195 | 8 Keesee K, Briggman JB, Thill G, Wu YJ (1996) Utilization of
nuclear matrix proteins for cancer diagnosis. CRC Crit Rev
Eukaryotic Gene Expr 6:189-214
Thanks! |
|
m******e
发帖数: 82 | 9 #include
using namespace std;
int GetSingleOperand(char* &expr) {
int num = 0;
while (*expr >= '0' && *expr <= '9') {
num = 10 * num + *expr - '0';
expr++;
}
return num;
}
int GetOperand(char* &expr) {
int num = GetSingleOperand(expr);
while (*expr != '\0') {
if (*expr == '*') {
expr++;
num *= GetSingleOperand(expr);
} else if (*expr == '/') {
expr++;
num /= GetSingleOperand(expr);
... 阅读全帖 |
|
Y**G
发帖数: 1089 | 10 其实xml很好,可以描述任何有结构的东东,不过就是有时比较繁琐
比如:
for (i = 0; i < 10; i ++) {
sum = sum + i;
}
就是
0
10
阅读全帖 |
|
f*******t
发帖数: 7549 | 11 找出了一年多前写的逆波兰处理算数表达式的代码，强烈建议有兴趣的自己实现一下：
#include
#include
#include
#include
#define BUFFSIZE 1024
using namespace std;
struct Token {
bool isNum;
int num;
char op;
Token();
Token(const Token& t);
};
Token::Token()
{
isNum = false;
num = 0;
op = 0;
}
Token::Token(const Token& t)
{
isNum = t.isNum;
num = t.num;
op = t.op;
}
Token *getToken(const char expr[], int& idx)
{
Token *res = NULL;
while(expr[idx] == ' ')
... 阅读全帖
|
|
l*********8
发帖数: 4642 | 12 又写了一遍，供参考
int getValue(const char * &expr) {
int val;
sscanf(expr, "%d", &val);
while (isdigit(*++expr))
;
return val;
}
int evaluate(const char *expr) {
if (!expr || !*expr) return 0;
int ans = getValue(expr);
while (*expr == '*' || *expr == '/') {
if (*expr == '*')
ans *= getValue(++expr);
else
ans /= getValue(++expr);
}
return ans + evaluate(expr);
} |
|
d****n
发帖数: 233 | 13 bool isDigit(const string &expr, int pos)
{
return expr[pos] >='0' && expr[pos] <= '9';
}
void parseNum(const string &expr, int &pos)
{
if (expr[pos] == '0') {
pos++;
// if the first char is '0', it is a number
// following digits should be treated as separate number.
return;
}
while(isDigit(expr, pos))
pos++;
return;
}
bool validate(const string& expr) {
stack st;
int i = 0;
while(i < expr.length()) ... 阅读全帖 |
|
T*******e
发帖数: 4928 | 14 算了，给你贴一个: http://www.itint5.com/oj/#26
int getNumber(const string &expr, int &pos){
int num=0;
while(expr[pos]&&expr[pos]<='9'&&expr[pos]>='0'){
num=num*10+expr[pos++]-'0';
}
return num;
}
//返回表达式expr的值
int evaluate(const string& expr) {
int res=0;
int size=expr.size();
if(size==0) return res;
vector v;
int pos=0;
v.push_back(getNumber(expr, pos));
while(pos
char op=expr[pos++];
int num=getNumber(expr, pos);
... 阅读全帖 |
|
l*******G
发帖数: 1191 | 15 #!/usr/bin/python
def permu(xs):
if xs:
r , h = [],[]
for x in xs:
if x not in h:
ts = xs[:]; ts.remove(x)
for p in permu(ts):
r.append([x]+p)
h.append(x)
return r
else:
return [[]]
def product(*args, **kwds):
# product('ABCD', 'xy') --> Ax Ay Bx By Cx Cy Dx Dy
... 阅读全帖 |
|
l*******G
发帖数: 1191 | 16 #!/usr/bin/python
def permu(xs):
if xs:
r , h = [],[]
for x in xs:
if x not in h:
ts = xs[:]; ts.remove(x)
for p in permu(ts):
r.append([x]+p)
h.append(x)
return r
else:
return [[]]
def product(*args, **kwds):
# product('ABCD', 'xy') --> Ax Ay Bx By Cx Cy Dx Dy
... 阅读全帖 |
|
l**********1
发帖数: 5204 | 17 Continue:
第四乐章 Finale
找有关的PhD dissertation 里边的 R source code program
while U can debug it or even rewrite it for another task,
then you already masted NGS coding skills.
比如
http://www.dspace.cam.ac.uk/handle/1810/218542
DSpace at Cambridge
title: Genome-wide analyses using bead-based microarrays
Authors: Dunning, Mark J
Issue Date: 4-Sep-2008
Files in This Item:
File Description Size Format
dunning_thesis_.pdf 10.47 MB Adobe PDF
its Appendix B
R source Code f... 阅读全帖 |
|
r****m
发帖数: 70 | 18 boolean validate(String expression){
String expr = expression.trim();
boolean expectNum = true;
int numOfParentheses = 0;
int i = 0;
while(i < expr.length()){
if(expr.charAt(i) == '('){
if(!expectNum) return false;
numOfParentheses++;
i++;
} else if (expr.charAt(i) == ')'){
if(expectNum || numOfParentheses < 1) return false;
numOfParentheses--;
... 阅读全帖 |
|
r****m
发帖数: 70 | 19 boolean validate(String expression){
String expr = expression.trim();
boolean expectNum = true;
int numOfParentheses = 0;
int i = 0;
while(i < expr.length()){
if(expr.charAt(i) == '('){
if(!expectNum) return false;
numOfParentheses++;
i++;
} else if (expr.charAt(i) == ')'){
if(expectNum || numOfParentheses < 1) return false;
numOfParentheses--;
... 阅读全帖 |
|
h*****y
发帖数: 298 | 20 recursion比较robust但是短时间内不好写. 因为你没有可以用的语法树，所以要花力
气来tokenize. 只有用Stack才有希望在规定时间里写完，虽然这样的程序完全没有用。
public class EvalExpression {
private Stack results = new Stack();
private Stack operators = new Stack();
private Stack> vars = new Stack
>>();
private static final String ADD = "add";
private static final String MULT = "mult";
private static final String LET = "let";
private static final String LPAREN... 阅读全帖 |
|
n*******w
发帖数: 687 | 21 java写的。可以递归。
public class recurivePre2Post {
final static int MUL = -1;
final static int ADD = -2;
public static void main(String[] args){
int[] expr1 = {MUL, ADD, 1, 2, 3};
int[] expr2 = {ADD, ADD, ADD, ADD, 1, 2, 3, MUL, MUL, 4, 5, 6, 7};
int[] expr3 = {MUL, 2, ADD, 1, MUL, 3, 4};
convert(expr1, 0);
System.out.println();
convert(expr2, 0);
System.out.println();
convert(expr3, 0);
}
public static int convert(int... 阅读全帖 |
|
x**********4
发帖数: 70 | 22 import re
class Solution:
def evaluate(self, expr):
tokens = re.split('[ ()]', expr)
tokens = [token for token in tokens if token]
var, stack, i = {}, [], 0
keywords = set(['add', 'mult', 'let'])
while i < len(tokens):
if tokens[i] == 'add' or tokens[i] == 'mult':
stack.append(tokens[i])
i += 1
elif tokens[i] == 'let':
i += 1
while i < len(tokens) and tokens[i] not ... 阅读全帖 |
|
发帖数: 1 | 23 http://rosettacode.org/wiki/24_game/Solve#C
改一下就行了。这是输入4个的，可以改成输入3个的。
6 17 3 7: No solution
……
#include
#include
#include
#define n_cards 4
#define solve_goal 29
#define max_digit 9
typedef struct { int num, denom; } frac_t, *frac;
typedef enum { C_NUM = 0, C_ADD, C_SUB, C_MUL, C_DIV } op_type;
typedef struct expr_t *expr;
typedef struct expr_t {
op_type op;
expr left, right;
int value;
} expr_t;
void show_expr(expr e, op_type prec, int is_r... 阅读全帖 |
|
h***o
发帖数: 539 | 24 BBS水木清华站∶精华区
发信人: FangQ (奥萨马·本·拉登), 信区: MathTools
标 题: Mathematica函数及使用方法
发信站: BBS 水木清华站 (Mon Nov 23 08:20:15 1998)
Mathematica函数及使用方法
—————————————————————————————————————
九、虚数函数
Re[expr] 复数表达式的实部
Im[expr] 复数表达式的虚部
Abs[expr] 复数表达式的模
Arg[expr] 复数表达式的辐角
Conjugate[expr] 复数表达式的共轭
十、数的头及模式及其他操作
Integer _Integer 整数
Real _Real 实数
Complex |
|
c*****t
发帖数: 1879 | 25 The problem with LL is well known though, although there are work
arounds. For example:
expr + expr
expr * expr
type, in LALR with precedence is really easy to do, about 20x more
work for LL.
Sun's Java compiler is slow. It also has quite a bit limitations
and some artifacts.
Try this in your code:
String str = "\u000a";
It also fails on several other codes.
Antlr has some problems too. It directly generates Java code.
IMO, this is actually bad due to several reasons: lots of
function calls, |
|
R****n
发帖数: 708 | 26 my simple R code. Try to read the basic R, and you should be able to get it
in a few weeks.
setwd("C:/Users/meng09/Downloads/BRCA/BCGSC__IlluminaHiSeq_miRNASeq/Level_3")
lst<-list.files()
exprtable<-c()
Nam<-c()
for (f in lst) {
temp<-read.delim(f)
Nam<-c(Nam,as.character(temp[1,"barcode"]))
exprtable<-cbind(exprtable,temp[,"reads_per_million_miRNA_mapped"])
}
exprtable[1:5,1:5]
exprs<-as.data.frame(exprtable)
samp<-Nam
probe<-as.character(temp[,"miRNA_ID"])
names(exprs)<-samp
rownames(exp... 阅读全帖 |
|
h***o
发帖数: 539 | 27 BBS水木清华站∶精华区
发信人: FangQ (奥萨马·本·拉登), 信区: MathTools
标 题: Mathematica函数及使用方法
发信站: BBS 水木清华站 (Sat Nov 28 20:14:58 1998)
Mathematica函数及使用方法
—————————————————————————————————————
十三、表函数
(*“表”，我认为是Mathematica中最灵活的一种数据类型 *)
(*实际上表就是表达式，表达式也就是表，所以下面list==expr *)
(*一个表中元素的位置可以用于一个表来表示 *)
表的生成
{e1,e2,...} 一个表，元素可以为任意表达式，无穷嵌套
Table[expr,{imax}] 生成一个表，共imax个元素
Table[expr,{i, imax}] 生成一个表，共imax个元素expr[i]
Table[ex |
|
c********u
发帖数: 1177 | 28 1. Even if you do know many phd examples for G, do you also know examples
for L ? if not, how can you simply reach a conclusion G is better? Is
French the most beautiful language in the world?
2. Since you already know working in NYC ,people do not nessasraily living
inside NYC, then how do you draw a assumption that people who work at
MountainView, has to live in MountainView? I am trying to point out you can
not simply compare the living expense from Great NY area to MountainView.
3. ms+e... 阅读全帖 |
|
y***n
发帖数: 1594 | 29 厉害，最后加了一点可以handle 解法
return *expr =='-' ? ans - evaluate(expr) : ans + evaluate(expr); |
|
q**e
发帖数: 106 | 30 HUGE LOT, baby is moving to whole milk now.
ALL original, 非打印
All Similac below
2x $15 off coupon (can be combined with Check), exp 6/30/11
4x $5 check expr 10/08/11
2x $5 check expr 11/12/11
$5 off coupon, $3 off coupon (no expr date)
Coupon and checks can be combined.
$15+$5=Free 23.2 Oz can
Good Start Formula check
$11.50 9/1/11
$4.5 9/1/11
$5.5 7/1/11
Huggies coupon (FREE)
$45 include 邮费 (big envelope)
Send from CA, can not be responsible if you receive late and it expired,
but
normal... 阅读全帖 |
|
W*******Q
发帖数: 275 | 31 说交通差不多那简直是瞎子。公司大部分开在Central Expr 以北。居民区在Central
Expr 以南。
早上北向85一直堵到237出口。晚上开Central Expr 往南看，Lawrence,Wolfe,
Mathilda, Mary哪一条不是一路刹车灯？Cupertino, Saratoga, SJW地大是不错可这几年
涨幅明显落后。
另据内部消息，SMS去年毕业的初中生还有30%是墨墨。现在6年纪只剩下20%。 |
|
o****i
发帖数: 1706 | 32 It needs to parse function in Lisp format. For example...
(+ 3 4) or (* 3 4 2)
I got a something like below, but it only can parse experession like (3 + 4)
, any advice to improve this? Thanks...
mulop = do{ symbol "*"; return (SExp "*")}
<|> do{ symbol "/"; return (SExp "/")}
addop = do{ symbol "+"; return (SExp "+")}
<|> do{ symbol "-"; return (SExp "-")}
anInt = do d <- digits
ws
return $ IntExp (read d)
anSym = oneOf ['-','*','+','/',':',''','?','>','<','=']... 阅读全帖 |
|
c*****t
发帖数: 1879 | 33 This is a long post...
I am trying to update CookCC (a lexer / parser generator in Java) for
a new feature.
One existing CookCC feature is that one can specify the lexer pattern
and parser grammar in Java annotations. For example:
@CookCCOption
class MyParser extends GeneratedParser
{
@Lex (pattern = "[_A-Za-z][_A-Za-z0-9]*", state = "INITIAL")
String scanIdentifier ()
{
return yyText ();
}
@Rules (rules = {
@Rule (lhs = "Expr", rhs = "Expr '+' Expr"),
|
|
o****i
发帖数: 1706 | 34 It need to parse function in Lisp format. For example...
(+ 3 4) or (* 3 4 2)
I got a something like below, but it only can parse experession like (3 + 4)
, any advice to improve this? Thanks...
mulop = do{ symbol "*"; return (SExp "*")}
<|> do{ symbol "/"; return (SExp "/")}
addop = do{ symbol "+"; return (SExp "+")}
<|> do{ symbol "-"; return (SExp "-")}
anInt = do d <- digits
ws
return $ IntExp (read d)
anSym = oneOf ['-','*','+','/',':',''','?','>','<','=']
... 阅读全帖 |
|
e*******o
发帖数: 4654 | 35 (? expr pat ...) — applies expr to the value to be matched, and checks
whether the result is a true value; the additional pats must also match; i.e
., ? combines a predicate application and an and pattern. However, ?, unlike
and, guarantees that expr is matched before any of the pats. |
|
k********o
发帖数: 236 | 36 【 以下文字转载自 JobMarket 讨论区 】
发信人: kittyhello (HelloKitty), 信区: JobMarket
标 题: Two consulting openings at Jersey City
发信站: BBS 未名空间站 (Fri Nov 9 11:31:27 2012, 美东)
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Loanet/Global1 is big plus.
Wall str expr... 阅读全帖 |
|
m********o
发帖数: 26 | 37 帮朋友转一下面经：
不是牛人，也没有遇到牛人那么难的面试。
4个多月前面的，整理过几个国人论坛半年内的G面经，周围也有不少人面，感觉还是比
百分之七八十的面经难，擦。
之前准备了一些最近常考的G家独有题，结果一个都没碰到。。。也没碰到过leetcode
，CC150原题。之前也看了不少杂书和advanced topic， 花了不少功夫准备，不过因为
其他事情中断了复习，最后突击了一下，这点还是希望大家引以为戒。
也许是大家都刷题bar高了，基本上全是算法而且要求写code且量不小，所有题都要推
到optimal解法， 至少有三个面试官没有循循善诱，而是赤裸裸的不到最优解不让写
code外加鄙视。后来自己从最优解回头看所有题目，各种呵呵。
面经只包括主要的题目，面试前后扯淡神聊的都没记录在内。我的表现也自然有好有坏
, 面试官看上去都很nice，可惜题目摆在那里，我水平不够，想放水都难。我简历是越
来越挫，G家还这样招待我教我做人，水平确实有限就不高攀了，自己回去闭关反省了
，希望能帮到大家。
电面1：
expr ::= int | ‘(‘ op expr… ‘)’;
op ::= ‘+... 阅读全帖 |
|
k********o
发帖数: 236 | 38 Two consulting openings at Jersey City
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Loanet/Global1 is big plus.
Wall str expr a must and not a job hopper.
Good communication and analytical skills
Leadership potential.
Contract is for 1 yrs with op... 阅读全帖 |
|
k********o
发帖数: 236 | 39 Two consulting openings at Jersey City
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Loanet/Global1 is big plus.
Wall str expr a must and not a job hopper.
Good communication and analytical skills
Leadership potential.
Contract is for 1 yrs with op... 阅读全帖 |
|
k********o
发帖数: 236 | 40 Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Loanet/Global1 is big plus.
Wall str expr a must and not a job hopper.
Good communication and analytical skills
Leadership potential.
Contract is for 1 yrs with opportunity to convert to full time
Pleas... 阅读全帖 |
|
y*****o
发帖数: 265 | 41 Here's how it works.
Earn 30,000 bonus miles when you spend $500 in three months. Receive $50 cas
h back when you make a Delta purchase within six months.
请问这是什么状况啊？是个好deal吗？email收到的。
Now enjoy priority boarding and in-flight savings
along with 30,000 bonus miles and $50 cash back.
We're always trying to make your travel experience better. So we've added ev
en more benefits to the Gold Delta SkyMiles? Credit Card from American Expre
ss. Plus, you can earn 30,000 bonus miles1 - more than e... 阅读全帖 |
|
|
n***s
发帖数: 10056 | 43 Don't trust lawyer on checking everything because any mistake would result
you lose precious time. If you total expr together is less than 6 months
when convert to 40 hr/wk (full time), you'll need to file a new PERM. The
concern is how many months expr are you gonna put in the job ad? 5 months? 4
months? |
|
n***s
发帖数: 10056 | 44 Include current expr in the resume just don't count them into the required
expr. |
|
c****r
发帖数: 969 | 45 ☆─────────────────────────────────────☆
WWII (WWII) 于 (Mon Nov 14 12:33:03 2011, 美东) 提到:
发信人: WWII (WWII), 信区: Immigration
标 题: 申请自己的职位求教
发信站: BBS 未名空间站 (Sun Nov 13 15:52:48 2011, 美东)
进现在的公司就是这个职位，现在三年了，公司开始打广告。知道不能用现在在这个职
位的经历去申请，但是简历上的经历就到三年前2008年为止么？是不是看着有些怪？求
教。
☆─────────────────────────────────────☆
whatifnot (Contour) 于 (Mon Nov 14 13:52:13 2011, 美东) 提到:
No. For the same position of PERM, you can't use the experiences at your
current company.
☆──────────────────────────────────... 阅读全帖 |
|
k********o
发帖数: 236 | 46 【 以下文字转载自 JobMarket 讨论区 】
发信人: kittyhello (HelloKitty), 信区: JobMarket
标 题: Two consulting openings at Jersey City
发信站: BBS 未名空间站 (Fri Nov 9 11:31:27 2012, 美东)
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Loanet/Global1 is big plus.
Wall str expr... 阅读全帖 |
|
k********o
发帖数: 236 | 47 【 以下文字转载自 JobMarket 讨论区 】
发信人: kittyhello (HelloKitty), 信区: JobMarket
标 题: Two consulting openings at Jersey City
发信站: BBS 未名空间站 (Thu Oct 25 10:26:40 2012, 美东)
Two consulting openings at Jersey City
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Lo... 阅读全帖 |
|
k********o
发帖数: 236 | 48 【 以下文字转载自 JobMarket 讨论区 】
发信人: kittyhello (HelloKitty), 信区: JobMarket
标 题: Two consulting openings at Jersey City
发信站: BBS 未名空间站 (Thu Oct 25 10:26:40 2012, 美东)
Two consulting openings at Jersey City
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Lo... 阅读全帖 |
|
k********o
发帖数: 236 | 49 【 以下文字转载自 JobMarket 讨论区 】
发信人: kittyhello (HelloKitty), 信区: JobMarket
标 题: Two consulting openings at Jersey City
发信站: BBS 未名空间站 (Thu Oct 25 10:26:40 2012, 美东)
Two consulting openings at Jersey City
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Lo... 阅读全帖 |
|
k********o
发帖数: 236 | 50 【 以下文字转载自 JobMarket 讨论区 】
发信人: kittyhello (HelloKitty), 信区: JobMarket
标 题: Two consulting openings at Jersey City
发信站: BBS 未名空间站 (Thu Oct 25 10:26:40 2012, 美东)
Two consulting openings at Jersey City
Senior Java Developer
7+ expr
College degree
4yr Finance Industry experience a must
Core java desktop application, SWING, MVC, multi-threading, messaging…
RDBMS, DB2 a plus
2yr security financing a plus
Big plus if developed/support front office applications, know Anvil-ART,
SunGaurd-Martini/APEX/Lo... 阅读全帖 |
|
