ppxscal/embedding_network huggingface dataset:
An FEM identification procedure for a wing section within a class of finite Laurent series
Authors: Teruo Ushijima, Kyousuke Handa, Homare Nishizaki, Fumihiro Chiba
Venue: Journal of Computational and Applied Mathematics (2009)

This paper concerns a determination procedure for conformal mapping of a wing through a finite element computation of potential function associated with the flow of 2-dimensional perfect fluid around the given wing section. Through our numerical procedure a family of mappings is obtained in the forms of finite Laurent series for an initial wing section input. Each member of the family describes a wing section located in a neighboring domain of the input one. Some of them could be expected as modified versions of the original wing section input, although they could not recover completely it. Inputting the shape of wing section has ambiguity in practical cases of wing sections such as the NACA23012 wing section. We would like to postulate that our identification procedure should be employed in the determination process of numerical profiles of the wing section considered, since identified ones are significantly easier in numerical processing than the original input shape.
UA-ZSA: web page clustering on the basis of name disambiguation
Authors: Zornitsa Kozareva, Sonia Vazquez, Andres Montoyo
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper presents an approach for web page clustering. The different underlying meanings of a name are discovered on the basis of the title of the web page, the body content, the common named entities across the documents and the sub-links. This information is feeded into a K-Means clustering algorithm which groups together the web pages that refer to the same individual.
The use of online synchronous discussion for web-based professional development for teachers
Authors: Yihsuan Chen, Nian-Shing Chen, Chin-Chung Tsai
Venue: Computers Education (2009)

This article described the experiences of an inservice professional development program for teachers with a focus on online synchronous discussions. Transcripts of six online synchronous discussions containing 3600 messages from an online teacher professional development course were analyzed. In addition, the researchers interviewed 10 participating teachers in order to understand their perceptions toward online synchronous discussions. According to the online discourse data, the online synchronous discussions served not only as a learning tool, but also an avenue for teachers to request and provide information, socialize and support each other. The analyses also revealed that the teachers posted more social messages in the beginning and the end of discussion, and most messages did not involve any cognitive and metacognitive skills. Moreover, the interview results showed that the information exchange during online synchronous discussion was not effective for some participating teachers. Based on the interview data, synchronous discussions appeared to hold little advantage when compared to face-to-face discussions for several participating teachers that we interviewed. The problem may be resulted from lack of self-regulated skills by the participants or from the role played by the moderator.
A Fast Optimization Method for Level Set Segmentation
Authors: Thord Andersson, Gunnar Läthén, Reiner Lenz, Magnus Borga
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed distance function, and evolved according to a motion equation in order to minimize a cost function. This function defines the objective of the segmentation problem and also includes regularization constraints. Gradient descent search is the de facto method used to solve this optimization problem. Basic gradient descent methods, however, are sensitive for local optima and often display slow convergence. Traditionally, the cost functions have been modified to avoid these problems. In this work, we instead propose using a modified gradient descent search based on resilient propagation (Rprop), a method commonly used in the machine learning community. Our results show faster convergence and less sensitivity to local optima, compared to traditional gradient descent.
Modeling of Multirate Input and Output Networked Control System
Authors: Xia Zhao, Wei Zhang, Hao Zhang, Qijun Chen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Asynchronous multirate sampling is a natural description for networked control system (NCS), while current research status on NCS has only focused on time-delay, data-packet loss, single-packet transmission, multiple-packets transmission, or their combinations. In this article, we will discuss modeling problem of NCS and then obtain an NCS model, which will take not only network-induced time-delay, but also asynchronous multirate sampling into account. We will only consider two kinds of asynchronous multirate NCS, i.e. multirate input and output NCS (MRINCS and MRONCS). And obvious advantages, e.g. MRINCS can improve control ability of digital controller and MRONCS can obtain more information about the plant and further increase control ability, will be seen from these two kinds of NCS.
Kinematics Simulation of a Twin Tripod Sliding Universal Joint
Authors: Fu-qin Yang, De-gong Chang, Xue-feng Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

This paper presents the kinematics of a twin tripod sliding universal joint consisting of two tripod joints connected by an intermediate shaft. By means of a multi-body dynamics technique, it has been investigated the intrinsic properties including the angle variation of input, output and intermediate shaft, the angular speed of the output shaft and the trajectory of tripod center, etc. These results provide practical guidelines for promoting the utilization and popularization of the twin tripod sliding universal joint.
A Gradient Descent Approximation for Graph Cuts
Authors: Alparslan Yildiz, Yusuf Sinan Akgul
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal results efficiently and the convenience of usage are some of the factors of this popularity. However, there are a few issues with graph cuts, such as inherent sequential nature of popular algorithms and the memory bloat in large scale problems. In this paper, we introduce a novel method for the approximation of the graph cut optimization by posing the problem as a gradient descent formulation. The advantages of our method is the ability to work efficiently on large problems and the possibility of convenient implementation on parallel architectures such as inexpensive Graphics Processing Units (GPUs). We have implemented the proposed method on the Nvidia 8800GTS GPU. The classical segmentation experiments on static images and video data showed the effectiveness of our method.
Implementation of Fine-Grained Algorithms on Graphical Processing Unit
Authors: Konstantin Kalgin
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

In this paper we solve the problem of mapping of fine- grained algorithm to graphical processing unit (GPU). Synchronous, asynchronous, block-synchronous and probabilistic cellular automata and explicit scheme of PDE are used as examples. Different implementation variants and their performances are presented. 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
An Implementation of Role-Base Trust Management Extended with Weights on Mobile Devices
Authors: Davide Fais, Maurizio Colombo, Aliaksandr Lazouski
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper describes the implementation of a library for the management and evaluation of Role-based Trust Management (RT) credentials and policies written in RTML, also extended with weights, in mobile devices. In particular, it describes the implementation of the library in J2ME. It is worth noticing, that RTML credentials are XML-like documents and thus the capability of porting these features on mobile devices makes the overall framework very interoperable with other RT frameworks (as for GRID systems). As policy language, we use actually a variant of RTML, whose policies are added with weights and are able to express quantitative experience-based notions of trust. It allow also to encode certain reputation and recommendation models. The obtained results show how the implementation on mobile devices is feasible and the running time acceptable for several applications.
A hybrid approach for building Arabic diacritizer
Authors: Khaled Shaalan, Hitham M. Abo Bakr, Ibrahim Ziedan
Venue: Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages (2009)

Modern standard Arabic is usually written without diacritics. This makes it difficult for performing Arabic text processing. Diacritization helps clarify the meaning of words and disambiguate any vague spellings or pronunciations, as some Arabic words are spelled the same but differ in meaning. In this paper, we address the issue of adding diacritics to undiacritized Arabic text using a hybrid approach. The approach requires an Arabic lexicon and large corpus of fully diacritized text for training purposes in order to detect diacritics. Case-Ending is treated as a separate post processing task using syntactic information. The hybrid approach relies on lexicon retrieval, bigram, and SVM-statistical prioritized techniques. We present results of an evaluation of the proposed diacritization approach and discuss various modifications for improving the performance of this approach.
A distributed approach to enabling privacy-preserving model-based classifier training
Authors: Hangzai Luo, Jianping Fan, Xiaodong Lin, Aoying Zhou, Elisa Bertino
Venue: Knowledge and Information Systems (2009)

This paper proposes a novel approach for privacy-preserving distributed model-based classifier training. Our approach is an important step towards supporting customizable privacy modeling and protection. It consists of three major steps. First, each data site independently learns a weak concept model (i.e., local classifier) for a given data pattern or concept by using its own training samples. An adaptive EM algorithm is proposed to select the model structure and estimate the model parameters simultaneously. The second step deals with combined classifier training by integrating the weak concept models that are shared from multiple data sites. To reduce the data transmission costs and the potential privacy breaches, only the weak concept models are sent to the central site and synthetic samples are directly generated from these shared weak concept models at the central site. Both the shared weak concept models and the synthetic samples are then incorporated to learn a reliable and complete global concept model. A computational approach is developed to automatically achieve a good trade off between the privacy disclosure risk, the sharing benefit and the data utility. The third step deals with validating the combined classifier by distributing the global concept model to all these data sites in the collaboration network while at the same time limiting the potential privacy breaches. Our approach has been validated through extensive experiments carried out on four UCI machine learning data sets and two image data sets.
Gaussian rational quadrature formulas for ill-scaled integrands
Authors: J. R. Illán González
Venue: Journal of Computational and Applied Mathematics (2009)

A flexible treatment of Gaussian quadrature formulas based on rational functions is given to evaluate the integral @!"If(x)W(x)dx, when f is meromorphic in a neighborhood V of the interval I and W(x) is an ill-scaled weight function. Some numerical tests illustrate the power of this approach in comparison with Gautschi's method.
The Myths of Object-Orientation
Authors: James Noble
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Object-Orientation is now over forty years old. In that time, Object-Oriented programming has moved from a Scandinavian cult to a world-wide standard. In this talk I'll revisit the essential principles -- myths -- of object-orientation, and discuss their role in the evolution of languages from SIMULA to Smalltalk to C+ + to Java and beyond. Only by keeping the object-oriented faith can we ensure full-spectrum object-oriented dominance for the next forty years in the project for a new object-oriented century!
The Data Governance Imperative
Authors: Steve Sarsfield
Venue:  (2009)

Attention to corporate information has never been more important than now. The ability to generate accurate business intelligence, accurate financial reports and to understand your business relies on better processes and personal commitment to clean data. Every byte of data that resides inside your company, and some that resides outside its walls, has the potential to make you stronger by giving you the agility, speed and intelligence that none of your competitors yet have. Data governance is the term given to changing the hearts and minds of your company to see the value of such information quality. "The Data Governance Imperative" is a business person's view of data governance. This practical book covers both strategies and tactics around managing a data governance initiative. The author, Steve Sarsfield, works for a major enterprise software company and is a leading expert in data quality and data governance, focusing on the business perspectives that are important to data champions, front-office employees, and executives. Steve runs an award-winning and world-recognized blog called the Data Governance and Data Quality Insider, offering practical wisdom. 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
Footstep Planning Based on Univector Field Method for Humanoid Robot
Authors: Youngdae Hong, Jong-Hwan Kim
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

This paper proposes a footstep planning algorithm based on univector field method optimized by evolutionary programming for humanoid robot to arrive at a target point in a dynamic environment. The univector field method is employed to determine the moving direction of the humanoid robot at every footstep. Modifiable walking pattern generator, extending the conventional 3D-LIPM method by allowing the ZMP variation while in single support phase, is utilized to generate every joint trajectory of a robot satisfying the planned footstep. The proposed algorithm enables the humanoid robot not only to avoid either static or moving obstacles but also step over static obstacles. The performance of the proposed algorithm is demonstrated by computer simulations using a modeled small-sized humanoid robot HanSaRam (HSR)-VIII.
Making Sense of Large Heaps
Authors: Nick Mitchell, Edith Schonberg, Gary Sevitsky
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

It is common for large-scale Java applications to suffer memory problems, whether inefficient designs that impede scalability, or lifetime bugs such as leaks. Making sense of heaps with many millions of objects is difficult given the extensive layering, framework reuse, and shared ownership in current applications. We present Yeti, a tool that summarizes memory usage to uncover the costs of design decisions, rather than of lower-level artifacts as in traditional tools, making it possible to quickly identify and remediate problems. Yeti employs three progressive abstractions and corresponding visualizations: it identifies costly groups of objects that collectively perform a function, recovers a logical data model for each, and summarizes the implementation of each model entity and relationship. Yeti is used by development and service teams within IBM, and has been effective in solving numerous problems. Through case studies we demonstrate how these abstractions help solve common categories of problems.
Realizing FIFO Communication When Mapping Kahn Process Networks onto the Cell
Authors: Dmitry Nadezhkin, Sjoerd Meijer, Todor Stefanov, Ed Deprettere
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Kahn Process Networks (KPN) are an appealing model of computation to specify streaming applications. When a KPN has to execute on a multi-processor platform, a mapping of the KPN model to the execution platform model should mitigate all possible overhead introduced by the mismatch between primitives realizing the communication semantics of the two models. In this paper, we consider mappings of KPN specification of streaming applications onto the Cell BE multi-processor execution platform. In particular, we investigate how to realize the FIFO communication of a KPN onto the Cell BE in order to reduce the synchronization overhead. We present a solution based on token packetization and show the performance results of five different streaming applications mapped onto the Cell BE.
An Epistemological Approach to Steganography
Authors: Rainer Böhme
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

Steganography has been studied extensively in the light of information, complexity, probability and signal processing theory. This paper adds epistemology to the list and argues that Simmon's seminal prisoner's problem has an empirical dimension, which cannot be ignored (or defined away) without simplifying the problem substantially. An introduction to the epistemological perspective on steganography is given along with a structured discussion on how the novel perspective fits into the existing body of literature.
A Decimal Floating-Point Adder with Decoded Operands and a Decimal Leading-Zero Anticipator
Authors: Liang-Kai Wang, Michael J. Schulte
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

The IEEE 754-2008 Standard for Floating-Point Arithmetic was officially approved this year. One of the most important revisions to IEEE 754-1985 is the introduction of decimal floating-point (DFP) formats and operations. Since IEEE 754-1985 was revised, major microprocessor vendors have been working on hardware designs and software libraries for decimal arithmetic. Because the new standard has been approved, many software vendors are planning to adapt the new decimal formats into their applications. Therefore, it is important to investigate efficient algorithms and hardware designs for common DFP arithmetic operations to improve the performance of these applications. This paper presents a novel DFP adder with decoded operands and a decimal leading-zero anticipator (LZA). The DFP adder is based on a previous DFP adder design with several new features, including a new internal format, an improved operand pre-correction stage, and a novel decimal LZA to obtain better timing for decimal addition and subtraction. Synthesis results show that the new DFP adder is roughly 14% faster than the previous design.
A Study about Recommendation Based on Underlying Desires
Authors: Masahiro Sawai, Yoshifumi Okada, Tomomasa Nagashima, Hiroshi Kubo
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

Today, consumers have been able to buy various items with development of e-commerce sites and so on, while it made difficult to find items suitable for the consumer's preference from many items. Because of such situation, recommendation systems that can present items suitable for user's preference have been required. When a person prefers an item, but hesitates what to do, it is an important criterion whether the person's desires is satisfied by the item or not.Thus, we analyzed relationship between consumer's desires and preferred items by Evaluation Grid Method,recommending items based on constructed Evaluation Grids.Moreover we investigated effectiveness of recommendation based on desires in our experiment and discussed about cross-category recommendation such as recommendation of item that have different attributes or categories.
Thermal-flow techniques for sub-35nm contact-hole fabrication using Taguchi method in electron-beam lithography
Authors: Te-Sheng Li, Szu-Hung Chen, Hsuen-Li Chen
Venue: Microelectronic Engineering (2009)

In this article, we demonstrate that 100nm contact-hole resist patterns can successfully and reliably be shrunk to 35nm after a thermal-flow procedure using Taguchi method. Many critical factors such as structure, thermal-flow baking temperature, baking time period and exposure dwell time affecting the critical dimensions (CDs) were optimized and discussed. The experiments were conducted using Taguchi method orthogonal array (OA) and the optimal thermal-flow parameter settings were determined by signal/noise ratio (SNR) and ANOVA analysis. The experimental results show that the most important factor in thermal-flow procedure is the baking temperature. The optimal parameter settings were Si/SiO"2 with thick resist, 155^o, 180s and 6@ms. Experiment results found that higher temperature provided larger shrink ratio but it cannot higher than 160^o. It is also noted that the proposed approach was reproducible due to the confirmation experiments SNRs within the 95% confidence interval. For pattern-uniformity study, the contact-hole profiles appear significantly indifferent after the thermal-flow process as distributed on five different locations and two spacings.
Shallow Parsing of Transcribed Speech of Estonian and Disfluency Detection
Authors: Kaili Müürisep, Helen Nigol
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)

This paper introduces our strategy for adapting a rule based parser of written language to transcribed speech. Special attention has been paid to disfluencies (repairs, repetitions and false starts). A Constraint Grammar based parser was used for shallow syntactic analysis of spoken Estonian. The modification of grammar and additional methods improved the recall from 97.5% to 97.6% and precision from 91.6% to 91.8%. Also, the paper gives a detailed analysis of the types of errors made by the parser while analyzing the corpus of disfluencies.