ppxscal/embedding_network huggingface dataset:
On the union of fat tetrahedra in three dimensions
Authors: Esther Ezra, Micha Sharir
Venue: Journal of the ACM (JACM) (2009)

We show that the combinatorial complexity of the union of n &ldquo;fat&rdquo; tetrahedra in 3-space (i.e., tetrahedra all of whose solid angles are at least some fixed constant) of arbitrary sizes, is O(n2+&epsiv;), for any &epsiv; > 0;the bound is almost tight in the worst case, thus almost settling a conjecture of Pach et al. [2003]. Our result extends, in a significant way, the result of Pach et al. [2003] for the restricted case of nearly congruent cubes. The analysis uses cuttings, combined with the Dobkin-Kirkpatrick hierarchical decomposition of convex polytopes, in order to partition space into subcells, so that, on average, the overwhelming majority of the tetrahedra intersecting a subcell &Delta; behave as fat dihedral wedges in &Delta;. As an immediate corollary, we obtain that the combinatorial complexity of the union of n cubes in R3, having arbitrary side lengths, is O(n2+&epsiv;), for any &epsiv; > 0 (again, significantly extending the result of Pach et al. [2003]). Finally, our analysis can easily be extended to yield a nearly quadratic bound on the complexity of the union of arbitrarily oriented fat triangular prisms (whose cross-sections have arbitrary sizes) in R3.
Text versus speech: a comparison of tagging input modalities for camera phones
Authors: Mauro Cherubini, Xavier Anguera, Nuria Oliver, Rodrigo de Oliveira
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Speech and typed text are two common input modalities for mobile phones. However, little research has compared them in their ability to support annotation and retrieval of digital pictures on mobile devices. In this paper, we report the results of a month-long field study in which participants took pictures with their camera phones and had the choice of adding annotations using speech, typed text, or both. Subsequently, the same subjects participated in a controlled experiment where they were asked to retrieve images based on annotations as well as retrieve annotations based on images in order to study the ability of each modality to effectively support users' recall of the previously captured pictures. Results demonstrate that each modality has advantages and shortcomings for the production of tags and retrieval of pictures. Several guidelines are suggested when designing tagging applications for portable devices.
A Simple Algorithm for Automatic Layout of BPMN Processes
Authors: Ingo Kitzmann, Christoph Konig, Daniel Lubke, Leif Singer
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Badly and inconsistently layouted business processes are hard to read for humans and therefore lack comprehensibility. Furthermore, processes generated by software have no layout at all. If stakeholders cannot comprehend the process descriptions, they are unable to validate them and ﬁnd mistakes. By offering a fully automatic layout algorithm for BPMN, it is possible to layout business processes in a consistent and clear way so that stakeholders can better and quicker comprehend the contents. This leads to better comprehensiblity and thus to better communication in BPM / SOA projects and allows for consistent process layouts throughout projects and enterprises - independent from the model source. In addition, this permits using generated models without manual layouting.
Shape preserving approximation by spatial cubic splines
Authors: V. P. Kong, B. H. Ong
Venue: Computer Aided Geometric Design (2009)

Shape preserving curve approximation is considered for an ordered set of spatial data points. Linear sufficient conditions for shape preserving criteria on convexity, inflection, collinearity and coplanarity are derived to ensure the approximant mimics the shape of the data. The cubic B-spline is used to generate the C^2 shape preserving approximation curve as this type of spline enables the shape preserving constraints to be formulated in a simple way.
Direction Parameter Identification of Motion-Blurred Image Based on Three Second Order Frequency Moments
Authors: Yiping Wang, Xinsheng Huang, Peng Jia
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

The quality of motion-blurred image restoration is highly dependent on the blur direction identification, which is an important and difficult problem in image restoration. In frequency domain, we summarize four important characteristics of motion-blurred image, and then propose a method to reduce the impact of deficiencies in frequency characteristics by using the binaryzation operation, the morphological operations and the main-connectivity detection method. Aiming at identifying the blur direction effectually, we propose an algorithm to detect the medial axis of white stripes by combining three second order moments of motion-blurred image in frequency domain. The algorithm in this paper is quite different from traditional algorithms which detect black stripes. Experimental results show that our algorithm is much faster and can achieve high accuracy and stability.
Conversational Case-Based Reasoning in Medical Classification and Diagnosis
Authors: David Mcsherry
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

In case-based reasoning (CBR) approaches to classification and diagnosis, a description of the problem to be solved is often assumed to be available in advance. Conversational CBR (CCBR) is a more interactive approach in which the system is expected to play an active role in the selection of relevant tests to help minimize the number of problem features that the user needs to provide. We present a new algorithm for CCBR called iNN(k) and demonstrate its ability to achieve high levels of accuracy on a selection of datasets related to medicine and health care, while often requiring the user to provide only a small subset of the problem features required by a standard k-NN classifier. Another important benefit of iNN(k) is a goal-driven approach to feature selection that enables a CCBR system to explain the relevance of any question it asks the user in terms of its current goal.
Research on Agile Job-shop Scheduling Problem Based on Genetic Algorithm
Authors: Ye Li, Da Tang, Yan Chen
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

A new genetic algorithm for solving the agile job shop scheduling is presented. The objective of this kind of job shop scheduling problem is minimizing the completion time of all the jobs, called the makespan, subject to the constraints. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also designed. It jumped from the local optimal solution, and the search area of solution is improved. Finally, the algorithm is tested on instances of 8 working procedure and 5 machines. The feasibility of GA is showed by simulation result
Considerations of Efficiency and Mental Stress of Search Tasks on Websites by Blind Persons
Authors: Junichi Iizuka, Akira Okamoto, Yasuo Horiuchi, Akira Ichikawa
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

We examined what kind of rating index was usable for verification of usability of websites for blind persons. The search time had a strong correlation with the NASA-TLX WWL scores. This would suggest a possibility to evaluate the usability by the search time. On the other hand, in respect of the accessibility check tool, its verification result had no correlation with NASA-TLX WWL scores, so it could not be used as a tool for verification of usability. We must develop a new usability check tool for blind persons. If we place functions with high usage frequency and high level of importance at a top of the website where a user can easily recognize them, it not only gives us a high level of visibility but also is effective for a blind person using voice output web browser as well.
Building Information Modeling: A Strategic Implementation Guide for Architects, Engineers, Constructors, and Real Estate Asset Managers
Authors: Dana K. Smith, Michael Tardif
Venue:  (2009)

The optimal approach to design, build, operate, and maintain buildings With this strategic guide to building information modeling (BIM), youll learn how to implement this new technology as part of a comprehensive systems approach to the design, construction, management, operation, maintenance, and use of buildings. The authors, among the leading experts and pioneers in BIM, show you how BIM supports more streamlined, integrated, and efficient business processes throughout the life cycle of buildings, from their initial conception through their eventual retirement or reuse. The result is better quality buildings, lower construction and operating costs, shorter project turnaround times, and a higher quality of building information to support better business decisions. Moreover, they set forth a plan for incorporating BIM into every organizations existing workflows, enabling you to take full advantage of all the benefits that BIM offers. Everything you need to implement a BIM approach is set forth in detail, including: The business case for BIM, demonstrating how it can improve collaboration, facilitate better design and construction, optimize workflow, and help reduce risk Guidance for meeting the challenges of BIM such as an entrenched business culture, the proliferation of BIM tools, and the uneven rates of BIM adoption The big picture view showing how your organization can work with business partners and fit into the building life cycle in a BIM-enabled industry Throughout the book, sample documents and figures help you better understand the principles of BIM and how it works in practice. In addition, first-hand accounts show you exactly how adopters of BIM have gained a competitive edge. Architects, engineers, constructors, building owners, and facility managers can turn to this book to realize the full potential of BIM and radically improve the way buildings are designed, built, operated, and maintained.
Adaptive Feedback for Rician Channels Exploiting Channel Statistic Information
Authors: Haijuan Yang, Ling Qiu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In multi-antenna multiuser downlink systems, an adaptive feedback scheme is proposed which is more efficient in Rician channels. First, a new concept of the angle distance distribution is introduced. Based on this theory and channel statistic information at the transmitter, we propose a limited feedback scheme in which the quantization codebook can be more close to the channel direction for each user. Moreover, without increasing the quantized error of the channel direction, this scheme can adapt the number of feedback bits to the strength of the line-of-sight (LOS) component of channel. The simulation results show that our scheme outperforms the strategies proposed for uncorrelated Rayleigh channels both on increasing throughput and on decreasing feedback overhead in Rician channels.
Multiple Kernel LSSVM in Empirical Kernel Mapping Space
Authors: Bo Yang, Yingyong Bu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Multiple kernel methods are superior to single kernel methods on treating multiple, heterogeneous data sources. Different from the existing multiple kernel methods which mainly work in implicit kernel space, we propose a novel multiple kernel method in empirical kernel mapping space. In empirical kernel mapping space, the combination of kernels can be treated as the weighted fusion of empirical kernel mapping samples. Based this fact, we developed a multiple kernel least squares support vector machine(LSSVM) to realize multiple kernel classification in empirical kernel mapping space. The experiments here illustrate that the proposed multiple LSSVM method is feasible and effective.
Service Systems Performance Ontology
Authors: Tad Gonsalves, Kiyoshi Itoh
Venue: Journal of Integrated Design Process Science (2008)

Service systems are designed with the intention of providing service to customers. Also known as a value co-creation system, a service system is a configuration of technology and organizational networks. This paper describes the development of a performance ontology for service systems. The core of the performance ontology describes the four primitives in service systems - customers, resources, service and protocols, and the semantic relations among them. The ontology provides a framework for integrating the quantitative performance evaluation of service systems specified as queuing networks or as stochastic Petri nets. The goal of the domain ontology is to eliminate the conceptual and terminological confusion among the members of a virtual community of performance analysts and designers.
Practical Collisions for EnRUPT
Authors: Sebastiaan Indesteege, Bart Preneel
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete hash functions, each having a different digest length.We present a practical collision attack on each of these seven EnRUPT variants. The time complexity of our attack varies from 236 to 240 round computations, depending on the EnRUPT variant, and the memory requirements are negligible. We demonstrate that our attack is practical by giving an actual collision example for EnRUPT-256.
Evaluation of Workflow Management Systems
Authors: Horst Gruber
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Workflow technology promises an increase in efficiency in the execution of business processes. The technology is widely accepted, but often the high costs exceed the promised benefits. Most companies perform an evaluation of workflow management systems (WFMS) tools before selecting their tool of choice. In this paper a method for selecting a WFMS is presented that is used in practice at Raiffeisen Informatik GmbH - an IT service provider of a banking corporation. The WFMS selection is based on a criteria catalogue covering aspects of functionality, architecture, integration, robustness, and secured prospects.
Neural networks letter: New passivity criteria for neural networks with time-varying delay
Authors: Zexu Zhang, Shaoshuai Mou, James Lam, Huijun Gao
Venue: Neural Networks (2009)

In this paper, improved criteria for the passivity of neural networks with time delay are proposed. The improvement is achieved by exploiting the finer relationships between the time-varying delay and its size bound which allow the use of more slack variables. It is illustrated via numerical examples that the proposed results are less conservative than those available in the literature.
ZigBee-Ready Wireless Water Leak Detector
Authors: Anders Pettersson, Johan Nordlander, Shaofang Gong
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

To prevent water leak from causing damage, the use of centralized alarming system consisting of several water leak detectors can be placed in targeted areas. However, the installation costs for these types of alarming systems are high, especially in already finished buildings since they require a lot of wiring for handling of the alarming system. To solve this problem water leak detectors that use the ZigBee technology to communicate with a control center have been studied and developed in this work. Thanks to the wireless connection, the sensor is easy to place in any area where water leak detection is desired. The wireless water detector system in the ZigBee network has a very high reliability and a long battery lifetime of 10 years.
Recognizing Human Actions by Their Pose
Authors: Christian Thurau, Václav Hlaváč
Venue: Statistical and Geometrical Approaches to Visual Motion Analysis: International Dagstuhl Seminar, Dagstuhl Castle, Germany, July 13-18, 2008. Revised Papers (2009)

The topic of human action recognition from image sequences gained increasing interest throughout the last years. Interestingly, the majority of approaches are restricted to dynamic motion features and therefore not universally applicable. In this paper, we propose to recognize human actions by evaluating a distribution over a set of predefined static poses which we refer to as pose primitives. We aim at a generally applicable approach that also works in still images, or for images taken from a moving camera. Experimental validation takes varying video sequence lengths into account and emphasizes the possibility for action recognition from single images, which we believe is an often overlooked but nevertheless important aspect of action recognition.The proposed approach uses a set of training video sequences to estimate pose and action class representations. To incorporate the local temporal context of poses, atomic subsequences of poses using n-gram expressions are explored. Action classes can be represented by histograms of poses primitive n-grams which allows for action recognition by means of histogram comparison. Although the suggested action recognition method is independent of the underlying low-level representation of poses, representations remain important for targeting practical problems. Thus, to deal with common problems in video based action recognition, e.g. articulated poses and cluttered background, a recently introduced Histogram of Oriented Gradient based descriptor is extended using a non-negative matrix factorization reconstruction.
Plane Graphs with Parity Constraints
Authors: Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Let S be a set of n points in general position in the plane. Together with S we are given a set of parity constraints, that is, every point of S is labeled either even or odd. A graph G on S satisfies the parity constraint of a point p ¿ S, if the parity of the degree of p in G matches its label. In this paper we study how well various classes of planar graphs can satisfy arbitrary parity constraints. Specifically, we show that we can always find a plane tree, a two-connected outerplanar graph, or a pointed pseudo-triangulation which satisfy all but at most three parity constraints. With triangulations we can satisfy about 2/3 of all parity constraints. In contrast, for a given simple polygon H with polygonal holes on S, we show that it is NP-complete to decide whether there exists a triangulation of H that satisfies all parity constraints.
Supporting bi-cluster interpretation in 0/1 data by means of local patterns
Authors: Ruggero G. Pensa, Céline Robardet, Jean-François Boulicaut
Venue: Intelligent Data Analysis (2006)

Clustering or co-clustering techniques have been proved useful in many application domains. A weakness of these techniques remains the poor support for grouping characterization. As a result, interpreting clustering results and discovering knowledge from them can be quite hard. We consider potentially large Boolean data sets which record properties of objects and we assume the availability of a bi-partition which has to be characterized by means of a symbolic description. Our generic approach exploits collections of local patterns which satisfy some user-defined constraints in the data, and a measure of the accuracy of a given local pattern as a bi-cluster characterization pattern. We consider local patterns which are bi-sets, i.e., sets of objects associated to sets of properties. Two concrete examples are formal concepts (i.e., associated closed sets) and the so-called &delta;-bi-sets (i.e., an extension of formal concepts towards fault-tolerance). We introduce the idea of characterizing query which can be used by experts to support knowledge discovery from bi-partitions thanks to available local patterns. The added-value is illustrated on benchmark data and three real data sets: a medical data set and two gene expression data sets.
A Case Study of Using Domain Engineering for the Conflation Algorithms Domain
Authors: Okan Yilmaz, William B. Frakes
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

In this study we used domain engineering as a method for gaining deeper formal understanding of a class of algorithms. Specifically, we analyzed 6 stemming algorithms from 4 different sub-domains of the conflation algorithms domain and developed formal domain models and generators based on these models. The application generator produces source code for not only affix removal but also successor variety, table lookup, and n-gram stemmers. The performance of the generated stemmers was compared with the stemmers developed manually in terms of stem similarity, source, and executable sizes, and development and execution times. Five of the stemmers generated by the application generator produced more than 99.9% identical stems with the manually developed stemmers. Some of the generated stemmers were as efficient as their manual equivalents and some were not.
Feature Selection in Marketing Applications
Authors: Stefan Lessmann, Stefan Voß
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

The paper is concerned with marketing applications of classification analysis. Feature selection (FS) is crucial in this domain to avoid cognitive overload of decision makers through use of excessively large attribute sets. Whereas algorithms for feature ranking have received considerable attention within the literature, a clear strategy how a subset of attributes should be selected once a ranking has been obtained is yet missing. Consequently, three candidate FS procedures are presented and contrasted by means of empirical experimentation on real-world data. The results offer some guidance which approach should be employed in practical applications and identify promising avenues for future research.
A Research of Cognitive Models for CGF in Tank Member
Authors: Qing Xue, Yang Wei, Zhiwu Tang, Guohui Zhang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

As we know in land battle tank member must perform many diverse tasks in their missions: navigation, system control, enemy engagement, and communication. As human capabilities are limited, the members will find themselves in situations where task load and other factors raise their mental burden severely. In turn, such stress has documented effects on quantitative and qualitative changes in task performance that could lead to mission failure. This paper describes the process of simulating tank member in a mission where mental burden is a key factor to the outcome of performance. Mental burden is represented as a behaviors moderator, which can be manipulated to demonstrate and predict behavioral effects. The cognitive models of the tank member are implemented as agents, interacting with tanks in a simulated battlefield. With high empirical validity as a main objective, the data acquired for the model was collected from experiments with tank member, including observations and task analyses. Afterwards, the simulation was verified with two Subject Matter Experts.