ppxscal/embedding_network huggingface dataset:
Mixed quasi complementarity problems in topological vector spaces
Authors: Ali P. Farajzadeh, Muhammad Aslam Noor, Saira Zainab
Venue: Journal of Global Optimization (2009)

In this paper, we introduce and consider a new class of complementarity problems, which is called the mixed quasi complementarity problems in a topological vector space. We show that the mixed quasi complementarity problems are equivalent to the mixed quasi variational inequalities. Using the KKM mapping theorem, we study the existence of a solution of the mixed quasi variational inequalities and mixed quasi complementarity problems. Several special cases are also discussed. Results obtained in this paper can be viewed as extension and generalization of the previously known results.
Identifying the Nature of Knowledge Using the Pressures Applied to a Computer Mouse
Authors: Martha E. Crosby, Curtis Ikehara, Wendy Ark
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

The nature of knowledge retention is not that a student either knows or doesn't. Using signal detection theory, the correct and incorrect responses a student provides can each be subdivided into two more levels of knowledge using the student's confidence of answer correctness. The proposed study will attempt to link confidence of answer correctness to the categorized pressures applied to a computer mouse allowing for the partitioning of responses. Twenty participants that were part of a pedagogical methods study will be retested using a computer-based multiple choice test and pressure sensitive computer mouse. Participants will also rate their confidence of answer correctness. It is hypothesized that the analyzed pressures applied to the computer mouse will indicate the confidence of answer correctness. Using the categorized pressures from the computer mouse allows for the real-time assessment of a student's knowledge to guide pedagogical follow-up.
On determining optimal fleet size and vehicle transfer policy for a car rental company
Authors: Zhaolin Li, Feng Tao
Venue: Computers and Operations Research (2010)

This paper considers how to determine the optimal fleet size and vehicle transfer policy for a rental-car company that serves two cities. In each city, there are single-trip and round-trip customers, where the former is given a higher priority. Because of the single-trip traffic, the number of cars at these two cities may become unbalanced. Hence, the central planner in each day needs to decide whether to transfer any cars from one city to the other. We develop a two-stage dynamic programming model, in which we determine the vehicle transfer policy in the second stage and the optimal fleet size in the first stage. Although the objective function could be neither concave nor quasi-concave due to lost sales, we can find the optimal fleet size and vehicle transfer policy by solving a series of linear programming problems. We propose a heuristic solution, which is based on a special case analysis, for the fleet size problem. A numerical study reveals that our heuristic solution for the fleet size performs well. However, if the corresponding vehicle transfer policy is not appropriate, the overall performance can drastically deteriorate even with the optimal fleet size. Several extensions of our basic model are also analyzed.
Java assembly language programming for the JVM
Authors: H. Paul Haiduk
Venue: Journal of Computing Sciences in Colleges (2009)

This tutorial/workshop is based on the assumption that the participant is looking for an alternative or supplement to the Intel Pentium or the Power PC real architectures for a computer organization and assembly language course in a CS curriculum. It is also designed to encourage those who have abandoned the traditional computer organization and assembly language course to reconsider such decision given that there now exists a universal, freely accessible, reasonably well-documented, ubiquitous architecture known as the Java Virtual Machine (JVM).
The Relationship between Technology Acceptance Model and Usability Test - Case of Performing E-learning Task with PDA
Authors: Wen-Chih Chiou, Chyuan Perng, Chin-Chao Lin
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

In the past, most studies used Technology Acceptance Model (TAM) to test the degree of technology acceptance and usability test to measure the task performance respectively. However, the relationship between TAM and usability has not been addressed. In this paper, an E-learning task was tested and validated with PDA. The findings show that TAM seems more suitable for general purpose context and usability test seems more reasonable and consistency for task-based context.
Stress Analysis and Intensity Design of Electromotor Used in Hazardous Location Present Powder and Explosives
Authors: Zhang Qinghui, Jin Guangfeng
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The design formula of the thickness of the encloser is educed according to the first intensity theory in material mechanics. The intensity of the encloser is designed with the common explosion insulation three-phase asynchronism electromotor of YB2 100L2-4. And the finite element simulation to the encloser by ANSYS shows that it is reliable in intensity with the thickness.
An extension of the ' 1/9 '-problem
Authors: Herbert Stahl, Thomas Schmelzer
Venue: Journal of Computational and Applied Mathematics (2009)

We consider the rational approximation of a perturbed exponential function (1)f(z)=u"0(z)+u"1(z)e^z on the negative real axis R"- with u"0 and u"1@?0 being rational functions. Building upon results from the solution of the ' 1/9'-problem by Gonchar and Rakhmanov, it is shown that rational best approximants to f share the fast asymptotic convergence of rational approximants to the exponential function, despite the fact that the functions (1) may differ substantially from the exponential. Our main result is that for k@?Z fixed, we have (2)limn->~@?f-rn,n+k*@?R"-1/n=19.28902549...=H with H being the same Halphen constant as that already known from the solution of the ' 1/9'-problem and r"n"m^*=r"n"m^*(f,R"-;@?) being a rational best approximant with denominator and numerator degrees at most n and m in the uniform norm on R"- to the function f of type (1). Further, it is shown that the convergence on R"-, which is characterized by (2), extends to compact subsets of the complex plane C and also to Hankel contours in C@?R"-, and this extension holds with the same asymptotic rate of convergence H. Many of the results for rational best approximants extend also to rational close-to-best approximants, which by our definition are rational approximants with a convergence behavior on R"- that is comparable in an nth root sense to that of the best approximants r"n","n^*. The asymptotic distribution of the poles of approximants is studied and determined. In the present paper we present only results, complete proofs are not given, however, some of the main ideas of the proofs are sketched.
An Efficient Algorithm for Finding Empty Space for Reconfigurable Systems
Authors: Yan Xiao, Zhenhua Duan, Pengcheng Nie
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

The management of resources in reconfigurable systems is one of the most critical factors concerned deeply with the performance of dynamic reconfigurable systems. There are several algorithms for managing the empty space of reconfigurable systems, among which the basic Scan Line Algorithm (SLA) is a relative efficient one. However, SLA suffers from two problems: redundancy and duplication. To solve duplication, the improved Scan Line Algorithm (ISLA)is proposed. However, the redundancy problem is remained. Therefore, we are motivated to over come this problem and propose an enhanced algorithm called ESLA based on SLA. ESLA solves problems of both redundancy and duplication. Further, Simulation experiments show that the performance of ESLA is better than ISLA.
An Optimizing Strategy for Massive Data Management System Based on SQLSERVER 2000
Authors: Lei-Yue Yao, Yong Chen
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Systems are always be checked and accepted easily. But with time passing by, systems are getting more and more slowly, and eventually, exceed the limit of users’ patience. It’s quite often that one Bottleneck appears followed by another was just solved. Therefore, finding the point of balance and making best use of all the resource in a certain range is a more realistic purpose. In this article, was taken as an example, optimization was done in the field of cluster, database and application. An efficient and effective optimizing strategy for massive data management system was raised. Moreover, this strategy can be popularized in all information management system.
Proceedings of the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data
Authors: Jian Pei, Lise Getoor, Ander de Keijzer
Venue: International Conference on Knowledge Discovery and Data Mining (2009)

The importance of uncertain data is growing quickly in many essential applications such as environmental surveillance, mobile object tracking and data integration. Recently, storing, collecting, processing, and analyzing uncertain data has attracted increasing attention from both academia and industry. Analyzing and mining uncertain data needs collaboration and joint effort from multiple research communities including reasoning under uncertainty, uncertain databases and mining uncertain data. For example, statistics and probabilistic reasoning can provide support with models for representing uncertainty. The uncertain database community can provide methods for storing and managing uncertain data, while research in mining uncertain data can provide data analysis tasks and methods. It is important to build connections among those communities to tackle the overall problem of analyzing and mining uncertain data. There are many common challenges among the communities. One is to understand the different modeling assumptions made, and how they impact the methods, both in terms of accuracy and efficiency. Different researchers hold different assumptions and this is one of the major obstacles in the research of mining uncertain data. Another is the scalability of proposed management and analysis methods. Finally, to make analysis and mining useful and practical, we need real data sets for testing. Unfortunately, uncertain data sets are often hard to get. The goal of the First ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data (U'09) is to discuss in depth the challenges, opportunities and techniques on the topic of analyzing and mining uncertain data. The theme of this workshop is to make connections among the research areas of uncertain databases, probabilistic reasoning, and data mining, as well as to build bridges among the aspects of models, data, applications, novel mining tasks and effective solutions. By making connections among different communities, we aim at understanding each other in terms of scientific foundation as well as commonality and differences in research methodology. The workshop program is very stimulating and exciting. We are pleased to feature two invited talks by pioneers in mining uncertain data. Christopher Jermaine will give an invited talk titled "Managing and Mining Uncertain Data: What Might We Do Better?" Matthias Renz will address the topic "Querying and Mining Uncertain Data: Methods, Applications, and Challenges". Moreover, 8 accepted papers in 4 full presentations and 4 concise presentations will cover a bunch of interesting topics and on-going research projects about uncertain data mining.
Stabilizing 3D modeling with geometric constraints propagation
Authors: Michela Farenzena, Andrea Fusiello
Venue: Computer Vision and Image Understanding (2009)

This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization of 2D points, the position of the 3D point is estimated as a polyhedron containing all the possible solutions of the triangulation. Then, given the topological structure of the 3D points cloud, geometric relationships among facets, such as coplanarity, parallelism, orthogonality, and angle equality, are automatically detected. A subset of them that is sufficient to stabilize the 3D model estimation is selected with a flow-network based algorithm. Finally, a feasible instance of the 3D model, i.e. one that satisfies the geometric constraints and whose 3D vertices lie within the associated polyhedral bounds, is computed by solving a Constraint Satisfaction Problem. The process accommodates uncertainty in a non-probabilistic fashion and thus provides rigorous results. Synthetic and real experiments illustrate the approach.
Finite Models in FOL-Based Crypto-Protocol Verification
Authors: Jan Jürjens, Tjark Weber
Venue: Foundations and Applications of Security Analysis: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers (2009)

Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair soundness of the verification approach. To address this issue, we investigate an alternative approach (based on first-order logic) that does not require inequalities to be axiomatized. A derivation of the negated security property exhibits a protocol attack, and absence of a derivation amounts to absence of the investigated kind of attack.We establish a fragment of FOL strictly greater than Horn formulas in which the approach is sound. We then show how to use finite model generation in this context to prove the absence of attacks. To demonstrate its practicality, the approach is applied to several well-known protocols, including ones relying on non-trivial algebraic properties. We show that it can be used to deal with infinitely many principals (and thus sessions).
Study on the Construction Method of Networked Service Oriented System for RP
Authors: Di Wu, Qingxi Hu, YuanYao, Haiguang Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The paper presents an approach which constructs networked service system for RP (Rapid Prototyping) industries, summarizes the networked service pattern, and discusses the networked service matching and composition of RP enterprise. It analyzes the technical theory of system construction, description metamodel of networked service based on domain ontology is built to describe the interior of enterprise and the dynamic connection between enterprises. Technical route and theoretical structure model of system is established, autonomic computing and service composition algorithm are used. It will provide professional RP service interfaces and venture platform for middle and small enterprises which they can run business effectively. A new pattern is provided for quick response service of RP enterprise and it will be expected to have definite reference for future research on information technology of RP service industries. It plays a positive role to improve RP manufacturing service independent innovation, informationization development and level of advanced manufacturing technology.
Design and Implementation of Community GIS Based on COM Technology
Authors: Hui-de Liu, Xiao-yu Sun, Wen-min Zhu, Jun-fang Cui
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The significance of developing community GIS (Geographic Information System) is put forward and a brief introduction which is related to the characters of COM (Component Object Model) is given. The key technology of database design under the component technology is researched. The function of the system, the design and realization of the model are introduced.
Kolmogorov-Complexity Based on Infinite Computations
Authors: Günter Hotz
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

We base the theory of Kolmogorov complexity on programs running on a special universal machine M, which computes infinite binary sequences x ¿ {0,1} ¿ . The programs are infinite sequences p ¿ {0,1}*·1·0 ¿ . As length |p| we define the length of the longest prefix of p ending with 1. We measure the distance d(x,y) = 2¿ n of x,y ¿ {0,1} ¿ by the length n of the longest common prefix of x and y. $\Delta_M(x,2^{-n})$ is the length of a minimal program p computing a sequence y with d(x,y) ≤ 2¿ n . It holds $\Delta_M(x,2^{-n})\leq\Delta_M(x,2^{-(n+1)})\leq n+2$ for all n. We prove that the sets of sequences $$ K_{\Delta_M} := \bigcup\limits_{c\in\mathcal{N}}\{x\in X^{\infty}:\Delta_M(x,2^{-n})>n-c\quad\textrm{for all n}\} $$ $$ K_{\Delta_M}^{o(n)} := \{x\in X^{\infty}:n+1-\Delta_M(x,2^{-n})=o(n)\} $$ have the measure 1 for memoryless sources with equal probabilities for 0 and 1. The sequences in $K_{\Delta_M}^{o(n)}$ are Bernoulli sequences. The sequences in $K_{\Delta_M}$ define collectives in the sense of von Mises up to a set of measure 0 and the sequences in $K_{\Delta_M}^{o(n)}$ have this property in a certain resricted fom.
General Database Statistics Using Entropy Maximization
Authors: Raghav Kaushik, Christopher Ré, Dan Suciu
Venue: Proceedings of the 12th International Symposium on Database Programming Languages (2009)

We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states that the size of the output of a conjunctive query over the data is a given number. A very simple example is a histogram, which makes assertions about the sizes of the output of several range queries. Our model also allows much more complex assertions that include joins and projections. To model such complex statistical assertions we propose to use the Entropy-Maximization (EM) probability distribution. In this model any set of statistics that is consistent has a precise semantics, and every query has an precise size estimate. We show that several classes of statistics can be solved in closed form.
A Blind Image Watermarking Scheme Based on Wavelet Tree Quantization
Authors: Peng Liu, Zhizhong Ding
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

This paper proposes a blind image watermarking scheme using wavelet trees quantization. The largest two coefficients in a wavelet tree are called significant coefficients and the difference between them is called significant difference. We embed a watermark bit by comparing the significant difference with an average significant difference value, and the maximum coefficients are quantized. So there exists a large magnitude difference between the maximum coefficients and the second maximum coefficients after watermark embedding, which can be used for blind extracting watermark. As a result, the watermarked image looks lossless comparing with the original image. Moreover, by designing an adaptive threshold in the extracting process, our method can effectively resist common image processing attacks such as JPEG compression, media filtering, Gaussian noise, cropping, sharpening, histogram equalization and so on, and it has a good transparency.
Preliminary Analysis on Landscape Pattern of Laoshan District, Qingdao
Authors: Shi Honghua
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Based on field investigation and verification, land-use types of Laoshan District are divided into the beach, river beach, reservoirs, fish pond, coniferous forest, cultivated woody vegetation, cultivated herbaceous vegetation, industrial land, public building land and residential land. Some conclusions are found that: the spatial variation of land-use types in Laoshan District is very significant; landscape pattern and structure of Laoshan District show strong regularity in space: from northeast to southwest, topography vegetation, hydrology and other geographical factors changes with altitude. Meanwhile, population distribution and socio-economic development also have a huge difference. Human activities mainly concentrate in the plain areas and the transition zone of plains and hills, the spatial differences of land-use type and intensity result in evolution of landscape pattern and structure. The landscape heterogeneity analysis suggests that landscape’s diversity index and Dominance index of Laoshan District belong to a relative high level, but its Evenness index is quite low because of the spatial heterogeneity of land-usetype.
Unique Reporting Form: Flight Crew Auditing of Everyday Performance in an Airline Safety Management System
Authors: Maria Chiara Leva, Alison Kay, Joan Cahill, Gabriel Losa, Sharon Keating, Diogo Serradas, Nick Mcdonald
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

This paper presents the proposed prototype for a Unique report form, which will constitute the basis for all operational and safety related reports completed by Flight Crew. This reporting form provides an opportunity for operational personnel to audit their own company's processes and procedures and has been developed in collaboration with a major Spanish Airline as part of the Human Integration into the Lifecycle of Aviation Systems (HILAS) project. This research involved extensive fieldwork, including process workshops, task analysis and collaborative prototyping of new concepts. Traditionally airlines use performance monitoring tools to evaluate human performance and by implication their organizational/system safety. Feedback from these tools is used to direct improvements (re-design procedures, enhance training etc.). The Line Operation Safety Audit (LOSA) methodology constitutes the current state of the art in terms of performance monitoring. Building on this concept, end user requirements elicited were the main focus for the design of this reporting form.
JCCM: Joint Cluster Communities on Attribute and Relationship Data in Social Networks
Authors: Li Wan, Jianxin Liao, Chun Wang, Xiaomin Zhu
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

JCCM (Joint Clustering Coefficient Method) algorithm was proposed to identify communities which are cohesive on both attribute and relationship data in social networks. JCCM is a two-step algorithm: In the first step, it clusters tightly cohesive cliques as community cores and we proposed a heuristic method to identify community cores with a probabilistic guarantee to find out all community cores. In the second step, JCCM assigns the community cores and peripheral actors into different communities in a top-down manner resulting in a dendrogram and the final clustering is determined by our objective function, namely Joint Clustering Coefficient (JCC). To consider the power of actors in different roles in community identification, we defined two regimes of communities, namely "union" and "autarchy". Experiments demonstrated that JCCM performs better than existing algorithms and confirmed that attribute and relationship data indeed contain complementary information which helps to identify communities.