ppxscal/embedding_network huggingface dataset:
Probability of Failure on Demand --- The Why and the How
Authors: Jens Braband, Rüdiger Vom Hövel, Hendrik Schäbe
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

In the paper, we will study the PFD and its connection with the probability of failure per hour and failure rates of equipment using very simple models. We describe the philosophies that are standing behind the PFD and the THR. A comparison shows, how the philosophies are connected and which connections between PFH and PFD are implied. Depending on additional parameters, there can be deviations between safety integrity levels that are derived on the basis of the PFD and the PFH. Problems are discussed, which can arise when working with the PFD. We describe, how PFD and PFH in IEC 61508 are connected with the THR defined in the standard EN 50129.We discuss arguments that show, why care is needed when using the PFD. Moreover, we present a reasoning, why a probability of failure on demand (PFD) might be misleading.
Eliminating false positives during corner finding by merging similar segments
Authors: Aaron Wolin, Brandon Paulson, Tracy Hammond
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

We present a new comer finding algorithm based on merging like stroke segmentations together in order to eliminate false positive comers. We compare our system to two benchmark corner finders with substantial improvements in both polyline and complex fits.
Intelligence Computing Methods in Electronic Commerce and Security
Authors: Jing Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

This paper consists of a survey of various e-business, e-marketplaces, graphics and imaging processing, pattern recognition, computer vision, access control, authentication, authorization, etc. applications based on the intelligent computing, and also a summary of the recent techniques such as still artificial neural networks, swarm intelligence, artificial immune systems, fractal geometry, artificial life, ant colony algorithm, genetic algorithm, evolutionary algorithm, quantum computing. Intelligent computing can be powerful tools in several fields of electronic commerce and security.
Building a semantic lexicon of English nouns via bootstrapping
Authors: Ting Qian, Benjamin Van Durme, Lenhart Schubert
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium (2009)

We describe the use of a weakly supervised bootstrapping algorithm in discovering contrasting semantic categories from a source lexicon with little training data. Our method primarily exploits the patterns in sentential contexts where different categories of words may appear. Experimental results are presented showing that such automatically categorized terms tend to agree with human judgements.
Perception-Based Audio Authentication Watermarking in the Time-Frequency Domain
Authors: Sascha Zmudzinski, Martin Steinebach
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

Current systems and protocols based on cryptographic methods for integrity and authenticity verification of media data do not distinguish between legitimate signal transformation and malicious tampering that manipulates the content. Furthermore, they usually provide no localization or assessment of the relevance of such manipulations with respect to human perception or semantics. We present an algorithm for a authentication audio watermarking that uses a perception-based robust hash function in combination with robust watermarking to verify the integrity of audio recordings. Experimental results show that the proposed system provides both a high level of distinction between perceptually different audio data and a high robustness against signal transformations that do not change the perceived information.
Hypertext and deixis
Authors: Dan Loehr
Venue: Referring Phenomena in a Multimedia Context and their Computational Treatment (1997)

Hypertext linking is akin to deixis in that each points out of the discourse to the context in which the discourse occurs. The context of a hypertext document such as a World Wide Web page is the World Wide Web itself. This study investigates some linguistic aspects of hypertext, using as data Web pages from college students and commercial enterprises. I first look at the syntactic forms of hypertext anchors, finding them mostly noun phrases. Next, noting the intuitive similarities between hypertext and place deictics, I attempt to find a quantitative relationship between the two. I show that certain place deictics do occur more frequently inside of hypertext anchors than in the ordinary text of Web pages, but this is due to the popularity of the deictic here, as in <u>click here</u>. Observing that hypertext style guides prescribe against the usage of <u>click here</u>. I hypothesize that more experienced hypertext authors will disprefer this usage. Using the assumption that college students are less experienced than commercial Web authors, I am unable to confirm this hypothesis statistically. Finally, I examine the various types of deixis Web authors use in hypertext anch ors, finding the majority to be person deictics. I close by noting that the variety and creativity of deixis within hypertext anchors suggests that the relatively new medium of hypertext is a fully productive genre of natural language.
An Estimation Suited for VBR Service Parameters in the ATM Network
Authors: Lin-zhu Wang, Ya-qin Fang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

An estimation suited for network VBR(Variable bit rate) service parameters in the ATM(Asynchronous Transfer Mode) network In order to guarantee the quality of service in the ATM network effectively satisfied user’s request, this paper proposed a new kind of method to estimate the service parameters in the VBR ON/OFF source model. According to different service parameters, this method could satisfy the QoS(quality of service) request by the smallest network cost. The simulation result indicated that: in order to achieve the lowest call cost, the user would use low network cost to decide the value of service parameter. QoS achieved 10-6.
The Study on Knowledge Sharing about Student Affairs Management: Comparing DUT and IIT
Authors: Chen Xiaohui
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Students are the most important base why universities can be existed. How to improve the effectiveness and the efficiency of the management of student affairs is a crucial problem of every university and knowledge sharing is the key part of this problem. The comparing with DUT (Dalian University of Technology) and IIT (Illinois Institute of Technology) in knowledge sharing about student affairs management shows that knowledge sharing is necessary in student affairs management. Based on the comparison about the management of recruit students, student activities and student graduation between DUT and IIT, some suggestions of knowledge sharing about student affairs management are proposed to both DUT and IIT.
A Probabilistic Approach for Modeling Human Behavior in Smart Environments
Authors: Christoph Burghardt, Thomas Kirste
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

In order to act intelligently, a smart environment needs to have a notion about its users. Hidden Markov models are especially suited to recognize for example the state of a meeting in a smart meeting room, as they can cope with the noisy and intermittent sensor values. However, modeling the user behavior as an HMM is challenging, because of the high degrees of freedom the users have when acting in such a smart environment. Therefore, we compare two methods that ease the automatic generation of HMM and express the human behavior.
Bounding the false discovery rate in local Bayesian network learning
Authors: Ioannis Tsamardinos, Laura E. Brown
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Modern Bayesian Network learning algorithms are time-efficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development, variable selection, and causal discovery. The quality of the models, however, has often only been empirically evaluated; the available theoretical results typically guarantee asymptotic correctness (consistency) of the algorithms. This paper describes theoretical bounds on the quality of a fundamental Bayesian Network local-learning task in the finite sample using theories for controlling the False Discovery Rate. The behavior of the derived bounds is investigated across various problem and algorithm parameters. Empirical results support the theory which has immediate ramifications in the design of new algorithms for Bayesian Network learning, variable selection and causal discovery.
Optimal Rhode Island Hold'em poker
Authors: Andrew Gilpin, Tuomas Sandholm
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

Rhode Island Hold'em is a poker card game that has been proposed as a testbed for AI research. This game, with a tree size larger than 3.1 billion nodes, features many characteristics present in full-scale poker (e.g., Texas Hold'em). Our research advances in equilibrium computation have enabled us to solve for the optimal (equilibrium) strategies for this game. Some features of the equilibrium include poker techniques such as bluffing, slow-playing, check-raising, and semi-bluffing. In this demonstration, participants will compete with our optimal opponent and will experience these strategies firsthand.
Management of Work Site Health-Promotion Programs: A Review
Authors: Bernhard Zimolong, Gabriele Elke
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

The review starts with the assessment of needs for health promotion, particularly drawing upon the aging of the workforce in Europe and U.S. Basic intervention models for work site health promotion programs (WHP) are outlined. Recent findings of WHP outcomes underscore the requirement to integrate health promotion into the management system of the organization. Based on the framework of healthy work organization and of Health Management Systems the research project INOPE is described. The objective is the development, implementation, evaluation and transfer of a holistic health management system within the German tax administration.
Challenges and Opportunities in Preparing Students for Petascale Computational Science and Engineering
Authors: Sharon C. Glotzer, Bob Panoff, Scott Lathrop
Venue: IEEE Design Test (2009)

Global competitiveness requires a 21st century approach to educating students and preparing them to exploit next-generation technologies. The Blue Waters project aims to revolutionize undergraduate and graduate education by promoting new educational resources, models, and methods that transcend traditional boundaries of discipline and institution.
A Buffer Space Optimal Solution for Re-establishing the Packet Order in a MPSoC Network Processor
Authors: Daniela Genius, Alix Munier Kordon, Khouloud Zine El Abidine
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

We consider a multi-processor system-on-chip destined for streaming applications. An application is composed of one input and one output queue and in-between, several levels of identical tasks. Data arriving at the input are treated in parallel in an arbitrary order, but have to leave the system in the order of arrival. This scenario is particularly important in the context of telecommunication applications, where the duration of treatment depends on the packets' contents. We present an algorithm which re-establishes the packet order: packets are dropped if their earliness or lateness exceeds a limit previously fixed by experimentation; otherwise, they are stored in a buffer on the output side. Write operations to this buffer are random access, whereas read operations are in FIFO order. Our algorithm guarantees that no data is removed from the queue before it has been read. For a given throughput, we guarantee a minimum buffer size. We implemented our algorithm within the output coprocessor in the form of communicating finite state machines and validated it on a multi-processor telecommunication platform.
A method for large-scale l1-regularized logistic regression
Authors: Kwangmoo Koh, Seung-Jean Kim, Stephen Boyd
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Logistic regression with l1 regularization has been proposed as a promising method for feature selection in classification problems. Several specialized solution methods have been proposed for l1-regularized logistic regression problems (LRPs). However, existing methods do not scale well to large problems that arise in many practical settings. In this paper we describe an efficient interior-point method for solving l1-regularized LRPS. Small problems with up to a thousand or so features and examples can be solved in seconds on a PC. A variation on the basic method, that uses a preconditioned conjugate gradient method to compute the search step, can solve large sparse problems, with a million features and examples (e.g., the 20 Newsgroups data set), in a few tens of minutes, on a PC. Numerical experiments show that our method outperforms standard methods for solving convex optimization problems as well as other methods specifically designed for l1- regularized LRPs.
Experiences of Deploying an Indoor Building Sensor Network
Authors: Malka N. Halgamuge, Toong-Khuan Chan, Priyan Mendis
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Monitoring and automatic control of building environment is a crucial application of Wireless Sensor Network (WSN) in which maximizing network lifetime is a key challenge. We investigate the link quality distribution to obtain full coverage of signal strength in a single floor of building environment, experimentally.Our results confirmed the transitional region is particular concern in wireless sensor network since it accommodates high variance unreliable links. The reason due to thistransitional region in inside building environment could be the obstacles including concrete/brick walls, partitions, office furniture and other items affect as additional absorption term to the path loss.
Theories of Programming Languages, 1st edition
Authors: John C. Reynolds
Venue:  (2009)

This textbook is a broad but rigorous survey of the theoretical basis for the design, definition, and implementation of programming languages, and of systems for specifying and proving program behavior. It encompasses imperative and functional programming, as well as the ways of integrating these aspects into more general languages. Basic concepts and their properties are described with mathematical rigor, but the mathematical development is balanced by numerous examples of applications, particularly of program specification and proof, concurrent programming, functional programming (including the use of continuations and lazy evaluation), and type systems (including subtyping, polymorphism, and modularization). Assuming only knowledge of elementary programming, this text is perfect for advanced undergraduate and beginning graduate courses in programming language theory, and will also appeal to researchers and professionals in designing or implementing computer languages. 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
Inactivation of Cyclops by Chemical Oxidation in a Drinking Water Plant
Authors: Zuo Jinlong
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Cyclops of zooplankton propagated excessively in eutrophic water body and it couldn’t be effectively inactivated by the conventional disinfection process. In order to tackle this problem, a study of removal effect on Cyclops with oxidants in a drinking plant in China was conducted. Among five oxidants, chlorine dioxide was more effective against Cyclops and the potassium permanganate was the weakest with the same conditions. The full-scale results showed that Cyclops could be effectively removed from water by 1.0mg/L chlorine dioxide preoxidation cooperating with the conventional clarification process. The chlorite, by-product of prechlorine dioxide, was about at 0.45mg/L after filtration, which is lower than the critical value of the USEPA. The Ames test further showed that the mutagenicity in the treated water by chlorine dioxide preoxidation were obviously less than that of prechlorination.
DEEP - Differential Evolution Entirely Parallel Method for Gene Regulatory Networks
Authors: Konstantin Kozlov, Alexander Samsonov
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

DEEP - Differential Evolution Entirely Parallel method is applied to the biological data fitting problem. We introduce a new migration scheme, in which the best member of the branch substitutes the oldest member of the next branch, that provides a high speed of the algorithm convergence. We analyze the performance and efficiency of the developed algorithm on a test problem of finding the regulatory interactions within the network of gap genes that control the development of early Drosophila embryo. The parameters of a set of nonlinear differential equations are determined by minimizing the total error between the model behavior and experimental observations. The age of the individuum is defined by the number of iterations this individuum survived without changes. We used a ring topology for the network of computational nodes. The computer codes are available upon request.
Representation of Velocity Information by Using Tactile Apparent Motion
Authors: Kentaro Kotani, Toru Yu, Takafumi Asao, Ken Horii
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The objective of the study is to evaluate whether use of apparent motion can be an effective presentation method for velocity information. Ten subjects participated in the experiment where they perceived apparent motion generated by air-jet and they controlled the speed of the moving object on the PC screen to express their perceived velocity. As a result, perceived velocity decreased significantly as the ISOI was increased. Perceived velocity changed with the duration when the ISOI was between 30---70 ms and when apparent motion was provided. Duration only affected perceived velocity when apparent motion is provided to the subjects. In conclusion, apparent motion generated by stimuli can be effectively used to transmit precise velocity information tactually.
Generalised Matching
Authors: Raphael Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

Given a pattern p over an alphabet Σ p and a text t over an alphabet Σ t , we consider the problem of determining a mapping f from Σ p to ${\Sigma}_{t}^{+}$ such that t = f(p 1)f(p 2)...f(p m ). This class of problems, which was first introduced by Amir and Nor in 2004, is defined by different constraints on the mapping f. We give NP-Completeness results for a wide range of conditions. These include when f is either many-to-one or one-to-one, when Σ t is binary and when the range of f is limited to strings of constant length. We then introduce a related problem we term pattern matching with string classes which we show to be solvable efficiently. Finally, we discuss an optimisation variant of generalised matching and give a polynomial-time min $(1,\sqrt{k/OPT})$-approximation algorithm for fixed k.
Design and Implementation of a Radix-4 Complex Division Unit with Prescaling
Authors: Pouya Dormiani, Milo D. Ercegovac, Jean-Michel Muller
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

We present a design and implementation of a radix-4 complex division unit with prescaling of the operands. Specifically, we extend the treatment of the residual bound and errors due to the use of truncated redundant representation. The requirements for prescaling tables are simplified and a detailed specification of the table design is given. All principal components used in the design are described and the proposed optimizations are explained. The target platform for implementation was an Altera Stratix II FPGA for which we report timing and area requirements. For a precision of 36 bits, the implementation uses 1185 ALUTs, achieving a latency of 157 ns. The maximum clock frequency is 173.49 MHz.
Modeling Personalized Fuzzy Candlestick Patterns for Investment Decision Making
Authors: Chiung-Hon Leon Lee
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Candlestick theory is one of widely used technical analysis methods in stock and commodity investment domains. The investors can make their investment decision by observing the change of the candlestick lines and discovering specific candlestick patterns. A candlestick pattern is composed of some candlestick lines. Because different investors have different interpretation of a candlestick pattern, we model different parts of a candlestick line with fuzzy linguistic variables to create a fuzzy candlestick pattern. We also proposed a personal ontology for the candlestick pattern interpretation and decision making. The user can use data mining algorithm such as decision tree to mine some candlestick patterns for investment decision making and the mined candlestick patterns could be stored in a database for different user’s future reuse. Our approach can be future used with other financial time series prediction results to provide users more information for investment decision making.
Cross-Culture and Website Design: Cultural Movements and Settled Cultural Variables
Authors: Abdalghani Mushtaha, Olga Troyer
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

This paper reports on research carried out to determine the settled as well as other types of cultural markers including interface design elements and cultural dimensions that are appropriate to be used for cultural-centered website design and localization. For this, research discussed in this paper builds upon the existing body of research in website design and anthropologists' cultural dimensions. The research was performed in two phases: a first study was carried out to re-evaluate some pre-researched websites, and the second study was performed to evaluate and rank anthropologist's cultural dimensions. The findings of both research studies were evaluated and compared against earlier research results in order to provide insight into the evolution of the use of cultural markers. The results, a grouping of the cultural markers into 5 levels can be used for designing cultural-centered websites.