ppxscal/embedding_network huggingface dataset:
IBM i & i5/OS Security & Compliance: A Practical Guide
Authors: Carol Woodbury
Venue:  (2009)

Get a fresh look at the world of IBM i and i5/OS security in this comprehensive book by one of the industry s leading authorities on security. Security consultant Carol Woodbury takes her extensive experience designing and implementing security on IBM systems and makes it relevant for today s world. Throughout the book, she discusses issues that organizations need to address for compliance requirements, providing best practices as well as alternatives and options for compensating controls when best practices cannot be applied. Building on the foundation laid by the popular Experts Guide to OS/400 & i5/OS Security, this edition features completely updated information throughout. New chapters address compliance requirements for IBM i, implementing role-based access (RBAC), implementing object-level security, and creating a security incident response plan. Carol Woodbury s methodology for implementing object-level security is described in detail. Topics include determining a system s current settings, default access requirements, process access, and the rollout of new application security models. The book presents this information in a clear and informative way that lets even non-security professionals understand and apply the concepts. This book is a must-read for any auditor, system administrator, security officer, or compliance officer who works with IBM i or i5/OS. Contents Chapter 1: Security The Real Reason You re Reading This Book Chapter 2: Policies and Procedures Chapter 3: Security at the System Level Chapter 4: The Facts About User Profiles Chapter 5: Service Tools Security Chapter 6: Object-Level Security Chapter 7: Security Considerations for the IFS Chapter 8: Securing Your Printed Output Chapter 9: Encryption Chapter 10: Connecting to the System Chapter 11: Internet Security Chapter 12: Evaluating Applications Current Implementations and Designing New Ones Chapter 13: Role-based Access (RBAC) Chapter 14: Role-based Access for IT Chapter 15: Auditing Chapter 16: Implementing Object-Level Security Chapter 17: Maintaining Compliance Chapter 18: Preparing for the Worst: Creating a Security Incident Response Plan Chapter 19: Creating a Security Awareness Program 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
CSCL for teacher professional development
Authors: Bruno Poellhuber, Catherine Allen, Martine Chomienne
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Within the last fifteen years, many colleges of the province of Quebec in Canada have been faced with low admission rates in some less popular technical programs. The increased financial burden for these institutions and the enhanced task burden for teachers working with small groups of students threaten the quality of teaching and learning. In order to cope with this situation, computer-mediated collaboration (telecollaboration) was used to provide teachers with the opportunity to work with colleagues from other colleges who teach similar courses. In this short paper, the impacts of telecollaboration on resources diversity and teacher professional development are examined. After four semesters of experimentation, questionnaires and interviews suggest that teachers learned from their colleagues as they shared ideas and acquired pedagogical and technopedagogical knowledge and skills.
A Comparison of Performance Measures for Online Algorithms
Authors: Joan Boyar, Sandy Irani, Kim S. Larsen
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear points. Even though the problem is simple, it encapsulates a core challenge in online algorithms which is to balance greediness and adaptability. We examine Competitive Analysis, the Max/Max Ratio, the Random Order Ratio, Bijective Analysis and Relative Worst Order Analysis, and determine how these measures compare the Greedy Algorithm and Lazy Double Coverage, commonly studied algorithms in the context of server problems. We find that by the Max/Max Ratio and Bijective Analysis, Greedy is the better algorithm. Under the other measures, Lazy Double Coverage is better, though Relative Worst Order Analysis indicates that Greedy is sometimes better. Our results also provide the first proof of optimality of an algorithm under Relative Worst Order Analysis.
Minimum Entropy Combinatorial Optimization Problems
Authors: Jean Cardinal, Samuel Fiorini, Gwenaël Joret
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.
Partially Observable Markov Decision Process (POMDP) Technologies for Sign Language Based Human-Computer Interaction
Authors: Sylvie C. Ong, David Hsu, Wee Sun Lee, Hanna Kurniawati
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL data, the recognition system can speed up processing by taking only a subset of extracted features as its input. However, this should not be realised at the expense of a drop in recognition accuracy. By training different recognizers for different subsets of features, we can formulate the problem as the task of planning the sequence of recognizer actions to apply to SL data, while accounting for the trade-off between recognition speed and accuracy. Partially observable Markov decision processes (POMDPs) provide a principled mathematical framework for such planning problems. A POMDP explicitly models the probabilities of observing various outputs from the individual recognizers and thus maintains a probability distribution (or belief) over the set of possible SL input sentences. It then computes a policy that maps every belief to an action. This allows the system to select actions in real-time during online policy execution, adapting its behaviour according to the observations encountered. We illustrate the POMDP approach with a simple sentence recognition problem and show in experiments the advantages of this approach over "fixed action" systems that do not adapt their behaviour in real-time.
A Web-Based Search Engine for Chinese Calligraphic Manuscript Images
Authors: Yi Zhuang, Nan Jiang, Haiyang Hu
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

In this paper, we propose a novel framework for the web-based retrieval of Chinese calligraphic manuscript images which includes two main components: 1). A Shape- Similarity (SS)-based method which is to effectively support a retrieval over large Chinese calligraphic manuscript databases [19]. In this retrieval method, shapes of calligraphic characters are represented by their approximate contour points extracted from the character images; 2). To speed up the retrieval efficiency, we then propose a Composite - Distance- Tree(CD-Tree)-based high-dimensional indexing scheme for it. Comprehensive experiments are conducted to testify the effectiveness and efficiency of our proposed retrieval and indexing methods respectively.
Considerations for Designing Response Quantification Procedures in Non-traditional Psychophysiological Applications
Authors: A. V. Iyer, L. D. Cosand, C. G. Courtney, A. A. Rizzo, T. D. Parsons
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Psychophysiological assessment in the context of virtual environments is a promising means for benchmarking the efficacy and ecological validity of virtual reality scenarios. When applied to human-computer interaction, psychophysiological and affective computing approaches may increase facility for development of the next generation of human-computer systems. Such systems have the potential to use psychophysiological signals for user-feedback and adaptive responding. As the composition of investigating teams becomes diverse in keeping with interdisciplinary trends, there is a need to review de-facto standards of psychophysiological response quantification and arrive at consensus protocols adequately addressing the concerns of basic researchers and application developers. The current paper offers a demonstration of the ways in which such consensus scoring protocols may be derived. Electromyographic eye-blink scoring from an immersion investigation is used as an illustrative case study.
Computer Vision Based Vacuum Circuit-Breaker's Stroke Parameter Automatic Measurement
Authors: Shutao Zhao, Jing Chi, Baoshu Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In order to solve the existing deficiencies of measuring the vacuum circuit-breaker’s stroke parameter, this paper proposes a new non-contact measurement method based on modern computer vision technology.Firstly, during the movement of switching operation of the vacuum circuit-breaker, CCD camera is utilized as the detect sensor to capture special images with specific screw fixed in the moving conduction-bar; secondly, the quality of the images is enhanced by image preprocessing, such as image filter, enhancement and distorted calibration etc.; and then recognizing the position of the specific screw’s axes by using template matching technique; at last calculating stroke parameter value according to the axes’ displacement and translate to the real-world results. The experimental results shows that the proposed method not only can realize a non-contact measurement of the vacuum circuit-breaker’s stroke parameter, but also can meet the needs of quickly and precise measuring in power test field experiment.
Games Design Principles for Improving Social Web Applications
Authors: Ines Loreto
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Most young people (at least in countries were social communication technologies are established from a long run) carry mobile devices, surf the Internet and download music. They are always connected and live in a world where the distinction between virtual and real fade. The design of new interfaces becomes, in this context, a complex activity that involves a series of methodological problems. To one side designers have to create interfaces using basic HCI principles, on the other side they have to merge them with others ICT principles able to support social aspects, bearing in mind that they are addressing the above described generation of younger. Is our opinion that designers can find useful suggestion in game design strategies. Looking at games interface design choices, in fact, can help software engineers to improve the usability of other types of - more conventional - applications. In order to demonstrate this we will compare two social web applications: the new Facebook website and a French online game, Hordes.
The Positioning of Binocular Stereo Visual Servoing Based on Robot Dynamics
Authors: Mei Jin, Liguo Zhang, Huiguang Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Since binocular stereo visual servoing system acquires more information and has better control effectiveness than single camera visual servoing system, considering the characteristics of robot dynamics, this paper uses an adaptive controller to deal with the positioning control for image-based robot manipulator of stereo visual servoing, which is applicable to the fixed camera configuration or the eye-in-hand set up whose intrinsic and extrinsic parameters are not all known. The asymptotic convergence of the image errors to zero is proved by the Lyapunov theory. A simulation is carried out to demonstrate the effectiveness of the proposed scheme.
First-Principles Calculation of Electronic Structure of Mg2Si with Doping
Authors: Chen Qian, Xie Quan, Zhao Feng-Juan, Cui Dong-Meng, Li Xu-Zhen
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The electronic structures of Mg2Si and Al, Cu doped Mg2Si have been calculated by first-principles pseudo-potential method. The calculated results show that Mg2Si is an indirect semiconductor with the band gap of 0.2994 eV, the valence bands of Mg2Si are composed of Si 3p, Mg 3s, 3p and the conduction bands are mainly composed of Mg 3s, 3p as well as Si 3p. Al-doped Mg2Si sample is n-type semiconductor and the conduction bands near Fermi level are composed of Si 3p, Mg 3s, 3p and Al 3p. Cu-doped Mg2Si sample is p-type semiconductor and the valance bands near Fermi level are composed of Si 3p, Mg 3s, 3p and Cu 3d.
Update summarization based on novel topic distribution
Authors: Josef Steinberger, Karel Ježek
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

This paper deals with our recent research in text summarization. The field has moved from multi-document summarization to update summarization. When producing an update summary of a set of topic-related documents the summarizer assumes prior knowledge of the reader determined by a set of older documents of the same topic. The update summarizer thus must solve a novelty vs. redundancy problem. We describe the development of our summarizer which is based on Iterative Residual Rescaling (IRR) that creates the latent semantic space of a set of documents under consideration. IRR generalizes Singular Value Decomposition (SVD) and enables to control the influence of major and minor topics in the latent space. Our sentence-extractive summarization method computes the redundancy, novelty and significance of each topic. These values are finally used in the sentence selection process. The sentence selection component prevents inner summary redundancy. The results of our participation in TAC evaluation seem to be promising.
A Packet-Based Anomaly Detection Model for Inter-domain Routing
Authors: Huayang Cao, Miao Wang, Xiaoqiang Wang, Peidong Zhu
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

The current implementation of BGP protocol has a variety of vulnerabilities and weakness. Monitoring BGP’s behavior is an effective way to improve the security of inter-domain routing. Due to the difficulty of obtaining routing tables from Autonomous Systems, a packet-based model for detecting routing anomalies is presented. This model contains data collectors, anomaly detection engine, routing information database and result visualization module. A rule-based approach is designed, and the combined usage of rules and routing information database is proved to be effective on improving the accuracy of detection. Experiment results show that model performs well in detecting various anomalies. The feasibility and validity of the detecting approach are demonstrated by the detailed description of the deployment and performance analysis.
Deriving a large scale taxonomy from Wikipedia
Authors: Simone Paolo Ponzetto, Michael Strube
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We take the category system in Wikipedia as a conceptual network. We label the semantic relations between categories using methods based on connectivity in the network and lexicosyntactic matching. As a result we are able to derive a large scale taxonomy containing a large amount of subsumption, i.e. isa, relations. We evaluate the quality of the created resource by comparing it with ResearchCyc, one of the largest manually annotated ontologies, as well as computing semantic similarity between words in benchmarking datasets.
Active and Semi-supervised Data Domain Description
Authors: Nico Görnitz, Marius Kloft, Ulf Brefeld
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) learns a hypersphere enclosing the bulk of provided unlabeled data such that points lying outside of the ball are considered anomalous. However, relevant information such as expert and background knowledge remain unused in the unsupervised setting. In this paper, we rephrase data domain description as a semi-supervised learning task, that is, we propose a semi-supervised generalization of data domain description (SSSVDD) to process unlabeled and labeled examples. The corresponding optimization problem is non-convex. We translate it into an unconstraint, continuous problem that can be optimized accurately by gradient-based techniques. Furthermore, we devise an effective active learning strategy to query low-confidence observations. Our empirical evaluation on network intrusion detection and object recognition tasks shows that our SSSVDDs consistently outperform baseline methods in relevant learning settings.
RaJoLink: A Method for Finding Seeds of Future Discoveries in Nowadays Literature
Authors: Tanja Urbančič, Ingrid Petrič, Bojan Cestnik
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

In this article we present a study which demonstrates the ability of the method RaJoLink to uncover candidate hypotheses for future discoveries from rare terms in existing literature. The method is inspired by Swanson's ABC model approach to finding hidden relations from a set of articles in a given domain. The main novelty is in a semi-automated way of suggesting which relations might have more potential for new discoveries and are therefore good candidates for further investigations. In our previous articles we reported on a successful application of the method RaJoLink in the autism domain. To support the evaluation of the method with a well-known example from the literature, we applied it to the migraine domain, aiming at reproducing Swanson's finding of magnesium deficiency as a possible cause of migraine. Only literature which was available at the time of the Swanson's experiment was used in our test. As described in this study, in addition to actually uncovering magnesium as a candidate for formulating the hypothesis, RaJoLink pointed also to interferon, interleukin and tumor necrosis factor as candidates for potential discoveries connecting them with migraine. These connections were not published in the titles contemporary to the ones used in the experiment, but have been recently reported in several scientific articles. This confirms the ability of the RaJoLink method to uncover seeds of future discoveries in existing literature by using rare terms as a beacon.
New compilation languages based on structured decomposability
Authors: Knot Pipatsrisawat, Adnan Darwiche
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We introduce in this paper two new, complete propositional languages and study their properties in terms of (1) their support for polytime operations and (2) their ability to represent boolean functions compactly. The new languages are based on a structured version of decomposability--a property that underlies a number of tractable languages. The key characteristic of structured decomposability is its support for a polytime conjoin operation, which is known to be intractable for unstructured decomposability. We show that any CNF can be compiled into formulas in the new languages, whose size is only exponential in the treewidth of the CNF. Our study also reveals that one of the languages we identify is as powerful as OBDDs in terms of answering key inference queries, yet is more succinct than OBDDs.
Content analysis for proactive intelligence: marshaling frame evidence
Authors: A. P. Sanfilippo, A. J. Cowell, S. C. Tratz, A. M. Boek, A. K. Cowell, C. Posse, L. C. Pouchard
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Modeling and simulation have great potential as technologies capable of aiding analysts in making accurate predictions of future situations to help provide competitive advantage and avoid strategic surprise. However, to make modeling and simulation effective, an evidence-marshaling process is needed that addresses the information needs of the modeling task, as detailed by subject matter experts. We suggest that such an evidence-marshaling process can be obtained by combining natural language processing and content analysis techniques to provide quantified qualitative content assessments, and describe a case study on the acquisition and marshaling of frames from unstructured text.
Pragmatic constraints on semantic presupposition
Authors: Yafa Al-Raheb
Venue: Proceedings of the Third Workshop on Constraints and Language Processing (2006)

The literature investigating the notion of presupposition in Discourse Representation Theory (DRT) has mainly been dubbed as being semantic (Simons 2003). This paper investigates the linguistic application of pragmatic-based constraints to the 'semantic' notion of presupposition in DRT. By applying pragmatic-based constraints to presuppositional phenomenon, we aim to defend DRT against the accusation that DRT's interpretation of presuppositional phenomenon is essentially 'semantic' and push this interpretation further towards the pragmatic side of the semantic/pragmatic interface.
Parallel Algorithms for Solving Markov Decision Process
Authors: Qi Zhang, Guangzhong Sun, Yinlong Xu
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Markov decision process (MDP) provides the foundations for a number of problems, such as artificial intelligence studying, automated planning and reinforcement learning. MDP can be solved efficiently in theory. However, for large scenarios, more investigations are needed to reveal practical algorithms. Algorithms for solving MDP have a natural concurrency. In this paper, we present parallel algorithms based on dynamic programming. Meanwhile, the cost of computation and communication complexity of this method is analyzed. Moreover, experimental results demonstrate excellent speedups and scalability.
txteagle: Mobile Crowdsourcing
Authors: Nathan Eagle
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

We present txteagle, a system that enables people to earn small amounts of money by completing simple tasks on their mobile phone for corporations who pay them in either airtime or MPESA (mobile money). The system is currently being launched in Kenya and Rwanda in collaboration with the mobile phone service providers Safaricom and MTN Rwanda. Tasks include translation, transcription, and surveys. User studies in Nairobi involving high school students, taxi drivers, and local security guards have been completed and the service has recently launched in Kenya nationwide.