We're proud to announce the upcoming workshop on "Scheduling under
Uncertainty".
The workshop will feature an exciting program with several top
speakers and take place at EURANDOM, Eindhoven University of
Technology, June 1-5, followed back-to-back by the 12th Workshop on
Models and Algorithms for Planning and Scheduling Problems (MAPSP
2015), which will be held in La Roche-en-Ardenne during the week of
June 8-12.
Thematic scope:
The workshop's goal is to bring together and promote the dialogue and
collaboration between researchers in two different communities: the
stochastic scheduling and networking community, and the worst-case
approximation scheduling community. Both these communities consider
mathematical and algorithmic problems motivated by resource
allocation, scheduling shared resources and load balancing, routing
and speed scaling in large-scale systems. However, the specific
problems studied and the techniques used to address them are quite
different. The workshop will bring together experts in both these
areas, and especially researchers who span both these communities, and
foster links by exploring problem areas of mutual interest and
encouraging lively interaction and discussions.
In addition to the invited speakers, we also expect a broad attendance
of local Dutch researchers and students from Europe.
5-Minute presentations:
We plan to organize a special session with 5-minute presentations. If
you're interested to give such a 5-minute presentation, then please
send an email to Nikhil Bansal at n.bansal@tue.nl with a title and
brief abstract by April 15.
Organizers:
Nikhil Bansal (Eindhoven)
Sem Borst (Eindhoven)
Leen Stougie (VU & CWI Amsterdam)
Gerhard Woeginger (Eindhoven)
Program:
The workshop features keynotes/tutorials by four excellent speakers:
Prof. Kamesh Munagala (Duke)
Prof. Kirk Pruhs (U. Pittsburgh)
Prof. R. Srikant (UIUC)
Prof. Jean Walrand (Berkeley)
Additional confirmed invited speakers:
Dr. Matthew Andrews (Alcatel-Lucent)
Prof. Urtzi Ayesta (CNRS-LAAS)
Prof. Yossi Azar (Tel-Aviv)
Dr. Christoph Durr (LIP6, Paris)
Prof. Leah Epstein (Haifa)
Prof. Asaf Levin (Technion)
Prof. Nicole Megow (TU Berlin)
Prof. Rolf Moehring (TU Berlin)
Prof. Mike Pinedo (NYU)
Prof. Ramandeep Randhawa (USC)
Prof. Sasha Stolyar (LeHigh)
Prof. Marc Uetz (Twente)
Dr. Andreas Wiese (MPI Saarbruecken)
Prof. Kuang Xu (INRIA/Stanford)
Prof. Yuan Zhong (Columbia)
Sponsors:
The workshop is financially supported by EURANDOM and NETWORKS.
Practical information and registration:
For further information, online registration and updates,
please go to http://www.eurandom.tue.nl/events/workshops/2015/Scheduling/Scheduling_index.html
Registration is free-of-charge, but mandatory since only a limited
number of participants can be accommodated (on a First-Come
First-Served basis).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, March 4, 2015
[DMANET] Last Mile: SEMAPRO 2015 || July 19 - 24, 2015 - Nice, France
INVITATION:
=================
The submission deadline is March 18, 2015.
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to SEMAPRO 2015.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== SEMAPRO 2015 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
SEMAPRO 2015, The Ninth International Conference on Advances in Semantic Processing
July 19 - 24, 2015 - Nice, France
General page: http://www.iaria.org/conferences2015/SEMAPRO15.html
Call for Papers: http://www.iaria.org/conferences2015/CfPSEMAPRO15.html
Submission page: http://www.iaria.org/conferences2015/SubmitSEMAPRO15.html
Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]
Proposals for:
- mini-symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posed on www.iaria.org]
- panels: [slide-deck posed on www.iaria.org]
Submission deadline: March 18, 2015
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the editorial rules: http://www.iaria.org/editorialrules.html
SEMAPRO 2015 Topics (topics and submission details: see CfP on the site)
Basics on semantics
Fundamental of semantics processing; Semantic-based techniques for feature selection; Semantic-based pruning; Semantic interoperability; Semantics uncertainty; Semantics pre-processing and post-processing; Semantics harmonization; Constraint-based semantics processing; Embedded semantics into the discovery process; Semantics in spatial and spatio-temporal models
Ontology fundamentals for semantic processing
Ontology learning; Ontology for semantic interoperability; Ontologies and data pre-processing; Ontology-based evaluation and semantic patterns; Global core ontologies; Progressive ontologies; Bridging semantics through ontologies; Ontology mapping and ontology visualization; Ontology in information systems; Ontology-based semantic mediation; Ontology design and maintenance for conceptual model integration; Reverse engineering of ontologies from conceptual model; Ontologies for explanation generation
Semantic technologies
Basics of Ontology and Semantic Web; Semantic storing, computing, representation, communications; Semantic-driven system design; Syntactic and semantic processing models; Hardware and software support for semantic processing; Microprocessors for semantic processing; Multi-model semantic systems; Semantic annotation of multimedia supports; Semantic multimedia information retrieval; Natural language semantic processing; Context-based semantic processing; Content-based semantic processing; Scalability to the Web level; Performance in semantic processing; Information security in semantic processing; Explaining semantic processing and its results
Models and ontology-based design of protocols, architectures and services
Fundamentals in theory; Modeling methodologies; Models and Ontology-driven Technologies (for the communications system design); Models and ontology relationships; Multi-models coherence. Models and ontology-based communications services and protocols; Semantics of services and service modeling; Protocol models and semantics; Application and quality of experience semantics; Services and protocols semantics; Models and ontology-based cross-layer services and architectures design; Models and ontology-based software frameworks; Composition of Services and Composability rules; Cross-layering services models, components and implementations
Semantic Deep Web
Ontology plug-in search; Information extraction from the Deep Web /e-commerce sites/; Semantic Deep Web annotation and indexing; Deep Web-based ontology; Semantic Deep Web crawlers; Semantic browsing and visualization; Semantic Deep Web data fusion; Semiautomatic ontology generation; Metrics for quality of ontology; Similarity measures for ontology alignment; Measurements for quality of search; Tools for semantic Deep Web; Experience extraction from the Web
Semantic reasoning
Reasoning methods; Reasoning for the Web; Ontology expressiveness; Ontology alignment, mapping and merging; Expressing formal semantics; Languages (RDF, RDF Schema, OWL, etc); Robustness of reasoning on the Web; Patterns on semantic reasoning; Querying and searching; Scalable and tolerant reasoning; Dynamic reasoning for the Semantic Web; Ontologies and problem-solving methods; Computational learning theory; Approximate reasoning/computing; Strategies for abstraction and compression of information; Cognitive semantic reasoning; Attention semantic scoping; Recency-based self-optimizing memory; Cost-benefit trade-off reasoning models; Negotiation in obtaining near-optimal reasoning results under bounded resources; Case-based reasoning
Semantic content searching
Methodologies for innovative information retrieval technologies; Combinatorial search; Massive search-spaces with heuristics (e.g., based on Monte Carlo simulations); Searching using metadata, semantics, and ontology; Advanced searching in digital libraries; Advanced use of RDF and OWL; Expressiveness of the content ontologies; Inherent inconsistency and incompleteness of data on the Web; Scalability of semantic processing; Specialized search engines (Hakia, Matrixware and seekda)
Hypertext and hypermedia semantic
Hypertext techniques and semantic applications; Hypertext and ontologies; Hypertext semantic models; Spatial semantic hypertext; Self-organized hypertext; Semantic adaptive hypertext; Web and hypertext link analysis; Hypertexts and semantic Web; Hypertext semantic applications
Semantic voice-video-speech (VVS) searching
Engines and methods for VVS advanced searching; Patterns in VVS searching; Contextual VVS searching; Rapid VVS searching; Accuracy in VVS searching; Noise in VVS searching; Performance in VVS searching; Metrics for VVS searching; Text and VVS searching; Applications of VVS
Semantic multimedia
Efficient storage of structured data that scale to a very large size; Automatic generation of multimedia presentations; Advanced process for multimedia information mining; Semantic metadata extraction; Annotation tools and methods for content semantics; Media ontology generation/learning/reasoning; Semantic multimedia streaming; Semantics enabled multimedia applications /annotation/browsing/storage/retrieval/visualization
Semantic social media
Community detection and evolution in social media; Recommendation and ranking systems; Search in social media; Event detection, trend identification and tracking in social media; Influence, trust and reputation in social media; Opinion/sentiment analysis, polarity identification; Feed distillation and ranking blogs; Mining microblogging and real time data; Folksonomy, tag semantics, clustering and usage; Advertising models for the social web; Indexing social media content, index freshness; Visualizing social network data; Spam detection, social network spam and profile spam
Semantics for sentiment/opinion analysis
Architectures for generic sentiment analysis systems; Sentiment analysis techniques on social media; Document-level analysis; Sentence-level analysis; Aspect-based analysis; Comparative-sentiment analysis; Sentiment lexicon acquisition; Optimizing sentiment analysis algorithms; Applications of sentiment analysis
Semantic networking
Semantic-based QoS (Quality of Service) control and scheduling; Semantic QoE (Quality of Experience) evaluation; Semantic-based Internet data streaming and delivery; Semantics enabled networking and middleware; Semantic routing; Semantic interfaces
Domain-oriented semantic applications
Semantics for managing pharmaceutical data; Semantic processing for biomedical knowledge; Speech, text and picture recognition; Semantic email workflow and content; Semantic blogs and wikis; Semantic email addressing; Semantic web and digital libraries; Semantic processing in e-Health; Semantic-driven tutoring systems
Economics and governance of semantics technologies
Organizational views; Legal; Business; Regulations; Assessment; Standards; Harmonization; Cross-nation mediation
Semantic applications/platforms/tools
Market for semantic technologies; Applications, services and systems based on semantic processing; User friendly semantic system integration tools; Ontology-based data transformation and data migration tools; Ontology mapping tools and languages; Ontology-enabled interoperability in e-science, life sciences, e-business, culture; Commercial cost models for semantic applications; Semantic solutions for business intelligence; Semantic processing platforms ; Supporting ontology platforms/tools (Prot�g�, etc); Semantic query languages (SPARQL, etc); Ontology-enabled search engines; Semantic Web search engines; Interoperability of data, systems, and organizations; Experiments and lessons learned; Standard activities
----------------------
Committee: http://www.iaria.org/conferences2015/ComSEMAPRO15.html
================================================
=================
The submission deadline is March 18, 2015.
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to SEMAPRO 2015.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== SEMAPRO 2015 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
SEMAPRO 2015, The Ninth International Conference on Advances in Semantic Processing
July 19 - 24, 2015 - Nice, France
General page: http://www.iaria.org/conferences2015/SEMAPRO15.html
Call for Papers: http://www.iaria.org/conferences2015/CfPSEMAPRO15.html
Submission page: http://www.iaria.org/conferences2015/SubmitSEMAPRO15.html
Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]
Proposals for:
- mini-symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posed on www.iaria.org]
- panels: [slide-deck posed on www.iaria.org]
Submission deadline: March 18, 2015
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the editorial rules: http://www.iaria.org/editorialrules.html
SEMAPRO 2015 Topics (topics and submission details: see CfP on the site)
Basics on semantics
Fundamental of semantics processing; Semantic-based techniques for feature selection; Semantic-based pruning; Semantic interoperability; Semantics uncertainty; Semantics pre-processing and post-processing; Semantics harmonization; Constraint-based semantics processing; Embedded semantics into the discovery process; Semantics in spatial and spatio-temporal models
Ontology fundamentals for semantic processing
Ontology learning; Ontology for semantic interoperability; Ontologies and data pre-processing; Ontology-based evaluation and semantic patterns; Global core ontologies; Progressive ontologies; Bridging semantics through ontologies; Ontology mapping and ontology visualization; Ontology in information systems; Ontology-based semantic mediation; Ontology design and maintenance for conceptual model integration; Reverse engineering of ontologies from conceptual model; Ontologies for explanation generation
Semantic technologies
Basics of Ontology and Semantic Web; Semantic storing, computing, representation, communications; Semantic-driven system design; Syntactic and semantic processing models; Hardware and software support for semantic processing; Microprocessors for semantic processing; Multi-model semantic systems; Semantic annotation of multimedia supports; Semantic multimedia information retrieval; Natural language semantic processing; Context-based semantic processing; Content-based semantic processing; Scalability to the Web level; Performance in semantic processing; Information security in semantic processing; Explaining semantic processing and its results
Models and ontology-based design of protocols, architectures and services
Fundamentals in theory; Modeling methodologies; Models and Ontology-driven Technologies (for the communications system design); Models and ontology relationships; Multi-models coherence. Models and ontology-based communications services and protocols; Semantics of services and service modeling; Protocol models and semantics; Application and quality of experience semantics; Services and protocols semantics; Models and ontology-based cross-layer services and architectures design; Models and ontology-based software frameworks; Composition of Services and Composability rules; Cross-layering services models, components and implementations
Semantic Deep Web
Ontology plug-in search; Information extraction from the Deep Web /e-commerce sites/; Semantic Deep Web annotation and indexing; Deep Web-based ontology; Semantic Deep Web crawlers; Semantic browsing and visualization; Semantic Deep Web data fusion; Semiautomatic ontology generation; Metrics for quality of ontology; Similarity measures for ontology alignment; Measurements for quality of search; Tools for semantic Deep Web; Experience extraction from the Web
Semantic reasoning
Reasoning methods; Reasoning for the Web; Ontology expressiveness; Ontology alignment, mapping and merging; Expressing formal semantics; Languages (RDF, RDF Schema, OWL, etc); Robustness of reasoning on the Web; Patterns on semantic reasoning; Querying and searching; Scalable and tolerant reasoning; Dynamic reasoning for the Semantic Web; Ontologies and problem-solving methods; Computational learning theory; Approximate reasoning/computing; Strategies for abstraction and compression of information; Cognitive semantic reasoning; Attention semantic scoping; Recency-based self-optimizing memory; Cost-benefit trade-off reasoning models; Negotiation in obtaining near-optimal reasoning results under bounded resources; Case-based reasoning
Semantic content searching
Methodologies for innovative information retrieval technologies; Combinatorial search; Massive search-spaces with heuristics (e.g., based on Monte Carlo simulations); Searching using metadata, semantics, and ontology; Advanced searching in digital libraries; Advanced use of RDF and OWL; Expressiveness of the content ontologies; Inherent inconsistency and incompleteness of data on the Web; Scalability of semantic processing; Specialized search engines (Hakia, Matrixware and seekda)
Hypertext and hypermedia semantic
Hypertext techniques and semantic applications; Hypertext and ontologies; Hypertext semantic models; Spatial semantic hypertext; Self-organized hypertext; Semantic adaptive hypertext; Web and hypertext link analysis; Hypertexts and semantic Web; Hypertext semantic applications
Semantic voice-video-speech (VVS) searching
Engines and methods for VVS advanced searching; Patterns in VVS searching; Contextual VVS searching; Rapid VVS searching; Accuracy in VVS searching; Noise in VVS searching; Performance in VVS searching; Metrics for VVS searching; Text and VVS searching; Applications of VVS
Semantic multimedia
Efficient storage of structured data that scale to a very large size; Automatic generation of multimedia presentations; Advanced process for multimedia information mining; Semantic metadata extraction; Annotation tools and methods for content semantics; Media ontology generation/learning/reasoning; Semantic multimedia streaming; Semantics enabled multimedia applications /annotation/browsing/storage/retrieval/visualization
Semantic social media
Community detection and evolution in social media; Recommendation and ranking systems; Search in social media; Event detection, trend identification and tracking in social media; Influence, trust and reputation in social media; Opinion/sentiment analysis, polarity identification; Feed distillation and ranking blogs; Mining microblogging and real time data; Folksonomy, tag semantics, clustering and usage; Advertising models for the social web; Indexing social media content, index freshness; Visualizing social network data; Spam detection, social network spam and profile spam
Semantics for sentiment/opinion analysis
Architectures for generic sentiment analysis systems; Sentiment analysis techniques on social media; Document-level analysis; Sentence-level analysis; Aspect-based analysis; Comparative-sentiment analysis; Sentiment lexicon acquisition; Optimizing sentiment analysis algorithms; Applications of sentiment analysis
Semantic networking
Semantic-based QoS (Quality of Service) control and scheduling; Semantic QoE (Quality of Experience) evaluation; Semantic-based Internet data streaming and delivery; Semantics enabled networking and middleware; Semantic routing; Semantic interfaces
Domain-oriented semantic applications
Semantics for managing pharmaceutical data; Semantic processing for biomedical knowledge; Speech, text and picture recognition; Semantic email workflow and content; Semantic blogs and wikis; Semantic email addressing; Semantic web and digital libraries; Semantic processing in e-Health; Semantic-driven tutoring systems
Economics and governance of semantics technologies
Organizational views; Legal; Business; Regulations; Assessment; Standards; Harmonization; Cross-nation mediation
Semantic applications/platforms/tools
Market for semantic technologies; Applications, services and systems based on semantic processing; User friendly semantic system integration tools; Ontology-based data transformation and data migration tools; Ontology mapping tools and languages; Ontology-enabled interoperability in e-science, life sciences, e-business, culture; Commercial cost models for semantic applications; Semantic solutions for business intelligence; Semantic processing platforms ; Supporting ontology platforms/tools (Prot�g�, etc); Semantic query languages (SPARQL, etc); Ontology-enabled search engines; Semantic Web search engines; Interoperability of data, systems, and organizations; Experiments and lessons learned; Standard activities
----------------------
Committee: http://www.iaria.org/conferences2015/ComSEMAPRO15.html
================================================
Tuesday, March 3, 2015
[DMANET] Post-doc fellowship: Modeling the spread of infectious diseases through transport networks and human mobility
*Post-doc fellowship: Modeling the spread of infectious diseases through
transport networks and human mobility *at The University of New South
Wales *(posted
4/3/15).*
A one year post-doc fellowship starting in 2015, with a possibility of
extension is available for a suitably qualified candidate to work on the
topic of the spread of infectious diseases. The research will focus on the
development of optimization based network models for predicting outbreak
behaviour, and developing control measures. The researcher will be part of
a multidisciplinary research team which includes the School of Civil and
Environmental Engineering and the School of Public Health and Community
Medicine.
The role: this study is motivated by the need to track viruses through
space and time in order to understand outbreak behaviour of emerging
infectious diseases, and aid in the implementation of real-time containment
strategies. Most epidemiologic models are not able to reconstruct the
contagion process of an ongoing outbreak to reveal information about the
current state of the network. Thus, there exists a gap in the literature
which calls for scenario specific disease prediction models. Recent
advances in social and activity based travel modelling and real time case
reporting offer invaluable information which can be utilized during
outbreaks to track the infection process. As such, it is critical to
develop methods which can exploit this data in aiding the prevention and
mitigation of contagion episodes.
The person: we are seeking an applicant with a background in mathematics,
physics, complex systems, engineering or a related field with a
quantitative background in network modelling and optimization.
Contact: If you are interested in this position or would like additional
information, please contact Dr. Lauren Gardner on l.gardner@unsw.edu.au
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
transport networks and human mobility *at The University of New South
Wales *(posted
4/3/15).*
A one year post-doc fellowship starting in 2015, with a possibility of
extension is available for a suitably qualified candidate to work on the
topic of the spread of infectious diseases. The research will focus on the
development of optimization based network models for predicting outbreak
behaviour, and developing control measures. The researcher will be part of
a multidisciplinary research team which includes the School of Civil and
Environmental Engineering and the School of Public Health and Community
Medicine.
The role: this study is motivated by the need to track viruses through
space and time in order to understand outbreak behaviour of emerging
infectious diseases, and aid in the implementation of real-time containment
strategies. Most epidemiologic models are not able to reconstruct the
contagion process of an ongoing outbreak to reveal information about the
current state of the network. Thus, there exists a gap in the literature
which calls for scenario specific disease prediction models. Recent
advances in social and activity based travel modelling and real time case
reporting offer invaluable information which can be utilized during
outbreaks to track the infection process. As such, it is critical to
develop methods which can exploit this data in aiding the prevention and
mitigation of contagion episodes.
The person: we are seeking an applicant with a background in mathematics,
physics, complex systems, engineering or a related field with a
quantitative background in network modelling and optimization.
Contact: If you are interested in this position or would like additional
information, please contact Dr. Lauren Gardner on l.gardner@unsw.edu.au
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP: SWANSITY 2015 (in conjunction with IEEE SECON), deadline April 1
=============================================================
CFP: SWANSITY 2015 - 2nd Workshop on Smart Wireless Access Networks for Smart cITY
>>>>> In conjunction with SECON 2015 <<<<<
=============================================================
22 June 2015, SEATTLE - USA
http://secon2015.ieee-secon.org/workshops/smart-wireless-access-networks-smart-city
Important dates
Submission deadline (Hard): April 1st, 2015
Notification of acceptance: April 15th, 2015
Camera Ready: April 30th, 2015
Workshop: June 22nd, 2015
Scope
The main goals of a smart-city are to improve sustainability and livability, to ease city government and organization, and to increase services to the citizens. The primary role of ICT in enabling this vision is to keep the decision makers, the stake holders and the citizen constantly updated with fresh information collected around the city.
To accomplish this task, next generation cities, will be populated with billion of heterogeneous devices ranging from tiny communicating objects (e.g., actuators, sensors, tags) able to interact with the surrounding environment and remote systems, to high-end nodes (e.g., data centers, workstations) capable of complex operations and to process an huge amount of information. In this futuristic scenario a very special role is played by citizens with their smartphones, tablets and portable devices. They are constantly connected with whatever surroundings them and they are formidable information consumers. At the same time, citizens roaming around the city may be considered as mobile probes which, by making uses of cyber and physical data accessible by smartphones, can analyze the situation and produce reports to the community. Furthermore smartphones can actively contributing in creating the communication infrastructure by forwarding data coming from surrounding devices.
All in all, cities are going to become a new complex ecosystem which has the potentiality to offer many amazing features and support innovative application. Unfortunately, fully exploiting, managing and accessing that ecosystem are still far to be fully viable and their fulfillment surely poses a formidable challenge.
The SWANSITY workshop aims to solicit contributions on novel algorithms, methodological studies and experimentations on how to enable the formerly described ecosystem. Specifically, on how devise a city-wide networking infrastructure capable to efficiently guarantee communication in the new envisaged ecosystem, to manage the complexity of heterogeneous devices and access technologies, and to guarantee robust, ubiquitous, and secure connectivity over the urban environments.
In line with such objectives, original contributions are solicited in topics of interest including, but not limited to, the following:
- Models of network components, interactions on a smart-city
- Enabling wireless and mobile technologies for smart cities
- Novel communication protocols for M2M Communications;
- Device-2-Device Communications (D2D);
- IoT architectures and middleware for smart cities;
- Self-organizing wireless networks for pervasive urban access;
- Network virtualization for heterogeneous wireless networks;
- Distributed Sensing and Control in Smart Cities;
- Mobile-aware cloud computing models, infrastructures, and approaches for smart cities
- Smartphone-based sensing systems, tools, applications in Smart City environments;
- Smartphone and mobile systems and applications;
- Cyber-physical interactions with smartphones;
- Crowd sourcing in smart cities;
- Dynamic trust management models for Smartphone based networks and applications;
- Cooperation incentive models for Smartphone based networks and applications;
- Reliability, Security, Privacy and Trust in smart cities ecosystems;
- Business model to promote users collaboration and resources sharing in smart cities ecosystems;
- Testbed demonstrating the feasibility of Smartphone based networks and interaction with Cyber physical Systems;
- Applications, Business, Standards, and Social Issue;
- Security models to promote Smartphone collaboration and resources sharing
- Cooperative Smart Objects supporting Wireless Networks Interoperability and Management
To be published in the IEEE SWANSITY Proceedings and to be eligible for publication in IEEE Xplore, an author of an accepted paper is required to register for the workshop at the full (member or non-member) rate and the paper must be presented by an author of that paper at the conference unless the TPC Chair grants permission for a substitute presenter arranged in advance of the event and who is qualified both to present and answer questions. Non-refundable registration fees must be paid prior to uploading the final IEEE formatted, publication-ready version of the paper. For authors with multiple accepted papers, one full registration is valid for up to 3 papers. Accepted and presented papers will be published in the IEEE SWANSITY Proceedings and submitted to IEEE Xplore.
Submission Instructions:
Prospective authors are invited to submit original technical paper by the deadline of 1st April 2015. Submissions will be accepted through EDAS. All submissions must be written in English and be at most six (6) printed pages in length, including figures.
For full details, please visit the following website: http://secon2015.ieee-secon.org/workshops/smart-wireless-access-networks-smart-city
TPC Co-Chairs
Valeria LOSCRI' - Inria Lille-Nord Europe, FUN, France
Pasquale PACE - University of Calabria, Italy
Giuseppe RUGGERI - University of Reggio Calabria, Italy
Zhengguo SHENG - University of British Columbia (UBC), Canada
Steering Committee
Gianluca Aloi - University of Calabria - Italy
Emanuele Viterbo - Monash University - Australia
Giancarlo Fortino - University of Calabria - Italy
TPC Members
Davide Adami - CNIT-University of Pisa, Italy
Jesus Alonso-Zarate - CTTC: Centre Tecnol?ic Telecomunicacions Catalunya, Spain
Luca Bedogni - University of Bologna, Italy
Orazio Briante - University of Reggio Calabria, Italy
Marcos Fagundes Caetano - University of Brasilia, Brasil
Claudia Campolo - University of Reggio Calabria, Italy
Marco Di Felice - University of Bologna, Italy
Yaser P. Fallah - West Virginia University (WVU), USA
Hassan Ghasemzadeh - Washington State University, USA
Stefano Giordano - University of Pisa, Italy
Ali Hazmi - Tampere University of Technology, Finland
Xiping Hu - The university of British Columbia, Canada
Antonio Iera - University of Reggio Calabria, Italy
Hao Liang - University of Alberta, Canada
Annamaria Mandalari - Universidad Carlos III de Madrid (UC3M), Spain
Pietro Manzoni - Universitat Politecnica de Valencia, Spain
Liang Ma - IBM T. J. Watson Research Center, NY, USA
Nathalie Mitton - Inria Lille-Nord Europe / FUN, France
Antonella Molinaro - University of Reggio Calabria, Italy
Enrico Natalizio - Compiegne Technology University, France
Sotiris Nikoletseas - University of Patras and CTI, Greece
Sema Oktug - Istanbul Technical University, Turkey
Al-Sakib Khan Pathan - International Islamic University (IIUM), Kuala Lumpur, Malaysia
Tahiry Razafindralambo - Inria Lille-Nord Europe / FUN, France
Pratap Kumar Sahu - University of Montreal, Canada
Anna Maria Vegni - University of Roma Tre, Italy
Ranga Rao Venkatesha Prasad - TU Delft, The Netherlands
Athanasios V. Vasilakos - Kuwait University, Kuwait
상기 메일은 지정된 수신인만을 위한 것이며, 「개인정보보호법」 법령에 따라 보호의 대상이 되는 개인정보가 포함되었을 수 있습니다. 본 문서에 포함된 정보를 무단으로 사용하거나 제3자에게 공개하는 것은 엄격히 금지됩니다. 본 메일이 잘못 발송된 경우, 발신인 또는 한림대학교에 알려주시고, 즉시 삭제하여 주시기 바랍니다.DISCLAIMER:This e-mail message and its attachments contain information that may be privileged or confidential and is the property of Hallym University. This message is only intended for the person to whom it is addressed, therefore if you are not the intended recipient, please note that you are not authorized to read, print, retain, copy disseminate, distribute, or use this message or any part thereof. If you received this message in error, please notify the sender immediately and delete all copies of this message.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CFP: SWANSITY 2015 - 2nd Workshop on Smart Wireless Access Networks for Smart cITY
>>>>> In conjunction with SECON 2015 <<<<<
=============================================================
22 June 2015, SEATTLE - USA
http://secon2015.ieee-secon.org/workshops/smart-wireless-access-networks-smart-city
Important dates
Submission deadline (Hard): April 1st, 2015
Notification of acceptance: April 15th, 2015
Camera Ready: April 30th, 2015
Workshop: June 22nd, 2015
Scope
The main goals of a smart-city are to improve sustainability and livability, to ease city government and organization, and to increase services to the citizens. The primary role of ICT in enabling this vision is to keep the decision makers, the stake holders and the citizen constantly updated with fresh information collected around the city.
To accomplish this task, next generation cities, will be populated with billion of heterogeneous devices ranging from tiny communicating objects (e.g., actuators, sensors, tags) able to interact with the surrounding environment and remote systems, to high-end nodes (e.g., data centers, workstations) capable of complex operations and to process an huge amount of information. In this futuristic scenario a very special role is played by citizens with their smartphones, tablets and portable devices. They are constantly connected with whatever surroundings them and they are formidable information consumers. At the same time, citizens roaming around the city may be considered as mobile probes which, by making uses of cyber and physical data accessible by smartphones, can analyze the situation and produce reports to the community. Furthermore smartphones can actively contributing in creating the communication infrastructure by forwarding data coming from surrounding devices.
All in all, cities are going to become a new complex ecosystem which has the potentiality to offer many amazing features and support innovative application. Unfortunately, fully exploiting, managing and accessing that ecosystem are still far to be fully viable and their fulfillment surely poses a formidable challenge.
The SWANSITY workshop aims to solicit contributions on novel algorithms, methodological studies and experimentations on how to enable the formerly described ecosystem. Specifically, on how devise a city-wide networking infrastructure capable to efficiently guarantee communication in the new envisaged ecosystem, to manage the complexity of heterogeneous devices and access technologies, and to guarantee robust, ubiquitous, and secure connectivity over the urban environments.
In line with such objectives, original contributions are solicited in topics of interest including, but not limited to, the following:
- Models of network components, interactions on a smart-city
- Enabling wireless and mobile technologies for smart cities
- Novel communication protocols for M2M Communications;
- Device-2-Device Communications (D2D);
- IoT architectures and middleware for smart cities;
- Self-organizing wireless networks for pervasive urban access;
- Network virtualization for heterogeneous wireless networks;
- Distributed Sensing and Control in Smart Cities;
- Mobile-aware cloud computing models, infrastructures, and approaches for smart cities
- Smartphone-based sensing systems, tools, applications in Smart City environments;
- Smartphone and mobile systems and applications;
- Cyber-physical interactions with smartphones;
- Crowd sourcing in smart cities;
- Dynamic trust management models for Smartphone based networks and applications;
- Cooperation incentive models for Smartphone based networks and applications;
- Reliability, Security, Privacy and Trust in smart cities ecosystems;
- Business model to promote users collaboration and resources sharing in smart cities ecosystems;
- Testbed demonstrating the feasibility of Smartphone based networks and interaction with Cyber physical Systems;
- Applications, Business, Standards, and Social Issue;
- Security models to promote Smartphone collaboration and resources sharing
- Cooperative Smart Objects supporting Wireless Networks Interoperability and Management
To be published in the IEEE SWANSITY Proceedings and to be eligible for publication in IEEE Xplore, an author of an accepted paper is required to register for the workshop at the full (member or non-member) rate and the paper must be presented by an author of that paper at the conference unless the TPC Chair grants permission for a substitute presenter arranged in advance of the event and who is qualified both to present and answer questions. Non-refundable registration fees must be paid prior to uploading the final IEEE formatted, publication-ready version of the paper. For authors with multiple accepted papers, one full registration is valid for up to 3 papers. Accepted and presented papers will be published in the IEEE SWANSITY Proceedings and submitted to IEEE Xplore.
Submission Instructions:
Prospective authors are invited to submit original technical paper by the deadline of 1st April 2015. Submissions will be accepted through EDAS. All submissions must be written in English and be at most six (6) printed pages in length, including figures.
For full details, please visit the following website: http://secon2015.ieee-secon.org/workshops/smart-wireless-access-networks-smart-city
TPC Co-Chairs
Valeria LOSCRI' - Inria Lille-Nord Europe, FUN, France
Pasquale PACE - University of Calabria, Italy
Giuseppe RUGGERI - University of Reggio Calabria, Italy
Zhengguo SHENG - University of British Columbia (UBC), Canada
Steering Committee
Gianluca Aloi - University of Calabria - Italy
Emanuele Viterbo - Monash University - Australia
Giancarlo Fortino - University of Calabria - Italy
TPC Members
Davide Adami - CNIT-University of Pisa, Italy
Jesus Alonso-Zarate - CTTC: Centre Tecnol?ic Telecomunicacions Catalunya, Spain
Luca Bedogni - University of Bologna, Italy
Orazio Briante - University of Reggio Calabria, Italy
Marcos Fagundes Caetano - University of Brasilia, Brasil
Claudia Campolo - University of Reggio Calabria, Italy
Marco Di Felice - University of Bologna, Italy
Yaser P. Fallah - West Virginia University (WVU), USA
Hassan Ghasemzadeh - Washington State University, USA
Stefano Giordano - University of Pisa, Italy
Ali Hazmi - Tampere University of Technology, Finland
Xiping Hu - The university of British Columbia, Canada
Antonio Iera - University of Reggio Calabria, Italy
Hao Liang - University of Alberta, Canada
Annamaria Mandalari - Universidad Carlos III de Madrid (UC3M), Spain
Pietro Manzoni - Universitat Politecnica de Valencia, Spain
Liang Ma - IBM T. J. Watson Research Center, NY, USA
Nathalie Mitton - Inria Lille-Nord Europe / FUN, France
Antonella Molinaro - University of Reggio Calabria, Italy
Enrico Natalizio - Compiegne Technology University, France
Sotiris Nikoletseas - University of Patras and CTI, Greece
Sema Oktug - Istanbul Technical University, Turkey
Al-Sakib Khan Pathan - International Islamic University (IIUM), Kuala Lumpur, Malaysia
Tahiry Razafindralambo - Inria Lille-Nord Europe / FUN, France
Pratap Kumar Sahu - University of Montreal, Canada
Anna Maria Vegni - University of Roma Tre, Italy
Ranga Rao Venkatesha Prasad - TU Delft, The Netherlands
Athanasios V. Vasilakos - Kuwait University, Kuwait
상기 메일은 지정된 수신인만을 위한 것이며, 「개인정보보호법」 법령에 따라 보호의 대상이 되는 개인정보가 포함되었을 수 있습니다. 본 문서에 포함된 정보를 무단으로 사용하거나 제3자에게 공개하는 것은 엄격히 금지됩니다. 본 메일이 잘못 발송된 경우, 발신인 또는 한림대학교에 알려주시고, 즉시 삭제하여 주시기 바랍니다.DISCLAIMER:This e-mail message and its attachments contain information that may be privileged or confidential and is the property of Hallym University. This message is only intended for the person to whom it is addressed, therefore if you are not the intended recipient, please note that you are not authorized to read, print, retain, copy disseminate, distribute, or use this message or any part thereof. If you received this message in error, please notify the sender immediately and delete all copies of this message.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP: FOG Networking for 5G and IoT (in conjunction with IEEE SECON), deadline April 1
IA0KPT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT0NCkNGUDogRm9nIE5l
dHdvcmtpbmcgZm9yIDVHIGFuZCBJb1Qgd29ya3Nob3ANCj4+Pj4+IEluIGNvbmp1bmN0aW9uIHdp
dGggU0VDT04gMjAxNSA8PDw8PA0KPT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09
PT09PT0NCjIyIEp1bmUgMjAxNSwgU0VBVFRMRSAtIFVTQQ0KIA0KaHR0cDovL3NlY29uMjAxNS5p
ZWVlLXNlY29uLm9yZy93b3Jrc2hvcHMvZm9nLW5ldHdvcmtpbmctNWctYW5kLWlvdC13b3Jrc2hv
cCANCiANCkltcG9ydGFudCBkYXRlcw0KU3VibWlzc2lvbiBkZWFkbGluZShIYXJkKTogQXByaWwg
MXN0LCAyMDE1DQpOb3RpZmljYXRpb24gb2YgYWNjZXB0YW5jZTogQXByaWwgMTV0aCwgMjAxNQ0K
Q2FtZXJhIFJlYWR5OiBBcHJpbCAzMHRoLCAyMDE1DQpXb3Jrc2hvcDogSnVuZSAyMm5kLCAyMDE1
DQogDQogDQpTY29wZTogDQogDQpQdXNoaW5nIGNvbXB1dGF0aW9uLCBjb250cm9sIGFuZCBzdG9y
YWdlIGludG8gdGhlICZxdW90O2Nsb3VkJnF1b3Q7IGhhcyBiZWVuIGEga2V5IHRyZW5kIGluIG5l
dHdvcmtpbmcgaW4gdGhlIHBhc3QgZGVjYWRlLiBPdmVyLWRlcGVuZGVuY2Ugb24gdGhlIGNsb3Vk
LCBob3dldmVyLCBpbmRpY2F0ZXMgdGhhdCBhdmFpbGFiaWxpdHkgYW5kIGZhdWx0IHRvbGVyYW5j
ZSBpc3N1ZXMgaW4gdGhlIGNsb3VkIHdvdWxkIGRpcmVjdGx5IGltcGFjdCBtaWxsaW9ucyBvZiBl
bmQtdXNlcnMuIEluZGVlZCwgdGhlIGNsb3VkIGlzIG5vdyAmcXVvdDtkZXNjZW5kaW5nJnF1b3Q7
IHRvIHRoZSBuZXR3b3JrIGVkZ2UgYW5kIG9mdGVuIGRpZmZ1c2VkIGFtb25nIHRoZSBjbGllbnQg
ZGV2aWNlcyBpbiBib3RoIG1vYmlsZSBhbmQgd2lyZWxpbmUgbmV0d29ya3MuIFRoZSBjbG91ZCBp
cyBiZWNvbWluZyB0aGUgJnF1b3Q7Zm9nLiZxdW90OyANCkVtcG93ZXJlZCBieSB0aGUgbGF0ZXN0
IGNoaXBzLCByYWRpb3MsIGFuZCBzZW5zb3JzLCBlYWNoIGNsaWVudCBkZXZpY2UgdG9kYXkgaXMg
cG93ZXJmdWwgaW4gY29tcHV0YXRpb24sIGluIHN0b3JhZ2UsIGluIHNlbnNpbmcgYW5kIGluIGNv
bW11bmljYXRpb24uIFlldCBjbGllbnQgZGV2aWNlcyBhcmUgc3RpbGwgbGltaXRlZCBpbiBiYXR0
ZXJ5IHBvd2VyLCBnbG9iYWwgdmlldyBvZiB0aGUgbmV0d29yaywgYW5kIG1vYmlsaXR5IHN1cHBv
cnQuIE1vc3QgaW50ZXJlc3RpbmdseSwgdGhlIGNvbGxlY3Rpb24gb2YgbWFueSBjbGllbnRzIGlu
IGEgY3Jvd2QgcHJlc2VudHMgYSBoaWdobHkgZGlzdHJpYnV0ZWQsIHVuZGVyLW9yZ2FuaXplZCwg
YW5kIHBvc3NpYmx5IGRlbnNlIG5ldHdvcmsuIEZ1cnRoZXIsIHdpcmVsZXNzIG5ldHdvcmtzIGlz
IGluY3JlYXNpbmdseSB1c2VkIGxvY2FsbHksIGUuZy4gaW50cmEtYnVpbGRpbmcsIGludHJhLXZl
aGljbGUsIGFuZCBwZXJzb25hbCBib2R5LWFyZWEgbmV0d29ya3M7IGFuZCBkYXRhIGdlbmVyYXRl
ZCBsb2NhbGx5IGlzIGluY3JlYXNpbmdseSBjb25zdW1lZCBsb2NhbGx5Lg0KRm9nIE5ldHdvcmsg
cHJlc2VudHMgYW4gYXJjaGl0ZWN0dXJlIHRoYXQgdXNlcyBvbmUgb3IgYSBjb2xsYWJvcmF0aXZl
IG11bHRpdHVkZSBvZiBlbmQtdXNlciBjbGllbnRzIG9yIG5lYXItdXNlciBlZGdlIGRldmljZXMg
dG8gY2Fycnkgb3V0IHN0b3JhZ2UsIGNvbW11bmljYXRpb24sIGNvbXB1dGF0aW9uLCBhbmQgY29u
dHJvbCBpbiBhIG5ldHdvcmsuIA0KSXQgaXMgYW4gYXJjaGl0ZWN0dXJlIHRoYXQgd2lsbCBzdXBw
b3J0IHRoZSBJbnRlcm5ldCBvZiBUaGluZ3MsIGhldGVyb2dlbmVvdXMgNUcgbW9iaWxlIHNlcnZp
Y2VzLCBhbmQgaG9tZSBhbmQgcGVyc29uYWwgYXJlYSBuZXR3b3Jrcy4gRm9nIE5ldHdvcmtpbmcg
bGV2ZXJhZ2VzIHBhc3QgZXhwZXJpZW5jZSBpbiBzZW5zb3IgbmV0d29ya3MsIFAyUCBhbmQgTUFO
RVQgcmVzZWFyY2gsIGFuZCBpbmNvcnBvcmF0ZXMgdGhlIGxhdGVzdCBhZHZhbmNlcyBpbiBkZXZp
Y2VzLCBuZXR3b3JrIHN5c3RlbXMsIGFuZCBkYXRhIHNjaWVuY2UgdG8gcmVzaGFwZSB0aGUgJnF1
b3Q7YmFsYW5jZSBvZiBwb3dlciZxdW90OyBpbiB0aGUgZWNvc3lzdGVtIG9mIGNvbXB1dGluZyBh
bmQgbmV0d29ya2luZy4gDQpBcyB0aGUgZmlyc3QgaGlnaC1xdWFsaXR5IElFRUUgd29ya3Nob3Ag
aW4gdGhlIGVtZXJnZW50IGFyZWEgb2YgRm9nIE5ldHdvcmtpbmcsIHRoaXMgd29ya3Nob3AncyBz
Y29wZSBpbmNsdWRlczoNCi0gCUVkZ2UgZGF0YSBhbmFseXRpY3MgYW5kIHN0cmVhbSBtaW5pbmcg
DQotIAlFZGdlIHJlc291cmNlIHBvb2xpbmcgDQotIAlFZGdlIGNhY2hpbmcgYW5kIGRpc3RyaWJ1
dGVkIGRhdGEgY2VudGVyIA0KLSAJQ2xpZW50LXNpZGUgbWVhc3VyZW1lbnQgYW5kIGNyb3dkLXNl
bnNpbmcNCi0gCUNsaWVudC1zaWRlIGNvbnRyb2wgYW5kIGNvbmZpZ3VyYXRpb24gDQotIAlTZWN1
cml0eSBhbmQgcHJpdmFjeSBpbiBGb2cgDQotIAlGb2cgYXBwbGljYXRpb25zIGluIElvVA0KLSAJ
Rm9nIGFwcGxpY2F0aW9ucyBpbiA1RyANCi0gCUZvZyBhcHBsaWNhdGlvbnMgaW4gaG9tZSBhbmQg
cGVyc29uYWwgYXJlYSBuZXR3b3JraW5nIA0KIA0KVG8gYmUgcHVibGlzaGVkIGluIHRoZSBJRUVF
IEZPRyBDb25mZXJlbmNlIFByb2NlZWRpbmdzIGFuZCB0byBiZSBlbGlnaWJsZSBmb3IgcHVibGlj
YXRpb24gaW4gSUVFRSBYcGxvcmUsIGFuIGF1dGhvciBvZiBhbiBhY2NlcHRlZCBwYXBlciBpcyBy
ZXF1aXJlZCB0byByZWdpc3RlciBmb3IgdGhlIGNvbmZlcmVuY2UgYXQgdGhlIGZ1bGwgKG1lbWJl
ciBvciBub24tbWVtYmVyKSByYXRlIGFuZCB0aGUgcGFwZXIgbXVzdCBiZSBwcmVzZW50ZWQgYnkg
YW4gYXV0aG9yIG9mIHRoYXQgcGFwZXIgYXQgdGhlIGNvbmZlcmVuY2UgdW5sZXNzIHRoZSBUUEMg
Q2hhaXIgZ3JhbnRzIHBlcm1pc3Npb24gZm9yIGEgc3Vic3RpdHV0ZSBwcmVzZW50ZXIgYXJyYW5n
ZWQgaW4gYWR2YW5jZSBvZiB0aGUgZXZlbnQgYW5kIHdobyBpcyBxdWFsaWZpZWQgYm90aCB0byBw
cmVzZW50IGFuZCBhbnN3ZXIgcXVlc3Rpb25zLiAgTm9uLXJlZnVuZGFibGUgcmVnaXN0cmF0aW9u
IGZlZXMgbXVzdCBiZSBwYWlkIHByaW9yIHRvIHVwbG9hZGluZyB0aGUgZmluYWwgSUVFRSBmb3Jt
YXR0ZWQsIHB1YmxpY2F0aW9uLXJlYWR5IHZlcnNpb24gb2YgdGhlIHBhcGVyLiAgRm9yIGF1dGhv
cnMgd2l0aCBtdWx0aXBsZSBhY2NlcHRlZCBwYXBlcnMsIG9uZSBmdWxsIHJlZ2lzdHJhdGlvbiBp
cyB2YWxpZCBmb3IgdXAgdG8gMyBwYXBlcnMuICBBY2NlcHRlZCBhbmQgcHJlc2VudGVkIHBhcGVy
cyB3aWxsIGJlIHB1Ymxpc2hlZCBpbiB0aGUgSUVFRSBGT0cgQ29uZmVyZW5jZSBQcm9jZWVkaW5n
cyBhbmQgc3VibWl0dGVkIHRvIElFRUUgWHBsb3JlLg0KIA0KIA0KV29ya3Nob3AgQ28tQ2hhaXJz
OiANCiANCk11bmcgQ2hpYW5nDQpBcnRodXIgTGVHcmFuZCBEb3R5IFByb2Zlc3NvciBvZiBFbGVj
dHJpY2FsIEVuZ2luZWVyaW5nDQpEaXJlY3RvciBvZiBLZWxsZXIgQ2VudGVyIGZvciBJbm5vdmF0
aW9uIGluIEVuZ2luZWVyaW5nIEVkdWNhdGlvbiANClByaW5jZXRvbiBVbml2ZXJzaXR5IA0KIA0K
U2FuZ3RhZSBIYQ0KQXNzaXN0YW50IFByb2Zlc3NvciwgQ29tcHV0ZXIgU2NpZW5jZSBEZXBhcnRt
ZW50IA0KVW5pdmVyc2l0eSBvZiBDb2xvcmFkbyBhdCBCb3VsZGVyIA0KIA0KSnVuc2hhbiBaaGFu
ZyANClByb2Zlc3NvciwgRWxlY3RyaWNhbCBhbmQgQ29tcHV0ZXIgRW5naW5lZXJpbmcgRGVwYXJ0
bWVudCANCkFyaXpvbmEgU3RhdGUgVW5pdmVyc2l0eQ0KIA0KV29ya3Nob3AgVGVjaG5pY2FsIFBy
b2dyYW0gQ29tbWl0dGVlOiANCiANCkJoYXJhdGggQmFsYXN1YnJhbWFuaWFuIChBVCZhbXA7VCBM
YWJzKQ0KU3VtYW4gQmFuZXJqZWUgKFVuaXZlcnNpdHkgb2YgV2lzY29uc2luKQ0KSm9obiBCcmFz
c2lsIChIUCBMYWJzKQ0KVGlhbiBCdSAoQmVsbCBMYWJzKQ0KR2FyeSBDaGFuIChIb25nIEtvbmcg
VW5pdmVyc2l0eSBvZiBTY2llbmNlIGFuZCBUZWNobm9sb2d5KQ0KVGlhbiBMYW4gKEdlb3JnZSBX
YXNoaW5ndG9uIFVuaXZlcnNpdHkpDQpBdGhpbmEgTWFya29wb3Vsb3UgKFVDIElydmluZSkNClJh
amVzaCBQYW50YSAoQVQmYW1wO1QgTGFicykNCkNodW5taW5nIFFpYW8gKFVuaXZlcnNpdHkgb2Yg
QnVmZmFsbykgDQpNb28tcnlvbmcgUmEgKEFUJmFtcDtUIExhYnMpDQpUYW8gWmhhbmcgKENpc2Nv
KQ0KIA0KIA0KILvzseIguN7Az8C6IMH2waS1yCC89r3FwM64uMC7IMCnx9EgsM3AzLjnLCChuLCz
wM7BpLq4urjIo7n9obkguf23yb+hILX7tvMgurjIo8DHILTru/PAzCC1x7TCILCzwM7BpLq4sKEg
xvfH1LXHvvrAuyC89iDA1r3AtM+02S4gursgua68rb+hIMb3x9S1yCDBpLq4uKYguau03MC4t84g
u+e/68fPsMWzqiDBpjPA2r+hsNQgsPiws8fPtMIgsM3AuiC+9rDdyPcgsd3B9rXLtM+02S4gursg
uN7Az8DMIMDfuPggud+827XIILDmv+wsILnfvcXAziC2x7TCIMfRuLK068fQsbO/oSC+y7fBwda9
w7DtLCDB773DILvowabHz7+pIMHWvcOx4iC52bb4tM+02S5ESVNDTEFJTUVSOlRoaXMgZS1tYWls
IG1lc3NhZ2UgYW5kIGl0cyBhdHRhY2htZW50cyBjb250YWluIGluZm9ybWF0aW9uIHRoYXQgbWF5
IGJlIHByaXZpbGVnZWQgb3IgY29uZmlkZW50aWFsIGFuZCBpcyB0aGUgcHJvcGVydHkgb2YgSGFs
bHltIFVuaXZlcnNpdHkuIFRoaXMgbWVzc2FnZSBpcyBvbmx5IGludGVuZGVkIGZvciB0aGUgcGVy
c29uIHRvIHdob20gaXQgaXMgYWRkcmVzc2VkLCB0aGVyZWZvcmUgaWYgeW91IGFyZSBub3QgdGhl
IGludGVuZGVkIHJlY2lwaWVudCwgcGxlYXNlIG5vdGUgdGhhdCB5b3UgYXJlIG5vdCBhdXRob3Jp
emVkIHRvIHJlYWQsIHByaW50LCByZXRhaW4sIGNvcHkgZGlzc2VtaW5hdGUsIGRpc3RyaWJ1dGUs
IG9yIHVzZSB0aGlzIG1lc3NhZ2Ugb3IgYW55IHBhcnQgdGhlcmVvZi4gSWYgeW91IHJlY2VpdmVk
IHRoaXMgbWVzc2FnZSBpbiBlcnJvciwgcGxlYXNlIG5vdGlmeSB0aGUgc2VuZGVyIGltbWVkaWF0
ZWx5IGFuZCBkZWxldGUgYWxsIGNvcGllcyBvZiB0aGlzIG1lc3NhZ2Uu
--DC81425433614746.14be276d99a33.MailEdge
Content-Type: text/html;
charset="euc-kr"
Content-Transfer-Encoding: base64
PGltZyBib3JkZXI9MCB3aWR0aD0xIGhlaWdodD0xIHNyYz0iaHR0cDovL21haWwuaGFsbHltLmFj
LmtyOjgwL21lL29ycHQuZG8/YWN0aW9uS2luZD1SMCZ1c2VySWQ9anNvMSZtc2dJZD01NTMyOWQ2
NzJlYjQxJnBlcnNvbmFsPSZlbWFpbEFkZHJlc3M9ZG1hbmV0QHpwci51bmkta29lbG4uZGUiPiAg
PGRpdj4mbmJzcDs8L2Rpdj4NCjxkaXY+PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09
PT09PT09PT08L2Rpdj4NCjxkaXY+Q0ZQOiBGb2cgTmV0d29ya2luZyBmb3IgNUcgYW5kIElvVCB3
b3Jrc2hvcDwvZGl2Pg0KPGRpdj4mZ3Q7Jmd0OyZndDsmZ3Q7Jmd0OyBJbiBjb25qdW5jdGlvbiB3
aXRoIFNFQ09OIDIwMTUgJmx0OyZsdDsmbHQ7Jmx0OyZsdDs8L2Rpdj4NCjxkaXY+PT09PT09PT09
PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT08L2Rpdj4NCjxkaXY+MjIgSnVuZSAyMDE1
LCBTRUFUVExFIC0gVVNBPC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5odHRwOi8vc2Vj
b24yMDE1LmllZWUtc2Vjb24ub3JnL3dvcmtzaG9wcy9mb2ctbmV0d29ya2luZy01Zy1hbmQtaW90
LXdvcmtzaG9wJm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5JbXBvcnRhbnQg
ZGF0ZXM8L2Rpdj4NCjxkaXY+U3VibWlzc2lvbiBkZWFkbGluZShIYXJkKTogQXByaWwgMXN0LCAy
MDE1PC9kaXY+DQo8ZGl2Pk5vdGlmaWNhdGlvbiBvZiBhY2NlcHRhbmNlOiBBcHJpbCAxNXRoLCAy
MDE1PC9kaXY+DQo8ZGl2PkNhbWVyYSBSZWFkeTogQXByaWwgMzB0aCwgMjAxNTwvZGl2Pg0KPGRp
dj5Xb3Jrc2hvcDogSnVuZSAyMm5kLCAyMDE1PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRp
dj4mbmJzcDs8L2Rpdj4NCjxkaXY+U2NvcGU6Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2
Pg0KPGRpdj5QdXNoaW5nIGNvbXB1dGF0aW9uLCBjb250cm9sIGFuZCBzdG9yYWdlIGludG8gdGhl
ICZxdW90O2Nsb3VkJnF1b3Q7IGhhcyBiZWVuIGEga2V5IHRyZW5kIGluIG5ldHdvcmtpbmcgaW4g
dGhlIHBhc3QgZGVjYWRlLiBPdmVyLWRlcGVuZGVuY2Ugb24gdGhlIGNsb3VkLCBob3dldmVyLCBp
bmRpY2F0ZXMgdGhhdCBhdmFpbGFiaWxpdHkgYW5kIGZhdWx0IHRvbGVyYW5jZSBpc3N1ZXMgaW4g
dGhlIGNsb3VkIHdvdWxkIGRpcmVjdGx5IGltcGFjdCBtaWxsaW9ucyBvZiBlbmQtdXNlcnMuIElu
ZGVlZCwgdGhlIGNsb3VkIGlzIG5vdyAmcXVvdDtkZXNjZW5kaW5nJnF1b3Q7IHRvIHRoZSBuZXR3
b3JrIGVkZ2UgYW5kIG9mdGVuIGRpZmZ1c2VkIGFtb25nIHRoZSBjbGllbnQgZGV2aWNlcyBpbiBi
b3RoIG1vYmlsZSBhbmQgd2lyZWxpbmUgbmV0d29ya3MuIFRoZSBjbG91ZCBpcyBiZWNvbWluZyB0
aGUgJnF1b3Q7Zm9nLiZxdW90OyZuYnNwOzwvZGl2Pg0KPGRpdj5FbXBvd2VyZWQgYnkgdGhlIGxh
dGVzdCBjaGlwcywgcmFkaW9zLCBhbmQgc2Vuc29ycywgZWFjaCBjbGllbnQgZGV2aWNlIHRvZGF5
IGlzIHBvd2VyZnVsIGluIGNvbXB1dGF0aW9uLCBpbiBzdG9yYWdlLCBpbiBzZW5zaW5nIGFuZCBp
biBjb21tdW5pY2F0aW9uLiBZZXQgY2xpZW50IGRldmljZXMgYXJlIHN0aWxsIGxpbWl0ZWQgaW4g
YmF0dGVyeSBwb3dlciwgZ2xvYmFsIHZpZXcgb2YgdGhlIG5ldHdvcmssIGFuZCBtb2JpbGl0eSBz
dXBwb3J0LiBNb3N0IGludGVyZXN0aW5nbHksIHRoZSBjb2xsZWN0aW9uIG9mIG1hbnkgY2xpZW50
cyBpbiBhIGNyb3dkIHByZXNlbnRzIGEgaGlnaGx5IGRpc3RyaWJ1dGVkLCB1bmRlci1vcmdhbml6
ZWQsIGFuZCBwb3NzaWJseSBkZW5zZSBuZXR3b3JrLiBGdXJ0aGVyLCB3aXJlbGVzcyBuZXR3b3Jr
cyBpcyBpbmNyZWFzaW5nbHkgdXNlZCBsb2NhbGx5LCBlLmcuIGludHJhLWJ1aWxkaW5nLCBpbnRy
YS12ZWhpY2xlLCBhbmQgcGVyc29uYWwgYm9keS1hcmVhIG5ldHdvcmtzOyBhbmQgZGF0YSBnZW5l
cmF0ZWQgbG9jYWxseSBpcyBpbmNyZWFzaW5nbHkgY29uc3VtZWQgbG9jYWxseS48L2Rpdj4NCjxk
aXY+Rm9nIE5ldHdvcmsgcHJlc2VudHMgYW4gYXJjaGl0ZWN0dXJlIHRoYXQgdXNlcyBvbmUgb3Ig
YSBjb2xsYWJvcmF0aXZlIG11bHRpdHVkZSBvZiBlbmQtdXNlciBjbGllbnRzIG9yIG5lYXItdXNl
ciBlZGdlIGRldmljZXMgdG8gY2Fycnkgb3V0IHN0b3JhZ2UsIGNvbW11bmljYXRpb24sIGNvbXB1
dGF0aW9uLCBhbmQgY29udHJvbCBpbiBhIG5ldHdvcmsuJm5ic3A7PC9kaXY+DQo8ZGl2Pkl0IGlz
IGFuIGFyY2hpdGVjdHVyZSB0aGF0IHdpbGwgc3VwcG9ydCB0aGUgSW50ZXJuZXQgb2YgVGhpbmdz
LCBoZXRlcm9nZW5lb3VzIDVHIG1vYmlsZSBzZXJ2aWNlcywgYW5kIGhvbWUgYW5kIHBlcnNvbmFs
IGFyZWEgbmV0d29ya3MuIEZvZyBOZXR3b3JraW5nIGxldmVyYWdlcyBwYXN0IGV4cGVyaWVuY2Ug
aW4gc2Vuc29yIG5ldHdvcmtzLCBQMlAgYW5kIE1BTkVUIHJlc2VhcmNoLCBhbmQgaW5jb3Jwb3Jh
dGVzIHRoZSBsYXRlc3QgYWR2YW5jZXMgaW4gZGV2aWNlcywgbmV0d29yayBzeXN0ZW1zLCBhbmQg
ZGF0YSBzY2llbmNlIHRvIHJlc2hhcGUgdGhlICZxdW90O2JhbGFuY2Ugb2YgcG93ZXImcXVvdDsg
aW4gdGhlIGVjb3N5c3RlbSBvZiBjb21wdXRpbmcgYW5kIG5ldHdvcmtpbmcuJm5ic3A7PC9kaXY+
DQo8ZGl2PkFzIHRoZSBmaXJzdCBoaWdoLXF1YWxpdHkgSUVFRSB3b3Jrc2hvcCBpbiB0aGUgZW1l
cmdlbnQgYXJlYSBvZiBGb2cgTmV0d29ya2luZywgdGhpcyB3b3Jrc2hvcCdzIHNjb3BlIGluY2x1
ZGVzOjwvZGl2Pg0KPGRpdj4tIDxzcGFuIGNsYXNzPSJBcHBsZS10YWItc3BhbiIgc3R5bGU9Indo
aXRlLXNwYWNlOnByZSI+CTwvc3Bhbj5FZGdlIGRhdGEgYW5hbHl0aWNzIGFuZCBzdHJlYW0gbWlu
aW5nJm5ic3A7PC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHls
ZT0id2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkVkZ2UgcmVzb3VyY2UgcG9vbGluZyZuYnNwOzwv
ZGl2Pg0KPGRpdj4tIDxzcGFuIGNsYXNzPSJBcHBsZS10YWItc3BhbiIgc3R5bGU9IndoaXRlLXNw
YWNlOnByZSI+CTwvc3Bhbj5FZGdlIGNhY2hpbmcgYW5kIGRpc3RyaWJ1dGVkIGRhdGEgY2VudGVy
Jm5ic3A7PC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHlsZT0i
d2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkNsaWVudC1zaWRlIG1lYXN1cmVtZW50IGFuZCBjcm93
ZC1zZW5zaW5nPC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHls
ZT0id2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkNsaWVudC1zaWRlIGNvbnRyb2wgYW5kIGNvbmZp
Z3VyYXRpb24mbmJzcDs8L2Rpdj4NCjxkaXY+LSA8c3BhbiBjbGFzcz0iQXBwbGUtdGFiLXNwYW4i
IHN0eWxlPSJ3aGl0ZS1zcGFjZTpwcmUiPgk8L3NwYW4+U2VjdXJpdHkgYW5kIHByaXZhY3kgaW4g
Rm9nJm5ic3A7PC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHls
ZT0id2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkZvZyBhcHBsaWNhdGlvbnMgaW4gSW9UPC9kaXY+
DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHlsZT0id2hpdGUtc3BhY2U6
cHJlIj4JPC9zcGFuPkZvZyBhcHBsaWNhdGlvbnMgaW4gNUcmbmJzcDs8L2Rpdj4NCjxkaXY+LSA8
c3BhbiBjbGFzcz0iQXBwbGUtdGFiLXNwYW4iIHN0eWxlPSJ3aGl0ZS1zcGFjZTpwcmUiPgk8L3Nw
YW4+Rm9nIGFwcGxpY2F0aW9ucyBpbiBob21lIGFuZCBwZXJzb25hbCBhcmVhIG5ldHdvcmtpbmcm
bmJzcDs8L2Rpdj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2PlRvIGJlIHB1Ymxpc2hlZCBpbiB0
aGUgSUVFRSBGT0cgQ29uZmVyZW5jZSBQcm9jZWVkaW5ncyBhbmQgdG8gYmUgZWxpZ2libGUgZm9y
IHB1YmxpY2F0aW9uIGluIElFRUUgWHBsb3JlLCBhbiBhdXRob3Igb2YgYW4gYWNjZXB0ZWQgcGFw
ZXIgaXMgcmVxdWlyZWQgdG8gcmVnaXN0ZXIgZm9yIHRoZSBjb25mZXJlbmNlIGF0IHRoZSBmdWxs
IChtZW1iZXIgb3Igbm9uLW1lbWJlcikgcmF0ZSBhbmQgdGhlIHBhcGVyIG11c3QgYmUgcHJlc2Vu
dGVkIGJ5IGFuIGF1dGhvciBvZiB0aGF0IHBhcGVyIGF0IHRoZSBjb25mZXJlbmNlIHVubGVzcyB0
aGUgVFBDIENoYWlyIGdyYW50cyBwZXJtaXNzaW9uIGZvciBhIHN1YnN0aXR1dGUgcHJlc2VudGVy
IGFycmFuZ2VkIGluIGFkdmFuY2Ugb2YgdGhlIGV2ZW50IGFuZCB3aG8gaXMgcXVhbGlmaWVkIGJv
dGggdG8gcHJlc2VudCBhbmQgYW5zd2VyIHF1ZXN0aW9ucy4gJm5ic3A7Tm9uLXJlZnVuZGFibGUg
cmVnaXN0cmF0aW9uIGZlZXMgbXVzdCBiZSBwYWlkIHByaW9yIHRvIHVwbG9hZGluZyB0aGUgZmlu
YWwgSUVFRSBmb3JtYXR0ZWQsIHB1YmxpY2F0aW9uLXJlYWR5IHZlcnNpb24gb2YgdGhlIHBhcGVy
LiAmbmJzcDtGb3IgYXV0aG9ycyB3aXRoIG11bHRpcGxlIGFjY2VwdGVkIHBhcGVycywgb25lIGZ1
bGwgcmVnaXN0cmF0aW9uIGlzIHZhbGlkIGZvciB1cCB0byAzIHBhcGVycy4gJm5ic3A7QWNjZXB0
ZWQgYW5kIHByZXNlbnRlZCBwYXBlcnMgd2lsbCBiZSBwdWJsaXNoZWQgaW4gdGhlIElFRUUgRk9H
IENvbmZlcmVuY2UgUHJvY2VlZGluZ3MgYW5kIHN1Ym1pdHRlZCB0byBJRUVFIFhwbG9yZS48L2Rp
dj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5Xb3Jrc2hvcCBD
by1DaGFpcnM6Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5NdW5nIENoaWFu
ZzwvZGl2Pg0KPGRpdj5BcnRodXIgTGVHcmFuZCBEb3R5IFByb2Zlc3NvciBvZiBFbGVjdHJpY2Fs
IEVuZ2luZWVyaW5nPC9kaXY+DQo8ZGl2PkRpcmVjdG9yIG9mIEtlbGxlciBDZW50ZXIgZm9yIElu
bm92YXRpb24gaW4gRW5naW5lZXJpbmcgRWR1Y2F0aW9uJm5ic3A7PC9kaXY+DQo8ZGl2PlByaW5j
ZXRvbiBVbml2ZXJzaXR5Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5TYW5n
dGFlIEhhPC9kaXY+DQo8ZGl2PkFzc2lzdGFudCBQcm9mZXNzb3IsIENvbXB1dGVyIFNjaWVuY2Ug
RGVwYXJ0bWVudCZuYnNwOzwvZGl2Pg0KPGRpdj5Vbml2ZXJzaXR5IG9mIENvbG9yYWRvIGF0IEJv
dWxkZXImbmJzcDs8L2Rpdj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2Pkp1bnNoYW4gWmhhbmcm
bmJzcDs8L2Rpdj4NCjxkaXY+UHJvZmVzc29yLCBFbGVjdHJpY2FsIGFuZCBDb21wdXRlciBFbmdp
bmVlcmluZyBEZXBhcnRtZW50Jm5ic3A7PC9kaXY+DQo8ZGl2PkFyaXpvbmEgU3RhdGUgVW5pdmVy
c2l0eTwvZGl2Pg0KPGRpdj4mbmJzcDs8L2Rpdj4NCjxkaXY+V29ya3Nob3AgVGVjaG5pY2FsIFBy
b2dyYW0gQ29tbWl0dGVlOiZuYnNwOzwvZGl2Pg0KPGRpdj4mbmJzcDs8L2Rpdj4NCjxkaXY+Qmhh
cmF0aCBCYWxhc3VicmFtYW5pYW4gKEFUJmFtcDtUIExhYnMpPC9kaXY+DQo8ZGl2PlN1bWFuIEJh
bmVyamVlIChVbml2ZXJzaXR5IG9mIFdpc2NvbnNpbik8L2Rpdj4NCjxkaXY+Sm9obiBCcmFzc2ls
IChIUCBMYWJzKTwvZGl2Pg0KPGRpdj5UaWFuIEJ1IChCZWxsIExhYnMpPC9kaXY+DQo8ZGl2Pkdh
cnkgQ2hhbiAoSG9uZyBLb25nIFVuaXZlcnNpdHkgb2YgU2NpZW5jZSBhbmQgVGVjaG5vbG9neSk8
L2Rpdj4NCjxkaXY+VGlhbiBMYW4gKEdlb3JnZSBXYXNoaW5ndG9uIFVuaXZlcnNpdHkpPC9kaXY+
DQo8ZGl2PkF0aGluYSBNYXJrb3BvdWxvdSAoVUMgSXJ2aW5lKTwvZGl2Pg0KPGRpdj5SYWplc2gg
UGFudGEgKEFUJmFtcDtUIExhYnMpPC9kaXY+DQo8ZGl2PkNodW5taW5nIFFpYW8gKFVuaXZlcnNp
dHkgb2YgQnVmZmFsbykmbmJzcDs8L2Rpdj4NCjxkaXY+TW9vLXJ5b25nIFJhIChBVCZhbXA7VCBM
YWJzKTwvZGl2Pg0KPGRpdj5UYW8gWmhhbmcgKENpc2NvKTwvZGl2Pg0KPGRpdj4mbmJzcDs8L2Rp
dj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pjxicj48YnI+PGRpdiBpZD0n
X2Rpc2NsYWltZXJfbWVzc2FnZV8nPjxocj6787HiILjewM/AuiDB9sGktcggvPa9xcDOuLjAuyDA
p8fRILDNwMy45ywgobiws8DOwaS6uLq4yKO5/aG5ILn9t8m/oSC1+7bzILq4yKPAxyC067vzwMwg
tce0wiCws8DOwaS6uLChIMb3x9S1x776wLsgvPYgwNa9wLTPtNkuILq7ILmuvK2/oSDG98fUtcgg
waS6uLimILmrtNzAuLfOILvnv+vHz7DFs6ogwaYzwNq/obDUILD4sLPHz7TCILDNwLogvvaw3cj3
ILHdwfa1y7TPtNkuILq7ILjewM/AzCDA37j4ILnfvNu1yCCw5r/sLCC5373FwM4gtse0wiDH0biy
tOvH0LGzv6Egvsu3wcHWvcOw7Swgwe+9wyC76MGmx8+/qSDB1r3DseIgudm2+LTPtNkuPGJyPjxi
cj5ESVNDTEFJTUVSOjxicj48YnI+VGhpcyBlLW1haWwgbWVzc2FnZSBhbmQgaXRzIGF0dGFjaG1l
bnRzIGNvbnRhaW4gaW5mb3JtYXRpb24gdGhhdCBtYXkgYmUgcHJpdmlsZWdlZCBvciBjb25maWRl
bnRpYWwgYW5kIGlzIHRoZSBwcm9wZXJ0eSBvZiBIYWxseW0gVW5pdmVyc2l0eS4gVGhpcyBtZXNz
YWdlIGlzIG9ubHkgaW50ZW5kZWQgZm9yIHRoZSBwZXJzb24gdG8gd2hvbSBpdCBpcyBhZGRyZXNz
ZWQsIHRoZXJlZm9yZSBpZiB5b3UgYXJlIG5vdCB0aGUgaW50ZW5kZWQgcmVjaXBpZW50LCBwbGVh
c2Ugbm90ZSB0aGF0IHlvdSBhcmUgbm90IGF1dGhvcml6ZWQgdG8gcmVhZCwgcHJpbnQsIHJldGFp
biwgY29weSBkaXNzZW1pbmF0ZSwgZGlzdHJpYnV0ZSwgb3IgdXNlIHRoaXMgbWVzc2FnZSBvciBh
bnkgcGFydCB0aGVyZW9mLiBJZiB5b3UgcmVjZWl2ZWQgdGhpcyBtZXNzYWdlIGluIGVycm9yLCBw
bGVhc2Ugbm90aWZ5IHRoZSBzZW5kZXIgaW1tZWRpYXRlbHkgYW5kIGRlbGV0ZSBhbGwgY29waWVz
IG9mIHRoaXMgbWVzc2FnZS48L2Rpdj4=
--DC81425433614746.14be276d99a33.MailEdge--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
dHdvcmtpbmcgZm9yIDVHIGFuZCBJb1Qgd29ya3Nob3ANCj4+Pj4+IEluIGNvbmp1bmN0aW9uIHdp
dGggU0VDT04gMjAxNSA8PDw8PA0KPT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09
PT09PT0NCjIyIEp1bmUgMjAxNSwgU0VBVFRMRSAtIFVTQQ0KIA0KaHR0cDovL3NlY29uMjAxNS5p
ZWVlLXNlY29uLm9yZy93b3Jrc2hvcHMvZm9nLW5ldHdvcmtpbmctNWctYW5kLWlvdC13b3Jrc2hv
cCANCiANCkltcG9ydGFudCBkYXRlcw0KU3VibWlzc2lvbiBkZWFkbGluZShIYXJkKTogQXByaWwg
MXN0LCAyMDE1DQpOb3RpZmljYXRpb24gb2YgYWNjZXB0YW5jZTogQXByaWwgMTV0aCwgMjAxNQ0K
Q2FtZXJhIFJlYWR5OiBBcHJpbCAzMHRoLCAyMDE1DQpXb3Jrc2hvcDogSnVuZSAyMm5kLCAyMDE1
DQogDQogDQpTY29wZTogDQogDQpQdXNoaW5nIGNvbXB1dGF0aW9uLCBjb250cm9sIGFuZCBzdG9y
YWdlIGludG8gdGhlICZxdW90O2Nsb3VkJnF1b3Q7IGhhcyBiZWVuIGEga2V5IHRyZW5kIGluIG5l
dHdvcmtpbmcgaW4gdGhlIHBhc3QgZGVjYWRlLiBPdmVyLWRlcGVuZGVuY2Ugb24gdGhlIGNsb3Vk
LCBob3dldmVyLCBpbmRpY2F0ZXMgdGhhdCBhdmFpbGFiaWxpdHkgYW5kIGZhdWx0IHRvbGVyYW5j
ZSBpc3N1ZXMgaW4gdGhlIGNsb3VkIHdvdWxkIGRpcmVjdGx5IGltcGFjdCBtaWxsaW9ucyBvZiBl
bmQtdXNlcnMuIEluZGVlZCwgdGhlIGNsb3VkIGlzIG5vdyAmcXVvdDtkZXNjZW5kaW5nJnF1b3Q7
IHRvIHRoZSBuZXR3b3JrIGVkZ2UgYW5kIG9mdGVuIGRpZmZ1c2VkIGFtb25nIHRoZSBjbGllbnQg
ZGV2aWNlcyBpbiBib3RoIG1vYmlsZSBhbmQgd2lyZWxpbmUgbmV0d29ya3MuIFRoZSBjbG91ZCBp
cyBiZWNvbWluZyB0aGUgJnF1b3Q7Zm9nLiZxdW90OyANCkVtcG93ZXJlZCBieSB0aGUgbGF0ZXN0
IGNoaXBzLCByYWRpb3MsIGFuZCBzZW5zb3JzLCBlYWNoIGNsaWVudCBkZXZpY2UgdG9kYXkgaXMg
cG93ZXJmdWwgaW4gY29tcHV0YXRpb24sIGluIHN0b3JhZ2UsIGluIHNlbnNpbmcgYW5kIGluIGNv
bW11bmljYXRpb24uIFlldCBjbGllbnQgZGV2aWNlcyBhcmUgc3RpbGwgbGltaXRlZCBpbiBiYXR0
ZXJ5IHBvd2VyLCBnbG9iYWwgdmlldyBvZiB0aGUgbmV0d29yaywgYW5kIG1vYmlsaXR5IHN1cHBv
cnQuIE1vc3QgaW50ZXJlc3RpbmdseSwgdGhlIGNvbGxlY3Rpb24gb2YgbWFueSBjbGllbnRzIGlu
IGEgY3Jvd2QgcHJlc2VudHMgYSBoaWdobHkgZGlzdHJpYnV0ZWQsIHVuZGVyLW9yZ2FuaXplZCwg
YW5kIHBvc3NpYmx5IGRlbnNlIG5ldHdvcmsuIEZ1cnRoZXIsIHdpcmVsZXNzIG5ldHdvcmtzIGlz
IGluY3JlYXNpbmdseSB1c2VkIGxvY2FsbHksIGUuZy4gaW50cmEtYnVpbGRpbmcsIGludHJhLXZl
aGljbGUsIGFuZCBwZXJzb25hbCBib2R5LWFyZWEgbmV0d29ya3M7IGFuZCBkYXRhIGdlbmVyYXRl
ZCBsb2NhbGx5IGlzIGluY3JlYXNpbmdseSBjb25zdW1lZCBsb2NhbGx5Lg0KRm9nIE5ldHdvcmsg
cHJlc2VudHMgYW4gYXJjaGl0ZWN0dXJlIHRoYXQgdXNlcyBvbmUgb3IgYSBjb2xsYWJvcmF0aXZl
IG11bHRpdHVkZSBvZiBlbmQtdXNlciBjbGllbnRzIG9yIG5lYXItdXNlciBlZGdlIGRldmljZXMg
dG8gY2Fycnkgb3V0IHN0b3JhZ2UsIGNvbW11bmljYXRpb24sIGNvbXB1dGF0aW9uLCBhbmQgY29u
dHJvbCBpbiBhIG5ldHdvcmsuIA0KSXQgaXMgYW4gYXJjaGl0ZWN0dXJlIHRoYXQgd2lsbCBzdXBw
b3J0IHRoZSBJbnRlcm5ldCBvZiBUaGluZ3MsIGhldGVyb2dlbmVvdXMgNUcgbW9iaWxlIHNlcnZp
Y2VzLCBhbmQgaG9tZSBhbmQgcGVyc29uYWwgYXJlYSBuZXR3b3Jrcy4gRm9nIE5ldHdvcmtpbmcg
bGV2ZXJhZ2VzIHBhc3QgZXhwZXJpZW5jZSBpbiBzZW5zb3IgbmV0d29ya3MsIFAyUCBhbmQgTUFO
RVQgcmVzZWFyY2gsIGFuZCBpbmNvcnBvcmF0ZXMgdGhlIGxhdGVzdCBhZHZhbmNlcyBpbiBkZXZp
Y2VzLCBuZXR3b3JrIHN5c3RlbXMsIGFuZCBkYXRhIHNjaWVuY2UgdG8gcmVzaGFwZSB0aGUgJnF1
b3Q7YmFsYW5jZSBvZiBwb3dlciZxdW90OyBpbiB0aGUgZWNvc3lzdGVtIG9mIGNvbXB1dGluZyBh
bmQgbmV0d29ya2luZy4gDQpBcyB0aGUgZmlyc3QgaGlnaC1xdWFsaXR5IElFRUUgd29ya3Nob3Ag
aW4gdGhlIGVtZXJnZW50IGFyZWEgb2YgRm9nIE5ldHdvcmtpbmcsIHRoaXMgd29ya3Nob3AncyBz
Y29wZSBpbmNsdWRlczoNCi0gCUVkZ2UgZGF0YSBhbmFseXRpY3MgYW5kIHN0cmVhbSBtaW5pbmcg
DQotIAlFZGdlIHJlc291cmNlIHBvb2xpbmcgDQotIAlFZGdlIGNhY2hpbmcgYW5kIGRpc3RyaWJ1
dGVkIGRhdGEgY2VudGVyIA0KLSAJQ2xpZW50LXNpZGUgbWVhc3VyZW1lbnQgYW5kIGNyb3dkLXNl
bnNpbmcNCi0gCUNsaWVudC1zaWRlIGNvbnRyb2wgYW5kIGNvbmZpZ3VyYXRpb24gDQotIAlTZWN1
cml0eSBhbmQgcHJpdmFjeSBpbiBGb2cgDQotIAlGb2cgYXBwbGljYXRpb25zIGluIElvVA0KLSAJ
Rm9nIGFwcGxpY2F0aW9ucyBpbiA1RyANCi0gCUZvZyBhcHBsaWNhdGlvbnMgaW4gaG9tZSBhbmQg
cGVyc29uYWwgYXJlYSBuZXR3b3JraW5nIA0KIA0KVG8gYmUgcHVibGlzaGVkIGluIHRoZSBJRUVF
IEZPRyBDb25mZXJlbmNlIFByb2NlZWRpbmdzIGFuZCB0byBiZSBlbGlnaWJsZSBmb3IgcHVibGlj
YXRpb24gaW4gSUVFRSBYcGxvcmUsIGFuIGF1dGhvciBvZiBhbiBhY2NlcHRlZCBwYXBlciBpcyBy
ZXF1aXJlZCB0byByZWdpc3RlciBmb3IgdGhlIGNvbmZlcmVuY2UgYXQgdGhlIGZ1bGwgKG1lbWJl
ciBvciBub24tbWVtYmVyKSByYXRlIGFuZCB0aGUgcGFwZXIgbXVzdCBiZSBwcmVzZW50ZWQgYnkg
YW4gYXV0aG9yIG9mIHRoYXQgcGFwZXIgYXQgdGhlIGNvbmZlcmVuY2UgdW5sZXNzIHRoZSBUUEMg
Q2hhaXIgZ3JhbnRzIHBlcm1pc3Npb24gZm9yIGEgc3Vic3RpdHV0ZSBwcmVzZW50ZXIgYXJyYW5n
ZWQgaW4gYWR2YW5jZSBvZiB0aGUgZXZlbnQgYW5kIHdobyBpcyBxdWFsaWZpZWQgYm90aCB0byBw
cmVzZW50IGFuZCBhbnN3ZXIgcXVlc3Rpb25zLiAgTm9uLXJlZnVuZGFibGUgcmVnaXN0cmF0aW9u
IGZlZXMgbXVzdCBiZSBwYWlkIHByaW9yIHRvIHVwbG9hZGluZyB0aGUgZmluYWwgSUVFRSBmb3Jt
YXR0ZWQsIHB1YmxpY2F0aW9uLXJlYWR5IHZlcnNpb24gb2YgdGhlIHBhcGVyLiAgRm9yIGF1dGhv
cnMgd2l0aCBtdWx0aXBsZSBhY2NlcHRlZCBwYXBlcnMsIG9uZSBmdWxsIHJlZ2lzdHJhdGlvbiBp
cyB2YWxpZCBmb3IgdXAgdG8gMyBwYXBlcnMuICBBY2NlcHRlZCBhbmQgcHJlc2VudGVkIHBhcGVy
cyB3aWxsIGJlIHB1Ymxpc2hlZCBpbiB0aGUgSUVFRSBGT0cgQ29uZmVyZW5jZSBQcm9jZWVkaW5n
cyBhbmQgc3VibWl0dGVkIHRvIElFRUUgWHBsb3JlLg0KIA0KIA0KV29ya3Nob3AgQ28tQ2hhaXJz
OiANCiANCk11bmcgQ2hpYW5nDQpBcnRodXIgTGVHcmFuZCBEb3R5IFByb2Zlc3NvciBvZiBFbGVj
dHJpY2FsIEVuZ2luZWVyaW5nDQpEaXJlY3RvciBvZiBLZWxsZXIgQ2VudGVyIGZvciBJbm5vdmF0
aW9uIGluIEVuZ2luZWVyaW5nIEVkdWNhdGlvbiANClByaW5jZXRvbiBVbml2ZXJzaXR5IA0KIA0K
U2FuZ3RhZSBIYQ0KQXNzaXN0YW50IFByb2Zlc3NvciwgQ29tcHV0ZXIgU2NpZW5jZSBEZXBhcnRt
ZW50IA0KVW5pdmVyc2l0eSBvZiBDb2xvcmFkbyBhdCBCb3VsZGVyIA0KIA0KSnVuc2hhbiBaaGFu
ZyANClByb2Zlc3NvciwgRWxlY3RyaWNhbCBhbmQgQ29tcHV0ZXIgRW5naW5lZXJpbmcgRGVwYXJ0
bWVudCANCkFyaXpvbmEgU3RhdGUgVW5pdmVyc2l0eQ0KIA0KV29ya3Nob3AgVGVjaG5pY2FsIFBy
b2dyYW0gQ29tbWl0dGVlOiANCiANCkJoYXJhdGggQmFsYXN1YnJhbWFuaWFuIChBVCZhbXA7VCBM
YWJzKQ0KU3VtYW4gQmFuZXJqZWUgKFVuaXZlcnNpdHkgb2YgV2lzY29uc2luKQ0KSm9obiBCcmFz
c2lsIChIUCBMYWJzKQ0KVGlhbiBCdSAoQmVsbCBMYWJzKQ0KR2FyeSBDaGFuIChIb25nIEtvbmcg
VW5pdmVyc2l0eSBvZiBTY2llbmNlIGFuZCBUZWNobm9sb2d5KQ0KVGlhbiBMYW4gKEdlb3JnZSBX
YXNoaW5ndG9uIFVuaXZlcnNpdHkpDQpBdGhpbmEgTWFya29wb3Vsb3UgKFVDIElydmluZSkNClJh
amVzaCBQYW50YSAoQVQmYW1wO1QgTGFicykNCkNodW5taW5nIFFpYW8gKFVuaXZlcnNpdHkgb2Yg
QnVmZmFsbykgDQpNb28tcnlvbmcgUmEgKEFUJmFtcDtUIExhYnMpDQpUYW8gWmhhbmcgKENpc2Nv
KQ0KIA0KIA0KILvzseIguN7Az8C6IMH2waS1yCC89r3FwM64uMC7IMCnx9EgsM3AzLjnLCChuLCz
wM7BpLq4urjIo7n9obkguf23yb+hILX7tvMgurjIo8DHILTru/PAzCC1x7TCILCzwM7BpLq4sKEg
xvfH1LXHvvrAuyC89iDA1r3AtM+02S4gursgua68rb+hIMb3x9S1yCDBpLq4uKYguau03MC4t84g
u+e/68fPsMWzqiDBpjPA2r+hsNQgsPiws8fPtMIgsM3AuiC+9rDdyPcgsd3B9rXLtM+02S4gursg
uN7Az8DMIMDfuPggud+827XIILDmv+wsILnfvcXAziC2x7TCIMfRuLK068fQsbO/oSC+y7fBwda9
w7DtLCDB773DILvowabHz7+pIMHWvcOx4iC52bb4tM+02S5ESVNDTEFJTUVSOlRoaXMgZS1tYWls
IG1lc3NhZ2UgYW5kIGl0cyBhdHRhY2htZW50cyBjb250YWluIGluZm9ybWF0aW9uIHRoYXQgbWF5
IGJlIHByaXZpbGVnZWQgb3IgY29uZmlkZW50aWFsIGFuZCBpcyB0aGUgcHJvcGVydHkgb2YgSGFs
bHltIFVuaXZlcnNpdHkuIFRoaXMgbWVzc2FnZSBpcyBvbmx5IGludGVuZGVkIGZvciB0aGUgcGVy
c29uIHRvIHdob20gaXQgaXMgYWRkcmVzc2VkLCB0aGVyZWZvcmUgaWYgeW91IGFyZSBub3QgdGhl
IGludGVuZGVkIHJlY2lwaWVudCwgcGxlYXNlIG5vdGUgdGhhdCB5b3UgYXJlIG5vdCBhdXRob3Jp
emVkIHRvIHJlYWQsIHByaW50LCByZXRhaW4sIGNvcHkgZGlzc2VtaW5hdGUsIGRpc3RyaWJ1dGUs
IG9yIHVzZSB0aGlzIG1lc3NhZ2Ugb3IgYW55IHBhcnQgdGhlcmVvZi4gSWYgeW91IHJlY2VpdmVk
IHRoaXMgbWVzc2FnZSBpbiBlcnJvciwgcGxlYXNlIG5vdGlmeSB0aGUgc2VuZGVyIGltbWVkaWF0
ZWx5IGFuZCBkZWxldGUgYWxsIGNvcGllcyBvZiB0aGlzIG1lc3NhZ2Uu
--DC81425433614746.14be276d99a33.MailEdge
Content-Type: text/html;
charset="euc-kr"
Content-Transfer-Encoding: base64
PGltZyBib3JkZXI9MCB3aWR0aD0xIGhlaWdodD0xIHNyYz0iaHR0cDovL21haWwuaGFsbHltLmFj
LmtyOjgwL21lL29ycHQuZG8/YWN0aW9uS2luZD1SMCZ1c2VySWQ9anNvMSZtc2dJZD01NTMyOWQ2
NzJlYjQxJnBlcnNvbmFsPSZlbWFpbEFkZHJlc3M9ZG1hbmV0QHpwci51bmkta29lbG4uZGUiPiAg
PGRpdj4mbmJzcDs8L2Rpdj4NCjxkaXY+PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09
PT09PT09PT08L2Rpdj4NCjxkaXY+Q0ZQOiBGb2cgTmV0d29ya2luZyBmb3IgNUcgYW5kIElvVCB3
b3Jrc2hvcDwvZGl2Pg0KPGRpdj4mZ3Q7Jmd0OyZndDsmZ3Q7Jmd0OyBJbiBjb25qdW5jdGlvbiB3
aXRoIFNFQ09OIDIwMTUgJmx0OyZsdDsmbHQ7Jmx0OyZsdDs8L2Rpdj4NCjxkaXY+PT09PT09PT09
PT09PT09PT09PT09PT09PT09PT09PT09PT09PT09PT08L2Rpdj4NCjxkaXY+MjIgSnVuZSAyMDE1
LCBTRUFUVExFIC0gVVNBPC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5odHRwOi8vc2Vj
b24yMDE1LmllZWUtc2Vjb24ub3JnL3dvcmtzaG9wcy9mb2ctbmV0d29ya2luZy01Zy1hbmQtaW90
LXdvcmtzaG9wJm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5JbXBvcnRhbnQg
ZGF0ZXM8L2Rpdj4NCjxkaXY+U3VibWlzc2lvbiBkZWFkbGluZShIYXJkKTogQXByaWwgMXN0LCAy
MDE1PC9kaXY+DQo8ZGl2Pk5vdGlmaWNhdGlvbiBvZiBhY2NlcHRhbmNlOiBBcHJpbCAxNXRoLCAy
MDE1PC9kaXY+DQo8ZGl2PkNhbWVyYSBSZWFkeTogQXByaWwgMzB0aCwgMjAxNTwvZGl2Pg0KPGRp
dj5Xb3Jrc2hvcDogSnVuZSAyMm5kLCAyMDE1PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRp
dj4mbmJzcDs8L2Rpdj4NCjxkaXY+U2NvcGU6Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2
Pg0KPGRpdj5QdXNoaW5nIGNvbXB1dGF0aW9uLCBjb250cm9sIGFuZCBzdG9yYWdlIGludG8gdGhl
ICZxdW90O2Nsb3VkJnF1b3Q7IGhhcyBiZWVuIGEga2V5IHRyZW5kIGluIG5ldHdvcmtpbmcgaW4g
dGhlIHBhc3QgZGVjYWRlLiBPdmVyLWRlcGVuZGVuY2Ugb24gdGhlIGNsb3VkLCBob3dldmVyLCBp
bmRpY2F0ZXMgdGhhdCBhdmFpbGFiaWxpdHkgYW5kIGZhdWx0IHRvbGVyYW5jZSBpc3N1ZXMgaW4g
dGhlIGNsb3VkIHdvdWxkIGRpcmVjdGx5IGltcGFjdCBtaWxsaW9ucyBvZiBlbmQtdXNlcnMuIElu
ZGVlZCwgdGhlIGNsb3VkIGlzIG5vdyAmcXVvdDtkZXNjZW5kaW5nJnF1b3Q7IHRvIHRoZSBuZXR3
b3JrIGVkZ2UgYW5kIG9mdGVuIGRpZmZ1c2VkIGFtb25nIHRoZSBjbGllbnQgZGV2aWNlcyBpbiBi
b3RoIG1vYmlsZSBhbmQgd2lyZWxpbmUgbmV0d29ya3MuIFRoZSBjbG91ZCBpcyBiZWNvbWluZyB0
aGUgJnF1b3Q7Zm9nLiZxdW90OyZuYnNwOzwvZGl2Pg0KPGRpdj5FbXBvd2VyZWQgYnkgdGhlIGxh
dGVzdCBjaGlwcywgcmFkaW9zLCBhbmQgc2Vuc29ycywgZWFjaCBjbGllbnQgZGV2aWNlIHRvZGF5
IGlzIHBvd2VyZnVsIGluIGNvbXB1dGF0aW9uLCBpbiBzdG9yYWdlLCBpbiBzZW5zaW5nIGFuZCBp
biBjb21tdW5pY2F0aW9uLiBZZXQgY2xpZW50IGRldmljZXMgYXJlIHN0aWxsIGxpbWl0ZWQgaW4g
YmF0dGVyeSBwb3dlciwgZ2xvYmFsIHZpZXcgb2YgdGhlIG5ldHdvcmssIGFuZCBtb2JpbGl0eSBz
dXBwb3J0LiBNb3N0IGludGVyZXN0aW5nbHksIHRoZSBjb2xsZWN0aW9uIG9mIG1hbnkgY2xpZW50
cyBpbiBhIGNyb3dkIHByZXNlbnRzIGEgaGlnaGx5IGRpc3RyaWJ1dGVkLCB1bmRlci1vcmdhbml6
ZWQsIGFuZCBwb3NzaWJseSBkZW5zZSBuZXR3b3JrLiBGdXJ0aGVyLCB3aXJlbGVzcyBuZXR3b3Jr
cyBpcyBpbmNyZWFzaW5nbHkgdXNlZCBsb2NhbGx5LCBlLmcuIGludHJhLWJ1aWxkaW5nLCBpbnRy
YS12ZWhpY2xlLCBhbmQgcGVyc29uYWwgYm9keS1hcmVhIG5ldHdvcmtzOyBhbmQgZGF0YSBnZW5l
cmF0ZWQgbG9jYWxseSBpcyBpbmNyZWFzaW5nbHkgY29uc3VtZWQgbG9jYWxseS48L2Rpdj4NCjxk
aXY+Rm9nIE5ldHdvcmsgcHJlc2VudHMgYW4gYXJjaGl0ZWN0dXJlIHRoYXQgdXNlcyBvbmUgb3Ig
YSBjb2xsYWJvcmF0aXZlIG11bHRpdHVkZSBvZiBlbmQtdXNlciBjbGllbnRzIG9yIG5lYXItdXNl
ciBlZGdlIGRldmljZXMgdG8gY2Fycnkgb3V0IHN0b3JhZ2UsIGNvbW11bmljYXRpb24sIGNvbXB1
dGF0aW9uLCBhbmQgY29udHJvbCBpbiBhIG5ldHdvcmsuJm5ic3A7PC9kaXY+DQo8ZGl2Pkl0IGlz
IGFuIGFyY2hpdGVjdHVyZSB0aGF0IHdpbGwgc3VwcG9ydCB0aGUgSW50ZXJuZXQgb2YgVGhpbmdz
LCBoZXRlcm9nZW5lb3VzIDVHIG1vYmlsZSBzZXJ2aWNlcywgYW5kIGhvbWUgYW5kIHBlcnNvbmFs
IGFyZWEgbmV0d29ya3MuIEZvZyBOZXR3b3JraW5nIGxldmVyYWdlcyBwYXN0IGV4cGVyaWVuY2Ug
aW4gc2Vuc29yIG5ldHdvcmtzLCBQMlAgYW5kIE1BTkVUIHJlc2VhcmNoLCBhbmQgaW5jb3Jwb3Jh
dGVzIHRoZSBsYXRlc3QgYWR2YW5jZXMgaW4gZGV2aWNlcywgbmV0d29yayBzeXN0ZW1zLCBhbmQg
ZGF0YSBzY2llbmNlIHRvIHJlc2hhcGUgdGhlICZxdW90O2JhbGFuY2Ugb2YgcG93ZXImcXVvdDsg
aW4gdGhlIGVjb3N5c3RlbSBvZiBjb21wdXRpbmcgYW5kIG5ldHdvcmtpbmcuJm5ic3A7PC9kaXY+
DQo8ZGl2PkFzIHRoZSBmaXJzdCBoaWdoLXF1YWxpdHkgSUVFRSB3b3Jrc2hvcCBpbiB0aGUgZW1l
cmdlbnQgYXJlYSBvZiBGb2cgTmV0d29ya2luZywgdGhpcyB3b3Jrc2hvcCdzIHNjb3BlIGluY2x1
ZGVzOjwvZGl2Pg0KPGRpdj4tIDxzcGFuIGNsYXNzPSJBcHBsZS10YWItc3BhbiIgc3R5bGU9Indo
aXRlLXNwYWNlOnByZSI+CTwvc3Bhbj5FZGdlIGRhdGEgYW5hbHl0aWNzIGFuZCBzdHJlYW0gbWlu
aW5nJm5ic3A7PC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHls
ZT0id2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkVkZ2UgcmVzb3VyY2UgcG9vbGluZyZuYnNwOzwv
ZGl2Pg0KPGRpdj4tIDxzcGFuIGNsYXNzPSJBcHBsZS10YWItc3BhbiIgc3R5bGU9IndoaXRlLXNw
YWNlOnByZSI+CTwvc3Bhbj5FZGdlIGNhY2hpbmcgYW5kIGRpc3RyaWJ1dGVkIGRhdGEgY2VudGVy
Jm5ic3A7PC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHlsZT0i
d2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkNsaWVudC1zaWRlIG1lYXN1cmVtZW50IGFuZCBjcm93
ZC1zZW5zaW5nPC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHls
ZT0id2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkNsaWVudC1zaWRlIGNvbnRyb2wgYW5kIGNvbmZp
Z3VyYXRpb24mbmJzcDs8L2Rpdj4NCjxkaXY+LSA8c3BhbiBjbGFzcz0iQXBwbGUtdGFiLXNwYW4i
IHN0eWxlPSJ3aGl0ZS1zcGFjZTpwcmUiPgk8L3NwYW4+U2VjdXJpdHkgYW5kIHByaXZhY3kgaW4g
Rm9nJm5ic3A7PC9kaXY+DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHls
ZT0id2hpdGUtc3BhY2U6cHJlIj4JPC9zcGFuPkZvZyBhcHBsaWNhdGlvbnMgaW4gSW9UPC9kaXY+
DQo8ZGl2Pi0gPHNwYW4gY2xhc3M9IkFwcGxlLXRhYi1zcGFuIiBzdHlsZT0id2hpdGUtc3BhY2U6
cHJlIj4JPC9zcGFuPkZvZyBhcHBsaWNhdGlvbnMgaW4gNUcmbmJzcDs8L2Rpdj4NCjxkaXY+LSA8
c3BhbiBjbGFzcz0iQXBwbGUtdGFiLXNwYW4iIHN0eWxlPSJ3aGl0ZS1zcGFjZTpwcmUiPgk8L3Nw
YW4+Rm9nIGFwcGxpY2F0aW9ucyBpbiBob21lIGFuZCBwZXJzb25hbCBhcmVhIG5ldHdvcmtpbmcm
bmJzcDs8L2Rpdj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2PlRvIGJlIHB1Ymxpc2hlZCBpbiB0
aGUgSUVFRSBGT0cgQ29uZmVyZW5jZSBQcm9jZWVkaW5ncyBhbmQgdG8gYmUgZWxpZ2libGUgZm9y
IHB1YmxpY2F0aW9uIGluIElFRUUgWHBsb3JlLCBhbiBhdXRob3Igb2YgYW4gYWNjZXB0ZWQgcGFw
ZXIgaXMgcmVxdWlyZWQgdG8gcmVnaXN0ZXIgZm9yIHRoZSBjb25mZXJlbmNlIGF0IHRoZSBmdWxs
IChtZW1iZXIgb3Igbm9uLW1lbWJlcikgcmF0ZSBhbmQgdGhlIHBhcGVyIG11c3QgYmUgcHJlc2Vu
dGVkIGJ5IGFuIGF1dGhvciBvZiB0aGF0IHBhcGVyIGF0IHRoZSBjb25mZXJlbmNlIHVubGVzcyB0
aGUgVFBDIENoYWlyIGdyYW50cyBwZXJtaXNzaW9uIGZvciBhIHN1YnN0aXR1dGUgcHJlc2VudGVy
IGFycmFuZ2VkIGluIGFkdmFuY2Ugb2YgdGhlIGV2ZW50IGFuZCB3aG8gaXMgcXVhbGlmaWVkIGJv
dGggdG8gcHJlc2VudCBhbmQgYW5zd2VyIHF1ZXN0aW9ucy4gJm5ic3A7Tm9uLXJlZnVuZGFibGUg
cmVnaXN0cmF0aW9uIGZlZXMgbXVzdCBiZSBwYWlkIHByaW9yIHRvIHVwbG9hZGluZyB0aGUgZmlu
YWwgSUVFRSBmb3JtYXR0ZWQsIHB1YmxpY2F0aW9uLXJlYWR5IHZlcnNpb24gb2YgdGhlIHBhcGVy
LiAmbmJzcDtGb3IgYXV0aG9ycyB3aXRoIG11bHRpcGxlIGFjY2VwdGVkIHBhcGVycywgb25lIGZ1
bGwgcmVnaXN0cmF0aW9uIGlzIHZhbGlkIGZvciB1cCB0byAzIHBhcGVycy4gJm5ic3A7QWNjZXB0
ZWQgYW5kIHByZXNlbnRlZCBwYXBlcnMgd2lsbCBiZSBwdWJsaXNoZWQgaW4gdGhlIElFRUUgRk9H
IENvbmZlcmVuY2UgUHJvY2VlZGluZ3MgYW5kIHN1Ym1pdHRlZCB0byBJRUVFIFhwbG9yZS48L2Rp
dj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5Xb3Jrc2hvcCBD
by1DaGFpcnM6Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5NdW5nIENoaWFu
ZzwvZGl2Pg0KPGRpdj5BcnRodXIgTGVHcmFuZCBEb3R5IFByb2Zlc3NvciBvZiBFbGVjdHJpY2Fs
IEVuZ2luZWVyaW5nPC9kaXY+DQo8ZGl2PkRpcmVjdG9yIG9mIEtlbGxlciBDZW50ZXIgZm9yIElu
bm92YXRpb24gaW4gRW5naW5lZXJpbmcgRWR1Y2F0aW9uJm5ic3A7PC9kaXY+DQo8ZGl2PlByaW5j
ZXRvbiBVbml2ZXJzaXR5Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pg0KPGRpdj5TYW5n
dGFlIEhhPC9kaXY+DQo8ZGl2PkFzc2lzdGFudCBQcm9mZXNzb3IsIENvbXB1dGVyIFNjaWVuY2Ug
RGVwYXJ0bWVudCZuYnNwOzwvZGl2Pg0KPGRpdj5Vbml2ZXJzaXR5IG9mIENvbG9yYWRvIGF0IEJv
dWxkZXImbmJzcDs8L2Rpdj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2Pkp1bnNoYW4gWmhhbmcm
bmJzcDs8L2Rpdj4NCjxkaXY+UHJvZmVzc29yLCBFbGVjdHJpY2FsIGFuZCBDb21wdXRlciBFbmdp
bmVlcmluZyBEZXBhcnRtZW50Jm5ic3A7PC9kaXY+DQo8ZGl2PkFyaXpvbmEgU3RhdGUgVW5pdmVy
c2l0eTwvZGl2Pg0KPGRpdj4mbmJzcDs8L2Rpdj4NCjxkaXY+V29ya3Nob3AgVGVjaG5pY2FsIFBy
b2dyYW0gQ29tbWl0dGVlOiZuYnNwOzwvZGl2Pg0KPGRpdj4mbmJzcDs8L2Rpdj4NCjxkaXY+Qmhh
cmF0aCBCYWxhc3VicmFtYW5pYW4gKEFUJmFtcDtUIExhYnMpPC9kaXY+DQo8ZGl2PlN1bWFuIEJh
bmVyamVlIChVbml2ZXJzaXR5IG9mIFdpc2NvbnNpbik8L2Rpdj4NCjxkaXY+Sm9obiBCcmFzc2ls
IChIUCBMYWJzKTwvZGl2Pg0KPGRpdj5UaWFuIEJ1IChCZWxsIExhYnMpPC9kaXY+DQo8ZGl2Pkdh
cnkgQ2hhbiAoSG9uZyBLb25nIFVuaXZlcnNpdHkgb2YgU2NpZW5jZSBhbmQgVGVjaG5vbG9neSk8
L2Rpdj4NCjxkaXY+VGlhbiBMYW4gKEdlb3JnZSBXYXNoaW5ndG9uIFVuaXZlcnNpdHkpPC9kaXY+
DQo8ZGl2PkF0aGluYSBNYXJrb3BvdWxvdSAoVUMgSXJ2aW5lKTwvZGl2Pg0KPGRpdj5SYWplc2gg
UGFudGEgKEFUJmFtcDtUIExhYnMpPC9kaXY+DQo8ZGl2PkNodW5taW5nIFFpYW8gKFVuaXZlcnNp
dHkgb2YgQnVmZmFsbykmbmJzcDs8L2Rpdj4NCjxkaXY+TW9vLXJ5b25nIFJhIChBVCZhbXA7VCBM
YWJzKTwvZGl2Pg0KPGRpdj5UYW8gWmhhbmcgKENpc2NvKTwvZGl2Pg0KPGRpdj4mbmJzcDs8L2Rp
dj4NCjxkaXY+Jm5ic3A7PC9kaXY+DQo8ZGl2PiZuYnNwOzwvZGl2Pjxicj48YnI+PGRpdiBpZD0n
X2Rpc2NsYWltZXJfbWVzc2FnZV8nPjxocj6787HiILjewM/AuiDB9sGktcggvPa9xcDOuLjAuyDA
p8fRILDNwMy45ywgobiws8DOwaS6uLq4yKO5/aG5ILn9t8m/oSC1+7bzILq4yKPAxyC067vzwMwg
tce0wiCws8DOwaS6uLChIMb3x9S1x776wLsgvPYgwNa9wLTPtNkuILq7ILmuvK2/oSDG98fUtcgg
waS6uLimILmrtNzAuLfOILvnv+vHz7DFs6ogwaYzwNq/obDUILD4sLPHz7TCILDNwLogvvaw3cj3
ILHdwfa1y7TPtNkuILq7ILjewM/AzCDA37j4ILnfvNu1yCCw5r/sLCC5373FwM4gtse0wiDH0biy
tOvH0LGzv6Egvsu3wcHWvcOw7Swgwe+9wyC76MGmx8+/qSDB1r3DseIgudm2+LTPtNkuPGJyPjxi
cj5ESVNDTEFJTUVSOjxicj48YnI+VGhpcyBlLW1haWwgbWVzc2FnZSBhbmQgaXRzIGF0dGFjaG1l
bnRzIGNvbnRhaW4gaW5mb3JtYXRpb24gdGhhdCBtYXkgYmUgcHJpdmlsZWdlZCBvciBjb25maWRl
bnRpYWwgYW5kIGlzIHRoZSBwcm9wZXJ0eSBvZiBIYWxseW0gVW5pdmVyc2l0eS4gVGhpcyBtZXNz
YWdlIGlzIG9ubHkgaW50ZW5kZWQgZm9yIHRoZSBwZXJzb24gdG8gd2hvbSBpdCBpcyBhZGRyZXNz
ZWQsIHRoZXJlZm9yZSBpZiB5b3UgYXJlIG5vdCB0aGUgaW50ZW5kZWQgcmVjaXBpZW50LCBwbGVh
c2Ugbm90ZSB0aGF0IHlvdSBhcmUgbm90IGF1dGhvcml6ZWQgdG8gcmVhZCwgcHJpbnQsIHJldGFp
biwgY29weSBkaXNzZW1pbmF0ZSwgZGlzdHJpYnV0ZSwgb3IgdXNlIHRoaXMgbWVzc2FnZSBvciBh
bnkgcGFydCB0aGVyZW9mLiBJZiB5b3UgcmVjZWl2ZWQgdGhpcyBtZXNzYWdlIGluIGVycm9yLCBw
bGVhc2Ugbm90aWZ5IHRoZSBzZW5kZXIgaW1tZWRpYXRlbHkgYW5kIGRlbGV0ZSBhbGwgY29waWVz
IG9mIHRoaXMgbWVzc2FnZS48L2Rpdj4=
--DC81425433614746.14be276d99a33.MailEdge--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc position in combinatorics
Dear colleagues,
I would like to advertise an opening for an ERC funded postdoctoral
position in combinatorics at the University of Warwick. The details are
enclosed below. Note that we are open to hiring a candidate with no prior
experience in theory of combinatorial limits and/or extremal combinatorics.
Best regards,
Dan Kral
Job id: 75569-035
University of Warwick, Coventry
Department of Computer Science
Research Fellow
Fixed Term Contract from 1 Oct 2015 to 30 Sep 2017 (negotiable)
You will be expected to perform high quality research in the theory of
combinatorial limits and/or extremal combinatorics. You will possess, or
shortly be obtaining, a PhD, or an equivalent qualification in Mathematics
or Computer Science. You should have a strong background in one or more of
the following areas: structural graph theory, theory of graph limits,
extremal combinatorics, probability theory and model theory. Prior
experience in the theory of combinatorial limits or extremal combinatorics
is not essential; applications from PhD graduates working in probability
theory or model theory with an interest in combinatorial limits and
extremal combinatorics are particularly welcome.
This post is based in the Department of Computer Science, but a close
interaction with members of the Warwick Mathematics Institute and members
of the DIMAP center is expected. The position is funded by the ERC Starting
grant CCOSA and the ERC Consolidator grant LaDIST of Professor Daniel Kral.
Candidates should provide with their application form a CV, a list of
publications and a research statement.
Closing date: 31 Mar 2015
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
I would like to advertise an opening for an ERC funded postdoctoral
position in combinatorics at the University of Warwick. The details are
enclosed below. Note that we are open to hiring a candidate with no prior
experience in theory of combinatorial limits and/or extremal combinatorics.
Best regards,
Dan Kral
Job id: 75569-035
University of Warwick, Coventry
Department of Computer Science
Research Fellow
Fixed Term Contract from 1 Oct 2015 to 30 Sep 2017 (negotiable)
You will be expected to perform high quality research in the theory of
combinatorial limits and/or extremal combinatorics. You will possess, or
shortly be obtaining, a PhD, or an equivalent qualification in Mathematics
or Computer Science. You should have a strong background in one or more of
the following areas: structural graph theory, theory of graph limits,
extremal combinatorics, probability theory and model theory. Prior
experience in the theory of combinatorial limits or extremal combinatorics
is not essential; applications from PhD graduates working in probability
theory or model theory with an interest in combinatorial limits and
extremal combinatorics are particularly welcome.
This post is based in the Department of Computer Science, but a close
interaction with members of the Warwick Mathematics Institute and members
of the DIMAP center is expected. The position is funded by the ERC Starting
grant CCOSA and the ERC Consolidator grant LaDIST of Professor Daniel Kral.
Candidates should provide with their application form a CV, a list of
publications and a research statement.
Closing date: 31 Mar 2015
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP: Graphical Models for Security (GraMSec 2015)
CALL FOR PAPERS
GraMSec 2015
The Second International Workshop on Graphical Models for Security
July 13, 2015, Verona, Italy
http://gramsec.uni.lu/
Co-located with CSF 2015
=================================
Graphical security models provide an intuitive but systematic
methodology to analyze security weaknesses of systems and to evaluate
potential protection measures. Formal methods and computer security
researchers, as well as security professionals from industry and
government, have proposed various graphical security modeling schemes.
Such models are used to capture different security facets (digital,
physical, and social) and address a range of challenges including
security assessment, risk analysis, automated defensing, secure
services composition, policy validation and verification. The
objective of GraMSec is to contribute to the development of
well-founded graphical security models, efficient algorithms for their
analysis, as well as methodologies for their practical usage.
The workshop seeks submissions from academia, industry, and government
presenting novel research on all theoretical and practical aspects of
graphical models for security. The topics of the workshop include, but
are not limited to:
- Attack trees, attack graphs, and their variants
- Petri nets, Markov chains, and Bayesian networks for security
- UML-based models and other graphical modeling approaches for security
- Enhancement and/or optimization of existing graphical security models
- Methods for (semi-)automatic generation of graphical security models
- Scalability of graphical security models
- Software tools for graphical security modeling and analysis
- Risk assessment and risk management using graphical security models
- Methods for quantitative analysis of graphical security models
- Formal semantics of graphical security models
- Formal verification of graphical security models
- Game theoretical approaches to graphical security models
- Visualization of system security
- Visual security modeling and analysis of socio-technical and
cyber-physical systems
- Graphical models for system, organizational, and business security
- Graphical security models for emerging paradigms (e.g., Cloud
computing, IoT, Software Defined Networks, Big Data)
- Case studies and experience reports on the use of graphical security
models
SUBMISSION INSTRUCTIONS
We solicit two types of submissions:
- Regular papers (up to 15 pages) describing original and unpublished
work within the scope of the workshop.
- Tool papers (up to 5 pages) describing software supporting graphical
security modeling, analysis, and evaluation. Tool papers will be
presented during a special tool session.
All submissions must be prepared using the LNCS style.
Each paper will undergo a thorough review process. All accepted
(regular and tool) papers will be included in the final proceedings,
which we plan to publish as a Springer LNCS volume (pending
confirmation). Submissions should be made using the GraMSec'15
EasyChair web site.
IMPORTANT DATES
Submission deadline: April 19, 2015
Acceptance notification: May 26, 2015
Camera ready version: June 15, 2015
Workshop: July 13, 2015
GENERAL CHAIR
Sushil Jajodia, George Mason University, USA
PC CO-CHAIRS
Sjouke Mauw, University of Luxembourg, LU
Barbara Kordy, INSA Rennes, IRISA, FR
PROGRAM COMMITTEE
- Mathieu Acher, IRISA, France
- Massimiliano Albanese, George Mason University, USA
- Ludovic Apvrille, Institut Mines-Telecom, Telecom ParisTech, CNRS
LTCI, France
- Thomas Bauereiss, DFKI GmbH, Germany
- Giampaolo Bella, University of Catania, Italy
- Stefano Bistarelli, University of Perugia, Italy
- Ahto Buldas, Cybernetica, Estonia
- Jason Crampton, Royal Holloway University of London, UK
- Frederic Cuppens, Telecom Bretagne, France
- Mathias Ekstedt, Royal Institute of Technology, Sweden
- Olga Gadyatskaya, University of Luxembourg, Luxembourg
- Paolo Giorgini, University of Trento, Italy
- Erlend Andreas Gjare, SINTEF, Norway
- Dieter Gollmann, TU Hamburg, Germany
- Olivier Heen, Technicolor, France
- Siv Hilde Houmb, Secure-NOK AS, and Gjovik University College, Norway
- Ravi Jhawar, University of Luxembourg, Luxembourg
- Henk Jonkers, BiZZdesign, The Netherlands
- Jan Jurjens, Technical University Dortmund, Germany
- Jean-Louis Lanet, INRIA, France
- Gurvan Le Guernic, DGA Maitrise de l'Information, France
- Dong Seong Kim, University of Canterbury, New Zealand
- Per Haakon Meland, SINTEF, Norway
- Jogesh Muppala, HKUST, Hong Kong
- Flemming Nielson, Technical University of Denmark, Denmark
- Steven Noel, MITRE and George Mason University, USA
- Andreas L. Opdahl, University of Bergen, Norway
- Stephane Paul, Thales Research and Technology, France
- Wolter Pieters, TU Delft and University of Twente, The Netherlands
- Ludovic Pietre-Cambacedes, EDF, France
- Sophie Pinchinat, University Rennes 1, IRISA, France
- Vincenzo Piuri, University of Milan, Italy
- Cristian Prisacariu, University of Oslo, Norway
- Nicolas Prigent, Supelec, France
- Christian W. Probst, Technical University of Denmark, Denmark
- David Pym, University College London, UK
- Sasa Radomirovic, ETH Zurich, Switzerland
- Indrajit Ray, Colorado State University, USA
- Arend Rensink, University of Twente, The Netherlands
- Yves Roudier, EURECOM, France
- Pierangela Samarati, University of Milan, Italy
- Guttorm Sindre, Norwegian University of Science and Technology, Norway
- Ketil Stolen, Sintef, Norway
- Axel Tanner, IBM Research Zurich, Switzerland
- Kishor S. Trivedi, Duke University, USA
- Luca Vigano, King's College London, UK
- Lingyu Wang, Concordia University, Canada
- Jan Willemson, Cybernetica, Estonia
This call for papers and additional information about the workshop
can be found at http://gramsec.uni.lu/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
GraMSec 2015
The Second International Workshop on Graphical Models for Security
July 13, 2015, Verona, Italy
http://gramsec.uni.lu/
Co-located with CSF 2015
=================================
Graphical security models provide an intuitive but systematic
methodology to analyze security weaknesses of systems and to evaluate
potential protection measures. Formal methods and computer security
researchers, as well as security professionals from industry and
government, have proposed various graphical security modeling schemes.
Such models are used to capture different security facets (digital,
physical, and social) and address a range of challenges including
security assessment, risk analysis, automated defensing, secure
services composition, policy validation and verification. The
objective of GraMSec is to contribute to the development of
well-founded graphical security models, efficient algorithms for their
analysis, as well as methodologies for their practical usage.
The workshop seeks submissions from academia, industry, and government
presenting novel research on all theoretical and practical aspects of
graphical models for security. The topics of the workshop include, but
are not limited to:
- Attack trees, attack graphs, and their variants
- Petri nets, Markov chains, and Bayesian networks for security
- UML-based models and other graphical modeling approaches for security
- Enhancement and/or optimization of existing graphical security models
- Methods for (semi-)automatic generation of graphical security models
- Scalability of graphical security models
- Software tools for graphical security modeling and analysis
- Risk assessment and risk management using graphical security models
- Methods for quantitative analysis of graphical security models
- Formal semantics of graphical security models
- Formal verification of graphical security models
- Game theoretical approaches to graphical security models
- Visualization of system security
- Visual security modeling and analysis of socio-technical and
cyber-physical systems
- Graphical models for system, organizational, and business security
- Graphical security models for emerging paradigms (e.g., Cloud
computing, IoT, Software Defined Networks, Big Data)
- Case studies and experience reports on the use of graphical security
models
SUBMISSION INSTRUCTIONS
We solicit two types of submissions:
- Regular papers (up to 15 pages) describing original and unpublished
work within the scope of the workshop.
- Tool papers (up to 5 pages) describing software supporting graphical
security modeling, analysis, and evaluation. Tool papers will be
presented during a special tool session.
All submissions must be prepared using the LNCS style.
Each paper will undergo a thorough review process. All accepted
(regular and tool) papers will be included in the final proceedings,
which we plan to publish as a Springer LNCS volume (pending
confirmation). Submissions should be made using the GraMSec'15
EasyChair web site.
IMPORTANT DATES
Submission deadline: April 19, 2015
Acceptance notification: May 26, 2015
Camera ready version: June 15, 2015
Workshop: July 13, 2015
GENERAL CHAIR
Sushil Jajodia, George Mason University, USA
PC CO-CHAIRS
Sjouke Mauw, University of Luxembourg, LU
Barbara Kordy, INSA Rennes, IRISA, FR
PROGRAM COMMITTEE
- Mathieu Acher, IRISA, France
- Massimiliano Albanese, George Mason University, USA
- Ludovic Apvrille, Institut Mines-Telecom, Telecom ParisTech, CNRS
LTCI, France
- Thomas Bauereiss, DFKI GmbH, Germany
- Giampaolo Bella, University of Catania, Italy
- Stefano Bistarelli, University of Perugia, Italy
- Ahto Buldas, Cybernetica, Estonia
- Jason Crampton, Royal Holloway University of London, UK
- Frederic Cuppens, Telecom Bretagne, France
- Mathias Ekstedt, Royal Institute of Technology, Sweden
- Olga Gadyatskaya, University of Luxembourg, Luxembourg
- Paolo Giorgini, University of Trento, Italy
- Erlend Andreas Gjare, SINTEF, Norway
- Dieter Gollmann, TU Hamburg, Germany
- Olivier Heen, Technicolor, France
- Siv Hilde Houmb, Secure-NOK AS, and Gjovik University College, Norway
- Ravi Jhawar, University of Luxembourg, Luxembourg
- Henk Jonkers, BiZZdesign, The Netherlands
- Jan Jurjens, Technical University Dortmund, Germany
- Jean-Louis Lanet, INRIA, France
- Gurvan Le Guernic, DGA Maitrise de l'Information, France
- Dong Seong Kim, University of Canterbury, New Zealand
- Per Haakon Meland, SINTEF, Norway
- Jogesh Muppala, HKUST, Hong Kong
- Flemming Nielson, Technical University of Denmark, Denmark
- Steven Noel, MITRE and George Mason University, USA
- Andreas L. Opdahl, University of Bergen, Norway
- Stephane Paul, Thales Research and Technology, France
- Wolter Pieters, TU Delft and University of Twente, The Netherlands
- Ludovic Pietre-Cambacedes, EDF, France
- Sophie Pinchinat, University Rennes 1, IRISA, France
- Vincenzo Piuri, University of Milan, Italy
- Cristian Prisacariu, University of Oslo, Norway
- Nicolas Prigent, Supelec, France
- Christian W. Probst, Technical University of Denmark, Denmark
- David Pym, University College London, UK
- Sasa Radomirovic, ETH Zurich, Switzerland
- Indrajit Ray, Colorado State University, USA
- Arend Rensink, University of Twente, The Netherlands
- Yves Roudier, EURECOM, France
- Pierangela Samarati, University of Milan, Italy
- Guttorm Sindre, Norwegian University of Science and Technology, Norway
- Ketil Stolen, Sintef, Norway
- Axel Tanner, IBM Research Zurich, Switzerland
- Kishor S. Trivedi, Duke University, USA
- Luca Vigano, King's College London, UK
- Lingyu Wang, Concordia University, Canada
- Jan Willemson, Cybernetica, Estonia
This call for papers and additional information about the workshop
can be found at http://gramsec.uni.lu/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Lecturer or Senior Lecturer in Computer Science, University of Bristol
Lecturer or Senior Lecturer in Computer Science, University of Bristol
Closing date for applications: 01-April-2015
The Department of Computer Science at the University of Bristol is
seeking to appoint a Lecturer/Senior Lecturer in Computer Science.
You will have demonstrated that you are on track to become an
outstanding researcher, carrying out innovative research to complement
that currently being pursued in the department. You will have already
achieved international recognition and have a significant number of
high quality publications in top venues. You will have proven ability
or potential to attract research funding from government and/or
industrial sources. Our strategy is to grow our research portfolio and
you will be expected to take a major role in achieving that goal.
This is a full time, open ended post.
The full advert and application process can be found at
http://www.bristol.ac.uk/jobs/find/details.html?nPostingID=2981&nPostingTargetID=10709&option=28&sort=DESC&respnr=1&ID=Q50FK026203F3VBQBV7V77V83&JobNum=ACAD101302&Resultsperpage=10&lg=UK&mask=uobext
For informal discussion about the post candidates are welcome to
contact: Dr Andrew Calway (Head of Department),
Andrew.Calway@bristol.ac.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Closing date for applications: 01-April-2015
The Department of Computer Science at the University of Bristol is
seeking to appoint a Lecturer/Senior Lecturer in Computer Science.
You will have demonstrated that you are on track to become an
outstanding researcher, carrying out innovative research to complement
that currently being pursued in the department. You will have already
achieved international recognition and have a significant number of
high quality publications in top venues. You will have proven ability
or potential to attract research funding from government and/or
industrial sources. Our strategy is to grow our research portfolio and
you will be expected to take a major role in achieving that goal.
This is a full time, open ended post.
The full advert and application process can be found at
http://www.bristol.ac.uk/jobs/find/details.html?nPostingID=2981&nPostingTargetID=10709&option=28&sort=DESC&respnr=1&ID=Q50FK026203F3VBQBV7V77V83&JobNum=ACAD101302&Resultsperpage=10&lg=UK&mask=uobext
For informal discussion about the post candidates are welcome to
contact: Dr Andrew Calway (Head of Department),
Andrew.Calway@bristol.ac.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Fully funded PhD Position in Smart Grid Research
-----------------------------------------------------------------------
Please distribute to interested people
-----------------------------------------------------------------------
Please distribute to interested people
-----------------------------------------------------------------------
Fully funded PhD Position in Smart Grid Research
Technical University Hamburg, Germany
We are looking for a PhD candidate to do research in the area of smart
grid, decentralized power networks, micro-grids, and demand-response
systems. The focus of this research is on applying information and
communication technologies in these areas. We are a highly motivated
international team of researchers situated in the south of Hamburg. We
offer ideal working conditions, a beautiful campus, and a competitive
salary.
Requirements:
-- excellent M.S. in computer science, computer engineering, electrical
engineering, mathematics, physics or related studies
-- strong interest in design, implementation, simulation of distributed
algorithms
-- skills in creative problem solving
The position will be filled starting June, 1st, 2015. Deadline for
applications is April 3rd, 2015. More details and information about
applications (including the identifier D-15-34) are published at
http://intranet.tuhh.de/aktuell/stellen/stelle.html?kenn_nr=D-15-34
For more information contact:
Prof. Volker Turau (turau at tuhh.de)
Further information about the Institute of Telematics can be found on
http://www.ti5.tu-harburg.de/. Women are especially encouraged to
apply. The position is in the first instance limited to one year with
the possibility of extending for another three years. Applications
should include a detailed CV, a motivation letter, a list of your
M.SC. courses and grades, and a copy of your master thesis.
Applications can be send by email to telematik at tuhh.de using
reference number D-15-34.
---
Prof.Volker Turau
Institute of Telematics
Technische Universität Hamburg-Harburg
Schwarzenbergstr. 95
D-21073 Hamburg
Tel.: (+4940) 42878-3530
Fax: (+4940) 42878-2581
E-Mail: turau@tuhh.de
http://www.ti5.tu-harburg.de/staff/turau/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Ten PhD positions in Computer Science at GSSI - L'Aquila (Italy)
The Gran Sasso Science Institute (GSSI - http://www.gssi.infn.it/ ), a
recently established international PhD school and a Center for advanced
studies in L'Aquila (ITALY) offers 10 PhD positions in Computer Science.
recently established international PhD school and a Center for advanced
studies in L'Aquila (ITALY) offers 10 PhD positions in Computer Science.
These positions are related to the pillars of the PhD program in
Computer Science (http://cs.gssi.infn.it), namely:
Foundations of social and computer networks
Software systems and services
Specifications and analysis of concurrent reactive systems
Apart from pursuing their own research studies, the successful
candidates will have the opportunity to cooperate with members of the
research group and of the Scientific Board
(http://cs.gssi.infn.it/phd-program/information/), as well as with the
frequent guests of the institute.
Facilities and benefits:
All PhD students will have tuition fees waived;
all PhD students will have free accommodation on GSSI facilities (a
financial substitute of 350,00 Euros gross/month may be offered upon
request);
all PhD students will have free luncheon vouchers;
all PhD students will be covered by insurance against any accident
and/or injury that may occur while carrying out their PhD activities.
The deadline for application is: April 15, 2015 at 6:00 pm (Rome time)
The PhD programs last three years. The yearly amount of the scholarship
is of € 16.159,91 gross.
For information see http://www.gssi.infn.it/phd/.
For any further information feel free to contact Rocco De Nicola
(rocco.denicola@imtlucca.it), the coordinator of the PhD program in
Computer Science, or any other member of the research group or of the
Scientific Board http://cs.gssi.infn.it/phd-program/information/.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for Papers - SPIRE 2015
=========================================================
================ Call for Papers - SPIRE 2015 ==================
CALL FOR PAPERS
SPIRE 2015
22nd International Symposium on
String Processing and Information Retrieval
Sept. 1 - Sept 3, 2015, London, United Kingdom
http://www.dcs.kcl.ac.uk/events/spire2015/
Submission deadline: ** May 1, 2015 **
Notification: ** June 8, 2015 **
***************************************************************
SCOPE: Papers in all areas related to string processing and
information retrieval and related topics are sought, including,
but not limited to: bioinformatics and computational biology,
high-throughput DNA sequencing, coding and data compression,
compressed data structures, text analysis, data mining, natural
language processing, pattern discovery, string algorithms, string
processing in databases, text searching, information retrieval
models and evaluation, search tasks, efficiency in IR systems.
See: http://www.dcs.kcl.ac.uk/events/spire2015/submissions.html
Both papers reporting on original research unpublished elsewhere
and surveys of important results are welcome.
The proceedings will be published in the Springer-Verlag series
Lecture Notes in Computer Science.
IMPORTANT DATES:
Submission: May 1, 2015
Notification: June 8, 2015
Final version: June 22, 2015
Symposium: September 1- September 3, 2015
Workshops: September 4, 2015
INVITED SPEAKERS:
• Aris Gionis (Aalto University, Finland)
• Mounia Lalmas (Yahoo! Research, United Kingdom)
• Rajeev Raman (University of Leicester, United Kingdom)
PROGRAM COMMITTEE:
• Amihood Amir (Bar-Ilan University, Israel)
• Ismail Sengor Altingovde (METU, Turkey)
• Leif Azzopardi (University of Glasgow, UK)
• Hideo Bannai (Kyushu University, Japan)
• Golnaz Badkobeh (University of Sheffield, UK)
• Philip Bille (Technical University of Denmark, Denmark)
• Christina Boucher (Colorado State University, USA)
• Ben Carterette (University of Delaware, USA)
• Charlie Clarke (University of Waterloo, Canada)
• Gianluca Demartini (University of Sheffield, UK)
• Johannes Fischer (TU Dortmund, Germany)
• Travis Gagie (University of Helsinki, Finland)
• Paweł Gawrychowski (University of Warsaw, Poland)
• Simon Gog (Karlsruhe Institute of Technology, Germany)
• Danny Hermelin (Ben-Gurion University, Israel)
• Djoerd Hiemstra (University of Twente, The Netherlands)
• Katja Hofmann (Microsoft Research Cambridge, UK)
• Costas Iliopoulos (King's College London, UK, co-chair)
• Juha Kärkkäinen (University of Helsinki, Finland)
• Jaap Kamps (University of Amsterdam, The Netherlands)
• Evangelos Kanoulas (University of Amsterdam, The Netherlands)
• Gabriella Kazai (Lumi, UK)
• Gad Landau (University of Haifa, Israel)
• Susana Ladra (University of A Coruña, Spain)
• Zsuzsanna Lipták (University of Verona, Italy)
• Gonzalo Navarro (University of Chile, Chile)
• Kunsoo Park (Seoul National University, Korea)
• Nadia Pisanti (University of Pisa, Italy)
• Solon Pissis (King's College London, UK)
• Simon J. Puglisi (University of Helsinki, Finland, co-chair)
• Jakub Radoszewski (University of Warsaw, Poland)
• Marinella Sciortino (University of Palermo, Italy)
• Falk Scholer (RMIT University, Australia)
• Torsten Suel (New York University, USA)
• Jouni Sirén (Wellcome Trust Sanger Institute, UK)
• Tatiana Starikovskaya (University of Bristol, UK)
• Yasuo Tabei (Tokyo Institute of Technology, Japan)
• Rossano Venturini (University of Pisa, Italy)
• Grace Yang (Georgetown University, USA)
• Emine Yilmaz (University College London, UK, co-chair)
ORGANIZING COMMITTEE
• Solon Pissis (King's College London, UK, chair)
• Maxime Crochemore (King's College London, UK)
• Tomasz Radzik (King's College London, UK)
• Carl Barton (Queen Mary College, UK)
STEERING COMMITTEE
• Ricardo Baeza-Yates (Yahoo! Research)
• Maxime Crochemore (King's College London, UK)
• Oren Kerland (Technion, Israel)
• Moshe Lewenstein (Bar-Ilan University, Israel)
• Ely Porat (Bar-Ilan University, Israel)
• Berthier Ribeiro-Neto (Google Inc. and Federal Univ. Minas
Gerais, Brazil)
• Edleno Silva de Moura (Federal University of Amazonas, Brazil)
• Nivio Ziviani (Federal University of Minas Gerais, Brazil)
• Liliana Calderón-Benavides (Autonomous Univ. Bucaramanga,
Colombia)
• Edgar Chávez (Centro de Investigacion Cientifica y de Educacion
Superior de Ensenada, Mexico)
• Cristina N. González-Caro (Autonomous Univ. Bucaramanga, Colombia)
Further details are available at the symposium web site:
http://www.dcs.kcl.ac.uk/events/spire2015/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Last Mile: AMBIENT 2015 || July 19 - 24, 2015 - Nice, France
INVITATION:
=================
The submission deadline is March 18, 2015.
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to AMBIENT 2015.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== AMBIENT 2015 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
AMBIENT 2015, The Fifth International Conference on Ambient Computing, Applications, Services and Technologies
July 19 - 24, 2015 - Nice, France
General page: http://www.iaria.org/conferences2015/AMBIENT15.html
Call for Papers: http://www.iaria.org/conferences2015/CfPAMBIENT15.html
Submission page: http://www.iaria.org/conferences2015/SubmitAMBIENT15.html
Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]
Proposals for:
- mini-symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posed on www.iaria.org]
- panels: [slide-deck posed on www.iaria.org]
Submission deadline: March 18, 2015
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
AMBIENT 2015 Topics (topics and submission details: see CfP on the site)
Track 1: Ambient computing environments, sensors and hardware
Fundamental for ambient computing and mechanisms; Environmental sensing and computing; Distributed ambient and artificial intelligence; Autonomic ambient networks and communications; Smart environments and applications; Ubiquitous and mobile computing
Track 2: Ambient computing and modeling
Sentient Computing; Tracking and sensing networks; Location-based computing; Ambient context modeling and reasoning; Context-aware computing; Local and global sensing; Multi-sensory and multi-modal fusion
Track 3: Ambient devices, applications and systems
Ambient media and devices; Ambient content and methods for adding intelligence to media objects; Sentient offices; Smart phones; Glasses and filters for ambient game and movie; Social networks and social computing; Semantic-location; Body sensors; Wearable devices; Smart sensors
Track 4: Ambient services, technology and platforms
Personalized services; Ambient assisted living (AAL) ; Social games; Domotics (Home Automation) ; Domestic robotics; Intelligent homes; Tele-care and Telemedicine; Mobile media; Mobile learning; Emergency services; Ambient-oriented technologies (wireless, social networks) ; Universal access; Ambient platforms; Ambient and mobile social networks
Track 5: User Friendly Interfaces
Haptic interfaces; Smart user interfaces; Ambient interfaces (touch, gesture, haptics, biometrics) ; Multimodal interfaces and interaction
Track 6: Ambient Business Models, Privacy and Trust
Business model and business cases, security, privacy and trust, Real-life implementations
-------------
Committee: http://www.iaria.org/conferences2015/ComAMBIENT15.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
=================
The submission deadline is March 18, 2015.
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to AMBIENT 2015.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== AMBIENT 2015 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
AMBIENT 2015, The Fifth International Conference on Ambient Computing, Applications, Services and Technologies
July 19 - 24, 2015 - Nice, France
General page: http://www.iaria.org/conferences2015/AMBIENT15.html
Call for Papers: http://www.iaria.org/conferences2015/CfPAMBIENT15.html
Submission page: http://www.iaria.org/conferences2015/SubmitAMBIENT15.html
Contributions:
- regular papers [in the proceedings, digital library]
- short papers (work in progress) [in the proceedings, digital library]
- ideas: two pages [in the proceedings, digital library]
- extended abstracts: two pages [in the proceedings, digital library]
- posters: two pages [in the proceedings, digital library]
- posters: slide only [slide-deck posted at www.iaria.org]
- presentations: slide only [slide-deck posted at www.iaria.org]
- demos: two pages [posted at www.iaria.org]
- doctoral forum submissions: [in the proceedings, digital library]
Proposals for:
- mini-symposia: see http://www.iaria.org/symposium.html
- workshops: see http://www.iaria.org/workshop.html
- tutorials: [slide-deck posed on www.iaria.org]
- panels: [slide-deck posed on www.iaria.org]
Submission deadline: March 18, 2015
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
AMBIENT 2015 Topics (topics and submission details: see CfP on the site)
Track 1: Ambient computing environments, sensors and hardware
Fundamental for ambient computing and mechanisms; Environmental sensing and computing; Distributed ambient and artificial intelligence; Autonomic ambient networks and communications; Smart environments and applications; Ubiquitous and mobile computing
Track 2: Ambient computing and modeling
Sentient Computing; Tracking and sensing networks; Location-based computing; Ambient context modeling and reasoning; Context-aware computing; Local and global sensing; Multi-sensory and multi-modal fusion
Track 3: Ambient devices, applications and systems
Ambient media and devices; Ambient content and methods for adding intelligence to media objects; Sentient offices; Smart phones; Glasses and filters for ambient game and movie; Social networks and social computing; Semantic-location; Body sensors; Wearable devices; Smart sensors
Track 4: Ambient services, technology and platforms
Personalized services; Ambient assisted living (AAL) ; Social games; Domotics (Home Automation) ; Domestic robotics; Intelligent homes; Tele-care and Telemedicine; Mobile media; Mobile learning; Emergency services; Ambient-oriented technologies (wireless, social networks) ; Universal access; Ambient platforms; Ambient and mobile social networks
Track 5: User Friendly Interfaces
Haptic interfaces; Smart user interfaces; Ambient interfaces (touch, gesture, haptics, biometrics) ; Multimodal interfaces and interaction
Track 6: Ambient Business Models, Privacy and Trust
Business model and business cases, security, privacy and trust, Real-life implementations
-------------
Committee: http://www.iaria.org/conferences2015/ComAMBIENT15.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, March 2, 2015
[DMANET] Airport operations and airline scheduling - EURO 2015 - Glasgow
27th European Conference on Operational Research
12-15 July 2015, University of Strathclyde, Glasgow
Dear Colleagues,
We invite you to contribute to one of the following sessions within
the "Airport operations and airline scheduling" stream:
- Airport operations (invitation code: 92eb4ff4)
Session Chairs: Daniel Karapetyan and Jason Atkin
- Airline and Flight operations (invitation code: 178c7a8b)
Session Chairs: Andrew Parkes, Daniel Karapetyan and Jason Atkin
Please submit your abstract to the appropriate session using the
corresponding invitation code via the abstract submission page:
http://www.euro-online.org/conf/euro27.
The deadline for abstract submission is 16 March 2015.
We hope that you are interested in contributing to the stream. If you
have any questions, or wish to organise a session, then please do not
hesitate to contact us.
Best wishes,
Stream Organisers
Daniel Karapetyan and Jason Atkin
ASAP Group, School of Computer Science, University of Nottingham, UK
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
12-15 July 2015, University of Strathclyde, Glasgow
Dear Colleagues,
We invite you to contribute to one of the following sessions within
the "Airport operations and airline scheduling" stream:
- Airport operations (invitation code: 92eb4ff4)
Session Chairs: Daniel Karapetyan and Jason Atkin
- Airline and Flight operations (invitation code: 178c7a8b)
Session Chairs: Andrew Parkes, Daniel Karapetyan and Jason Atkin
Please submit your abstract to the appropriate session using the
corresponding invitation code via the abstract submission page:
http://www.euro-online.org/conf/euro27.
The deadline for abstract submission is 16 March 2015.
We hope that you are interested in contributing to the stream. If you
have any questions, or wish to organise a session, then please do not
hesitate to contact us.
Best wishes,
Stream Organisers
Daniel Karapetyan and Jason Atkin
ASAP Group, School of Computer Science, University of Nottingham, UK
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PANDA: a new software for polyhedral transformations
Dear colleagues,
we would like to announce PANDA to the general public. Our software package
PANDA (Parallel AdjaceNcy Decomposition Algorithm) allows for
transformation of linear descriptions of polytopes and polyhedra.
The key features of PANDA are:
* Vertex enumeration and facet enumeration of polytopes and polyhedra
* User choice of double description method and adjacency decomposition
* Use of symmetry information for compact representation (input & output)
as well as faster computation
* Use of modern multi-core hardware right out of the box (manual control of
number of concurrent threads possible, but optional)
* Ready for use on clusters (MPI required)
* Compatibility with PORTA format
* Correctness guarantee with arbitrary precision integer type or overflow
guarded integer type
For details on usage of the software, please visit the PANDA
homepage http://comopt.ifi.uni-heidelberg.de/software/PANDA/index.html
We highly value feedback! If you encounter compilation issues or found a
run time bug, please do not hesitate to contact our developer Stefan Lörwald.
Please use the email address provided in the README file of the
downloadable package
and include the version information in your bug report.
The software is available free of charge under the Creative Commons
Attribution-NonCommercial 4.0 International License. You'll find the latest
version on http://comopt.ifi.uni-heidelberg.de
/software/PANDA/index.html#download
Best regards
Stefan Lörwald, Gerhard Reinelt
Research Group Discrete and Combinatorial Optimization
Institut für Informatik, Ruprecht-Karls-Universität Heidelberg
Im Neuenheimer Feld 368, D-69120 Heidelberg
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Fully-funded PhD studentship in Algorithms and Complexity at University of Edinburgh
A fully funded 3.5 year PhD studentship is available at the School of
Informatics, University of Edinburgh, on the topic of "Exact Algorithms
for NP-hard Problems". The studentship is funded by the ERC
Consolidator Grant ALUnif: "Algorithms and Lower Bounds: A Unified
Approach", and will be supervised by Rahul Santhanam.
The goal of the project is to design and analyze better algorithms for
Satisfiability and other NP-complete problems, guided by
complexity-theoretic ideas. The project belongs to the field of exact
algorithms for NP-hard problems, where we are interested in finding
algorithms for NP-hard problems with worst-case complexity O(2^{cn}),
where c < 1 is as small as possible. Here "n" is the witness size of the
instance. Recently discovered connections between complexity lower bound
techniques and algorithmic analysis suggest new approaches to finding
better exact algorithms, and the student will work with the supervisor in
exploring these new approaches.
The student will join the Algorithms and Complexity Group at the
Laboratory for Foundations of Computer Science (LFCS) in the School of
Informatics. The School of Informatics at Edinburgh is the UK's largest
and strongest research centre for computing and informatics. In the latest
UK Research Excellence Framework in 2014, Informatics at Edinburgh was
adjudged to deliver more world-leading research than any other university
in the UK.
Applicants should have a strong mathematical background, with an
undergraduate degree in Computer Science, Mathematics or a related area.
Prior experience with the theory of algorithms and/or complexity theory is
highly recommended.
The position is available to UK/EU applicants, but exceptional
international applicants may also be considered. The deadline is March
31, 2015. Informal queries may be addressed to Rahul Santhanam
(rsanthan@inf.ed.ac.uk).
To apply, follow the instructions on this web-page:
http://www.ed.ac.uk/schools-departments/informatics/postgraduate/fees/research-grant-funding/algorithmsandlowerbounds
---------------
Rahul Santhanam
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Informatics, University of Edinburgh, on the topic of "Exact Algorithms
for NP-hard Problems". The studentship is funded by the ERC
Consolidator Grant ALUnif: "Algorithms and Lower Bounds: A Unified
Approach", and will be supervised by Rahul Santhanam.
The goal of the project is to design and analyze better algorithms for
Satisfiability and other NP-complete problems, guided by
complexity-theoretic ideas. The project belongs to the field of exact
algorithms for NP-hard problems, where we are interested in finding
algorithms for NP-hard problems with worst-case complexity O(2^{cn}),
where c < 1 is as small as possible. Here "n" is the witness size of the
instance. Recently discovered connections between complexity lower bound
techniques and algorithmic analysis suggest new approaches to finding
better exact algorithms, and the student will work with the supervisor in
exploring these new approaches.
The student will join the Algorithms and Complexity Group at the
Laboratory for Foundations of Computer Science (LFCS) in the School of
Informatics. The School of Informatics at Edinburgh is the UK's largest
and strongest research centre for computing and informatics. In the latest
UK Research Excellence Framework in 2014, Informatics at Edinburgh was
adjudged to deliver more world-leading research than any other university
in the UK.
Applicants should have a strong mathematical background, with an
undergraduate degree in Computer Science, Mathematics or a related area.
Prior experience with the theory of algorithms and/or complexity theory is
highly recommended.
The position is available to UK/EU applicants, but exceptional
international applicants may also be considered. The deadline is March
31, 2015. Informal queries may be addressed to Rahul Santhanam
(rsanthan@inf.ed.ac.uk).
To apply, follow the instructions on this web-page:
http://www.ed.ac.uk/schools-departments/informatics/postgraduate/fees/research-grant-funding/algorithmsandlowerbounds
---------------
Rahul Santhanam
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Opt4SmartCities workshop at CPAIOR, May 2015 Barcelona
Call for Papers
Workshop on Optimization for Smart Cities
Workshop on Optimization for Smart Cities
Opt4SmartCities
Barcelona, May 18 2015
in conjunction with CPAIOR 2015
Abstract submission: Apr 12 2015
================================================================================
Workshop web site: http://ai.unibo.it/Opt4SmartCities2015
CPAIOR 2015 web site: http://cpaior2015.uconn.edu
Policy makers who run the complex network of diverse people, expected services
and aging infrastructure are on a constant search for more efficient ways to
analyze data, anticipate problems and coordinate resources in their cities.
Developing methods for fulfilling such a need involves, among other things,
data analytics and intelligent sensor dissemination, modeling human demands and
operations and planning, often under uncertainty.
This workshop has the purpose of bringing together scholars and practitioners
that work on the solution of problems related to the improvement of the quality
of life and the use of resources in cities, to make cities smarter.
We invite submissions of a short abstract (not more than 4000 characters)
describing original work on applications of methods, with special emphasis on
optimization, for "making our cities smarter".
Abstract should be submitted via EasyChair at:
https://easychair.org/conferences/?conf=opt4smartcities2015
Abstract should be submitted by:
Apr 12 2015
Techniques of interest include (but are not limited to):
- Constraint Programming
- Mathematical Programming
- Hybrid algorithms
- Interconnection between (multi-agent) Simulation and Optimization;
- Interconnection between Data mining and analytics and Optimization;
- Interconnection between Sensors and Optimization;
- Optimization and visualization
Applications areas include (but are not limited to)
- Intelligent transportation systems
- Electric mobility
- Smart grids
- Waste management
- Urban planning
- Natural resources management
- Modeling human demands
This workshop is organized within the CPAIOR 2015 Conference in Barcelona,
Spain on Monday May 18, 2015, and will include both invited and contributed
talks. The program/organizing committee will evaluate the submissions and a
selection of abstracts will be admitted for presentation at the workshop. We
encourage the submission of new challenging problems, including data instances.
Workshop Organization:
- Michele Lombardi, Università di Bologna, Italy
- Michela Milano, Università di Bologna, Italy
Important Dates:
- Apr 12 2015: Deadline for abstract submission
- Apr 24 2015: Notification of acceptance
- May 18 2015: Opt4SmartCities Workshop
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CIAC 2015: CALL FOR PARTICIPATION
9th International Conference on Algorithms and Complexity (CIAC)
May 20-22, 2015, Paris, France
May 20-22, 2015, Paris, France
http://www.lamsade.dauphine.fr/~ciac2015/cfp.php
The 9th International Conference on Algorithms and Complexity is
intended to provide a forum for researchers working in all aspects of
computational complexity and the use, design, analysis and
experimentation of efficient algorithms and data structures.
Accepted papers presente original research in the following areas of
algorithms and
complexity:
sequential, parallel and distributed algorithms and data structures;
approximation and randomized algorithms;
graph algorithms and graph drawing;
on-line and streaming algorithms;
analysis of algorithms and computational complexity;
algorithm engineering;
web algorithms;
algorithmic game theory;
computational biology;
communication networks;
computational geometry;
discrete optimization.
The conference proceedings will be published by Springer-Verlag in
its Lecture Notes in Computer Science (LNCS) series.
CONFERENCE: May 20-22, 2015, UNIVERSITY PARIS-DAUPHINE
Early Registration (January 15th)
Student fee €300
Regular fee €400
Early Registration deadline is April 10th
Late Registration (April 10th)
Student fee €350
Regular fee €450
Invited Speakers
Elias Koutsoupias, St Anne's College, Oxford University, UK
Haim Kaplan, School of Computer Science, Tel Aviv University, Israel
Bernard Chazelle, Department of Computer Science, Princeton University, USA
Mikkel Thorup, Department of Computer Science, University of
Copenhagen, Denmark
Steering Committee
Giorgio Ausiello, Sapienza University of Rome, Italy
Josep Diaz, TU Catalonia, Spain
Rossella Petreschi, Sapienza University of Rome, Italy
Maria Serna, TU Catalonia, Spain
Paul Spirakis, University of Liverpool, UK and CTI, Greece
Program Committee
Hannah Bast, University of Freiburg, Germany
Vincenzo Bonifaci, IASI-CNR, Rome, Italy
Jérémie Chalopin, CNRS and Université d'Aix-Marseille, France
Victor Chepoi, University of Aix-Marseille, France
Marek Chrobak, University of California, Riverside, USA
Pierluigi Crescenzi, University of Florence, Italy
Jurek Czyzowicz, University of Québec in Outaouais, Canada
Yann Disser, TU Berlin, Germany
Thomas Erlebach, University of Leicester, UK
Bruno Escoffier, UPMC, France
Irene Finocchi, Sapienza University of Rome, Italy
Fedor Fomin, University of Bergen, Norway
Pierre Fraigniaud, CNRS and University Paris Diderot, France
Herman Haverkort, TU Eindhoven, Netherlands
Matúš Mihalák, ETH Zurich, Switzerland
Luca Moscardelli, University of Chieti-Pescara, Italy
Yoshio Okamoto, University of Electro-Communications, Japan
Vangelis Th. Paschos, University Paris-Dauphine, France
David Peleg, Weizmann Institute of Science, Israel
Marie-France Sagot, Inria & University Lyon 1, France
Piotr Sankowski, University of Warsaw, Poland
Maria Serna, TU Catalonia, Spain
Paul Spirakis, University of Liverpool, UK and CTI, Greece
Dimitrios M. Thilikos, CNRS, LIRMM, France and UoA, Greece
Roger Wattenhofer, ETH Zurich, Switzerland
Peter Widmayer (Chair), ETH Zurich, Switzerland
Gerhard J. Woeginger, TU Eindhoven, Netherlands
Organizing Committee
Katerina Kinta, University Paris-Dauphine, France
Cecile Murat, University Paris-Dauphine, France
Eleni Palaiologou, University Paris-Dauphine, France
Vangelis Th. Paschos (Chair), University Paris-Dauphine, France
Juliette de Roquefeuil, University Paris-Dauphine, France
Olivier Rouyer, University Paris-Dauphine, France
Florian Sikora, University Paris-Dauphine, France
Georgios Stamoulis, University Paris-Dauphine, France
--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] EUROCOMB 2015
The European Conference on Combinatorics, Graph Theory and
Applications will be held in Bergen, Norway, Aug 31 - Sep 4, 2015.
Please visit the EuroComb 2015 webpage for the Call for Papers:
http://eurocomb2015.b.uib.no/call-for-papers/
The Conference poster can now be downloaded.
Abstract submission deadline is March 15th.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Applications will be held in Bergen, Norway, Aug 31 - Sep 4, 2015.
Please visit the EuroComb 2015 webpage for the Call for Papers:
http://eurocomb2015.b.uib.no/call-for-papers/
The Conference poster can now be downloaded.
Abstract submission deadline is March 15th.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, March 1, 2015
[DMANET] Postdoctoral fellowship in Sydney
Postdoctoral fellowship in Sydney:
We are advertising a 24-month postdoctoral research fellowship in
theoretical computer science shared between University of Sydney and
University of New South Wales, Australia. The expected start date is
September 2015.
The successful applicant will conduct research on algorithms with
Serge Gaspers, Joachim Gudmundsson and Julian Mestre in the USYD SACT
research group and UNSW Algorithms group. The aim will be to design
algorithms in the areas of approximation algorithms and parameterized
complexity.
We are looking for outstanding PhD graduates with a track record in
the broad field of algorithms, ideally with an emphasis on
combinatorial optimization, parameterized complexity or computational
geometry. Experience in experimental algorithmics is an advantage but
not essential.
Salary Package: AUD 85,161 – AUD 91,520 pa plus superannuation
Your application must include
- a research statement
- a detailed curriculum vitae
- contact details of three references
For more information on how to apply, please visit:
https://sydneyalgorithms.wordpress.com/postdoctoral-fellowship/
The closing date for applying is 31 March 2015.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] UNSW/USydney Postdoctoral Fellow in Optimization for Radiotherapy
Postdoctoral Position in Optimisation for Radiotherapy
The Radiation Physics Laboratory at the University of Sydney currently has several positions open in Medical Physics related research. It is expected that at least one position will involve developing novel mathematics and numerical methods to solve large mixed integer programming problems that arise in radiotherapy treatments of lung cancer patients. This is an exciting opportunity to work on problems that are beneficial to human health, with the research highly likely to be translated to the clinic.
The optimisation position will be funded by a Cancer Australia Grant held by Dr Ricky O'Brien (University of Sydney) and Professor Gary Froyland (UNSW Australia). The positions are full-time fixed term for three years, subject to the completion of a satisfactory probation period for new appointees, with the possibility of a further offer of employment. The optimisation position requires no formal background in medical physics, however, an appreciation on the role that mixed integer programming plays in radiotherapy would be an advantage.
You will have a PhD in Mathematics, Computer Science, or Engineering specialising in optimisation / mathematical programming; excellent oral and written communication skills; demonstrated ability to work effectively as part of a team; demonstrated computer programming ability; demonstrated high level analytical and problem solving skills; a proven record of publications; a proven capacity for self-directed research; and the ability to deliver high-quality project outcomes in a timely manner.
To apply, please follow the link below; the closing date for applications is 23 March, 2015.
http://sydney.nga.net.au/cp/index.cfm?event=jobs.checkJobDetailsNewApplication&returnToEvent=jobs.listJobs&jobid=6e5b3cec-732f-3dcd-c073-889ba71a7912&CurATC=EXT&CurBID=949319bc%2D8898%2D4f11%2Dac4b%2D9db401358504&jobsListKey=0a7307af%2D0ff8%2D47fe%2D9bb7%2D9c3a92c97387&JobListID=a218b974%2Daa19%2D4889%2D821f%2D9bc90126ffaa&persistVariables=CurATC,CurBID,jobsListKey,JobListID,JobID&lid=91404630172
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
The Radiation Physics Laboratory at the University of Sydney currently has several positions open in Medical Physics related research. It is expected that at least one position will involve developing novel mathematics and numerical methods to solve large mixed integer programming problems that arise in radiotherapy treatments of lung cancer patients. This is an exciting opportunity to work on problems that are beneficial to human health, with the research highly likely to be translated to the clinic.
The optimisation position will be funded by a Cancer Australia Grant held by Dr Ricky O'Brien (University of Sydney) and Professor Gary Froyland (UNSW Australia). The positions are full-time fixed term for three years, subject to the completion of a satisfactory probation period for new appointees, with the possibility of a further offer of employment. The optimisation position requires no formal background in medical physics, however, an appreciation on the role that mixed integer programming plays in radiotherapy would be an advantage.
You will have a PhD in Mathematics, Computer Science, or Engineering specialising in optimisation / mathematical programming; excellent oral and written communication skills; demonstrated ability to work effectively as part of a team; demonstrated computer programming ability; demonstrated high level analytical and problem solving skills; a proven record of publications; a proven capacity for self-directed research; and the ability to deliver high-quality project outcomes in a timely manner.
To apply, please follow the link below; the closing date for applications is 23 March, 2015.
http://sydney.nga.net.au/cp/index.cfm?event=jobs.checkJobDetailsNewApplication&returnToEvent=jobs.listJobs&jobid=6e5b3cec-732f-3dcd-c073-889ba71a7912&CurATC=EXT&CurBID=949319bc%2D8898%2D4f11%2Dac4b%2D9db401358504&jobsListKey=0a7307af%2D0ff8%2D47fe%2D9bb7%2D9c3a92c97387&JobListID=a218b974%2Daa19%2D4889%2D821f%2D9bc90126ffaa&persistVariables=CurATC,CurBID,jobsListKey,JobListID,JobID&lid=91404630172
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
