ppxscal/embedding_network huggingface dataset:
Evidence for the role of osteocytes in the initiation of targeted remodeling
Authors: Terhi J. Heino, Kosaku Kurata, Hidehiko Higaki, H. Kalervo Väänänen
Venue: Technology and Health Care (2009)

Microdamage in bone contributes to fractures and acts as a stimulus for bone remodeling. Osteocytes are the most abundant cells in bone, and their death by microdamage has been suggested to be the major event leading in the initiation of osteoclastic bone resorption. Even though there is increasing evidence that osteocyte density, microcracks and targeted remodeling are related, there still exist several questions. For example, how osteoclasts are targeted to the specific site of microdamage for repair. It has been proposed that apoptotic osteocytes could secrete a specific signal to target osteoclasts. The other question is the nature of this signal. To elucidate the role of microdamage-induced osteocyte cell death in the initiation of targeted remodelling, this paper discusses the potential use of an in vitro model, in which osteocytes can be three-dimensionally cultured and locally damaged. Furthermore, the method enables one to study the osteocyte-derived soluble interactions with bone marrow cells. It was demonstrated that damaged osteocytes locally affect osteoclast precursors by secreting osteoclastogenic factors, and thus can have a role in the initiation of resorption in bone remodelling. This strongly supports the idea that damage to osteocyte cellular network has the potential to stimulate osteoclastic proliferation and therefore the activation of Basic Multicellular Units (BMUs).
Analysis and finite element approximations for distributed optimal control problems for implicit parabolic equations
Authors: Konstantinos Chrysafinos
Venue: Journal of Computational and Applied Mathematics (2009)

This work concerns analysis and error estimates for optimal control problems related to implicit parabolic equations. The minimization of the tracking functional subject to implicit parabolic equations is examined. Existence of an optimal solution is proved and an optimality system of equations is derived. Semi-discrete (in space) error estimates for the finite element approximations of the optimality system are presented. These estimates are symmetric and applicable for higher-order discretizations. Finally, fully-discrete error estimates of arbitrarily high-order are presented based on a discontinuous Galerkin (in time) and conforming (in space) scheme. Two examples related to the Lagrangian moving mesh Galerkin formulation for the convection-diffusion equation are described.
Front Matter and Contents
Venue: Proceeding of the 2007 conference on Algorithms and Architectures of Artificial Intelligence (2007)

This book gives an overview of methods developed in artificial intelligence for search, learning, problem solving and decision-making. It gives an overview of algorithms and architectures of artificial intelligence that have reached the degree of maturity when a method can be presented as an algorithm, or when a well-defined architecture is known, e.g. in neural nets and intelligent agents. It can be used as a handbook for a wide audience of application developers who are interested in using artificial intelligence methods in their software products. Parts of the text are rather independent, so that one can look into index and go directly to a description of a method presented in the form of an abstract algorithm or an architectural solution. The book can be used also as a textbook for a course in applied artificial intelligence. It has been used as a course material for this kind of courses on undergraduate and graduate levels at Tallinn University of Technology and Royal Institute of Technology in Stockholm. Exercises on the subject are added at the end of each chapter. Neither programming skills nor specific knowledge in computer science are expected from the reader. However, some parts of the text will be fully understood by those who know the terminology of computing well. The algorithms developed in the field of artificial intelligence are often directly applicable in solving various difficult problems and, therefore, they constitute a valuable part of the artificial intelligence that can be used independently of the philosophical and deep theoretical considerations related to the research in this area. Most of the algorithms are presented in this book in a simple algorithmic language. Sometimes, e.g. when describing neurons in artificial neural nets, it has been more expressive to use common mathematical notations for presenting the functionality of entities. Taxonomy of algorithms and methods concerned is discussed at the end of each chapter, summarizing the material presented in it. This taxonomy can be a valuable aid in developing new algorithms by elaborating the presented ones. 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
Microsoft Windows Desktop Deployment Resource Kit
Authors: Jerry Honeycutt
Venue:  (2004)

Get in-depth technical information and tools to deploy and manage Microsoft Windows XP and Microsoft Office 2003straight from the source. This official RESOURCE KIT provides Microsofts most-requested set-up and support information in one comprehensive and authoritative volume. With it, you get prescriptive guidance to help choose the best deployment method and tools for common scenarios; perform attended and unattended installations; automate the deployment process, control policy and profile settings for desktop operating systems and applications; automate deployments for Office and other programs; and more. The information, tools, templates, and scripts come straight from the source, for the expertise you need to maximize the productivity of your desktop environment and reduce support costs.
A generalization of an integral equation from physics
Authors: Maria Dobritoiu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

Using the Contraction Principle and the General data dependence theorem, several results of existence and uniqueness and of data dependence of the solution of the integral equation with modified argument x(t) = ∫Ω K(t,s,x(s),x(g(s)),x|∂Ω)ds + f(t), t ∈ Ω, where Ω ⊂ Rm is a bounded domain, K : Ω × Ω × Rm × Rm × C(∂Ω,Rm) → Rm, f : Ω → Rm and g : Ω → Ω, are given.
The learnability of voting rules
Authors: Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffrey S. Rosenschein
Venue: Artificial Intelligence (2009)

Scoring rules and voting trees are two broad and concisely-representable classes of voting rules; scoring rules award points to alternatives according to their position in the preferences of the voters, while voting trees are iterative procedures that select an alternative based on pairwise comparisons. In this paper, we investigate the PAC-learnability of these classes of rules. We demonstrate that the class of scoring rules, as functions from preferences into alternatives, is efficiently learnable in the PAC model. With respect to voting trees, while in general a learning algorithm would require an exponential number of samples, we show that if the number of leaves is polynomial in the size of the set of alternatives, then a polynomial training set suffices. We apply these results in an emerging theory: automated design of voting rules by learning.
Supporting architecture- and policy-based self-adaptive software systems
Authors: Richard N. Taylor
Venue:  (2008)

The continued deployment of systems in settings that are unpredictable, rapidly changing, and increasingly removed from human access drives the development of self-adaptive software: these are software systems that are capable of changing the way they behave in response to changes in their environment. The development of this class of software, however, is made challenging by difficulties in designing self-adaptive behavior coherently and consistently, accounting for adaptive needs, and perceiving adaptations as they take place. Our approach to addressing these challenges is architecture-based: the adaptation process is rooted in explicit architectural models and adaptation policies that model and implement changes through architectural means. This approach to policy-based architectural adaptation management (PBAAM) addresses the challenges of developing self-adaptive systems and improves on other architecture-based approaches. The key features of the approach are: using architectural models to provide a consistent foundation, adopting adaptation policies that can be modified at runtime, and providing explicit support for the recording and visualization of adaptations. Evaluation of the approach and our claims is conducted through case studies focused on the robotics domain. In both simulated as well as physical robotic platforms, we show how our approach is feasible and beneficial to component reuse and expressiveness while not imposing a prohibitive computational overhead. The contributions of this research include: an organizational framework useful in analyzing the current state of the art in architecture-based self-adaptive software, an architectural style for robotic systems that fosters adaptability, a specific approach to building architecture-based self-adaptive systems supported by extensible notations and tools, and a demonstration of novel self-adaptive capabilities in our case study domains.
Adaptation of spine theory to hexahedral meshing
Authors: Olga Egorova, Maria Savchenko, Vladimi Savchenko, Ichiro Hagiwara
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

In this paper we suggest a new concept for hexahedral meshing, based on the developed mathematical model HMGM - Hexahedral Mesh Growth Model. Our approach is based on spine (subpolyhedron) encoding of a 3-manifold of the inner part of the model, instead of usual graph representation of hexahedral mesh. The idea of this proposal is to combine geometry and topology in one step of mesh generation. It provides geometrically qualitative and topologically optimal hexahedral mesh for a given quadrilateral mesh, which enclose an arbitrary volume to be meshed. It is known from a spine theory that each 3-manifold can be encoded with a spine, which describes main properties of this manifold. Moves on spine are considered as an essential part of the problem. These moves can change spine components or their number, but they still keep the spine as an encoding spine for the same manifold. At present stage of HMGM development we do some mesh collapses for a given hexahedral mesh to receive spines experimentally. Thereby we describe inner membranes construction. Complexity of a spine must correspond to complexity of constructed molecule for a given surface. Then connection of the outer part with inner will be appropriate.
Complexity of Reasoning With Expressive Ontology Mappings
Authors: Chiara Ghidini, Luciano Serafini, Sergio Tessaris
Venue: Proceeding of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) (2008)

State of the art formalisms for distributed ontology integration provide ways to express semantic relations between homogeneous components of different ontologies; namely, they allow to map concepts into concepts, individuals into individuals, and properties into properties. However, the extensive usage of multiple distributed ontologies requires the capability for expressing different forms of mappings, which extend the semantic relations among homogeneous components studied so far. In recent papers extensions of the Distributed Description Logic (DDL) have been proposed to represent mappings between heterogeneous elements; i.e. mappings connecting concepts and relations. In this paper we investigate the computational properties of reasoning with mappings between homogeneous as well as heterogeneous elements in distributed ontologies, and an effective decision procedure for reasoning with multiple ontologies bridged with both forms of mappings.
Nonlinear Optics in Signal Processing, 1st edition
Authors: R. W. Eason, A. Miller
Venue: Engineering Aspects Of Lasers (2007)

Covers the applications of nonlinear optics to optical processing in a range of areas including switching, computing and telecommunications. DLC: Signal processing.
The Design of Tris(o-phenylenedioxy)cyclo-trisphosphazene (TPP) Derivatives and Analogs toward Multifunctional Zeolite Use
Authors: Godefroid Gahungu, Wenliang Li, Jingping Zhang
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Taking tris(o-phenylenedioxy)cyclotrisphosphazene (TPP) as template, series of derivatives and analogs were designed with the aim to investigate the structural features of organic zeolite (OZ) and their potential applications. On the basis of DFT-PBE0/6-31G** quantum calculation, the results show a tight dependence of the electron donor (E-D) of the entire molecule on that of the side group and bridge. It was found that extending the side fragment with a phenyl ring and substituting CH/N, or tetrathiafulvalene (TTF)-like group, or the side phenyl fragments substitution by TTF and its derivatives, preserve the "paddle wheel" molecular shape, a key factor in the tunnel formation on which is based the organic OZ use of TPP. In comparison with the commonly used organic superconductors, most of the designed molecules with TTF fragments were predicted to show comparable or better E-D strength.
Associativity of Infinite Synchronized Shuffles and Team Automata
Authors: Maurice H. ter Beek, Jetty Kleijn
Venue: Fundamenta Informaticae (2009)

Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrenceswhich preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a different word, may be identified as a single occurrence. In case at least one of the words involved is infinite, a (synchronized) shuffle can also be unfair in the sense that an infinite word may prevail fromsome point onwards even when the other word still has occurrences to contribute to the shuffle. We prove that for the synchronized shuffle operations under consideration, every (fair or unfair) synchronized shuffle can be obtained as a limit of synchronized shuffles of the finite prefixes of the words involved. In addition, it is shown that with the exception of one, all synchronized shuffle operations that we consider satisfy a natural notion of associativity, also in case of unfairness. Finally, using these results, some compositionality results for team automata are established.
Emergence of roles in english canonical transitive construction
Authors: Mike Gasser, Lisa Gershkoff-Stowe
Venue:  (2008)

The process of verb learning in children involves learning the verb's syntactic structure and also learning how to relate this structure to corresponding semantic knowledge. For example for the English transitive frame describing an action involving two participants, the child has to learn how the two participants are distinctively referred to by the subject and the object of the transitive verb. This knowledge of the mapping between syntactic and semantic roles is a critical part of any theory of language acquisition; yet little is known about its nature and its origin. The traditional view is that children possess a built-in abstract notion of the semantic roles as a prerequisite to language. This thesis argues for an alternative view, one in which knowledge of roles emerges hand-in-hand with knowledge of verbs on a case-by-case basis. The emergence of the semantic roles known as Agent and Patient was studied in a series of experiments. Experiment 1 used novel objects and actions to examine the generalizations made by 3-to-5-year-old children between Agents and Patients, with and without the benefit of language. The findings revealed that linguistic cues are important for directing children's attention to the properties shared by Agent-Patient roles for both age groups, but particularly among younger children. Experiment 2 explored two key components used to identify Agent-Patient roles: change-of-state and contact. The results showed differential effects of the absence of each component on children's ability to identify Agent-Patient roles in novel action scenes. Together, the findings are consistent with the hypothesis that children do not start with abstract knowledge of Agent/Patient roles. A computational model was constructed to simulate children's behavior in the experiments. Utilizing a case-based approach, the model starts with no hard-wired knowledge of roles and learns how to find the Agents and the Patients of the novel actions through exposure to many cases of similar actions sharing the same verb argument structure and relational semantic features. The model provides converging evidence that children's knowledge of roles develops as a result of exposure to language and prior experience with the world, and sheds new light on the mechanisms by which children acquire the syntactic knowledge of verb argument structure.
WiPam --Wireless Patient Management, a Novel Telemedicine Solution
Authors: Freddy Reyskens
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Telemedicine is a promising field in medicine and many studies show the importance on patient's health and cost saving. The company RDSM has found a cheap, wireless and completely automated solution for following up patients in the comfort of their homes.
Computational Steering Strategy to Calibrate Input Variables in a Dynamic Data Driven Genetic Algorithm for Forest Fire Spread Prediction
Authors: Mónica Denham, Ana Cortés, Tomás Margalef
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

This work describes a Dynamic Data Driven Genetic Algorithm (DDDGA) for improving wildfires evolution prediction. We propose an universal computational steering strategy to automatically adjust certain input data values of forest fire simulators, which works independently on the underlying propagation model. This method has been implemented in a parallel fashion and the experiments performed demonstrated its ability to overcome the input data uncertainty and to reduce the execution time of the whole prediction process.
How to construct efficient on-line-off-line threshold signature schemes through the simulation approach
Authors: Chong-zhi Gao, Baodian Wei, Dongqing Xie, Chunming Tang
Venue: Concurrency and Computation: Practice Experience (2009)

An on-line-off-line threshold signature (&Oscr;&Tscr;&Sscr;) scheme is a distributed cryptosystem in which a group of players jointly generate a signature for a message and use the on-line-off-line technique to improve the efficiency of signing. An &Oscr;&Tscr;&Sscr; scheme can be applied to large-scaled distributed data storage systems and can highly improve the efficiency of writing files. There are two approaches to construct an ordinary threshold signature scheme: the direct approach and the simulation approach. Owing to its simplicity, people tend to use the simulation approach, in which the security of a threshold signature scheme is reduced to the security of its underlying (and simpler) signature scheme. The security proof in this approach is based on a theorem that guarantees the validity of the security reduction&mdash;we call this theorem the simulation theorem. However, the simulation theorem (and thus the simulation approach) for an ordinary threshold signature scheme cannot be applied to the on-line-off-line cases, because partial signature exposure problems might occur in these cases. This paper presents a simulation theorem for the on-line-off-line cases, where the security of an &Oscr;&Tscr;&Sscr; scheme is reduced to the security of a so-called divisible on-line-off-line signature scheme. This provides a theoretical basis for constructing an &Oscr;&Tscr;&Sscr; scheme through the simulation approach. Furthermore, through this approach, we present a concrete &Oscr;&Tscr;&Sscr; scheme, which is efficient and its security proof is simple. Copyright &copy; 2009 John Wiley & Sons, Ltd.
A Further Improved Online/Offline Signature Scheme
Authors: Chong-zhi Gao, Zheng-an Yao
Venue: Fundamenta Informaticae (2009)

Online/offline signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. In this paper, we present a general method to efficiently convert a trapdoor hash family into an online/offline signature scheme without resorting to any additional signature scheme. We prove that the new scheme is secure in the randomoraclemodel if the underlying trapdoor hash family is collision resistant. Compared to Shamir and Tauman's paradigm, there is an almost 50% reduction in overall computational cost by using the new scheme.
Stabile algorithms switching for multiple models control systems
Authors: Lupu Ciprian, Udrea Andreea, Popescu Dumitru, Flutur Cristian
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

Multiple models structure represents one of the successful solutions for the real-time control of the nonlinear or multi-regime processes. Best algorithm/model selection, switching between control algorithms etc. are the main problems of these structures. The switching issue is a theoretical and practical study subject for a lot of recently researches. The paper proposes some supplementary conditions that assure a correct real-time functioning in terms of stability for multiple models structures. The applicability of the method is proved using an RST control algorithm. In the end, its software implementation is also shown.
Designing Programmes, 3rd edition
Authors: Karl Gerstner, Harald Geisler, Jonas Pabst
Venue:  (2007)

Karl Gerstners work is a milestone in the history of design. One of his most important works is Designing Programmes, which is presented here in a new edition of the original 1964 publication. In four essays, the author provides a basic introduction to his design methodology. Instead of set recipes, the method suggests a model for design in the early days of the computer era. The intellectual models it proposes, however, continue to be useful today. What it does not purvey is cut-and-dried, true-or-false solutions or absolutes of any kind - instead, it develops fundamental principles in an innovative and future-oriented way. The book is especially topical and exciting in the context of current developments in computational design, which seem to hold out the possibility of programmed design. With many examples from the worlds of graphic and product design, music, architecture, and art, it inspires the reader to seize on the material, develop it further, and integrate it into his or her own work.