ppxscal/embedding_network huggingface dataset:
Research on Reverse Engineering for Plastic Operation
Authors: Lv Yutao, Yi Jinhui, Liu Yang, Zhao Lei, Zhang Yugang, Chen Junguo
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

In this paper, analysis is presented aiming at the problem of plastic operation which is usually finished depending on doctor's experience only. Based on it, reverse engineering of freeform surface is studied and applied for plastic operation. The sufferer's freeform surface is measured and reconstructed to digital model. And the surgery result could be emulated beforehand. Breast plastic is chosen as example to test the technical application. The sufferer could consult the surgery operation with doctor by using reverse engineering. And the sufferer's desire could be satisfied and the successful probability of surgery be improved.
Superconvergence of Discontinuous Galerkin Methods for Convection-Diffusion Problems
Authors: Zuozheng Zhang, Ziqing Xie, Zhimin Zhang
Venue: Journal of Scientific Computing (2009)

Some discontinuous Galerkin methods for the linear convection-diffusion equation ¿¿ u¿+bu¿=f are studied. Based on superconvergence properties of numerical fluxes at element nodes established in some earlier works, e.g., Celiker and Cockburn in Math. Comput. 76(257), 67---96, 2007, we identify superconvergence points for the approximations of u or q=u¿. Our results are twofold:1) For the minimal dissipation LDG method (we call it md-LDG in this paper) using polynomials of degree p, we prove that the leading terms of the discretization errors for u and q are proportional to the right Radau and left Radau polynomials of degree p+1, respectively. Consequently, the zeros of the right-Radau and left-Radau polynomials of degree p+1 are the superconvergence points of order p+2 for the discretization errors of the potential and of the gradient, respectively.2) For the consistent DG methods whose numerical fluxes at the mesh nodes converge at the rate of O(h p+1), we prove that the leading term of the discretization error for q is proportional to the Legendre polynomial of degree p. Consequently, the approximation of the gradient superconverges at the zeros of the Legendre polynomial of degree p at the rate of O(h p+1).Numerical experiments are presented to illustrate the theoretical findings.
On the compilability and expressive power of propositional planning formalisms
Authors: Bernhard Nebel
Venue: Journal of Artificial Intelligence Research (2000)

The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of "expressive power" is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of "compilation schemes" between planning formalisms. Using this notion, we analyze the expressiveness of a large family of propositional planning formalisms, ranging from basic STRIPS to a formalism with conditional effects, partial state specifications, and propositional formulae in the preconditions. One of the results is that conditional effects cannot be compiled away if plan size should grow only linearly but can be compiled away if we allow for polynomial growth of the resulting plans. This result confirms that the recently proposed extensions to the GRAPHPLAN algorithm concerning conditional effects are optimal with respect to the "compilability" framework. Another result is that general propositional formulae cannot be compiled into conditional effects if the plan size should be preserved linearly. This implies that allowing general propositional formulae in preconditions and effect conditions adds another level of difficulty in generating a plan.
An Introduction to Certificate Translation
Authors: Gilles Barthe, César Kunz
Venue: Foundations of Security Analysis and Design V: FOSAD 2007/2008/2009 Tutorial Lectures (2009)

In a Proof-Carrying Code scenario, certificate generation remains a challenging problem. Typically, it is implemented as a compiler module that targets low-level executable code. Hence, since automatic, the properties under verification are limited to very simple safety policies. Discharging verification conditions automatically for arbitrarily complex properties is unfeasible. Therefore, it requires the support of tool-based interactive verification, which commonly targets high-level structured code. To connect source code verification and compiled code certification we have proposed a technique to build, from a certificate of the source program, a certificate for the result of its compilation. In this tutorial, we illustrate the principles of this technique, certificate translation, in the context of a certified quicksort algorithm. For each transformation step that defines the compiler, we explain the corresponding transformation of the certificate.
An Isochore Map of the Human Genome Based on the GCDT Method
Authors: Anhui Wang, Guiran Chang, Xuegong Deng, Xingbo Zhao
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Due to the isochore structures associate with many important biological functions, a good segment algorithm for the isochore boundaries will provide much insight into the understanding of the human genome. The isochore map of human genome has been obtained by an algorithm based on the technique of GCDT in this paper. The obtained boundaries match well with the GCDT images in visualization. The human genome has very clear isochore structures.
Multi-pointing Method Using a Desk Lamp and Single Camera for Effective Human-Computer Interaction
Authors: Taehoun Song, Thien Cong Pham, Soonmook Jung, Jihwan Park, Keyho Kwon, Jaewook Jeon
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

Multi-pointing has become an important research interest, and is used in many computer applications to allow users to interact effectively with a program. Multi-pointing is used as an input method, and can also be fun and very user-friendly. However, in order to use the method, a complex and expensive hardware configuration is required. This paper presents a new and low cost method of multi-pointing based on a simple hardware configuration. Our method uses dual hand recognition, a table lamp, and a single CMOS camera. The table lamp provides a steady illumination environment for image processing, and the CMOS camera is mounted to maintain good stability. A single camera is used for dual hand recognition to achieve multi-pointing. Therefore, image processing does not require intensive computing which allows us to use a stand-alone system (including a 32 bit RISK processor). The results of the proposed method show that effective control navigation of applications such as Google Earth or Google Maps can be achieved.
Assessing the Eligibility of Kidney Transplant Donors
Authors: Francisco Reinaldo, Carlos Fernandes, Md. Anishur Rahman, Andreia Malucelli, Rui Camacho
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

Organ transplantation is a highly complex decision process that requires expert decisions. The major problem in a transplantation procedure is the possibility of the receiver's immune system attack and destroy the transplanted tissue. It is therefore of capital importance to find a donor with the highest possible compatibility with the receiver, and thus reduce rejection. Finding a good donor is not a straightforward task because a complex network of relations exists between the immunological and the clinical variables that influence the receiver's acceptance of the transplanted organ. Currently the process of analyzing these variables involves a careful study by the clinical transplant team. The number and complexity of the relations between variables make the manual process very slow. In this paper we propose and compare two Machine Learning algorithms that might help the transplant team in improving and speeding up their decisions. We achieve that objective by analyzing past real cases and constructing models as set of rules. Such models are accurate and understandable by experts.
Applying semantics to grid middleware
Authors: A. C. T. Vidal, F. J. S. Silva, S. T. Kofuji, F. Kon
Venue: Concurrency and Computation: Practice Experience (2009)

Scheduling parallel and distributed applications efficiently onto grid environments is a difficult task and a great variety of scheduling heuristics has been developed aiming to address this issue. A successful grid resource allocation depends, among other things, on the quality of the available information about software artifacts and grid resources. In this article, we propose a semantic approach to integrate selection of equivalent resources and selection of equivalent software artifacts to improve the scheduling of resources suitable for a given set of application execution requirements. We also describe a prototype implementation of our approach based on the Integrade grid middleware and experimental results that illustrate its benefits. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Cultural Prescription vs. User Perception of Information Architecture for Culture Centred Website: A Case Study on Muslim Online User
Authors: Wan Abdul Wan Mohd Isa, Nor Laila Md. Noor, Shafie Mehad
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper reports the overview for the understanding of Islamic culture from the perspective of Islamic experts and Muslims based on the commonalities found in Hofstede's cultural dimension and Islamic worldview values. The understanding was gained from Wan Abdul Rahim et al. (2008) and a replication survey of VSM `94. We used this understanding as the benchmark for conducting experimental study to examine the time performance of Muslim online user in searching and purchasing books from two separate websites. The two websites were imposed with Islamic dimensions based from; (1) religious interpretation and; (2) user perception. The results of the paired-samples t-test showed that website imposed with Hofstede's dimension from religious interpretation is the better ones. Thus provide the indication that website that displays the cultural dimensions based on the religion prescriptions, will has a positive affect on the performance level regardless the current changes of the state of culture.
Developers and Moderators: Observations in the Co-development of an Online Social Space
Authors: David Gurzick, Kevin F. White
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Online social spaces have emerged at the confluence of three notable trends: an increasing amount of interaction occurring over digital channels, an awareness of the range of technical and social affordances such spaces provide, and a growing participatory culture that fosters member involvement in the creation and maintenance of digital locales. At the same time, these trends offer both great promise and significant challenges to the creation and maintenance of online social spaces. This paper unpacks the observations from the creation of one such online social space developed with involvement from the moderators tasked with facilitating its operation. Observations run the gamut from the technical (modifying system features to meet described work practices) to the social (fostering a joint ownership in the success of the social space) and set the stage for a broad research agenda for discovering best practice in constructing social spaces online.
Feature extraction through local learning
Authors: Yijun Sun, Dapeng Wu
Venue: Statistical Analysis and Data Mining (2009)

RELIEF is considered one of the most successful algorithms for assessing the quality of features. It has been recently proved that RELIEF is an online learning algorithm that solves a convex optimization problem with a margin-based objective function. Starting from this mathematical interpretation, we propose a novel feature extraction algorithm, referred to as local feature extraction (LFE), as a natural generalization of RELIEF. LFE collects discriminant information through local learning and can be solved as an eigenvalue decomposition problem with a closed-form solution. A fast implementation of LFE is derived. Compared to principal component analysis, LFE also has a clear physical meaning and can be implemented easily with a comparable computational cost. Compared to other feature extraction algorithms, LFE has an explicit mechanism to remove irrelevant features. Experiments on synthetic and real-world data are presented. The results demonstrate the effectiveness of the proposed algorithm. &copy; 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2: 34-47, 2009
Toward Constructing an Electroencephalogram Measurement Method for Usability Evaluation
Authors: Masaki Kimura, Hidetake Uwano, Masao Ohira, Ken-Ichi Matsumoto
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This paper describes our pilot study toward constructing an electroencephalogram (EEG) measurement method for usability evaluation. The measurement method consists of two steps: (1) measuring EEGs of subjects for several tens of seconds after events or tasks that are targets to evaluate, and (2) analyzing how much components of the alpha and/or beta rhythm are contained in the measured EEGs. However, there only exists an empirical rule on measurement time length of EEGs for usability evaluation. In this paper, we conduct an experiment to reveal the optimal time length of EEGs for usability evaluation by analyzing changes of EEGs over time. From the results of the experiments, we have found that the time length suitable for usability evaluation was more than 0~56.32 seconds.
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Authors: José R. Correa, Martin Skutella, José Verschae
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first part of the paper we prove that the power of preemption, i.e., the ratio between the makespan of an optimal nonpreemptive and an optimal preemptive schedule, is exactly 4. This result is a definite answer to an important basic open problem in scheduling. The proof of the lower bound is based on a clever iterative construction while the rounding technique we use to prove the upper bound is an adaptation of Shmoys and Tardos' rounding for the generalized assignment problem. In the second part of the paper we apply this adaptation to the more general setting in which orders, consisting of several jobs, have to be processed on unrelated parallel machines so as to minimize the sum of weighted completion times of the orders. We obtain the first constant factor approximation algorithms for the preemptive and nonpreemptive case, improving and extending a recent result by Leung et. al.
Adapting a lexicalized-grammar parser to contrasting domains
Authors: Laura Rimell, Stephen Clark
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Most state-of-the-art wide-coverage parsers are trained on newspaper text and suffer a loss of accuracy in other domains, making parser adaptation a pressing issue. In this paper we demonstrate that a CCG parser can be adapted to two new domains, biomedical text and questions for a QA system, by using manually-annotated training data at the pos and lexical category levels only. This approach achieves parser accuracy comparable to that on newspaper data without the need for annotated parse trees in the new domain. We find that retraining at the lexical category level yields a larger performance increase for questions than for biomedical text and analyze the two datasets to investigate why different domains might behave differently for parser adaptation.
Hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints
Authors: F. Jabbarizadeh, M. Zandieh, D. Talebi
Venue: Computers and Industrial Engineering (2009)

One of the common assumptions in the field of scheduling is that machines are always available in the planning horizon. This may not be true in realistic problems since machines might be busy processing some jobs left from previous production horizon, breakdowns or preventive maintenance activities. Another common assumption is the consideration of setup times as a part of processing times, while in some industries, such as printed circuit board and automobile manufacturing, not only setups are an important factor but also setup magnitude of a job depends on its immediately preceding job on the same machine, known as sequence-dependent setup times. In this paper, we consider hybrid flexible flowshops with sequence-dependent setup times and machine availability constraints caused by preventive maintenance. The optimization criterion is the minimization of makespan. Since this problem is NP-hard in the strong sense, we propose three heuristics, based on SPT, LPT and Johnson rule and two metaheuristics based on genetic algorithm and simulated annealing. Computational experiments are performed to evaluate the efficiencies of the algorithms.
IBM System Storage N Series
Venue:  (2009)

This IBM Redbooks publication provides a basic understanding of the IBM System StorageTM N series hardware and software features. It discusses topics such as installation, setup, and administration for both the N series filer and clients and provides example scenarios of some features. Corporate workgroups, distributed enterprises, and small to medium-sized companies are increasingly seeking to network and consolidate storage to improve availability, reduce costs, share information, and protect and secure information. These organizations require enterprise-class solutions capable of addressing immediate storage needs cost-effectively while providing an upgrade path for future requirements. IT managers need a maximum degree of flexibility to design the architecture that best supports the requirements of multiple types of data and a broad range of applications. IBM System Storage N series is designed to meet these requirements. It supports Ethernet environments, enabling economical network-attached storage (NAS) and iSCSI deployments. It also functions as a unification engine that is designed to allow you to simultaneously serve both file and block-level data across a single network. These are demanding procedures that, for some solutions, require multiple, separately managed systems. The flexibility of N series allows it to address the storage needs of a wide range of organizations, including distributed enterprises and data centers for midrange enterprises. N series also supports sites with computer-intensive and data-intensive enterprise applications, such as database, data warehousing, workgroup collaboration, and messaging. 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
Induction on Failure: Learning Connected Horn Theories
Authors: Tim Kimber, Krysia Broda, Alessandra Russo
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that produce multiple clauses in response to a single seed example. A common denominator of these systems is a restricted hypothesis search space, within which each clause must individually explain some example E, or some member of an abductive explanation for E. This paper proposes a new IE approach, called Induction on Failure (IoF), that generalises existing Horn clause learning systems by allowing the computation of hypotheses within a larger search space, namely that of Connected Theories. A proof procedure for IoF is proposed that generalises existing IE systems and also resolves Yamamoto's example. A prototype implementation is also described. Finally, a semantics is presented, called Connected Theory Generalisation, which is proved to extend Kernel Set Subsumption and to include hypotheses constructed within this new IoF approach.
Solving Storage Limitations Using a Peer-to-Peer Web File System
Authors: Florian Mircea Boian, Rares Florin Boian
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Running out of disk space is a problem that appears moreoften then one would desire, even though the hard–drivecapacities are becoming larger and the price per gigabytelower. This is mainly due to the significant increase in thedata manipulated by the average computer user, as well asthe expected user reluctance to go out and buy another diskwhen the existing one is full. Besides the usual solution ofdeleting useless data from the hard–drive, the user can sign–up for an online backup plan, and move some files there.The paper offers an alternative solution to this problemthrough collaborative data storage in a peer–to–peer system.The proposed system will be made transparent to the userthrough a user–space file system implemented using theFUSE kernel module. The peer–to–peer communication willbe done using Web Services. The data discovery will be doneusing the Chord algorithm.
Comparison of transient and static test methods for chip-to-sink thermal interface characterization
Authors: B. Smith, T. Brunschwiler, B. Michel
Venue: Microelectronics Journal (2009)

Accurate thermal interface characterization is essential for high flux microelectronic package design. However, it is increasingly difficult as interfacial bond lines are thinned and thermal interface materials (TIM) evolve to more complex formulations with better performance. This paper compares a static versus transient characterization method targeted at the chip-to-package interface in a test fixture that closely resembles a packaged chip. The static method requires measurements over multiple bond line thicknesses while the transient method yields additional information about the package at the cost of greater numerical complexity, hardware requirements, sensitivity to noise and experimental uncertainty. Both are compared with existing techniques. We conclude that the static method is more generally-applicable while transient is well-suited to rapid characterization of the interface when the rest of the package is well-defined. While both methods are sensitive to the accuracy and resolution of temperature and bondline thickness measurements, the transient technique is additionally sensitive to the relative contribution of the TIM in the full junction-to-ambient thermal path. These points are illustrated through experimental results and compact numerical modeling.