ppxscal/embedding_network huggingface dataset:
Single-Frame 3D Human Pose Recovery from Multiple Views
Authors: Michael Hofmann, Dariu M. Gavrila
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

We present a system for the estimation of unconstrained 3D human upper body pose from multi-camera single-frame views. Pose recovery starts with a shape detection stage where candidate poses are generated based on hierarchical exemplar matching in the individual camera views. The hierarchy used in this stage is created using a hybrid clustering approach in order to efficiently deal with the large number of represented poses. In the following multi-view verification stage, poses are re-projected to the other camera views and ranked according to a multi-view matching score. A subsequent gradient-based local pose optimization stage bridges the gap between the used discrete pose exemplars and the underlying continuous parameter space. We demonstrate that the proposed clustering approach greatly outperforms state-of-the-art bottom-up clustering in parameter space and present a detailed experimental evaluation of the complete system on a large data set.
Agent Based Modeling of Lung Metastasis-Immune System Competition
Authors: Marzio Pennisi, Francesco Pappalardo, Santo Motta
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

The Triplex vaccine is a cell vaccine developed as an immunopreventive approach to breast cancer. Recent studies showed that the same vaccine has a considerable therapeutic effect against lung metastases derived by mammary carcinoma[1].
Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation
Venue: ACL Workshops (2008)

Broad-coverage parsing has come to a point where distinct approaches can offer (seemingly) comparable performance: statistical parsers acquired from the Penn Treebank (PTB); data-driven dependency parsers; "deep" parsers trained off enriched treebanks (in linguistic frameworks like CCG, HPSG, or LFG); and hybrid "deep" parsers, employing hand-built grammars in, for example, HPSG, LFG, or LTAG. Evaluation against trees in the Wall Street Journal (WSJ) section of the PTB has helped advance parsing research over the course of the past decade. Despite some skepticism, the crisp and, over time, stable task of maximizing ParsEval metrics (i.e. constituent labeling precision and recall) over PTB trees has served as a dominating benchmark. However, modern treebank parsers still restrict themselves to only a subset of PTB annotation; there is reason to worry about the idiosyncrasies of this particular corpus; it remains unknown how much the ParsEval metric (or any intrinsic evaluation) can inform NLP application developers; and PTB-style analyses leave a lot to be desired in terms of linguistic information.
Decidability Results for Saturation-Based Model Building
Authors: Matthias Horbach, Christoph Weidenbach
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable whether a ground atom, a clause or even a formula holds in this minimal model of a satisfiable saturated clause set.We extend our superposition calculus for fixed domains with syntactic disequality constraints in a non-equational setting. Based on this calculus, we present several new decidability results for validity in the minimal model of a satisfiable finitely saturated clause set that in particular extend the decidability results known for ARM (Atomic Representations of term Models) and DIG (Disjunctions of Implicit Generalizations) model representations.
Delegating agency among researcher, biostatistician and computer machinery: modeling in biostatistics
Authors: Kenneth Wright
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Medical researchers exercise and delegate agency for making inferences or for making claims. In the biostatistical consultations discussed here, they encounter three key knowledge-producing agents in the "epistemic culture" (Knorr Cetina, 1999) of biostatistics: themselves, biostatistician and computer machinery. Who or what does what occurs amidst a "dance of agency" among the participants (Pickering, 1995). These interpretations provide support for recent reforms employing modeling approaches in science and mathematics instruction in K-16 settings.
Current and Emerging Security, Trust, Dependability and Privacy Challenges in Mobile Telecommunications
Authors: Reijo M. Savola
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

We discuss the near-term and far-term security, trust and dependability challenges in wireless and mobile telecommunications, in an always-connected environment. We identify some relevant technological and threat trends and propose research priorities in order to solve and respond to the future security-related challenges. Threat trends include increase of complexity and connectivity and challenges in wirelessness, user devices and network management. To overcome future challenges, new proactive solutions should be developed. Furthermore, metrics, methods and tools for security assurance, forensics and vulnerability management are needed. In particular, widely-accepted security, trust, dependability and privacy solutions for the Future Internet architecture are needed.
Blind identification of MISO-FIR channels
Authors: Carlos Estêvão R. Fernandes, Pierre Comon, Gérard Favier
Venue: Signal Processing (2010)

In this paper, we address the problem of determining the order of MISO channels by means of a series of hypothesis tests based on scalar statistics. Using estimated 4th-order output cumulants, we exploit the sensitiveness of a Chi-square test statistic to the non-Gaussianity of a stochastic process. This property enables us to detect the order of a linear finite impulse response (FIR) channel. Our approach leads to a new channel order detection method and we provide a performance analysis along with a criterion to establish a decision threshold, according to a desired level of tolerance to false alarm. Afterwards, we introduce the concept of MISO channel nested detectors based on a deflation-type procedure using the 4th-order output cumulants. The nested detector is combined with an estimation algorithm to select the order and estimate the parameters associated with different transmitters composing the MISO channel. By treating successively shorter and shorter channels, it is also possible to determine the number of sources.
Global asymptotic stability of neural networks with discontinuous activations
Authors: Jiafu Wang, Lihong Huang, Zhenyuan Guo
Venue: Neural Networks (2009)

Without assuming the boundedness and monotonicity of the neuron activations, we discuss the dynamics of a class of neural networks with discontinuous activation functions. The Leray-Schauder theorem of set-valued maps is successfully employed to derive the existence of an equilibrium point. A Lyapunov-like approach is applied to differential equations with discontinuous right-hand sides modeling the neural network dynamics, which yields conditions for global convergence or convergence in finite time. The obtained results extend previous works on global stability of neural networks with continuous neuron activations or discontinuous neuron activations.
An Efficient Binding Algorithm for Forward-chaining HTN Planning Based on Object-oriented Knowledge
Authors: Jingge Song, Jianzhong Cha, Yiping Lu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

An efficient improvement on the binding process of SHOP2 planner for hierarchical task network (HTN) planning is proposed by using some object-oriented formal knowledge. Two object-oriented structures, Structure of Object and Structure of Object Set are defined to separate SHOP2’s world state to two parts, object-oriented knowledge and predicate-based atoms. By preprocessing, improved binding algorithm can avoid searching in predicate-based state atoms when reasons about the type ofobject and the membership relation between two hierarchical objects, and thus the CPU time cost can be reduced. Experiments show that this approach can significantly increase the efficiency of binding process for forward-chaining HTN planning in systems concerning a large number of objects and with hierarchical structures without losing generality and easiness in modeling process.
A Novel Least Distortion Linear Gain Model for Halftone Image Watermarking Incorporating Perceptual Quality Metrics
Authors: Weina Jiang, Anthony T. Ho, Helen Treharne
Venue: Transactions on Data Hiding and Multimedia Security IV (2009)

In this paper, a least distortion approach is proposed for halftone image watermarking. The impacts of distortion and tonality problems in halftoning are analyzed. An iterative linear gain model is developed to optimize perceptual quality of watermarking halftone images with efficient computation complexity O(1). An optimum linear gain for data hiding error diffusion is derived and mapped into a standard linear gain model, with the tonality evaluated using the average power spectral density. As compared with Fu and Au's data hiding error diffusion method, our experiments show that our proposed linear gain model can achieve an improvement of between 6.5% to 12% using weighted signal-to-noise ratio (WSNR) and an improvement of between 11% to 23% measured by visual image fidelity (VIF).
Policy-Based Design of Human-Machine Collaboration in Manned Space Missions
Authors: Jurriaan van Diggelen, Jeffrey M. Bradshaw, Tim Grant, Matthew Johnson, Mark Neerincx
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

Team design is an important issue in manned planetary exploration. This paper demonstrates the feasibility of studying team design by using a computational policy approach for requirements engineering and system implementation.
On the Hybrid Extension of CTL and CTL +
Authors: Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL + by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H1CTL + and H1CTL, the hybrid extensions with one variable of CTL + and CTL, respectively, are expressively equivalent but H1CTL + is exponentially more succinct than H1CTL. On the other hand, HCTL + , the hybrid extension of CTL with arbitrarily many variables does not capture CTL ¿ , as it even cannot express the simple CTL ¿ property EGF p . The satisfiability problem for H1CTL + is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic.
Comparing Gestures and Traditional Interaction Modalities on Large Displays
Authors: António Neto, Carlos Duarte
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Interfaces based on gesture recognition offer a simple and intuitive alternative to the use of traditional menus, keyboard and mouse. In this paper we explore the field of gestural interaction on large screen displays, presenting the results of a study where users employ gestures to perform common actions in various applications suited for large displays. Results show the actions for which gestural interaction is a best asset compared to traditional interaction.
Implementation of Embedded Web Server Based on Mc9s12ne64
Authors: Zhang Yong, Wang Shouyi
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

With singlechip and internet development, embedded systems are making great progress, and among them embedded web server show extensively potential and prospect of application. The 16-bit singlechip MC9S12NE64 based on HCSl2 CPU core which is made by Freescale corporation, has an Ethernet media access controller(EMAC) and Ethernet physical transceiver(EPHY), and is equipped with compatible free bottom Protocol Stack “NE64_OpenTCP”.Therefore,we can easily develop one embedded web server based on MC9S12NE64,and link to internet.
A Proposal of Collection and Analysis System of Near Miss Incident in Nursing Duties
Authors: Akihisa Furukawa, Yusaku Okada
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)

In this study, we proposed collection and analysis system of near miss incident (CASN) as a support tool of safe activity at the medical institutions. CASN is consists of supporting software and reference list which helps risk managers who don't have special knowledge and skill do factor analysis easily and nurses write good reports for analysis. CASN accumulates the data of PSF of near miss incidents and gives the tendency of PSF at each post and analyzer. As a result, diverse factors are found by the analysis of the risk managers and we expect the diversity promotes the growth of the risk managers.
An Adaptive Algorithm for Smoothing Fingerprint Orientation Fields
Authors: Xiang Can, You Lin
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The traditional algorithm for smoothing fingerprint orientation fields was based on the low-pass filter. To improve this algorithm, a variable window adaptive smoothing algorithm for the fingerprint orientation fields is proposed based on the fingerprint orientation consistency. Our algorithm uses the correctness of the fingerprint orientation field to compute the weighted average of the orientation field. Experiments show that our algorithm can effectively deal with the orientation field images which have noises and really describe the topological structure of the fingerprint ridge.
A learning architecture for automating the intelligent environment
Authors: G. Michael Youngblood, Diane J. Cook, Lawrence B. Holder
Venue: Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3 (2005)

Developing technologies and systems for perception and perspicacious automated control of home and workplace environments is a challenging problem. We present a complete agent architecture for learning to automate the intelligent environment and discuss the development, deployment, and techniques utilized in our working intelligent environments. Empirical evaluation of our approach has proven its effectiveness at reducing inhabitant interactions by 72.2%.
Image Inpainting Algorithm Based on Successive Elimination
Authors: Ranran Zhang, Youdong Ding, Shuhan Wei
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Inpainting is an image interpolation problem with broad applications in image processing and vision analysis. In our research, a new algorithm is proposed for removing objects from digital images and filling in the hole that is left behind in a visually plausible way. To improve the efficiency, successive elimination algorithm ( SEA) is employed to obtain global optimal solution. The experiment results show that the inpainted images are visually pleasant and computational efficiency is improved obviously.
Semantic-based estimation of term informativeness
Authors: Kirill Kireyev
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

The idea that some words carry more semantic content than others, has led to the notion of term specificity, or informativeness. Computational estimation of this quantity is important for various applications such as information retrieval. We propose a new method of computing term specificity, based on modeling the rate of learning of word meaning in Latent Semantic Analysis (LSA). We analyze the performance of this method both qualitatively and quantitatively and demonstrate that it shows excellent performance compared to existing methods on a broad range of tests. We also demonstrate how it can be used to improve existing applications in information retrieval and summarization.
C-semiring Frameworks for Minimum Spanning Tree Problems
Authors: Stefano Bistarelli, Francesco Santini
Venue: Recent Trends in Algebraic Development Techniques: 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers (2009)

In this paper we define general algebraic frameworks for the Minimum Spanning Tree problem based on the structure of c-semirings. We propose general algorithms that can compute such trees by following different cost criteria, which must be all specific instantiation of c-semirings. Our algorithms are extensions of well-known procedures, as Prim or Kruskal, and show the expressivity of these algebraic structures. They can deal also with partially-ordered costs on the edges.
An Effective Target Tracking Method
Authors: MeiLi Shen
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Target tracking system has important application in military and civilian. In it, speed and accuracy are two important evaluations indicators. Harris algorithm is used to extract little part of target corner features which can improve this method’s speed. Then, the proposed method uses optic flow method which has high matching accuracy to match those extracted corner features in the following video frames. However, when the tracked target is rotated or transformation, the distributing of matched feature point is changed and target is easily lost. In order to overcome this shortcoming, bary algorithm is used to compute the bary of those matched features as displacement of target. It is proved by experiments that this method has not only high speed and tracking accuracy but also higher robustness to target rotation, transformation, shelter etc.
Comparing random starts local search with key feature matching
Authors: J. Ross Beveridge, Christopher R. Graves, Jim Steinborn
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

A new variant on key feature object recognition is presented. It is applied to optimal matching problems involving 2D line segment models and data. A single criterion function ranks both key features and complete object model matches. Empirical studies suggest that the key feature algorithm has run times which are dramatically less than a more general random starts local search algorithm. However, they also show the key feature algorithm to be brittle: failing on some apparently simple problems, while local search appears to be robust.
Carbon Dioxide Sequestration with Flue Gas Desulfurization (FGD) Gypsum
Authors: Hongqi Wang, Ningning Sun, Rona J. Donahoe
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Carbonation of industrial alkaline residues can be used as a CO2 sequestration technology to reduce carbon dioxide emissions. In this study, alkaline Ca-rich flue gas desulfurization (FGD) gypsum samples were carbonated to a varying extent. These materials are cheap, available near large point sources of CO2 (power plant), and tend to react relatively rapidly with CO2 due to their chemical instability. FGD gypsum was carbonated in aqueous suspensions to study its reaction mechanisms. Process variables, such as L/S ratio and reaction time, were systematically varied, and their influence on the carbonation rate was investigated. The carbonation reaction was found that the carbonation of Ca took place in two subsequent steps (i.e. dissolution and precipitation) rather than by solid-state conversion. The diffusion of Ca toward the surface of FGD gypsum particles probably determines the overall reaction. Research on further enhancement of the reaction rate, which would contribute to the development of a cost-effective CO2 sequestration process, should focus particularly on this mechanism.
A multi-agent-based approach for personnel scheduling in assembly centers
Authors: M. Sabar, B. Montreuil, J. -M. Frayret
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper presents a multi-agent-based approach for personnel scheduling problems in the context of a paced multi-product assembly center. Our purpose is to elaborate daily assignment of employees to workstations in order to minimize simultaneously the operational costs and personnel dissatisfactions. The proposed approach considers the individual competencies, mobility and preferences of each employee, as well as the personnel and competency requirements associated with each assembly activity given both the current master assembly schedule and the line balancing for each product. To benchmark the performance of the multi-agent approach, we use optimal solutions obtained through a linear programming model resolution using a commercial solver. Experimental results show that our multi-agent approach can produce high-quality and efficient solutions in a short computational time.
Everyone Abandons - Eventually: Understanding the Online Shopping Experience
Authors: Karen Renaud, Tunde Cockshott, Mario Hair
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Many e-stores use conversion rates, ie. how many people convert shopping baskets to actualpurchases as a primary indicator of success.A low conversion rate is used as a reason for spending moretime and effort on improving the usability of the site, assuming thatthe fault must be with the usability of the website.There is some question, however, about whether this focusis justified. We argue here that the online shopping experience has adistinct nature of its own, having different characteristics andencouraging different behaviours. We therefore carried out a study inorder tounderstand e-shopper behaviours - specifically their usage ofthe electronic shopping basket and wish list. We used an online survey to ask anumber of questions calculated to explore this usage. We report hereon our findings.We found that eventually, along with becoming more mature in the usageof online ecommerce, every e-shopper will abandon the shoppingbasket. Hence abandonment rates should not be used as a successindicator and a low conversion rate does not indicate that a site'susabiity is poor. We also identified three categories of e-shopper, thevague, the cost conscious and the windowshoppers. The first group had the strongest intention to purchase and were the least likely toabandon their shopping baskets with the other two groups being morelikely to abandon.Finally there werealso two distinct types of wish list user: the cleaners and thehoarders.The former were cost conscious and appeared to use the wishlist to monitor prices. The hoarders tended to have used e-commercefor longer and used the wish list to keep track of items they mightwell like to purchase in the future.