[algogeeks] Call for Papers Sessions: The 2011 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government (EEE'11), USA, July 18-21, 2011
CALL FOR PAPERS and Call For Workshop/Session Proposals EEE'11 The 2011 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government Date and Location: July 18-21, 2011, USA http://www.world-academy-of-science.org/ Location: See the above web site for venue/city You are invited to submit a full paper for consideration. All accepted papers will be published in the EEE conference proceedings (in printed book form; later, the proceedings will also be accessible online). Those interested in proposing workshops/sessions, should refer to the relevant sections that appear below. SCOPE: Topics of interest include, but are not limited to, the following: O e-Learning: - e-Learning design and methodologies - e-Learning portals - Instructional design methodologies - Audio and video technologies for e-Learning - Authoring tools - e-Learning technologies and tools - Social impact and cultural issues in e-Learning - Content management and development - Policy issues in e-Learning - On-demand e-Learning - e-Learning standards - Learning tools and strategies - Assessment methodologies - Knowledge management - Virtual learning environments - AI and e-Learning - On-line education (all levels: elementary, secondary, ...) - Open-source e-Learning platforms - Training and evaluation strategies - e-Universities - Case studies and emerging applications O e-Business: - e-Business systems integration and standardization - Electronic negotiation systems and protocols - Internet payment systems - e-Procurement methods - Techniques for B2B e-Commerce - Global e-Commerce and e-Business - e-Business models and architectures - Service-oriented e-Commerce - Trust, security, and privacy in e-Commerce and e-Business - Intelligence in e-Commerce - Secure Databases and e-Commerce applications - Business-oriented and consumer-oriented e-Commerce - Development of e-Business and applications - e-Business in developing countries - Novel marketing strategies on the web - Organizational and management issues - Supply chain management - e-Retailing and web design - Applications of new technologies to e-Business - Middleware technologies to support e-business - Case studies and applications O Enterprise Information Systems: - Strategic decision support systems - Organizational semiotics and semiotics in computing - Datacenters, data warehouses and technologies - Knowledge management - Enterprise resource planning and e-Business - middleware integration - Intranet and extranet business applications - Databases and information systems integration - Intelligent agents - Enterprise-wide client-server architectures - Information systems analysis and specification - Ontology engineering - CASE tools for system development - B2B and B2C applications - Business processes re-engineering - Market-spaces: market portals, hubs, auctions, ... - Semantic web technologies and Cloud computing - Web interfaces and usability - Human factors and e-Learning - Case studies and applications O e-Government: - e-Democracy and e-Voting - e-Government - Use of e-Government methodologies to prevent corruption - Legal aspects of e-Government - Risk management - Methods and tools for e-Government - Policies and strategies - Designing web services for e-Government - Trust and security in e-Government - Enterprise architecture for e-Government - Interoperability frameworks in e-Government - Inter-administration and G2G issues - Public and private partnership - Teaching e-Government - Case studies USEFUL WEB LINKS: To see the DBLP list of accepted papers of EEE 2009, go to: http://www.informatik.uni-trier.de/~ley/db/conf/csreaEEE/csreaEEE2009.html The DBLP list of accepted papers of EEE 2010 will soon appear at: http://www.informatik.uni-trier.de/~ley/db/conf/csreaEEE/csreaEEE2010.html The main web site of EEE'11 is currently under construction, it will soon appear at: http://www.world-academy-of-science.org/ IMPORTANT DATES: March 10, 2011: Submission of papers (about 5 to 7 pages) April 03, 2011: Notification of acceptance (+/- two days) April 24, 2011: Final papers + Copyright/Consent + Registration July 18-21, 2011: The 2011 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government (EEE'11) ACADEMIC CO-SPONSORS: Currently being prepared - The Academic sponsors of the last offering of EEE (2010) included research labs and centers affiliated with (a partial list): University of California, Berkeley; University of
Re: [algogeeks] Re: Find small strings in big string
since you have M small strings using KMP or RabinKarp will take time O(mn) but with suffix tree you can do it in O(n+m) read these and you'll be able to construct one: http://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf http://www.cise.ufl.edu/~sahni/dsaaj/enrich/c16/suffix.htm -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] DP problem
You have been given a list of jewelry items that must be split amongst two
people: Frank and Bob. Frank likes very expensive jewelry. Bob doesn't care
how expensive the jewelry is, as long as he gets a lot of jewelry. Based on
these criteria you have devised the following policy: 1) Each piece of
jewelry given to Frank must be valued greater than or equal to each piece of
jewelry given to Bob. In other words, Frank's least expensive piece of
jewelry must be valued greater than or equal to Bob's most expensive piece
of jewelry. 2) The total value of the jewelry given to Frank must exactly
equal the total value of the jewelry given to Bob. 3) There can be pieces of
jewelry given to neither Bob nor Frank. 4) Frank and Bob must each get at
least 1 piece of jewelry. Given the value of each piece, you will determine
the number of different ways you can allocate the jewelry to Bob and
Frank following
the above policy. For example: values = {1,2,5,3,4,5} Valid allocations are:
BobFrank 1,2 3 1,3 4 1,4 5 (first
5) 1,4 5 (second 5) 2,3 5 (first 5) 2,3 5
(second 5)5 (first 5) 5 (second 5) 5 (second 5) 5 (first
5) 1,2,3,4
5,5Note that each '5' is a different piece of jewelry and needs to be
accounted for separately. There are 9 legal ways of allocating the jewelry
to Bob andFrank given the policy, so your method would return 9.
Regards,
Akash Agrawal
http://tech-queries.blogspot.com/
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] file handling
use FILE * Can u elaborate on the probelm? Regards, Akash Agrawal http://tech-queries.blogspot.com/ On Mon, Dec 13, 2010 at 1:03 PM, neeraj agarwal itsneerajagar...@gmail.comwrote: i am facing problem in file handling in C can any one suggest me how to implement them. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Google questions
It is like finding the in order successor.
See it here (using parent pointer)
http://tech-queries.blogspot.com/2010/04/inorder-succesor-in-binary-tree.html
w/0 Parent pointer:
http://tech-queries.blogspot.com/2010/04/inorder-succesor-in-binary-tree-wo.html
Regards,
Akash Agrawal
http://tech-queries.blogspot.com/
On Thu, Dec 9, 2010 at 11:33 PM, GOBIND KUMAR gobind@gmail.com wrote:
Code for question no.--2
#includestdio.h
#includeconio.h
#includetime.h
struct test{
clock_t endwait;
void (*print_ptr)();
};
void print()
{printf(\nHello World\n);}
void wait ( int seconds )
{
struct test *g=(struct test *)malloc(sizeof(struct test));
g-endwait= clock () + seconds * CLOCKS_PER_SEC ;
while (clock() g-endwait) {}
(g-print_ptr)=print;
(*(g-print_ptr))();
}
int main(){
int sec;
printf(Enter the time after which you want output:);
scanf(%d,sec);
wait(sec);
getch();
return;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Google interview question
One of my friends attended google interview.This was one the question asked. you are given N documents(possibly in millions) with words in them. design datastructures such that the following scenarios take optimal time: a. print all the the docs having a given word b. print the docs having both of 2 given words Help me in solving this problem. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] matrix sum
You have given a matrix of n*m integer. A query will come to you with two co-ordinate (x1,y1) (x2,y2). You need to find sum of all elements which falls inside rectangle. As you will be bombarded with such query, you solution should be very very quick. Ans should be in O(1) Regards, Akash Agrawal http://tech-queries.blogspot.com/ -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] find triplets in an integer array A[] which satisfy condition: a[i]^2 + a[j]^2 = a[k]^2
Thanks everyone; that O(n^2) is an awesome solution.
Regards,
Akash Agrawal
http://tech-queries.blogspot.com/
On Thu, Dec 2, 2010 at 12:21 PM, fenghuang fenghaungyuyi...@gmail.comwrote:
@anoop
when you find some i and j(i j) meet the condition i.e. asq[i] + asq[j]
== asq[k], you can merge the same value without rollback.
in this sense, you are right.
On Thu, Dec 2, 2010 at 2:26 PM, anoop chaurasiya
anoopchaurasi...@gmail.com wrote:
@fenghuang try this array:
a[]={3,3,3,3,3,3,4,4,4,4,4,4,5}
so asq[]={9,9,9,9,9,9,16,16,16,16,16,16,25}
here as u can see the total number of requisite triple pairs are 6*6=36,
in general for above array total number of pairs is (n/2)*(n/2) i.e. n^2/4
where n is the size of the array.
by using O(n) algo and since you are choosing them one by one,u can't
include all of them as they are of order O(n^2).
so removing repetitions is the only option i think..
On Wed, Dec 1, 2010 at 11:37 PM, fenghuang fenghaungyuyi...@gmail.comwrote:
@anoop
in fact, it always work even if there are repeated elements, because they
don't change the decision.
in detail, assume ii, ,jj, kk is one of the answers, then
a[ii]+a[jj]=a[kk]. since the array is sorted, so a[ii-1]+a[jj] = a[kk] and
a[ii] + a[jj+1] = a[kk].
so when you try the pair of 'ii-1' and 'jj', the next step must be
calculate a[ii] + a[jj] as long as a[ii-1]+a[jj] is not equal to a[kk]. the
same to the pair 'ii' and 'jj+1'.
the algorithm is correct and in the whole procedure, repeated elements
don't affect the decision.
I'm sorry for my poor English.
Thank You!
On Thu, Dec 2, 2010 at 12:14 PM, anoop chaurasiya
anoopchaurasi...@gmail.com wrote:
sorry for the interruption,we can make it work even if the elements are
repeated, by removing the duplicacy in linear time(as the array is already
sorted) and taking a count of no. of duplicates in the seperate array.
On Wed, Dec 1, 2010 at 9:37 PM, Senthilnathan Maadasamy
senthilnathan.maadas...@gmail.com wrote:
A small correction to the algorithm above. In Step 3, instead of
finding *any* pair (a,b) such that a+b = x we need to find *all* such
pairs. However the complexity remains the same.
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anoop Chaurasiya
CSE (2008-2012)
NIT DGP
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Anoop Chaurasiya
CSE (2008-2012)
NIT DGP
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] What would be the output of the following program..?
int main()
{ int i=0;
while(+(+i--)!=0)
i-=i++;
printf(%d\n,i);
return 0; }
(a) -1 (b) 1 (c) -65535 (d) 0
Ans is option 'a' .. but how?? anybody help plz?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Fwd: What would be the output of the following program..?
-- Forwarded message --
From: siva viknesh sivavikne...@gmail.com
Date: Mon, Dec 13, 2010 at 8:45 PM
Subject: What would be the output of the following program..?
To: mit_cod...@googlegroups.com, mitcse08i...@googlegroups.com
int main()
{ int i=0;
while(+(+i--)!=0)
i-=i++;
printf(%d\n,i);
return 0; }
(a) -1 (b) 1 (c) -65535 (d) 0
Ans is option 'a' .. but how?? anybody help plz?
--
Regards,
$iva
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] C aps ques
#includestdio.h
int main()
{
int x = 5;
printf(%d %d, x++, ++x);
return 0;
}
for this output is 6 7 ... how evaluation proceeds??
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: What would be the output of the following program..?
int main()
{
int k = 5;
if (++k 5 k++/5 || ++k = 8);
printf(%d\n, k);
return 0;
}
for the above code output is '7' and not '8'...why??
int main()
{
int k = 5;
if (++k 5 k++/5 );
printf(%d\n, k);
return 0;
}
similarly for the above code output is '6' and not '7'...why??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: C aps ques
what's the output for following program?
#includestdio.h
int main()
{
int i = 0;
char ch = 'A';
do{ printf(%c, ch);
}
while (i++ 5|| ++ch = 'F');
return 0;
}
(a) ABCDEF (b) AA BCDEF
(c) A will be displayed infinitely
(d) None of the above
On Mon, Dec 13, 2010 at 10:39 PM, siva viknesh sivavikne...@gmail.comwrote:
#includestdio.h
int main()
{
int x = 5;
printf(%d %d, x++, ++x);
return 0;
}
for this output is 6 7 ... how evaluation proceeds??
--
Regards,
$iva
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
