Security Attributes Based Digital Rights Management

Most real-life systems delegate responsibilities to different authorities. We apply this model to a digital rights management system, to achieve flexible security. In our model a hierarchy of authorities issues certificates that are linked by cryptographic means. This linkage establishes a chain of control, identity-attribute-rights, and allows flexible rights control over content. Typical security objectives, such as identification, authentication, authorization and access control can be realised. Content keys are personalised to detect illegal super distribution. We describe a working prototype, which we develop using standard techniques, such as standard certificates, XML and Java. We present experimental results to evaluate the scalability of the system. A formal analysis demonstrates that our design is able to detect a form of illegal super distribution

Note and Comment

The Law School - In common with all other law schools requiring college work for admission, this school has suffered a very heavy loss in attendance because of war conditions. This, however, is a matter for pride and not for discouragement for it means that our students have gone into the army or navy or other branches of the national service in very high ratio to their total number. And this is by no means due only to the effect of the Selective Service Act for from the very beginning our men have volunteered in great spirit and promptness. In 1917 fewer than two-thirds of the then senior class were present at the Commencement exercises to receive their degrees. Most of them had gone by the middle of May. All this indicates that the profession is living up to one of its high traditions of patriotic service

Dynamics of the attractive 1D Bose gas: analytical treatment from integrability

The physics of the attractive one-dimensional Bose gas (Lieb-Liniger model) is investigated with techniques based on the integrability of the system. Combining a knowledge of particle quasi-momenta to exponential precision in the system size with determinant representations of matrix elements of local operators coming from the Algebraic Bethe Ansatz, we obtain rather general analytical results for the zero-temperature dynamical correlation functions of the density and field operators. Our results thus provide quantitative predictions for possible future experiments in atomic gases or optical waveguides.Comment: 26 pages, 5 figure

One-particle dynamical correlations in the one-dimensional Bose gas

The momentum- and frequency-dependent one-body correlation function of the one-dimensional interacting Bose gas (Lieb-Liniger model) in the repulsive regime is studied using the Algebraic Bethe Ansatz and numerics. We first provide a determinant representation for the field form factor which is well-adapted to numerical evaluation. The correlation function is then reconstructed to high accuracy for systems with finite but large numbers of particles, for a wide range of values of the interaction parameter. Our results are extensively discussed, in particular their specialization to the static case.Comment: 19 Pages, 7 figure

Thermodynamics of an interacting trapped Bose-Einstein gas in the classical field approximation

We present a convenient technique describing the condensate in dynamical equilibrium with the thermal cloud, at temperatures close to the critical one. We show that the whole isolated system may be viewed as a single classical field undergoing nonlinear dynamics leading to a steady state. In our procedure it is the observation process and the finite detection time that allow for splitting the system into the condensate and the thermal cloud.Comment: 4 pages, 4 eps figures, final versio

Singularities and Topology of Meromorphic Functions

We present several aspects of the "topology of meromorphic functions", which we conceive as a general theory which includes the topology of holomorphic functions, the topology of pencils on quasi-projective spaces and the topology of polynomial functions.Comment: 21 pages, 1 figur

Atom Interferometers

Interference with atomic and molecular matter waves is a rich branch of atomic physics and quantum optics. It started with atom diffraction from crystal surfaces and the separated oscillatory fields technique used in atomic clocks. Atom interferometry is now reaching maturity as a powerful art with many applications in modern science. In this review we first describe the basic tools for coherent atom optics including diffraction by nanostructures and laser light, three-grating interferometers, and double wells on AtomChips. Then we review scientific advances in a broad range of fields that have resulted from the application of atom interferometers. These are grouped in three categories: (1) fundamental quantum science, (2) precision metrology and (3) atomic and molecular physics. Although some experiments with Bose Einstein condensates are included, the focus of the review is on linear matter wave optics, i.e. phenomena where each single atom interferes with itself.Comment: submitted to Reviews of Modern Physic

Physics with Coherent Matter Waves

This review discusses progress in the new field of coherent matter waves, in particular with respect to Bose-Einstein condensates. We give a short introduction to Bose-Einstein condensation and the theoretical description of the condensate wavefunction. We concentrate on the coherence properties of this new type of matter wave as a basis for fundamental physics and applications. The main part of this review treats various measurements and concepts in the physics with coherent matter waves. In particular we present phase manipulation methods, atom lasers, nonlinear atom optics, optical elements, interferometry and physics in optical lattices. We give an overview of the state of the art in the respective fields and discuss achievements and challenges for the future

A flexible coupling approach to multi-agent planning under incomplete information

The final publication is available at Springer via http://dx.doi.org/10.1007/s10115-012-0569-7Multi-agent planning (MAP) approaches are typically oriented at solving loosely coupled problems, being ineffective to deal with more complex, strongly related problems. In most cases, agents work under complete information, building complete knowledge bases. The present article introduces a general-purpose MAP framework designed to tackle problems of any coupling levels under incomplete information. Agents in our MAP model are partially unaware of the information managed by the rest of agents and share only the critical information that affects other agents, thus maintaining a distributed vision of the task. Agents solve MAP tasks through the adoption of an iterative refinement planning procedure that uses single-agent planning technology. In particular, agents will devise refinements through the partial-order planning paradigm, a flexible framework to build refinement plans leaving unsolved details that will be gradually completed by means of new refinements. Our proposal is supported with the implementation of a fully operative MAP system and we show various experiments when running our system over different types of MAP problems, from the most strongly related to the most loosely coupled.This work has been partly supported by the Spanish MICINN under projects Consolider Ingenio 2010 CSD2007-00022 and TIN2011-27652-C03-01, and the Valencian Prometeo project 2008/051.Torreño Lerma, A.; Onaindia De La Rivaherrera, E.; Sapena Vercher, O. (2014). A flexible coupling approach to multi-agent planning under incomplete information. Knowledge and Information Systems. 38:141-178. https://doi.org/10.1007/s10115-012-0569-7S14117838Argente E, Botti V, Carrascosa C, Giret A, Julian V, Rebollo M (2011) An abstract architecture for virtual organizations: the THOMAS approach. Knowl Inf Syst 29(2):379–403Barrett A, Weld DS (1994) Partial-order planning: evaluating possible efficiency gains. Artif Intell 67(1):71–112Belesiotis A, Rovatsos M, Rahwan I (2010) Agreeing on plans through iterated disputes. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems. pp 765–772Bellifemine F, Poggi A, Rimassa G (2001) JADE: a FIPA2000 compliant agent development environment. In: Proceedings of the 5th international conference on autonomous agents (AAMAS). ACM, pp 216–217Blum A, Furst ML (1997) Fast planning through planning graph analysis. Artif Intell 90(1–2):281–300Boutilier C, Brafman R (2001) Partial-order planning with concurrent interacting actions. J Artif Intell Res 14(105):136Brafman R, Domshlak C (2008) From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of the 18th international conference on automated planning and scheduling (ICAPS). pp 28–35Brenner M, Nebel B (2009) Continual planning and acting in dynamic multiagent environments. J Auton Agents Multiag Syst 19(3):297–331Coles A, Coles A, Fox M, Long D (2010) Forward-chaining partial-order planning. In: Proceedings of the 20th international conference on automated planning and scheduling (ICAPS). pp 42–49Coles A, Fox M, Long D, Smith A (2008) Teaching forward-chaining planning with JavaFF. In: Colloquium on AI education, 23rd AAAI conference on artificial intelligenceCox J, Durfee E, Bartold T (2005) A distributed framework for solving the multiagent plan coordination problem. In: Proceedings of the 4th international joint conference on autonomous agents and multiagent systems (AAMAS). ACM, pp 821–827de Weerdt M, Clement B (2009) Introduction to planning in multiagent systems. Multiag Grid Syst 5(4):345–355Decker K, Lesser VR (1992) Generalizing the partial global planning algorithm. Int J Coop Inf Syst 2(2):319–346desJardins M, Durfee E, Ortiz C, Wolverton M (1999) A survey of research in distributed continual planning. AI Mag 20(4):13–22Doshi P (2007) On the role of interactive epistemology in multiagent planning. In: Artificial intelligence and, pattern recognition. pp 208–213Dréo J, Savéant P, Schoenauer M, Vidal V (2011) Divide-and-evolve: the marriage of descartes and darwin. In: Proceedings of the 7th international planning competition (IPC). Freiburg, GermanyDurfee EH (2001) Distributed problem solving and planning. In: Multi-agents systems and applications: selected tutorial papers from the 9th ECCAI advanced course (ACAI) and agentLink’s third European agent systems summer school (EASSS), vol LNAI 2086. Springer, pp 118–149Durfee EH, Lesser V (1991) Partial global planning: a coordination framework for distributed hypothesis formation. IEEE Trans Syst Man Cybern Special Issue Distrib Sens Netw 21(5):1167–1183Ephrati E, Rosenschein JS (1996) Deriving consensus in multiagent systems. Artif Intell 87(1–2):21–74Fikes R, Nilsson N (1971) STRIPS: a new approach to the application of theorem proving to problem solving. Artif Intell 2(3):189–208Fogués R, Alberola J, Such J, Espinosa A, Garcia-Fornes A (2010) Towards dynamic agent interaction support in open multiagent systems. In: Proceedings of the 2010 conference on artificial intelligence research and development: proceedings of the 13th international conference of the Catalan association for artificial intelligence’. IOS Press, pp 89–98Gerevini A, Long D (2006) Preferences and soft constraints in PDDL3. In: ICAPS workshop on planning with preferences and soft constraints, vol 6. Citeseer, pp 46–53Ghallab M, Howe A, Knoblock C, McDermott D, Ram A, Veloso M, Weld D, Wilkins D (1998) PDDL-the Planning Domain Definition Language. In: AIPS-98 planning committeeGmytrasiewicz P, Doshi P (2005) A framework for sequential planning in multi-agent settings. J Artif Intell Res 24:49–79Haslum P, Jonsson P (1999) Some results on the complexity of planning with incomplete information. In: Proceedings of the 5th European conference on, planning (ECP). pp 308–318Helmert M (2006) The fast downward planning system. J Artif Intell Res 26(1):191–246Hoffmann J, Nebel B (2001) The FF planning system: fast planning generation through heuristic search. J Artif Intell Res 14:253–302Jonsson A, Rovatsos M (2011) Scaling up multiagent planning: a best-response approach. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS). AAAI, pp 114–121Kambhampati S (1997) Refinement planning as a unifying framework for plan synthesis. AI Mag 18(2):67–97Kaminka GA, Pynadath DV, Tambe M (2002) Monitoring teams by overhearing: a multi-agent plan-recognition approach. J Artif Intell Res 17:83–135Kone M, Shimazu A, Nakajima T (2000) The state of the art in agent communication languages. Knowl Inf Syst 2(3):259–284Kovacs DL (2011) Complete BNF description of PDDL3.1. Technical reportKraus S (1997) Beliefs, time and incomplete information in multiple encounter negotiations among autonomous agents. Ann Math Artif Intell 20(1–4):111–159Kumar A, Zilberstein S, Toussaint M (2011) Scalable multiagent planning using probabilistic inference. In: Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI)’. Barcelona, Spain, pp 2140–2146Kvarnström J. (2011) Planning for loosely coupled agents using partial order forward-chaining. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS). AAAI, pp 138–145Lesser V, Decker K, Wagner T, Carver N, Garvey A, Horling B, Neiman D, Podorozhny R, Prasad M, Raja A et al (2004) Evolution of the GPGP/TAEMS domain-independent coordination framework. Auton Agents Multi Agent Syst 9(1):87–143Lipovetzky N, Geffner H (2011) Searching for plans with carefully designed probes. In: Proceedings of the 21th international conference on automated planning and scheduling (ICAPS)Micacchi C, Cohen R (2008) A framework for simulating real-time multi-agent systems. Knowl Inf Syst 17(2):135–166Nguyen N, Katarzyniak R (2009) Actions and social interactions in multi-agent systems. Knowl Inf Syst 18(2):133–136Nguyen X, Kambhampati S (2001) Reviving partial order planning. In: Proceedings of the 17th international joint conference on artificial intelligence (IJCAI). Morgan Kaufmann, pp 459–464Nissim R, Brafman R, Domshlak C (2010) A general, fully distributed multi-agent planning algorithm. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems (AAMAS). pp 1323–1330Pajares S, Onaindia E (2012) Defeasible argumentation for multi-agent planning in ambient intelligence applications. In: Proceedings of the 11th international conference on autonomous agents and multiagent systems (AAMAS) pp 509–516Paolucci M, Shehory O, Sycara K, Kalp D, Pannu A (2000) A planning component for RETSINA agents. Intelligent Agents VI. Agent Theories Architectures, and Languages pp 147–161Parsons S, Sierra C, Jennings N (1998) Agents that reason and negotiate by arguing. J Logic Comput 8(3):261Penberthy J, Weld D (1992) UCPOP: a sound, complete, partial order planner for ADL. In: Proceedings of the 3rd international conference on principles of knowledge representation and reasoning (KR). Morgan Kaufmann, pp 103–114Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39(1):127–177Sycara K, Pannu A (1998) The RETSINA multiagent system (video session): towards integrating planning, execution and information gathering. In: Proceedings of the 2nd international conference on autonomous agents (Agents). ACM, pp 350–351Tambe M (1997) Towards flexible teamwork. J Artif Intell Res 7:83–124Tang Y, Norman T, Parsons S (2010) A model for integrating dialogue and the execution of joint plans. Argumentation in multi-agent systems, pp 60–78Tonino H, Bos A, de Weerdt M, Witteveen C (2002) Plan coordination by revision in collective agent based systems. Artif Intell 142(2):121–145Van Der Krogt R, De Weerdt M (2005), Plan repair as an extension of planning. In: Proceedings of the 15th international conference on automated planning and scheduling (ICAPS). pp 161–170Weld D (1994) An introduction to least commitment planning. AI Mag 15(4):27Weld D (1999) Recent advances in AI planning. AI Mag 20(2):93–123Wilkins D, Myers K (1998) A multiagent planning architecture. In: Proceedings of the 4th international conference on artificial intelligence planning systems (AIPS), pp 154–162Wu F, Zilberstein S, Chen X (2011) Online planning for multi-agent systems with bounded communication. Artif Intell 175(2):487–511Younes H, Simmons R (2003) VHPOP: versatile heuristic partial order planner. J Artif Intell Res 20: 405–430Zhang J, Nguyen X, Kowalczyk R (2007) Graph-based multi-agent replanning algorithm. In: Proceedings of the 6th conference on autonomous agents and multiagent systems (AAMAS

Frequent expression of new cancer/testis gene D40/AF15q14 in lung cancers of smokers

We found a significant correlation between lung cancer in smokers and the expression of a human gene, D40, predominantly expressed in testis and cancers. In an attempt to clone a novel human gene, we screened a cDNA library derived from a human B cell line and obtained a cDNA clone that we refer to as D40. A search for public databases for sequence homologies showed that the D40 gene is identical to AF15q14. D40 mRNA is predominantly expressed in normal testis tissue. However, this gene is also expressed in various human tumour cell lines and primary tumours derived from various organs and tissues, such as lung cancer. We examined the relationship between D40 expression and clinico-pathological characteristics of tumours in primary lung cancer. D40 expression did not significantly correlate with either histological type or pathological tumour stage. However, D40 expression was observed more frequently in poorly differentiated tumours than in well or moderately differentiated ones. Furthermore, the incidence of D40 expression was significantly higher in tumours from patients who smoke than in those from non-smokers. D40/AF15q14 is the first gene in the cancer/testis family for which expression is related to the smoking habits of cancer patients