XML Specification Research Articles

Matcha

Apple and Google introduced their versions of privacy nutrition labels to the mobile app stores to better inform users of the apps' data practices. However, these labels are self-reported by developers and have been found to contain many inaccuracies due to misunderstandings of the label taxonomy. In this work, we present Matcha, an IDE plugin that uses automated code analysis to help developers create accurate Google Play data safety labels. Developers can benefit from Matcha's ability to detect user data accesses and transmissions while staying in control of the generated label by adding custom Java annotations and modifying an auto-generated XML specification. Our evaluation with 12 developers showed that Matcha helped our participants improved the accuracy of a label they created with Google's official tool for a real-world app they developed. We found that participants preferred Matcha for its accuracy benefits. Drawing on Matcha, we discuss general design recommendations for developer tools used to create accurate standardized privacy notices.

Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying

Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. Yet, few of the existing approaches consider XML semantics, and the methods that process semantics generally rely on computationally expensive word sense disambiguation (WSD) techniques, or apply semantic analysis in one stage only: performing query relaxation/refinement over the bag of words retrieval model, to reduce processing time. In this paper, we describe a new approach for XML keyword search aiming to solve the limitations mentioned above. Our solution first transforms the XML document collection (offline) and the keyword query (on-the-fly) into meaningful semantic representations using context-based and global disambiguation methods, specially designed to allow almost linear computation efficiency. We use a semantic-aware inverted index to allow semantic-aware search, result selection, and result ranking functionality. The semantically augmented XML data tree is processed for structural node clustering, based on semantic query concepts (i.e., key-concepts), in order to identify and rank candidate answer sub-trees containing related occurrences of query key-concepts. Dedicated weighting functions and various search algorithms have been developed for that purpose and will be presented here. Experimental results highlight the quality and potential of our approach.

Markov-Modulated Continuous-Time Markov Chains to Identify Site- and Branch-Specific Evolutionary Variation in BEAST

Markov models of character substitution on phylogenies form the foundation of phylogenetic inference frameworks. Early models made the simplifying assumption that the substitution process is homogeneous over time and across sites in the molecular sequence alignment. While standard practice adopts extensions that accommodate heterogeneity of substitution rates across sites, heterogeneity in the process over time in a site-specific manner remains frequently overlooked. This is problematic, as evolutionary processes that act at the molecular level are highly variable, subjecting different sites to different selective constraints over time, impacting their substitution behavior. We propose incorporating time variability through Markov-modulated models (MMMs), which extend covarion-like models and allow the substitution process (including relative character exchange rates as well as the overall substitution rate) at individual sites to vary across lineages. We implement a general MMM framework in BEAST, a popular Bayesian phylogenetic inference software package, allowing researchers to compose a wide range of MMMs through flexible XML specification. Using examples from bacterial, viral, and plastid genome evolution, we show that MMMs impact phylogenetic tree estimation and can substantially improve model fit compared to standard substitution models. Through simulations, we show that marginal likelihood estimation accurately identifies the generative model and does not systematically prefer the more parameter-rich MMMs. To mitigate the increased computational demands associated with MMMs, our implementation exploits recent developments in BEAGLE, a high-performance computational library for phylogenetic inference. [Bayesian inference; BEAGLE; BEAST; covarion, heterotachy; Markov-modulated models; phylogenetics.]

Mapping the Entire Record-An Alternative Approach to Data Access from Medical Logic Modules.

This study aimed to describe an alternative approach for accessing electronic medical records (EMRs) from clinical decision support (CDS) functions based on Arden Syntax Medical Logic Modules, which can be paraphrased as "map the entire record." Based on an experimental Arden Syntax processor, we implemented a method to transform patient data from a commercial patient data management system (PDMS) to tree-structured documents termed CDS EMRs. They are encoded in a specific XML format that can be directly transformed to Arden Syntax data types by a mapper natively integrated into the processor. The internal structure of a CDS EMR reflects the tabbed view of an EMR in the graphical user interface of the PDMS. The study resulted in an architecture that provides CDS EMRs in the form of a network service. The approach enables uniform data access from all Medical Logic Modules and requires no mapping parameters except a case number. Measurements within a CDS EMR can be addressed with straightforward path expressions. The approach is in routine use at a German university hospital for more than 2 years. This practical approach facilitates the use of CDS functions in the clinical routine at our local hospital. It is transferrable to standard-compliant Arden Syntax processors with moderate effort. Its comprehensibility can also facilitate teaching and development. Moreover, it may lower the entry barrier for the application of the Arden Syntax standard and could therefore promote its dissemination.

Spatial Rule-Based Simulations: The SRSim Software.

SRSim combines rule-based reaction network models with spatial particle simulations allowing to simulate the dynamics of large molecular complexes changing according to a set of chemical reaction rules. As the rule can contain patterns of molecular complexes and specific states of certain binding sites, a combinatorially complex or even infinitely sized reaction network can be defined. Particles move in a three-dimensional space according to molecular dynamics implemented by LAMMPS, while the BioNetGen language is used to formulate reaction rules. Geometric information is added in a specific XML format. The simulation protocol is exemplified by two different variants of polymerization as well as a toy model of DNA helix formation. SRSim is open source and available for download.

TM-Builder: An Ontology Builder based on XML Topic Maps


 
 
 Everyday a huge number of new information resources are linked to the web. This way the web is growing very fast, making search tasks more and more difficult with worse results. To solve the problem several initiatives were undertaken and a new area of research and development emerged: the one called Semantic Web.When we refer to the semantic web we are thinking about a network of concepts. Each concept has a group of related resources and can be related to other concepts; we can then use this concept network to navigate among web resources or simply among information resources. From the undertaken initiatives one became an ISO standard: Topic Maps ISO 13250.
 The aim of this paper is to introduce a Topic Map (TM) Builder, that is a processor that extracts topics and relations from instances of a family of XML documents.A TM-Builder is strongly dependent on the resources structure. So, to extract a topic map for different collections of information resources (sets of documents with different structures) we have to implement several TM-Builders, one for each collection. This is not very easy! To overcome this inconvenient we have created an XML abstraction layer for TM-Builders that enables us to specify the topic map we want to build from a concrete family of resources, in order to generate automatically the intended extractor.
 To describe that process, i.e. the extraction of knowledge from XML documents to produce a TM, we present a language to specify topic maps for a class of XML documents, that we call XSTM (XML Specification for Topic Maps). We also discuss a XSL processor that automatically generates the Extractor from its formal specification written in XSTM, the XSTM-P.
 
 

A hybrid logic for XML reference constraints

XML emerged as the (meta) mark-up language for representing, exchanging, and storing semistructured data. The structure of an XML document may be specified either through DTD (Document Type Definition) language or through the specific language XML Schema. While the expressiveness of XML Schema allows one to specify both the structure and constraints for XML documents, DTD does not allow the specification of integrity constraints for XML documents. On the other side, DTD has a very compact notation opposed to the complex notation and syntax of XML Schema. Thus, it becomes important to consider the issue of how to express further constraints on DTD-based XML documents, still retaining the simplicity and succinctness of DTDs. According to this scenario, in this paper we focus on a (as much as possible) simple logic, named XHyb, expressive enough to allow the specification of the most common integrity and reference constraints in XML documents. In particular, we focus on constraints on ID and IDREF(S) attributes, which are the common way of logically connecting parts of XML documents, besides the usual parent-child relationship of XML elements. Differently from other previously proposed hybrid logics, in XHyb IDREF(S) attributes are explicitly expressible by means of suitable syntactical constructors. Moreover, we propose a refinement of the usual graph representation of XML documents in order to represent XML documents in a formal and intuitive way without flatten accessibility through IDREF(S) to the usual parent-child relationship. Model checking algorithms are then proposed, to verify that a given XML document satisfies the considered constraints.

GMZ: A GML COMPRESSION MODEL FOR WEBGIS

Abstract. Geography markup language (GML) is an XML specification for expressing geographical features. Defined by Open Geospatial Consortium (OGC), it is widely used for storage and transmission of maps over the Internet. XML schemas provide the convenience to define custom features profiles in GML for specific needs as seen in widely popular cityGML, simple features profile, coverage, etc. Simple features profile (SFP) is a simpler subset of GML profile with support for point, line and polygon geometries. SFP has been constructed to make sure it covers most commonly used GML geometries. Web Feature Service (WFS) serves query results in SFP by default. But it falls short of being an ideal choice due to its high verbosity and size-heavy nature, which provides immense scope for compression. GMZ is a lossless compression model developed to work for SFP compliant GML files. Our experiments indicate GMZ achieves reasonably good compression ratios and can be useful in WebGIS based applications.

BonXai

While the migration from DTD to XML Schema was driven by a need for increased expressivity and flexibility, the latter was also significantly more complex to use and understand. Whereas DTDs are characterized by their simplicity, XML Schema Documents are notoriously difficult. In this article, we introduce the XML specification language BonXai, which incorporates many features of XML Schema but is arguably almost as easy to use as DTDs. In brief, the latter is achieved by sacrificing the explicit use of types in favor of simple patterns expressing contexts for elements. The goal of BonXai is not to replace XML Schema but rather to provide a simpler alternative for users who want to go beyond the expressiveness and features of DTD but do not need the explicit use of types. Furthermore, XML Schema processing tools can be used as a back-end for BonXai, since BonXai can be automatically converted into XML Schema. A particularly strong point of BonXai is its solid foundation rooted in a decade of theoretical work around pattern-based schemas. We present a formal model for a core fragment of BonXai and the translation algorithms to and from a core fragment of XML Schema. We prove that BonXai and XML Schema can be converted back-and-forth on the level of tree languages and we formally study the size trade-offs between the two languages.

XML 기반의 에너지 저장용 프로파일 어댑터 분석 및 설계

에너지 저장장치(Energy Storage System)은 전력 수요가 적을 때 전력을 저장해 두었다가 수요가 발생하거나 비상시 저장된 전력을 사용함으로 전기 에너지를 저장하여 필요할 때 사용 가능함으로써 에너지 이용 효율 향상, 전력공급 시스템 안정화 및 신재생 에너지 활용도 향상 효과를 가지는 시스템이다. 최근 세계적으로 에너지의 효율적인 소비에 대한 관심이 증대되면서 전력의 안정적인 공급을 원하는 수요자와 전력 수요 평준화를 원하는 공급자의 요구를 충족시켜줄 수 있는 에너지 저장장치의 필요성이 증대되고 있다. 현재 에너지 저장장치를 구성하는 Power Conditioning System(PCS), Battery Management System(BMS), 배터리 셀은 제조사별로 상이한 규격을 가진다. 이로 인해 각 핵심 부품 간 인터페이스가 규격화되어 있지 않아, 에너지 저장장치의 구성 및 운영에 난점으로 작용하고 있다. 본 논문에서는 제조사별로 상이한 특징을 가지는 부품들의 설정과 효율적 운영에 필요한 정보를 수용하여 에너지 저장장치를 구성할 수 있는 XML 기반의 에너지 시스템 전용 프로파일 시스템의 설계와 분석방안을 제안한다. 제조사별 PCS, BMS, 배터리 셀과 그 외의 주변 기기들의 설정 정보 및 운영 정보를 분석하여 프로파일 규격을 정의하고, 에너지 저장장치에 적용할 수 있는 프로파일 어댑터 소프트웨어를 설계 및 구현한다. 프로파일 어댑터를 통해 생성된 프로파일은 설정 프로파일과 운영 프로파일로 구성되며, 추후 확장성을 고려하여 표준 XML의 규격을 따른다. 구현된 프로파일 시스템의 검증은 에너지 저장장치 시스템에 적용되어 기본적인 충 방전 동작을 통해 정상 동작 결과를 제안한다. The Energy Storage System stores electricity for later use. This system can store electricity from legacy electric power systems or renewable energy systems into a battery device when demand is low. When there is high electricity demand, it uses the electricity previously stored and enables efficient energy usage and stable operation of the electric power system. It increases the energy usage efficiency, stabilizes the power supply system, and increases the utilization of renewable energy. The recent increase in the global interest for efficient energy consumption has increased the need for an energy storage system that can satisfy both the consumers' demand for stable power supply and the suppliers' demand for power demand normalization. In general, an energy storage system consists of a Power Conditioning System, a Battery Management System, a battery cell and peripheral devices. The specifications of the subsystems that form the energy storage system are manufacturer dependent. Since the core component interfaces are not standardized, there are difficulties in forming and operating the energy storage system. In this paper, the design of the profile structure for energy storage system and realization of private profiling system for energy storage system is presented. The profiling system accommodates diverse component settings that are manufacturer dependent and information needed for effective operation. The settings and operation information of various PCSs, BMSs, battery cells, and other peripheral device are analyzed to define profile specification and structure. A profile adapter software that can be applied to energy storage system is designed and implemented. The profiles for energy storage system generated by the profile authoring tool consist of a settings profile and operation profile. Setting profile consists of configuration information for energy device what composes energy saving system. To be more specific, setting profile has three parts of category as information for electric control module, sub system, and interface for communication between electric devices. Operation profile includes information in relation to the method in which controls Energy Storage system. The profiles are based on standard XML specification to accommodate future extensions. The profile system has been verified by applying it to an energy storage system and testing charge and discharge operations.

Cognition inspired format for the expression of computer vision metadata

Over the last decade noticeable progress has occurred in automated computer interpretation of visual information. Computers running artificial intelligence algorithms are growingly capable of extracting perceptual and semantic information from images, and registering it as metadata. There is also a growing body of manually produced image annotation data. All of this data is of great importance for scientific purposes as well as for commercial applications. Optimizing the usefulness of this, manually or automatically produced, information implies its precise and adequate expression at its different logical levels, making it easily accessible, manipulable and shareable. It also implies the development of associated manipulating tools. However, the expression and manipulation of computer vision results has received less attention than the actual extraction of such results. Hence, it has experienced a smaller advance. Existing metadata tools are poorly structured, in logical terms, as they intermix the declaration of visual detections with that of the observed entities, events and comprising context. This poor structuring renders such tools rigid, limited and cumbersome to use. Moreover, they are unprepared to deal with more advanced situations, such as the coherent expression of the information extracted from, or annotated onto, multi-view video resources. The work here presented comprises the specification of an advanced XML based syntax for the expression and processing of Computer Vision relevant metadata. This proposal takes inspiration from the natural cognition process for the adequate expression of the information, with a particular focus on scenarios of varying numbers of sensory devices, notably, multi-view video.

Review on Reverse Engineering Techniques of Software Engineering

Reverse Engineering is an approach to extract requirement information application from XML at higher level of abstraction. In the present study XML to UML transformation methods has been explored and discussed along with some other related work in reverse engineering. A brief review of reverse engineering shows that the transformation results of XML to UML are beneficial for developer. However it does not show changes as per the requirements view. Generation of Natural Language specifications from UML class diagrams is also discussed where results were found encouraging and feasible. All related work of reverse engineering of XML and Natural language specification from UML is clear but a lot of work is to be done to solve real world problems satisfactorily. Capability of different reverse engineering tools is also discussed. Automatic code generation using UML to XML schema transformation is reviewed which shows that it can reduce the time and efforts of coding.

Automated Dialogue Generation for Behavior Intervention on Mobile Devices

Communication in the form of dialogues between a virtual coach and a human patient (coachee) is one of the pillars in an intervention app for smartphones. The virtual coach is considered as a cooperative partner that supports the individual with various exercises for a behavior intervention therapy. To perform its supportive behavior, the coach follows a certain interaction model and its requirements, such as alignment, mutual commitment and adaptation. In this paper, we propose E-Coach MarkUp Language (ECML), a standard XML specification for scripting discourses that define how the virtual coach maintains a dialogue with a coachee following the interaction model. The format of the language allows messages to be tailored at a fine-grained level. Each sentence is synthesized based on the inferred goals of the coaching process and the current beliefs of the user, incorporating everything that has been said previously in the conversation. The design enables inexpensive implementation on mobile devices for a flexible, seamless coaching dialogue. With expert-based evaluations, we validated the language using scenarios on implemented ECML in the field of insomnia therapy.

DEVELOPING AN ebXML COMPATIBLE B2B COLLABORATION PROTOTYPE AND REFERENCE MODEL: The Viewpoint of Business Process Integration

In the digital information networking age, because of circulation and convergence of the information, the cost for enterprises to find trading partners to do business is getting lower and lower. By the emergence of e-Marketplace, it gathers a great number of buyers and sellers. It can promote business transactions and break the barriers, such as country and time, among trading partners. The enterprise may increase business revenue on the e-Marketplace. But only via integrating the e-Marketplace operation processes and corporation’s internal processes, it can fulfill the requests and provide services on e-Marketplace as rapidly as possible. In this research we follow the Electronic Business XML (ebXML) specification that is planned by The United Nations Center for Trade Facilitation and Electronic Business (UN/CEFACT) and The Organization for the Advancement of Structured Information Standards (OASIS). The vision of ebXML is to create a single global electronic marketplace where enterprises of any size and in any geographical location can meet and conduct business with each other through the exchange of XML based messages. We build an ebXML compatible collaboration module to deal with Business-to-Business integration issues. Via this module we can run business-to-business processes integration smoothly and reduce the integration cost with using ebXML specification.

Enhanced OAI-PMH services for metadata sharing in heterogeneous environments

Purpose– This paper aims to propose a toolset that enables individual digital collections owners to satisfy the requirements of aggregators even in cases where their IT and software infrastructure is limited and does not support them inherently. Managers of repositories/digital collections face the challenge of exposing their data via Open Archives Initiative – Protocol for Metadata Harvesting (OAI-PMH) to multiple aggregators and conforming to their possibly differing requirements, for example on output metadata schemas and selective harvesting.Design/methodology/approach– The authors developed a software server that is able to wrap existing systems or even metadata records in plain files as OAI-PMH sources. They analysed the functionality of OAI-PMH data providers in a flow of discrete steps and used a software library to modularise the software for these steps so that the whole process can be easily customised to the needs of each pair of OAI-PMH data provider and service provider. The developed server includes a mechanism for the implementation of schema mappings using an XML specification that can be defined by non-IT personnel, for example metadata experts. The server has been applied in various real-life use cases, in particular for providing content to Europeana.Findings– It has been concluded through real-life use cases that it is indeed possible and feasible in practice to expose metadata records of digital collections via OAI-PMH even when the data sources do not support the required protocols and standards. Even advanced OAI-PMH features like selective harvesting can be supported. Mappings between input and output schemas in many practical cases can be implemented entirely or to a large extent as XML specifications by metadata experts instead of software developers.Practical implications– Exposing data via OAI-PMH to aggregators like Europeana is made feasible/easier for digital collections owners, even when their software infrastructure does not inherently support the required protocols and standards.Originality/value– The approach is original and applicable in practice to diverse technology environments, effectively addressing the indisputable fact of the heterogeneity of software and systems used to implement digital repositories and collections worldwide.

Fast Learning of Restricted Regular Expressions and DTDs

We study the problem of generalizing from a finite sample to a language taken from a predefined language class. The two language classes we consider are subsets of the regular languages and have significance in the specification of XML documents (the classes corresponding to so-called chain regular expressions, Chares, and to single-occurrence regular expressions, Sores). The previous literature gives a number of algorithms for generalizing to Sores providing a trade-off between quality of the solution and speed. Furthermore, a fast but non-optimal algorithm for generalizing to Chares is known. For each of the two language classes we give an efficient algorithm returning a minimal generalization from the given finite sample to an element of the fixed language class; such generalizations are called descriptive. In this sense of descriptivity, both our algorithms are optimal.

CMBE v05—Implementation of a toy-model for chaos analysis of relativistic nuclear collisions at the present BNL energies

In this paper we present a new version of Chaos Many-Body Engine (CMBE) Grossu et al. (2014) [1]. Inspired by the Mean Free Path concept, we implemented a new parameter, namely the “Mean Free Time”, which is defined as the mean time between one particle’s creation and its stimulated decay. This new parameter should be understood as an effect of the nuclear environment and, as opposed to the particle lifetime, it has the advantage of not being affected by the relativistic dilation. In [2] we presented a toy-model for chaos analysis of relativistic nuclear collisions at 4.5 A GeV/c (the SKM 200 collaboration). In this work, we extended our model to 200 A GeV (the maximum BNL energy). New version program summaryProgram title: Chaos Many-Body Engine v05Catalogue identifier: AEGH_v5_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEGH_v5_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Microsoft Public License (Ms-PL)No. of lines in distributed program, including test data, etc.: 638984No. of bytes in distributed program, including test data, etc.: 15918340Distribution format: tar.gzProgramming language: Visual C# .Net 2010Computer: PCOperating system: .Net Framework 4.0 running on MS WindowsRAM: 128 MBClassification: 24.60.Lz, 05.45.aCatalogue identifier of previous version: AEGH_v4_0Journal reference of previous version: Computer Physics Communications 185 (2014) 1339Does the new version supersede the previous version?: YesNature of problem: Toy-model for relativistic nuclear collisions at present BNL energies.Solution method: Relativistic many-body OOP engine, including a reactions module.Reasons for new version:1.Implementation of the “Mean Free Time” parameter;2.Implementation of a new example of use for relativistic nuclear collisions at present BNL energies.Summary of revisions:1.Implementation of a new parameter, namely the “Mean Free Time”, defined as the mean time between one particle’s creation and its stimulated decay. The Mean Free Time should be understood as an effect of the nuclear environment and, as opposed to the particle lifetime, it is measured in the observation system (not affected by the relativistic dilation). Following this purpose, a new tag (MeanFreeTime) was added in the “Particles” section of the specific XML reactions input file described in [2].2.Analysis ∖Chaos Analysis ∖Double ∖Other: Implementation of a, more reliable, fuzzy algorithm [3] for probability distributions.3.Math ∖Vector ∖GetRandomVector: Bug correction (the distribution is now isotropic).4.Simulations ∖Collider: New example of use for relativistic nuclear collisions at present BNL energies [4].Additional comments:Inspired by existing nuclear billiards [5,6], in [2] we implemented a toy-model for relativistic nuclear collisions at 4.5 A GeV/c (the SKM 200 collaboration [7,8]). In this work, we extended our model to higher energies. Following this purpose, we inherited the SimulationCollisionExample class (the SimulationColliderExample class), and employed an extended set of reactions (the ColliderReactions.xml file). The, previously discussed, Mean Free Time concept is also playing an important role in this context. As an exemplification of CMBE capabilities, in Figs. 1–3 we present some preliminary results [9] for 1000 Au–Au events at 200 A GeV (the maximum BNL energy [4]), simulated at 0.1 Fm/c temporal resolution. [Display omitted] [Display omitted] [Display omitted]

XML Matchers: Approaches and challenges

Schema Matching, i.e. the process of discovering semantic correspondences between concepts adopted in different data source schemas, has been a key topic in Database and Artificial Intelligence research areas for many years. In the past, it was largely investigated especially for classical database models (e.g., E/R schemas, relational databases, etc.). However, in the latest years, the widespread adoption of XML in the most disparate application fields pushed a growing number of researchers to design XML-specific Schema Matching approaches, called XML Matchers, aiming at finding semantic matchings between concepts defined in DTDs and XSDs. XML Matchers do not just take well-known techniques originally designed for other data models and apply them on DTDs/XSDs, but they exploit specific XML features (e.g., the hierarchical structure of a DTD/XSD) to improve the performance of the Schema Matching process. The design of XML Matchers is currently a well-established research area. The main goal of this paper is to provide a detailed description and classification of XML Matchers. We first describe to what extent the specificities of DTDs/XSDs impact on the Schema Matching task. Then we introduce a template, called XML Matcher Template, that describes the main components of an XML Matcher, their role and behavior. We illustrate how each of these components has been implemented in some popular XML Matchers. We consider our XML Matcher Template as the baseline for objectively comparing approaches that, at first glance, might appear as unrelated. The introduction of this template can be useful in the design of future XML Matchers. Finally, we analyze commercial tools implementing XML Matchers and introduce two challenging issues strictly related to this topic, namely XML source clustering and uncertainty management in XML Matchers.

Flexible Generation of E-Learning Exams inR:MoodleQuizzes,OLATAssessments, and Beyond

The capabilities of the package exams for automatic generation of (statistical) exams in R are extended by adding support for learning management systems: As in earlier versions of the package exam generation is still based on separate Sweave files for each exercise – but rather than just producing different types of PDF output files, the package can now render the same exercises into a wide variety of output formats. These include HTML (with various options for displaying mathematical content) and XML specifications for online exams in learning management systems such as Moodle or OLAT. This flexibility is accomplished by a new modular and extensible design of the package that allows for reading all weaved exercises into R and managing associated supplementary files (such as graphics or data files). The manuscript discusses the readily available user interfaces, the design of the underlying infrastructure, and how new functionality can be built on top of the existing tools.

Cloud computing-based jam management for a manufacturing system in a Green IT environment

A manufacturing system is composed of and operated by many components; motors, cylinders, and sensors. Its purpose is to increase operational performance without system error or jam. And, recently, the Green IT/S (information technologies and systems) refer to processes that directly or indirectly address environmental sustainability in organizations. Green IT addresses energy consumption, reduces the bad productivity, and increases system operational efficiency using the computer. However, when the system experiences some problem or operational error, users (system operators or managers) often find it difficult to locate the jam position immediately and precisely. It is also difficult to know the cause of the jam and to manage jam information even after they read and find relevant error text in a repair manual for the system. This research proposes a method to efficiently manage jam status for manufacturing systems. For this purpose, a topic map was used. The topic model has topic types, associations, and occurrences, which relate to operational jam, system jam, and system components. All jam status information to support users is managed by XML specification, distinctly and efficiently.