ppxscal/embedding_network huggingface dataset:
Durability Analysis of SnAgCu Solder Joints for an Aerospace Application
Authors: Amir M. Lajimi, Joel Cugnoni, John Botsis
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

In this work, a deep analysis of the reliability of lead-free (SnAgCu) solders in comparison with conventional tin-lead (SnPb) solders was done for a particular aerospace application. Creep properties of this solder composition were investigated, and results were validated with a thermal shock test. A 0805 resistor was considered to simulate creep deformation, an electronic board was used for a thermal shock test to check continuity of the circuit for the specified mission, and finally a detailed metallographic study was done to examine microstructure of solder joints after thermal shock test. Main constitutive relations were implemented in commercial finite-element analysis software (ABAQUS 6.5), to predict creep strain accumulation under thermal loads. Moreover, effects of implementing different constitutive relations in compare with life prediction models were investigated. Overall, both solders are highly reliable with this number of thermal cycles; however, SnAgCu shows higher life time under this type of loading.
Multiple 3D Object tracking for augmented reality
Authors: Youngmin Park, Vincent Lepetit, Woontack Woo
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

We present a method that is able to track several 3D objects simultaneously, robustly, and accurately in real-time. While many applications need to consider more than one object in practice, the existing methods for single object tracking do not scale well with the number of objects, and a proper way to deal with several objects is required. Our method combines object detection and tracking: Frame-to-frame tracking is less computationally demanding but is prone to fail, while detection is more robust but slower. We show how to combine them to take the advantages of the two approaches, and demonstrate our method on several real sequences.
Lower Boundedness of Sequence of the T-fuzzy Valued Integral Induced by Monotonous Numerical Series
Authors: Li Yanhong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Through introducing the generalized triangle norm, the T-fuzzy valued integrals are defined to be aimed at nonnegative measurable fuzzy valued functions in fuzzy measure spaces, and lower boundedness of sequences of the T-fuzzy valued integrals are discussed through the monotonous numerical series and generalized triangle norm , and then the theory of the fuzzy integrals has been enriched.
Multi-label dimensionality reduction via dependence maximization
Authors: Yin Zhang, Zhi-Hua Zhou
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Multi-label learning deals with data associated with multiple labels simultaneously. Like other machine learning and data mining tasks, multi-label learning also suffers from the curse of dimensionality. Although dimensionality reduction has been studied for many years, multi-label dimensionality reduction remains almost untouched. In this paper, we propose a multi-label dimensionality reduction method, MDDM, which attempts to project the original data into a lower-dimensional feature space maximizing the dependence between the original feature description and the associated class labels. Based on the Hilbert-Schmidt Independence Criterion, we derive a closed-form solution which enables the dimensionality reduction process to be efficient. Experiments validate the performance of MDDM.
Mining Spread Patterns of Spatio-temporal Co-occurrences over Zones
Authors: Feng Qian, Qinming He, Jiangfeng He
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

The research tracks the spread of co-occurrence phenomena over the zonal space. Spread patterns of spatio-temporal co-occurrences over zones (SPCOZs) represent the spread structures over the zones for the subsets of features whose events co-locate in space and time. SPCOZs are of great use in many applications, such as tracking the evolutions of infectious diseases and ecological disasters in space and time. However, finding SPCOZs is computationally expensive due to large size of history data sets, exponential number of feature combinations, and complex interest measures. In this paper, we propose a novel Spread Pattern Tree (SP-Tree) to index the spread elements of the SPCOZs which holds the monotonic property with the size of the co-occurrences. We also propose an efficient mining algorithm (SPCOZ-Miner) for mining SPCOZs. The experimental evaluation with both synthetic and real-world data sets shows our algorithm is effective and much more efficient than a straight approach.
A New Oriented-Diffusion Image Inpainting Framework for Striped Texture Images
Authors: Zhu Yong, Wang Gui, Han Zhike
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Modeling Texture image is a challenge in image processing. The classical PDE model proposed for digital image inpainting can not be directly applied to striped texture image inpainting, since variation analysis of the PDE model shows that it may lead to trivial solution. In this paper, A novel PDE framework is proposed for striped texture image inpainting. The major idea is to employ the orientation field to act as the constraint of the diffusion directions. Once the orientation field can be correctly estimated, the gray level information can be propagated into the inpainting domain along a local fix orientation, which characterizes the orientation of the stripes. This paper is also an attempt to proposing an inpainting model which explicitly encoding spatial or geometrical correlations which mean orientation field in our models, especially for striped texture image or texture image with similar patterns. Numerical experimental results show that the proposed models are superior to common PDE models when inpainting striped texture images.
An Approach to Security Policy Configuration Using Semantic Threat Graphs
Authors: Simon N. Foley, William M. Fitzgerald
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding and/or management of the overall security policy requirements, which may, in turn, unnecessarily expose the enterprise to known threats. This paper proposes a threat management approach, whereby knowledge about the effectiveness of mitigating countermeasures is used to guide the autonomic configuration of security mechanisms. This knowledge is modeled in terms of Semantic Threat Graphs, a variation of the traditional Threat/Attack Tree, extended in order to relate semantic information about security configuration with threats, vulnerabilities and countermeasures. An ontology-based approach to representing and reasoning over this knowledge is taken. A case study on Network Access Controls demonstrates how threats can be analyzed and how automated configuration recommendations can be made based on catalogues of best-practice countermeasures.
An Iterative Model for Discovering Person Coreferences Using Name Frequency Estimates
Authors: Octavian Popescu, Bernardo Magnini
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

In this paper we present an approach to person coreference in a large collection of news, based on two main hypothesis: first, coreference is an iterative process, where the easy cases are addressed first and are then made available as an incrementally enriched resource for resolving more difficult cases. Second, at each iteration coreference among two person names is established according to a probabilistic model, where a number of features (e.g. frequency of first and last names) are taken into account. The approach does not assume any prior knowledge about persons mentioned in the collection and requires basic linguistic processing (named entity recognition) and resources (a dictionary of person names). The system parameters have been estimated on a Italian news corpus of 5K and then experimented on a collection containing more than 7 millions person names. Evaluation, over a sample of four days news, shows that the error rate of the system (1.4%) is above a baseline (5.4%) for the task. Finally, we discuss open issues for evaluation.
Magic Lantern Guides: SONY DSLR A100 Multimedia Workshop
Authors: Lark Books
Venue:  (2009)

Magic Lantern GuidesMultimedia WorkshopsThe worlds best photographic package! Magic Lantern Guides and DVDs have always provided the very best, most in-depth coverage of a cameras ins-and-outs. Now, theres even more magic on the market for photographers: the MAGIC LANTERN MULTIMEDIA WORKSHOP. Its a complete class in digital photography with a D-SLR cameraone that enables you to learn the essentials at your own pace, in the comfort in your own home. The attractive package includes:- Specific 80-minute DVD: An authoritative DVD guide made just for your model. Created by photographers for photographers, it covers specific camera features and functions. The format allows you to navigate easily between different topics and review chapters any time.- Taking Great Digital Photos: This full-color, 64-page book gets newcomers to the digital world started right. Packed with picture-taking tips and information on digital file formats, it explains how f/stops and shutter speeds work together to create an exposure, which focal lengths are best for various subjects, and how to get accurate color with white balance.- Great Photos with Your Digital SLR 60-minute DVD: This live-action tutorial demystifies digital shooting, and shows how to compose photos; choose the best picture-quality settings; improve results with the built-in flash; and interpret your histogram. Plus, see when to trust your cameras automatic settingsor change them yourself. - Quick Reference Wallet Card: This laminated take-along is an ideal in-the-field key to camera and menu operations.Theres nothing else like this on the market! 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
Depth as Randomness Deficiency
Authors: Lu&#x00ed;s Antunes, Armando Matos, Andr&#x00e9; Souto, Paul Vit&#x00e1;nyi
Venue: Theory of Computing Systems (2009)

Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditional lower bound on the computation time from a given program in absence of auxiliary information. Variants known as logical depth and computational depth are expressed in Kolmogorov complexity theory. We derive quantitative relation between logical depth and computational depth and unify the different depth notions by relating them to A.&#x00a0;Kolmogorov and L.&#x00a0;Levin&#x2019;s fruitful notion of randomness deficiency. Subsequently, we revisit the computational depth of infinite strings, study the notion of super deep sequences and relate it with other approaches.
Students' perceptions of teaching technologies, application of technologies, and academic performance
Authors: Thomas Li-Ping Tang, M. Jill Austin
Venue: Computers Education (2009)

This study examined business students' perceptions of four objectives (i.e., Enjoyment, Learning, Motivation, and Career Application) across five teaching technologies (i.e., Projector, PowerPoint, Video, the Internet, and Lecture), business professors' effective application of technologies, and students' academic performance. We collected data from 215 students at a regional state university in the USA. We developed Students' Perceptions of Technology Scale, SPOTS, specifically for the present study, used the most rigorous criteria, and investigated reliability, convergent and discriminant validity, exploratory and confirmatory factor analysis, and measurement invariance of this scale. Mean scores revealed that Video conveyed the highest amount of Enjoyment. PowerPoint provided the highest amount of Learning and Motivation. The Internet provided the highest Career Application for future jobs. Younger students preferred Video, whereas older students favored Lecture. Regression results showed that the use of Video for Learning, Projector and Lecture for Enjoyment, PowerPoint for career and Motivation, and the Internet for Learning contributed to professors' teaching effectiveness. Students' high ratings for professors' effective use of the Lecture method and low expectation for the use of a Projector predicted their self-reported GPA (academic performance). Professors may use a different mix of technologies in the classroom and use them creatively in order to promote the most Learning for students and satisfy students' Learning needs and objectives.
Comparison of Cluster Algorithms for the Analysis of Text Data Using Kolmogorov Complexity
Authors: Tina Geweniger, Frank-Michael Schleif, Alexander Hasenfuss, Barbara Hammer, Thomas Villmann
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

In this paper we present a comparison of multiple cluster algorithms and their suitability for clustering text data. The clustering is based on similarities only, employing the Kolmogorov complexity as a similiarity measure. This motivates the set of considered clustering algorithms which take into account the similarity between objects exclusively. Compared cluster algorithms are Median kMeans, Median Neural Gas, Relational Neural Gas, Spectral Clustering and Affinity Propagation.
Par-KAP: a knowledge acquisition tool for building practical planning systems
Authors: Leliane Nunes De Barros, James Hendler, V. Richard Benjamins
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Recently, attention has been focused on providing Knowledge Acquisition (KA) support for building practical planning systems. Such support is needed to guide a knowledge engineer in selecting planning methods, as well as for building and validating the planning knowledge-base for a given practical domain. Following current practice in knowledge acquisition, developing KA tools for planning requires that a number of planning knowledge components are made explicit. This includes explicating (i) a planning domain ontology, (ii) a library of problem-solving methods (PSMs) used in planning, and (iii) a set of domain requirements that are used to select a suitable PSM. In this paper, we summarize the planning knowledge components which we have identified in previous work, and, based on these, present an implementation (Par-KAP) that can exploit these models to aid knowledge engineers in constructing practical planning systems.
Multi-language machine translation through interactive document normalization
Authors: Aurélien Max
Venue: Proceedings of the 7th International EAMT workshop on MT and other Language Technology Tools, Improving MT through other Language Technology Tools: Resources and Tools for Building MT (2003)

Document normalization is an interactive process that transforms raw legacy documents into semantically well-formed and linguistically controlled documents with the same communicative intention content. A paradigm for content analysis has been implemented to select candidate semantic representations of the communicative content of an input document. This implementation reuses the formal content specification of a multilingual controlled authoring system. As a consequence, a candidate semantic representation can not only be associated with a text in the language of the input document, but also in all the languages supported by the system. This paper presents how multilingual versions of an input legacy document can be obtained interactively with a proposed implementation, and discusses the advantages and limitations of this kind of normalizing translation.
Constraints on the use of language, gesture and speech for multimodal dialogues
Authors: Bertrand Gaiffe, Laurent Romary
Venue: Referring Phenomena in a Multimedia Context and their Computational Treatment (1997)

In the domain of natural language understanding and more precisely man-machine dialogue design, there are usually two trends of research which seem to be rather differentiated. On the one hand, many studies have tackled the problem of interpreting spatial references expressed in verbal utterances, focusing in particular on the different geometric or functionnal constraints which are bound to the existance of a 'source' (or site) element in relation to which a 'target' is being situated. Such studies are usually based upon fine grained linguistic descriptions for different languages (Vandeloise, 1986). On the other hand, the problem raised by the integration of a gestural mode within classical NL interfaces has yielded some specific research about the association of demonstrative or deictic Nps together with designations, as initited by Bolt some two decades ago (cf. Thorisson et alii, 1992; Bellalem and Romary, 1995). Our aim in this paper is to show that the different phenomena described in the context of spatial reference or multimodal interaction should not necessarily be considered as two independant issues, but should rather be analysed in a unified way to account for the fact that they are both based on linguistic and perceptual data.
The Analysis of Government Supervision on Third-party Payment Under Cost-utility Model
Authors: Yiqun Li, Xuezheng Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

With the development of third-party payment in China, to some extend, it alleviates the problem of e-commerce and helps the development of e-commerce as well. However, it also brings some new issues, especially about government supervision. In this paper, the necessity of government supervision from three aspects is discussed because of the financial risks caused by the third-party payment. Furthermore, the theoretical government supervision model is proposed to demonstrate the best regulatory point for policy formulation based on cost-utility analysis.
TuLiPA: towards a multi-formalism parsing environment for grammar engineering
Authors: Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert, Kilian Evang
Venue: Proceedings of the Workshop on Grammar Engineering Across Frameworks (2008)

In this paper, we present an open-source parsing environment (T&uuml;bingen Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar (RCG) as a pivot formalism, thus opening the way to the parsing of several mildly context-sensitive formalisms. This environment currently supports tree-based grammars (namely Tree-Adjoining Grammars (TAG) and Multi-Component Tree-Adjoining Grammars with Tree Tuples (TT-MCTAG)) and allows computation not only of syntactic structures, but also of the corresponding semantic representations. It is used for the development of a tree-based grammar for German.
Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality
Authors: Chendong Li
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Binary constraint is an important constraint class that has been studied in both Constraint (Logic) Programming community [5] and Mathematical Programming community [3,4]. In [6] we studied Functional Constraints in Binary Constraint Satisfaction Problems (BCSPs) and developed efficient variable elimination algorithms based on variable substitutions (For details please refer to [6]). On the basis of our variable elimination algorithms for Functional Constraints, we further explored a special case of BCSPs that consisted of only Bi-Functional Constraints, which were called $ \mathcal{I}$ Constraints in our experiments. Afterward we extended our elimination algorithms to solve integer programs with two variables per inequality. These problems are known as TVPIs that have been studied in [3,4].
Partially Enhanced Competitive Learning
Authors: Ryotaro Kamimura
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

In this paper, we propose a new method to extract explicit features for competitive learning as well as self-organizing maps. The method aims to enhance final internal representations by conventional methods. We first train networks by conventional methods and compute enhanced information by focusing upon some specific input units or variables. Because we focus upon some specific inputs and activate competitive units, this enhancement is called partial enhancement. Then, networks are retrained to imitate the states obtained by partial enhancement. Final representations obtained by this retraining generate representations influenced by these specific variables. We applied the method to the famous Iris problem and the air pollution problem. In both problems, partial enhancement methods could produce clearer feature maps, superior to those obtained by self-organizing maps.
A microchannel heat exchanger design for microelectronics cooling correlating the heat transfer rate in terms of Brinkman number
Authors: HeeSung Park
Venue: Microsystem Technologies (2009)

Microchannel heat exchangers are a well known device in the application of microelectronics cooling. In this paper, liquid microchannel heat exchangers were designed and investigated with varying channel width in order to find the maximum cooling efficiency when combined with pumping performance. A recently developed correlation of heat transfer rate in terms of Nusselt number and Brinkman number was adopted to predict cooling efficiency of the microchannel heat exchanger and was compared with the experimental results. Conventional heat transfer theories and numerical commercial code were also used to predict the cooling efficiency. The measured minimum thermal resistance of the microchannel heat exchanger showed a good agreement with the prediction from the new correlation, whereas calculation results from conventional theories and numerical code showed large divergence. It can be seen that the microchannel heat exchanger can be optimized when combined with pumping performance. In addition, the new correlation of heat transfer rate in terms of Brinkman number can be quite a useful tool in design of microchannel heat exchanger. 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