ppxscal/embedding_network huggingface dataset:
COBIT QuickStart, 2nd Edition, 2nd edition
Venue:  (2007)

This special version of COBIT is a baseline for many small to medium enterprises (SMEs) and other entities where IT is not mission-critical or essential for survival. It can also serve as a starting point for other enterprises in their move towards an appropriate level of control and governance of IT. For purposes of this publication, SMEs have not been defined according to any financial or staffing measurement. Instead, the strategic nature of IT to the business is evaluated, a self-assessment form has been developed and exceptions are reviewed. Those enterprises for whom the strategic nature of IT is relatively low, who fall within certain ranges on the self-assessment and who do not have any of the exceptions that might indicate a higher level of dependence on IT are considered SMEs. This publication was developed in response to comments that COBIT, in its complete form, can be a bit overwhelming. Those who operate with a small IT staff often do not have the resources to implement all of COBIT. This version of COBIT constitutes a subset of the entire COBIT volume. Only those control objectives that are considered the most critical are included, so that implementation of COBIT's fundamental principles can take place easily, effectively and relatively quickly. CD-ROM included. 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
Thermal sensor allocation and placement for reconfigurable systems
Authors: Byunghyun Lee, Ki-Seok Chung, Bontae Koo, Nak-Woong Eum, Taewhan Kim
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2009)

A dynamic monitoring of thermal behavior of hardware resources using thermal sensors is very important to maintain the operation of systems safe and reliable. This article addresses the problem of thermal sensor allocation and placement for reconfigurable systems. For programmable logic arrays, the degree of the use of hardware resources in the systems highly depends on the target application to be implemented, making the allocation of thermal sensors at the manufacturing stage inadequate (or too costly if implemented) due to the unpredictable thermal profile. This means that the thermal sensor allocation could be processed at the time when the reconfigurable logic is implemented (i.e., at the post manufacturing stage). This work proposes an effective solution to the problem of thermal sensor allocation and placement at the post-manufacturing stage. Specifically, we define the Sensor Allocation and Placement Problem (SAPP), and propose a solution which formulates SAPP into the Unate-Covering Problem (UCP) and solves it optimally. Also we combine SAPP with temperature correlation to reduce required sensors more aggressively and propose a solution by applying UCP again. We then provide an extended solution to handle a practical design issue where the hardware resources for the sensor implementation on specific array locations have already been used up by the application logic. Experimental results using MCNC benchmarks show that our proposed technique uses 62.4&percnt; and 19.7&percnt; less number of sensors to monitor hotspots on the average than that used by the grid-based and the bisection-based approaches while the overhead of auxiliary circuitry is minimized, respectively.
Java-Based Mobile-Agent Systems in the Real World: Security Highlights
Authors: Martin Šimek
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

This document presents a study for the securing of Java-based systems based in the Mobile Agent paradigm. Security is an important issue for the widespread development of applications based on software agent technology. It is generally agreed that without the proper countermeasures in place, use of agent-based applications will be severe impeded. This document gives an overview of the threats associated with software agent systems focused on the elements of our simplified model: Agents and Agent Platforms and also describe a general method for controlling the behavior of mobile agent-system entities through the allocation of privileges. This approach overcomes a number of problems in existing agent systems and provides a means for attaining improved interpretability of agent systems designed and implemented independently by different manufacturers.
Use and acceptance of an electronic health record: factors affecting physician attitudes
Authors: Susan Wiedenbeck, Katherine W. Mccain
Venue:  (2008)

The benefits of using electronic health records (EHRs) are well-documented; however, a number of implementation barriers have impeded their widespread use. The literature provides evidence of failed clinical system implementations, due to lack of adoption by users. Health care organizations must be prepared to anticipate and manage changes that will accompany implementation of a new information system. As the key coordinator and provider of patient care, physician acceptance of an EHR application will determine the overall success of a product's implementation. The objective of this study was to determine the individual characteristics and sociotechnical factors that may contribute to physician acceptance of an EHR. A hypothesized causal model grounded in Diffusion of Innovations theory and the Technology Acceptance Model was developed using case study and survey methods, and was tested using structural equation modeling (SEM). An online survey was distributed to 802 faculty, fellow and resident physicians in an acute care teaching institution in the southeastern United States. Overall response rate was 29.8%. The model variables explained over 73% of the variance in EHR attitude and acceptable model fit was achieved. Individual physician characteristics did not correlate with attitudes in this population. Factors contributing to physician acceptance include: management support, physician involvement in selection and implementation, perceptions of the EHR's impact on physician autonomy, doctor-patient relationship, perceived ease of use and perceived usefulness. Study participants also expressed concerns about perceptions of the EHR's potential negative impact on clinical workflow and efficiency. Adequate training was not a significant predictor of attitudes. Significant contributions of this study include development of an EHR Acceptance Model for assessing physician attitudes prior to EHR implementation. Other healthcare institutions may find this framework useful for assessing EHR readiness. The findings may aid software developers in designing products to accommodate multiple clinical specialties and user skill levels. The results provide empirical support for a theory about the impact of sociotechnical factors on physician attitudes about EHR adoption.
Attribute reduction and optimal decision rules acquisition for continuous valued information systems
Authors: Yan-Yong Guan, Hong-Kai Wang, Yun Wang, Fang Yang
Venue: Information Sciences: an International Journal (2009)

For continuous valued information systems, the attribute values of objects for the same attribute represent not only their ordinal relationship but also their relative distances. Therefore, the classical rough set model is not suitable for deducing attribute reductions and optimal decision rules for continuous valued information systems. Though some discretization methods are proposed to transform the continuous valued information systems into discrete ones, but those methods are too categorical and may lead to loss of information in some cases. To solve such information loss problem, we propose a tolerance rough set model in this paper. With a given level, the proposed model can divide a universe into some maximal tolerance classes. Also two types of lower and upper approximations are defined accordingly. Then the reductions of the maximal tolerance class and optimal decision rules based on the proposed attribute descriptors are defined, and the approximate discernibility function for the maximal tolerance class is constructed and used to compute all the corresponding optimal decision rules via using Boolean reasoning techniques. Finally, the general reductions and consistent reductions for continuous valued information systems are discussed.
3D-aware image editing for out of bounds photography
Authors: Amit Shesh, Antonio Criminisi, Carsten Rother, Gavin Smyth
Venue: Proceedings of Graphics Interface 2009 (2009)

In this paper, we propose algorithms to manipulate 2D images in a way that is consistent with the 3D geometry of the scene that they capture. We present these algorithms in the context of creating "Out of Bounds" (OOB) images - compelling, depth-rich images generated from single, conventional 2D photographs (fig. 1). Starting from a single image our tool enables rapid OOB prototyping; i.e. the ability to quickly create and experiment with many different variants of the OOB effect before deciding which one best expresses the users' artistic intentions. We achieve this with a flexible work-flow driven by an intuitive user interface. The rich 3D perception of the final composition is achieved by exploiting two strong cues -- occlusions and shadows. A realistic-looking 3D frame is interactively inserted in the scene between segmented foreground objects and the background to generate novel occlusions and enhance the scene's perception of depth. This perception is further enhanced by adding new, realistic cast shadows. The key contributions of this paper are: (i) new algorithms for inserting simple 3D objects like frames in 2D images requiring minimal camera calibration, and (ii) new techniques for the realistic synthesis of cast shadows, even for complex 3D objects. These algorithms, although presented for OOB photography, may be directly used in general image composition tasks. With our tool, untrained users can turn ordinary photos into compelling OOB images in seconds. In contrast with existing workflows, at any time the artist can modify any aspect of the composition while avoiding time-consuming pixel painting operations. Such a tool has important commercial applications, and is much more suitable for OOB prototyping than existing image editors.
Insights into the nature of intermolecular interactions in low-energy conformers of perindopril erbumine
Authors: Jiří Czernek
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

The DF-SAPT-DFT approach has been employed to study the contributions to the interaction energy between perindopril and tert-butylamine parts of perindopril erbumine in the four structural arrangements, which have been previously described at the RI-MP2/SVP level of quantum chemical theory. The results are important for proper understanding of the conformational polymorphism of perindopril erbumine.
Stages of Ethical Development in Artificial General Intelligence Systems
Authors: Ben Goertzel, Stephan Vladimir Bugaj
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

A novel theory of the stages of ethical development in intelligent systems is proposed, incorporating prior related theories by Kohlberg and Gilligan, as well as Piaget's theory of cognitive development. This theory is then applied to the ethical development of integrative AGI systems that contain components carrying out simulation and uncertain inference --the key hypothesis being that effective integration of these components is central to the ascent of the AGI system up the ethical-stage hierarchy.
A unified syntactic model for parsing fluent and disfluent speech
Authors: Tim Miller, William Schuler
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

This paper describes a syntactic representation for modeling speech repairs. This representation makes use of a right corner transform of syntax trees to produce a tree representation in which speech repairs require very few special syntax rules, making better use of training data. PCFGs trained on syntax trees using this model achieve high accuracy on the standard Switchboard parsing task.
Who Helps the Helper? A Situated Scaffolding System for Supporting Less Experienced Feedback Givers
Authors: Duenpen Kochakornjarupong, Paul Brna, Paul Vickers
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This research emphasizes the construction of feedback pattern. A system called McFeSPA is designed to help inexperienced teaching assistants (TAs). Inexperienced TAs mean novice TAs including novice teachers, novice tutors, and novice lecturers who lack training in how to provide quality feedback. The system employs scaffolding to help the TAs improve quality feedback skill while marking assignments. We have currently been implementing the system with techniques drawn from Artificial Intelligence, cognitive psychology and theories of education. Our next step will entail the examination of the system for both scaffolding turned off to help two TAs give feedback to a group of students and two TAs using the full system with scaffolding.
A Unique Trial of Developing Software for the Actual Application by an Engineer with Non-Software Background
Authors: Shogo Hayashida, Noriko Taniguchi, Rikio Maruta
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

An attempt to develop a full-fledged software system by an engineer who has no software experiences is described. It is shown that use of the LYEE methodology made the attempt possible and practical with a little assistance and guidance by an experienced engineer. It is confirmed that the method developed through this attempt is useful for nurturing system architects, thereby enabling to realize our ultimate goal that is to transform a non software company to a software company.
A PDF-Matched Modification to Stone's Measure of Predictability for Blind Source Separation
Authors: Mahdi Khosravy, Mohammad Reza Alsharif, Katsumi Yamashita
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper presents a PDF-matched modification to Stone's measure of predictability. The modified measure of predictability is a measure of non-gaussianity too. It is an extent of signal predictability by two different prediction terms. One prediction term is based on a normal gaussian PDF assumption for signal. In contrast, the other one is based on a unit variance supergaussian PDF assumption for signal. By contrastive deployment of the above prediction terms, the modified measure of predictability enables BSS to follow a high kurtosis PDF assumption for signals. As an advantage, not only signals with maximized predictability are recovered, but also with increased non-gaussianity too. Deploying the modified measure of predictability concludes more independent recovered signals. The dominance of BSS based on the modified measure to the previous one has been demonstrated by many tests performed over mixtures of realistic audio signals (music and speech) and over mixtures of gray-scale images.
HYBRID SIMULATION ALGORITHMS FOR AN AGENT-BASED MODEL OF THE IMMUNE RESPONSE
Authors: Johannes Textor, Bjorn Hansen
Venue: Cybernetics and Systems (2009)

The immune system is of central interest for the life sciences, but its high complexity makes it a challenging system to study. Computational models of the immune system can help to improve our understanding of its fundamental principles. In this article, we analyze and extend the Celada-Seiden model, a simple and elegant agent-based model of the entire immune response, which, however, lacks biophysically sound simulation methodology. We extend the stochastic model to a stochastic-deterministic hybrid, and link the deterministic version to continuous physical and chemical laws. This gives precise meaning to all simulation processes, and helps to increase performance. To demonstrate an application for the model, we implement and study two different hypotheses about T cell-mediated immune memory.
Incremental Unsupervised Time Series Analysis Using Merge Growing Neural Gas
Authors: Andreas Andreakis, Nicolai V. Hoyningen-Huene, Michael Beetz
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

We propose Merge Growing Neural Gas (MGNG) as a novel unsupervised growing neural network for time series analysis. MGNG combines the state-of-the-art recursive temporal context of Merge Neural Gas (MNG) with the incremental Growing Neural Gas (GNG) and enables thereby the analysis of unbounded and possibly infinite time series in an online manner. There is no need to define the number of neurons a priori and only constant parameters are used. In order to focus on frequent sequence patterns an entropy maximization strategy is utilized which controls the creation of new neurons. Experimental results demonstrate reduced time complexity compared to MNG while retaining similar accuracy in time series representation.
Towards Linguistically Grounded Ontologies
Authors: Paul Buitelaar, Philipp Cimiano, Peter Haase, Michael Sintek
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

In this paper we argue why it is necessary to associate linguistic information with ontologies and why more expressive models, beyond RDFS, OWL and SKOS, are needed to capture the relation between natural language constructs on the one hand and ontological entities on the other. We argue that in the light of tasks such as ontology-based information extraction, ontology learning and population from text and natural language generation from ontologies, currently available datamodels are not sufficient as they only allow to associate atomic terms without linguistic grounding or structure to ontology elements. Towards realizing a more expressive model for associating linguistic information to ontology elements, we base our work presented here on previously developed models (LingInfo, LexOnto, LMF) and present a new joint model for linguistic grounding of ontologies called LexInfo. LexInfo combines essential design aspects of LingInfo and LexOnto and builds on a sound model for representing computational lexica called LMF which has been recently approved as a standard under ISO.
Efficient Evaluation of Generalized Tree-Pattern Queries with Same-Path Constraints
Authors: Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldatos, Theodore Dalamagas, Timos Sellis
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

Querying XML data is based on the specification of structural patterns which in practice are formulated using XPath. Usually, these structural patterns are in the form of trees (Tree-Pattern Queries --- TPQs). Requirements for flexible querying of XML data including XML data from scientific applications have motivated recently the introduction of query languages that are more general and flexible than TPQs. These query languages correspond to a fragment of XPath larger than TPQs for which efficient non-main-memory evaluation algorithms are not known.In this paper, we consider a query language, called Partial Tree-Pattern Query (PTPQ) language, which generalizes and strictly contains TPQs. PTPQs represent a broad fragment of XPath which is very useful in practice. We show how PTPQs can be represented as directed acyclic graphs augmented with "same-path" constraints. We develop an original polynomial time holistic algorithm for PTPQs under the inverted list evaluation model. To the best of our knowledge, this is the first algorithm to support the evaluation of such a broad structural fragment of XPath. We provide a theoretical analysis of our algorithm and identify cases where it is asymptotically optimal. In order to assess its performance, we design two other techniques that evaluate PTPQs by exploiting the state-of-the-art existing algorithms for smaller classes of queries. An extensive experimental evaluation shows that our holistic algorithm outperforms the other ones.
Treating Quantifiers in Database Semantics
Authors: Jae-Woong Choe, Roland Hausser
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

This paper analyzes the syntactic and semantic structure of noun phrases in English and Korean, using the time-linear derivations of Database Semantics. In comparison with Predicate Calculus, which handles the semantics of determiners like some and all at the highest level of the logical syntax, Database Semantics takes the alternative approach of specifying their semantics as atomic values in the feature structures representing noun phrases. This not only avoids well-known difficulties of the classical approach, such as unwanted scope ambiguities (Copestake et al. 2001) and problems binding certain variables (Geach 1969, Kamp & Reyle 1993), but also opens the way to concentrate on important linguistic aspects of complex noun phrases, namely agreement in English, and the alternative word orders and the rather free distribution of case markers inside the NP in Korean. Given that the internal structure of Japanese NPs is very similar to that of Korean, we believe that our analysis can be easily extended to include Japanese as well.
FI-based file access predictor
Authors: Jinsuk Baek, Paul S. Fisher, Min Gyung Kwak
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This algorithm is a first step in optimizing speed using a prefetching scheme based upon previous history of access. The technique described utilizes a mathematically based approach considering the actual occurrence of file application patterns. This technique was defined for pattern matching, and prefetching of files is indeed a pattern matching problem. We utilize the technique of Finite Inductive Sequences which is defined within the body of this paper. We also note that the formulation for the approach is defined and included, actual data for comparisons are still not completed as of the writing of this paper. However, we believe that the richness of this approach will be useful in considering how to prefetch multiple files for multiple applications under one system.
Arguing with Confidential Information
Authors: Nir Oren, Timothy J. Norman, Alun Preece
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

While researchers have looked at many aspects of argumentation, an area often neglected is that of argumentation strategies. That is, given multiple possible arguments that an agent can put forth, which should be selected in what circumstances. In this paper, we propose a heuristic that implements one such strategy. The heuristic assigns a utility cost to revealing information, as well as a utility to winning, drawing and losing an argument. An agent participating in a dialogue then attempts to maximise its utility. We present a formal argumentation framework in which this heuristic may operate, and show how it functions within the framework. Finally, we discuss how this heuristic may be extended in future work, and its relevance to argumentation theory in general.