ppxscal/embedding_network huggingface dataset:
Home Care Individual Intervention Plans in the K4Care Platform
Authors: David Isern, Miquel Millan, Antonio Moreno, Gianfranco Pedone, Laszlo Z. Varga
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Constructing computerised medical systems that can deal with the complexity of Home Care units is a very challenging task. On the one hand, many kinds of actors intervene in the care processes, making it necessary to adopt a distributed approach. On the other hand, although there are some available geriatric guidelines, the usual Home Care patients suffer from a set of co-morbid conditions and diseases, and that hampers the direct application of standard protocols. This paper describes the design of a Web accessible multi-agent platform that provides the services needed in a Home Care unit, including the definition and execution of fully personalised Individual Intervention Plans.
Flows of Incompressible Fluids subject to Navier's slip on the boundary
Authors: J. Hron, C. Le Roux, J. Málek, K. R. Rajagopal
Venue: Computers Mathematics with Applications (2008)

We establish closed form analytical solutions for the flows of a generalized fluid of complexity two, which includes the Navier-Stokes fluid, power-law fluid and the second-grade fluid as special subclasses, in special geometries under the assumption that the flows meet Navier slip conditions at the boundary. The boundary conditions allow the extremes of no-slipping and no-sticking. We also allow for different boundary conditions at different parts of the boundary, which leads to interesting consequences with regard to the solutions. The dependence of the form of the solutions on the boundary conditions is discussed in some detail.
Computational complexity of determining which statements about causality hold in different space–time models
Authors: Vladik Kreinovich, Olga Kosheleva
Venue: Theoretical Computer Science (2008)

Causality is one of the most fundamental notions of physics. It is therefore important to be able to decide which statements about causality are correct in different models of space-time. In this paper, we analyze the computational complexity of the corresponding decision problems. In particular, we show that: *for Minkowski space-time, the decision problem is as difficult as Tarski's decision problem for elementary geometry, while *for a natural model of primordial space-time, the corresponding decision problem is of the lowest possible complexity among all possible space-time models.
Large-Scale Agent-Based Pedestrian Simulation
Authors: Franziska Klügl, Guido Rindsfüser
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

Pedestrian simulation is a challenging and fruitful application area for agent-based modeling and simulation in the traffic and transportation domain. In this paper we will present the concepts and results of a particular project study: an agent-based simulation of pedestrian traffic of the complete railway station of Bern during the most busy morning hours. Overall more than 40 000 agents are passing through during 1,5 virtual hours. Going beyond traditional approaches for microscopic pedestrian simulation, our simulated pedestrians are not only capable of moving without collisions between two pre-defined locations, but are able to flexibly plan and re-plan their way through the railway station. A short glance and some discussion about the potential of agent-based pedestrian simulation closes this contribution.
Super-connected and super-arc-connected Cartesian product of digraphs
Authors: Juan Liu, Jixiang Meng
Venue: Information Processing Letters (2008)

We study the super-connected, hyper-connected and super-arc-connected Cartesian product of digraphs. The following two main results will be obtained:(i)If @d^+(D"i)=@d^-(D"i)=@d(D"i)=@k(D"i) for i=1,2, then D"1xD"2 is super-@k if and only if D"1xD"2@?DxK"n->(DxK"n->@?K"2->xK"2->,K"2->xK"3->), (ii)If @d^+(D"i)=@d^-(D"i)=@d(D"i)=@l(D"i) for i=1,2, then D"1xD"2 is super-@l if and only if D"1xD"2@?DxK"n->, where @l(D)=@d(D)=1, K"n-> denotes the complete digraph of order n and n>=2.
Web Applications Supporting the Development of Models of Chagas' Disease for Left Ventricular Myocytes of Adult Rats
Authors: Caroline Mendonça Costa, Ricardo Silva Campos, Fernando Otaviano Campos, Rodrigo Weber Dos Santos
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Chagas' Disease is an endemic infection in many areas of South and Central America that may cause a fatal type of myocarditis. In the acute phase of the disease, ventricular extrasystoles and tachycardia have been reported. Experiments with cardiac myocytes in the acute stage of Chagas' Disease have suggested a depression of I to , the Ca2 + -independent K + Transient Outward current. In this work we use computational models of left ventricular myocytes of adult rats to qualify the effects of I to reduction that appear during the acute phase of Chagas' Disease. The simulations are carried out by Web applications based on the CellML language, a recently emerged international standard for the description of biological models. The computational framework supports the development of mathematical models, simulations and visualization of the results. Our preliminary simulation results suggest that the reduction of I to density elicits modifications of electrophysiological mechanisms that are strongly related to the phenomena of arrhythmia.
Knowledge Technologies-Based Multi-Agent System for Semantic Web Services Environments
Authors: Francisco García-Sánchez, Rodrigo Martínez-Béjar, Rafael Valencia-García, Jesualdo T. Fernández-Breis
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Intelligent Agents and Semantic Web Services are two technologies with great potential in the future. Striking new applications can be developed by using them. However, in order for these technologies to be fully applicable to real settings, several problems remain unsolved. In particular, Semantic Web Services need for an upper software entity able to deal with them, while Intelligent Agents have historically suffered from a number of drawbacks not yet resolved. In this paper, we claim that integrating these technologies into a joint environment can overcome part of their respective problems while strengthening their advantages. The necessity for integrating these technologies and its benefits are analyzed in this work. Based on this study, we present SEMMAS, a framework for seamlessly integrating Intelligent Agents and Semantic Web Services. The fundamentals of the framework and its architecture are explained and a proof-of-concept implementation is described.
Mitigating Reply Implosions in Query-Based Service Discovery Protocols for Mobile Wireless Ad Hoc Networks
Authors: Antônio Tadeu Gomes, Artur Ziviani, Luciana S. Lima, Markus Endler, Guillaume Chelius
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

Providing service discovery in an efficient and scalable way in ad hoc networks is a challenging problem, in particular for multihop scenarios, due to the large number of potential participant nodes and the scarce resources in these networks. In this paper, we propose and evaluate an approach to mitigate the reply implosion problem in query-based service discovery protocols for multihop mobile ad hoc networks. Our simulation results show the scalability and efficiency of the proposed solution. We demonstrate that the proposed scheme considerably reduces the number of transmissions without compromising the efficiency of the service discovery in scenarios of pedestrian mobility.
Simulating Weed Propagation Via Hierarchical, Patch-Based Cellular Automata
Authors: Adam G. Dunn, Jonathan D. Majer
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Ecological systems are complex systems that feature heterogeneity at a number of spatial scales. Modelling weed propagation is difficult because local interactions are unpredictable, yet responsible for global patterns. A patch-based and hierarchical cellular automaton using probabilistic connections suits the nature of environmental weed dispersal mechanisms. In the presented model, weed dispersal mechanisms, including human disturbance and dispersal by fauna, are approximated by pathways through a network of cells. The results of simulations provide evidence that the method is suitable for modelling weed dispersal mechanisms using multiple scales of observation.
Sampling Precision to Depth 10000 at CLEF 2007
Authors: Stephen Tomlinson
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

We conducted an experiment to test the completeness of the relevance judgments for the monolingual Bulgarian, Czech and Hungarian information retrieval tasks of the Ad-Hoc Track of the Cross-Language Evaluation Forum (CLEF) 2007. In the ad hoc retrieval tasks, the system was given 50 natural language queries, and the goal was to find all of the relevant documents (with high precision) in a particular document set. For each language, we submitted a sample of the first 10000 retrieved items to investigate the frequency of relevant items at deeper ranks than the official judging depth (of 60 for Czech and 80 for Bulgarian and Hungarian). The results suggest that, on average, the percentage of relevant items assessed was less than 60% for Czech, 70% for Bulgarian and 85% for Hungarian. These levels of completeness are in line with the estimates that have been made for some past test collections which are still considered useful and fair for comparing retrieval methods. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Utility of Knowledge Extracted from Unsanitized Data when Applied to Sanitized Data
Authors: Michal Sramka, Reihaneh Safavi-Naini, Jörg Denzinger, Mina Askari, Jie Gao
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

Knowledge discovery systems extract knowledge from data that can be used for making prediction about incomplete data items. Utility is a measure of the usefulness of the discovered knowledge and satisfaction of the user with that knowledge. We motivate and address the question of usefulness of sanitized data using the notion of utility in data mining systems. For this we measure the success of patterns and rules discovered from the original data to make predictions about the sanitized data using a previously developed framework. Using experimental results on a set of medical data we demonstrate that it is possible to make useful predictions about the sanitized medical data when rules discovered from the original unsanitized medical data are used. We explain our results and compare it with the case where no sanitization is involved.
Chaotic Quantum Cryptography
Authors: Stamatios V. Kartalopoulos
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Quantum cryptographic systems use quantum mechanical concepts that are based on qubit superposition of states, and on the no cloning or no copying theorem to establish unbreakable cipher keys. Using optical communications the most commonly quantum mechanical property used is the polarization state of photon. However, in most quantum cryptographic algorithms a random polarization state is required. In this case, the random number generator should not be publically known, and it should be preferably reproducible. A naturally reproducible RNG can be produced using chaos functions. In this paper we review a quantum key distribution algorithm and chaos functions as RNGs. We then describe how chaos functions can be used in quantum key establishment and also a method that requires substantially fewer bits in the stream to establish the key and also a faster method.
Hadwiger Number and the Cartesian Product of Graphs
Authors: L. Sunil Chandran, Alexandr Kostochka_aff2n3, J. Krishnam Raju
Venue: Graphs and Combinatorics (2008)

The Hadwiger number &#x03b7;(G) of a graph G is the largest integer n for which the complete graph K n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, &#x03b7;(G) &#x2265; &#x03c7;(G), where &#x03c7;(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product $$G \square H$$of graphs. As the main result of this paper, we prove that $$\eta (G_1 \square G_2) \ge h\sqrt{l}\left (1 - o(1) \right )$$for any two graphs G 1 and G 2 with &#x03b7;(G 1) =&#x00a0;h and &#x03b7;(G 2) = l. We show that the above lower bound is asymptotically best possible when h&#x00a0;&#x2265; l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following: Let G be a connected graph. Let $$G = G_1 \square G_2 \square ... \square G_k$$be the (unique) prime factorization of G. Then G satisfies Hadwiger&#x2019;s conjecture if k &#x2265; 2 log log &#x03c7;(G) +&#x00a0;c&#x2032;, where c&#x2032; is a constant. This improves the 2 log &#x03c7;(G)&#x00a0;+&#x00a0;3 bound in [2]. Let G 1 and G 2 be two graphs such that &#x03c7;(G 1) &#x2265; &#x03c7;(G 2) &#x2265; c&#x00a0;log1.5(&#x03c7;(G 1)), where c is a constant. Then $$G_1 \square G_2$$satisfies Hadwiger&#x2019;s conjecture. Hadwiger&#x2019;s conjecture is true for G d (Cartesian product of G taken d times) for every graph G and every d &#x2265; 2. This settles a question by Chandran and Sivadasan [2]. (They had shown that the Hadiwger&#x2019;s conjecture is true for G d if d &#x2265; 3).
Specification for NLSv2
Authors: Philip Hawkes, Cameron Mcdonald, Michael Paddon, Gregory G. Rose, Miriam Wiggers Vries
Venue: New Stream Cipher Designs: The eSTREAM Finalists (2008)

NLSv2 is a synchronous stream cipher with message authentication functionality, submitted to the ECrypt Network of Excellence call for stream cipher primitives, profile 1A. NLSv2 is an updated version of NLS [19]. The minor change between NLS and NLSv2 increases resistance to attacks utilizing large amounts of keystream. NLS stands for Non-Linear SOBER, and the NLS ciphers are members of the SOBER family of stream ciphers [12],[16],[23] and [24].
Development of Robot Simulation Software for Five Joints Mitsubishi RV-2AJ Robot Using MATLAB/Simulink and V-Realm Builder
Authors: Muhammad Ikhwan Jambak, Habibollah Haron, Dewi Nasien
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

The Robot Simulation Software (RSS) nowadays is paramount important to increase the accuracy and efficiency of industrial robot. This paper reports the development of the RSS where a Mitsubishi RV-2AJ robot has been taken as a case study. The project adopts the virtual reality interface design methodology andutilizes MATLAB/Simulink and V-Realm Builder as the tools. A robot model has been developed and a RSS software life cycle has been implemented.
Collaborative Recommendations Using Bayesian Networks and Linguistic Modelling
Authors: Luis M. Campos, Juan M. Fernández-Luna, Juan F. Huete
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper presents a model designed under the formalism of Bayesian Networks to deal with the problem of collaborative recommendation. It has been designed to perform efficient and effective recommendations. We also consider the fact that the user can usually use vague ratings for the products, which might be represented as fuzzy labels. The complete proposal is evaluated with MovieLens.
The next step in social networking software: the global coffee machine
Authors: Maria Sunnerstam, Thommy Eriksson
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

With all the hundreds of digital connections professionals manage online, and with all million potential acquaintances available online, a cross-breeding between the coffee machine and a tool similar to MSN Messenger could be -- metaphorically -- like having the coffee machine in a stadium filled with thousands of people. In this workshop we would like to explore the concept of a digital tool for a new shared virtual space where online social interactions would become even more fluent, dynamic and fruitful.
Quantification of stochastic behavior in cardiac electrophysiological models
Authors: Sarah Elizabeth Geneser
Venue:  (2008)

Stochastic modeling has proven effective for accomplishing a number of goals. Firstly, mathematical models of intrinsically stochastic systems are typically reduced to deterministic forms to avoid the computational expense and cumbersome implementation commonly associated with solutions to stochastic systems. By focusing solely on mean behaviors, relevant aspects of a system's behavior may go unnoticed. Secondly, rigorous analytical uncertainty quantification and sensitivity analysis of models with complex governing equations are often intractable. These techniques are important to quantitatively determine the impact model inputs and parameters have on solutions of computational simulations. Thirdly, in systems where the model parameters cannot be measured directly, parameter values must instead be indirectly inferred, i.e., fit to experimental response data. Typically, modelers include response statistics in the fitting process and yet are seeking to obtain only mean parameter values. In an attempt to better quantify the randomness or uncertainty inherent in such parameters, it can be extremely beneficial to fit higher stochastic moments, e.g., variance and kurtosis, in addition to the mean values. The generalized polynomial chaos (gPC) theory provides an efficient means of representing stochastic processes within random systems. This representation alone is not sufficient to solve stochastic governing equations, and one must employ numerical techniques to obtain the weights of the gPC representation. The stochastic Galerkin and stochastic collocation numerical methods are accurate and efficient means of accomplishing this task. The resulting generalized polynomial chaos-stochastic Galerkin (gPC-SG) and polynomial chaos-stochastic collocation (gPC-SC) methods are powerful tools for accomplishing the three goals described above. In this thesis, we apply the gPC-SG and gPC-SC techniques to cardiac electrophysiological models for: (1) characterization of simulated behavior response, (2) uncertainty quantification and sensitivity analysis, and (3) determination of higher stochastic moments in fitted model parameters for cardiac electrophysiological systems of interest within the bioengineering community. We explore the consequences and impacts of these three analyses in both the low level Markovian ion channel model and a high level physiological system&ndash;that of the forward problem of electrocardiography. During the process, we explore and expand the mathematical and computational aspects of the stochastic Galerkin and collocation methods.
Advancing Spatio-temporal Analysis of Ecological Data: Examples in R
Authors: Tomislav Hengl, Emiel Loon, Henk Sierdsema, Willem Bouten
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The article reviews main principles of running geo-computations in ecology, as illustrated with case studies from the EcoGRID and FlySafe projects, and emphasizes the advantages of using R computing environment as the most attractive programming/scripting environment. Three case studies (including R code) of interest to ecological applications are described: (a) analysis of GPS trajectory data for two gull-birds species; (b) species distribution mapping in space and time for a bird species (sedge warbler; EcoGRID project); and (c) change detection using time-series of maps. The case studies demonstrate that R, together with its numerous packages for spatial and geostatistical analysis, is a well-suited tool to produce quality outputs (maps, statistical models) of interest in Geo-Ecology. Moreover, due to the recent implementation of the maptools and sp packages, such outputs can be easily exported to popular geographical browsers such as Google Earth and similar. The key computational challenges for Computational Geo-Ecology recognized were: (1) solving the problem of input data quality (filtering techniques), (2) solving the problem of computing with large data sets, (3) improving the over-simplistic statistical models, and (4) producing outputs of increasingly higher level of detail.
Effect Analysis in Implementing IRM (Information Resources Management) to Enterprise
Authors: Kazuya Matsudaira, Teruhisa Ichikawa, Tadanori Mizuno
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

In global circumstances, speedy and high quality of information required by CEO of Enterprise for quicker and better decision-making. IRM is the new concept and methods for improving the quality of CEO's decision. However, IRM is still understood by CEO as a bit/byte tool. These phenomena is caused by CEO's ignorance of importance of Information Resource. CEO must understand IRM as new role for enterprise. This paper reports variety of tangible analysis views of IRM merits and demerits. CEO may have a vision of IRM as a powerful management approach. This analysis is based on about 100 enterprises' experiences and one third of those were successful examples of IRM implementations in Japan. KSF is CEO's endeavor who deeply knew of tangible merits. Any of them requested the quantified data of direct and measurable savings and investments. They could understand how investments into IRM is justified by savings through actual figures shown by analysis. By this analysis, CEO could imagine both the best-case scenario and worst-case scenario. Once CEO decided to move into IRM implementation after he had gotten belief of medium-case scenario that the enterprise is keeping smoothly-up annual sales volume and continues to improve revenues in step by step. Information enabled enterprise will suffer from rapid cost-up of information related expenses. Vincent [1] proposed "Information-Investment Accounting" and "Reporting in Financial Statements". Japanese Enterprises are to succeed in controlling Information related costs, after grasping those costs, then in the next step, the Accountant should restate current PL statement. Vincent's idea is that instead of not replacing the regular P L, but providing further information with CEO. If one column is added, the figures of Information expenses and investments become very apparent. Vincent moreover, requested Restating the Balance Sheet.