ppxscal/embedding_network huggingface dataset:
A New Approach for Clustered Microcalcifications Detection
Authors: Xinsheng Zhang, Hua Xie
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Clustered microcalcifications (MCs) in mammograms can be an important early sign of breast cancer in women. Their accurate detection is an important problem in computer aided detection. To improve the performance of detection, we propose a bagging-based twin support vector machine (B-TWSVM) to detect MCs. The ground truth of MCs in mammograms is assumed to be known as a priori. First each MCs is preprocessed by using a simple artifact removal filter and a well designed high-pass filter. Then the combined image feature extractors are employed to extract 164 image features. In the combined image feature space, the MCs detection procedure is formulated as a supervised learning and classification problem, and the trained B-TWSVM is used as a classifier to make decision for the presence of MCs or not. A large number of experiments were carried out to evaluate and compare the performance of the proposed MCs detection algorithms. The results of this study indicate the potential of proposed approach for computer-aided detection of MCs.
A New Method of Image Denoise Using Contourlet Transform
Authors: Li Xingmei, Yan Guoping, Chen Liang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

In all methods of image denoising, there is a problem always exists that is how to distinguish noise and edge. Now wavelet and contourlet are main tools in image denoising, but threshold is the key in wavelet and contourlet denoising. In order to distinguish noise and edge well, most methods in wavelet denoising are about the improvement of threshold. Aiming to resolve this problem, a new method which makes full use of the model of anisotropic receptive fields and nonsubsampled contourlet transform is proposed and it can distinguish the noise and edge effectively without the need to choose a suitable threshold.
Motion Estimation Algorithm Based on Motion Characteristics
Authors: Meng Lei, Li Hang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Motion estimation is one of the key technologies in inner-frame estimation encoding of video compression. In all kinds of compression standard, motion estimation based on block is used widely. The H. 264 was a kind of new generation video compression standard. In order to reduce the computational complexity of the motion estimation and improve the accuracy of motion compensation, a new search algorithm based on campaign features is pointed out. An adaptive model for starting point prediction is presented. And an alterable search pattern is introduced to improve the searching efficiency by adjusting its shape according to the motion characteristics. Experimental results show the new algorithm has better image quality and speed of the search advantage.
An Interview with Michael Schrage on Ubiquity
Authors: Ubiquity staff
Venue: Ubiquity (2008)

Author of several acclaimed books and numerous articles in such publications as Fortune and Technology Review, Michael Schrage is also a world-traveling consultant to all businesses great and small. He has been at MIT for many years, and his new academic home will be in that institution's Sloan Management School. 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
A hybrid approach to interactive machine translation: integrating rule-based, corpus-based, and example-based method
Authors: Kiyoshi Yamabana, Shin-ichiro Kamei, Kazunori Muraki, Shinichi Doi, Shinko Tamura, Kenji Satoh
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

With rapid development of the Internet, demand is rising high for a personal tool to support writing foreign language document such as e-mail. However, translation result of an automatic MT system is often not satisfactory for this purpose and requires post-editing. In addition, a purely rule-based system does not necessarily provide a satisfactory result for specific expressions because of lack of corresponding rules, nor purely example-based system for expressions not covered by examples. A hybrid approach is worthwhile to pursuit, where automatic and interactive approaches, as well as rule-oriented and data-oriented approaches are integrated. In this article, we propose a hybrid interactive machine translation method that combines rule-based, corpus-based and example-based approach with an interactive man-machine interface. We show that the previously proposed rule-based model can be naturally integrated with different translation paradigms. The interactive operations, previously introduced and shown to be useful for disambiguation in the rule-based transfer, are shown to be also useful to control covering by and selection of the matching examples, two major decisions in the example-based translation method. We also mention an online learning scheme of translation pairs from the user interaction.
Chaitin Ω Numbers and Halting Problems
Authors: Kohtaro Tadaki
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Chaitin [G. J. Chaitin, J. Assoc. Comput. Mach., vol. 22, pp. 329---340, 1975] introduced his Ω number as a concrete example of random real. The real Ω is defined as the probability that an optimal computer halts, where the optimal computer is a universal decoding algorithm used to define the notion of program-size complexity. Chaitin showed Ω to be random by discovering the property that the first n bits of the base-two expansion of Ω solve the halting problem of the optimal computer for all binary inputs of length at most n. In the present paper we investigate this property from various aspects. It is known that the base-two expansion of Ω and the halting problem are Turing equivalent. We consider elaborations of both the Turing reductions which constitute the Turing equivalence. These elaborations can be seen as a variant of the weak truth-table reduction, where a computable bound on the use function is explicitly specified. We thus consider the relative computational power between the base-two expansion of Ω and the halting problem by imposing the restriction to finite size on both the problems.
The difficulties of learning logic programs with cut
Authors: Francesco Bergadano, Daniele Gunetti, Umberto Trinchero
Venue: Journal of Artificial Intelligence Research (1993)

As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses containing cut cannot be learned using an extensional evaluation method, as is done in most learning systems. On the other hand, searching a space of possible programs (instead of a space of independent clauses) is unfeasible. An alternative solution is to generate first a candidate base program which covers the positive examples, and then make it consistent by inserting cut where appropriate. The problem of learning programs with cut has not been investigated before and this seems to be a natural and reasonable approach. We generalize this scheme and investigate the difficulties that arise. Some of the major shortcomings are actually caused, in general, by the need for intensional evaluation. As a conclusion, the analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages.
Generating spatio-temporal descriptions in pollen forecasts
Authors: Ross Turner, Somayajulu Sripada, Ehud Reiter, Ian P. Davy
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

We describe our initial investigations into generating textual summaries of spatiotemporal data with the help of a prototype Natural Language Generation (NLG) system that produces pollen forecasts for Scotland.
Discovering User Interface Requirements of Search Results for Mobile Clients by Contextual Inquiry
Authors: David L. Chan, Robert W. Luk, Hong Va Leong, Edward K. Ho
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

This paper reports our in situ study using contextual inquiry (CI). It solicits user requirements of hierarchically organized search results for mobile access. In our experiment, search activities of our subjects are recorded in the video, and the interviewer solicits the interface requirements, during and after the experiment. An affinity diagram is built as a summary of our findings in the experiment, and the major issues are discussed in this paper. The search behavior of our subjects is summarized into a flow chart. In this study, we report mobile interface features that are desired by our users in addition to those found in an earlier survey.
Compiling causal theories to successor state axioms and STRIPS-like systems
Authors: Fangzhen Lin
Venue: Journal of Artificial Intelligence Research (2003)

We describe a system for specifying the effects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify the effects of actions using domain rules, which are state constraints that can entail new action effects from old ones. Declaratively, an action domain in our language corresponds to a nonmonotonic causal theory in the situation calculus. Procedurally, such an action domain is compiled into a set of logical theories, one for each action in the domain, from which fully instantiated successor state-like axioms and STRIPS-like systems are then generated. We expect the system to be a useful tool for knowledge engineers writing action specifications for classical AI planning systems, GOLOG systems, and other systems where formal specifications of actions are needed.
Just-in-Time Adaptivity through Dynamic Items
Authors: Carsten Ullrich, Tianxiang Lu, Erica Melis
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Adaptive course generation becomes more appropriate for realistic usage scenarios and more flexible if it includes mechanisms deciding just-in-time which content, which exercises, which external resources, and which tools to include for an individual student. We developed such a just-in-time delivery framework (called Dynamic Items) that is used for enhancing the adaptivity of (educational) online material generated by the web-based platform ActiveMath. This paper describes the framework and discusses several new learning opportunities created by Dynamic Items for an individual student.
Efficient incremental beam-search parsing with generative and discriminative models: keynote talk
Authors: Brian Roark
Venue: Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (2004)

This talk will present several issues related to incremental (left-to-right) beam-search parsing of natural language using generative or discriminative models, either individually or in combination. The first part of the talk will provide background in incremental top-down and (selective) left-corner beam-search parsing algorithms, and in stochastic models for such derivation strategies. Next, the relative benefits and drawbacks of generative and discriminative models with respect to heuristic pruning and search will be discussed. A range of methods for using multiple models during incremental parsing will be detailed. Finally, we will discuss the potential for effective use of fast, finite-state processing, e.g. part-of-speech tagging, to reduce the parsing search space without accuracy loss. POS-tagging is shown to improve efficiency by as much as 20-25 percent with the same accuracy, largely due to the treatment of unknown words. In contrast, an 'islands-of-certainty' approach, which quickly annotates labeled bracketing over low-ambiguity word sequences, is shown to provide little or no efficiency gain over the existing beam-search.
Semantic interpretation of prepositions for NLP applications
Authors: Sven Hartrumpf, Hermann Helbig, Rainer Osswald
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

The proper interpretation of prepositions is an important issue for automatic natural language understanding. We present an approach towards PP interpretation as part of a natural language understanding system which has been successfully employed in various NLP tasks for information retrieval and question answering. Our approach is based on the so-called Multi-Net paradigm, a knowledge representation formalism especially designed for the representation of natural language semantics. The paper describes how the information about the semantic interpretation of PPs is represented in the lexicon and in PP interpretation rules and how this information is used during semantic analysis. Moreover, we report on experiments that evaluate the impact of using this information about PP interpretation on the CLEF question answering task.
Supporting Acceptable Dialogue Start Based on User Uninterruptibility Estimation for Avatar-Mediated Multi-tasking Online Communication
Authors: Takahiro Tanaka, Kyouhei Matsumura, Kinya Fujita
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Current users of real-time online communication tools have difficulty recognizing the status of interaction partners. Therefore, initiation dialogue has a risk of unintended interruption of the partner. To overcome the problem, we focused on application-switching (AS) as a potential intelligent activity discontinuity marker for uninterruptibility estimation. Preliminary experiments revealed an uninterruptibility reduction effect of AS. Therefore, we prototyped an acceptable dialogue start supporting agent system that allows users to recognize the uninterruptibility of interaction partners naturally. The system estimates uninterruptibility using AS, keystrokes, and mouse clicks, and presenting the results by avatar posture and motion using overlapping expressions to control the impression of uninterruptibility.
A new relaxed proximal point procedure and applications to nonlinear variational inclusions
Authors: Ram U. Verma
Venue: Computers Mathematics with Applications (2009)

A new relaxed algorithmic procedure based on the notion of A-maximal relaxed monotonicity is developed, and then the convergence analysis in the context of solving a general class of nonlinear inclusion problems is examined. Furthermore, some results involving A-maximal relaxed monotone mappings in a Hilbert space setting are included.
On Tamper-Resistance from a Theoretical Viewpoint
Authors: Paulo Mateus, Serge Vaudenay
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

Tamper-proof devices are pretty powerful. They can be used to have better security in applications. In this work we observe that they can also be maliciously used in order to defeat some common privacy protection mechanisms. We propose the theoretical model of trusted agent to formalize the notion of programmable secure hardware. We show that protocols not using tamper-proof devices are not deniable if malicious verifiers can use trusted agents. In a strong key registration model, deniability can be restored, but only at the price of using key escrow. As an application, we show how to break invisibility in undeniable signatures, how to sell votes in voting schemes, how to break anonymity in group/ring signatures, and how to carry on the Mafia fraud in non-transferable protocols. We conclude by observing that the ability to put boundaries in computing devices prevents from providing full control on how private information spreads: the concept of sealing a device is in some sense incompatible with privacy.
Boosting a Semantic Search Engine by Named Entities
Authors: Annalina Caputo, Pierpaolo Basile, Giovanni Semeraro
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Traditional Information Retrieval (IR) systems are based on bag-of-words representation. This approach retrieves relevant documents by lexical matching between query and document terms. Due to synonymy and polysemy, lexical methods produce imprecise or incomplete results. In this paper we present SENSE (SEmantic N-levels Search Engine), an IR system that tries to overcome the limitations of the ranked keyword approach, by introducing semantic levels which integrate (and not simply replace) the lexical level represented by keywords. Semantic levels provide information about word meanings, as described in a reference dictionary, and named entities. This paper focuses on the named entity level. Our aim is to prove that named entities are useful to improve retrieval performance. We exploit a model able to capture entity relationships, although they are not explicit in documents text. Experiments on CLEF dataset prove the effectiveness of our hypothesis.
Proactive Fault Detection Schema for Enterprise Information System Using Statistical Process Control
Authors: Chihoon Lee, Doohyung Lee, Jahwan Koo, Jinwook Chung
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

This paper proposes a proactive fault detection schema using adaptive statistical approaches in order to enhance system availability and reliability in the heterogeneous complicated information system environment. The proposed system applies Six Sigma SPC (Statistical Process Control) techniques already validated in industries in order to monitor the application system in the information system. This makes it possible to reduce false alarm rates for system faults and accurately detect faults by creating a control chart based on past performance data and controlling the distribution of performance based on the chart. The early detection of faults is also enabled through a fault prediction model. Therefore, the aforementioned system not only detect unknown or unseen faults but also resolve potential problems for system administrator by detecting abnormal behaviors before faults occur. In the experiment we show the superiority of our proposed model and the possibility to early detect system faults.
Impact of Quad-Core Cray XT4 System and Software Stack on Scientific Computation
Authors: S. R. Alam, R. F. Barrett, H. Jagode, J. A. Kuehn, S. W. Poole, R. Sankaran
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

An upgrade from dual-core to quad-core AMD processor on the Cray XT system at the Oak Ridge National Laboratory (ORNL) Leadership Computing Facility (LCF) has resulted in significant changes in the hardware and software stack, including a deeper memory hierarchy, SIMD instructions and a multi-core aware MPI library. In this paper, we evaluate impact of a subset of these key changes on large-scale scientific applications. We will provide insights into application tuning and optimization process and report on how different strategies yield varying rates of successes and failures across different application domains. For instance, we demonstrate that the vectorization instructions (SSE) provide a performance boost of as much as 50% on fusion and combustion applications. Moreover, we reveal how the resource contentions could limit the achievable performance and provide insights into how application could exploit Petascale XT5 system's hierarchical parallelism.
A Logging Approach for Effective Dependability Evaluation of Complex Systems
Authors: M. Cinque, D. Cotroneo, A. Pecchia
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

The dependability evaluation and management of complex systems is often based on the collection of field data from event logs. Nevertheless, key decisions about log production and management are usually left to the late stages of development, leading to heterogeneous, inaccurate, and redundant logs. This in turn decreases the level of trust on logs. This paper proposes to enrich traditional logging by defining a set of rules, to be followed at design time, specifically conceived to improve the quality of logged failure data and to ease the coalescence of redundant or equivalent data. A tool for processing our rule-based logs has been developed to show the feasibility of the approach. The tool is applied on a real-world case study in order to evaluate the effectiveness of the approach when compared with traditional logging.
An Analysis of Manufacturers' R&D Decision-Making in Defense Procurement with Incomplete Information
Authors: Tang Yifang, Li Yan, Ji Bingan, Luo Yunfeng
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

This paper is intended to research the manufacturers’ decision-making for R&D investment in defense procurement with incomplete information. On the basis of constructing the model of R&D investment scale adjustment of defense procurement, it explores the equilibrium of manufacturers’’ R&D investment decision-making in defense procurement on condition that the monopolistic contract valuation of manufacturers is incomplete information. It comes to the conclusion that: under certain conditions, manufacturers’ investment equilibrium of R&D projects is identical to the government expectation. However, if the monopolistic contract valuation of manufacturers is incomplete information, the investment equilibrium may deviate from the government expectation. And it’s even possible that manufacturers would retreat form the contest, which will severely influence the performance of government’s reimbursement policy. Therefore, in the practice of defense procurement R&D, the government must ensure that predicting the future demand accurately and adopting a definite objective of procurement in order to keep manufacturers’ anticipation about the monopolistic contact being consistent with it desired.
A Generic Goal-Based Certification Argument for the Justification of Formal Analysis
Authors: Ibrahim Habli, Tim Kelly
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Formal methods are powerful specification and verification techniques for establishing high confidence in safety-critical systems. However, there are a number of concerns about the use of evidence generated from formal methods, when used in place of conventional testing, for satisfying certain certification objectives. In this paper, we address this issue by reviewing two certification documents, DO-178B and the UK Defence Standard 00-56, focusing on their approach to accepting formal analytical evidence. We also present a generic goal-based safety case that can be instantiated to facilitate the justification and presentation of formal analysis to the certification authorities. The safety case is based on claims about (1) the achievement of the intents of the certification objectives, (2) the demonstration of the trustworthiness of formal analysis and (3) the practical feasibility of deploying formal methods within a specific project.