ppxscal/embedding_network huggingface dataset:
Research of Feature Recognition Method for Box Part Based on STEP
Authors: Sheng-wen Zhang, Yang Liu, Xi-feng Fang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

To realize the information integration of CAD/CAPP/CAM, it’s important to apply the feature recognition method to the transfer and share of part information, but it’s still very difficult to apply the feature recognition method to handle the complicated box part. This paper presents a new method to extract the box part information, called as “feature naming method”, this method can extract the plane and hole information from STEP file, which can be used for the process reasoning of CAPP and the tool path generation in CAM. According to the part form feature character, a new method is proposed based on the graph-based approach, which can use the matrix characteristic polynomial to recognize the box part form feature. Compared with that of the commonly used incidence degree algorithm, the time complexity of this method’s algorithm has been greatly improved.
TidFP: Mining Frequent Patterns in Different Databases with Transaction ID
Authors: C. I. Ezeife, Dan Zhang
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an efficient way to mine frequent patterns in many types of databases including multiple tabled and distributed databases. Existing work have not focused on mining frequent patterns with the transaction ids they occurred in. Many applications require finding strong associations between transaction id (e.g., certain drug) and the itemsets (e.g., certain adverse effects) to help deduce some pertinent lacking information (like how many people use this product in total) and information (like how many people have the adverse effects).This paper proposes a set of algorithms TidFPs, for mining frequent patterns with their transaction ids in a single transaction database, in a multiple tabled database, and in a distributed database. The proposed technique scans the database records only once even with level-wise Apriori-based mining techniques, stores frequent 1-items with their transaction id bitmap, outperforms traditional approaches and is extendible to other tree-based mining techniques as well as sequential mining.
A Quantum-Based Model for Interactive Information Retrieval
Authors: Benjamin Piwowarski, Mounia Lalmas
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

Even the best information retrieval model cannot always identify the most useful answers to a user query. This is in particular the case with web search systems, where it is known that users tend to minimise their effort to access relevant information. It is, however, believed that the interaction between users and a retrieval system, such as a web search engine, can be exploited to provide better answers to users. Interactive Information Retrieval (IR) systems, in which users access information through a series of interactions with the search system, are concerned with building models for IR, where interaction plays a central role. In this paper, we propose a general framework for interactive IR that is able to capture the full interaction process in a principled way. Our approach relies upon a generalisation of the probability framework of quantum physics.
Syntactic Spreadsheets: In Search for a Human-Readable Representation of Parse Tree Forests
Authors: Janusz S. Bień
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)

The paper presents an example of a representation of parse tree forests advocated by the author. Although motivated by the need to analyse the forests generated by Świdziński's grammar, the representation can be used for any grammar handled by Woliński's Birnam parser, and the basic ideas can be applied to any Immediate Constituent grammar. Syntactic spreadsheets can serve several purposes. They can be simply included in printed publications or dynamically displayed by an appropriate viewer. Unfortunately the implementation of the idea is not easy and therefore it is still in progress.
A Mobile User Interface for Business Knowledge Management (BKM)
Authors: Danco Davcev, Marjan Arsic, Dalibor Ilievski
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

In this paper, we introduce an adaptable mobile interface for efficient business knowledge management (BKM). The user (client) via the Helpdesk operator can post a request for consultation to the business Experts and/or web services. The goal is to make business knowledge available on demand at any time and any place. This approach gives faster business problem solutions, more productive expert and/or web services, and high availability of the business knowledge.
Comparative Study of Multicast Protection Algorithms Using Shared Links in 100GET Transport Network
Authors: Samer Sulaiman, Abdelfattah Haidine, Ralf Lehnert, Stefan Tuerk
Venue: Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future (2009)

In recent years new challenges have emerged in the telecommunications market resulting from the increase of network traffic and strong competition. Because of that, service providers feel constrained to replace expensive and complex IP-routers with a cheap and simple solution which guarantees the requested quality of services (QoS) with low cost. One of these solutions is to use the Ethernet technology as a switching layer, which results in using the cheap Ethernet services (E-Line, E-LAN and E-Tree) and to replace the expensive IP-routers. To achieve this migration step, new algorithms that support the available as well as the future services have to be developed. In this paper, we investigate the multicast protection issue. Three multicast protection algorithms based on the shared capacity between primary and backup solutions are proposed and evaluated. The blocking probability is used to evaluate the performance of the proposed algorithms. The sub-path algorithm resulted in a low blocking probability compared with the other algorithms.
Study on Optimal Delivery Strategy Based on the Mode of Financing Warehouse
Authors: Zhengchi Liu, Mingyong Lai, Shaoqing Luo
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Started from the financing warehouse’s integration and recreation effect of enterprises’ credit, this article analyses the financing system among upstream supplier enterprises, the third-party financing warehouses, manufacturers and banks. Based on this system, we establish models respectively from the optimal costs of suppliers and the maximum amount of financing limit, and further analysis is made towards the impact of the financing warehouse storage costs parameters in the model to the delivery strategies for suppliers, thus provide information and recommendations for suppliers to choose the best delivery strategy to achieve maximum utility.
Automatic Lip Extraction Based on Wavelet Transform
Authors: M. M. Hosseini, S. Ghofrani
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The major problems that any lip image analysis method is faced are: low chromatic in lip region, low contrast luminance and overlap between the lip and facial skin color. So we are interested on those methods that can extract the lip region automatically and accuracy. In this paper, we present a new automatic approach for the lip extraction based on using the Haar wavelet. The proposed algorithm uses the color space CIE L*U*V* and CIE L*a*b* in order to improve the contrast between the lip and the other face regions. We execute the algorithm on the images that belong to the four different speakers. While the two basic method, it means the fuzzy c-means clustering (FCM) and the spatial fuzzy c-means clustering (SFCM), could not segment the lip for the all four tested image perfectly, the proposed algorithm based on using the wavelet shows the better performance.
The Algorithm and Realization of Vector-Data Attenuation-Junction of Arbitrary Scope
Authors: Fang Fang, Peng Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Junction is a necessary operation when vector-data entering into database to be stored. The current widespread use of junction is based on map. But the algorithm which restricted by the border of map can’t meet the demand of junction of arbitrary scope. In order to achieve the seamless integration of the spatial database after incremental updates, the algorithm of junction of arbitrary scope which has been made into large-scale GIS software MapGis7.3 is put forward. We find that the junction of massive spatial database is more efficient than traditional map junction, and the transition of vector-data after junction is smooth. Consequently, the effectiveness and accuracy of the algorithm are verified.
Understanding Patient User Experience in Obstetric Work Systems
Authors: Enid N. Montague
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

Patient user experiences with medical technology may be important predictors of patient ratings of satisfaction with health care systems and of acceptance of technologies used in their care. The purpose of this study was to understand how patients experience medical technology during medical events as passive users. 25 women were interviewed after the birth of their child about the technologies that were used to provide them care. Interviews were transcribed verbatim and reduced to codes in the qualitative data analysis tradition. Results show that patients have user experiences with technologies as passive users.
Higher-order distributional properties in closed queueing networks
Authors: Alexandre Brandwajn, Thomas Begin
Venue: Performance Evaluation (2009)

In many real-life computer and networking applications, the distributions of service times, or times between arrivals of requests, or both, can deviate significantly from the memoryless negative exponential distribution that underpins the product-form solution for queueing networks. Frequently, the coefficient of variation of the distributions encountered is well in excess of one, which would be its value for the exponential. For closed queueing networks with non-exponential servers there is no known general exact solution, and most, if not all, approximation methods attempt to account for the general service time distributions through their first two moments. We consider two simple closed queueing networks which we solve exactly using semi-numerical methods. These networks depart from the structure leading to a product-form solution only to the extent that the service time at a single node is non-exponential. We show that not only the coefficients of variation but also higher-order distributional properties can have an important effect on such customary steady-state performance measures as the mean number of customers at a resource or the resource utilization level in a closed network. Additionally, we examine the state that a request finds upon its arrival at a server, which is directly tied to the resulting quality of service. Although the well-known Arrival Theorem holds exactly only for product-form networks of queues, some approximation methods assume that it can be applied to a reasonable degree also in other closed queueing networks. We investigate the validity of this assumption in the two closed queueing models considered. Our results show that, even in the case when there is a single non-exponential server in the network, the state found upon arrival may be highly sensitive to higher-order properties of the service time distribution, beyond its mean and coefficient of variation. This dependence of mean numbers of customers at a server on higher-order distributional properties is in stark contrast with the situation in the familiar open M/G/1 queue. Thus, our results put into question virtually all traditional approximate solutions, which concentrate on the first two moments of service time distributions.
Proceedings of the second workshop on Building Educational Applications Using NLP
Venue: ACL Workshops (2005)

The two main research areas in educational applications, automated evaluation of students free-responses and intelligent tutoring systems (ITS), have developed fairly autonomously within the NLP community. We made progress toward bridging this gap in the First Workshop on Building Educational Applications Using NLP in 2003, where researchers in a wide variety of educational applications met in Edmonton to share their work and ideas - both in the speech- and text-based communities. Papers dealt with automated evaluation of essay-length texts and classification of brief responses that students enter into a tutoring system. Other research that was reported included exploring the value of using grammar checking within a tutoring system, comparing speech- and text-based tutoring systems, and automatically generating multiple-choice questions. There continues to be a significant and fast-growing body of research toward developing educational applications that incorporate NLP. This has become apparent as, since the First Workshop in 2003, subsequent workshops have been held by scientists working in this field (InSTIL/ICALL 2004 Symposium on Computer Assisted Learning and the eLearning International Workshop, COLING 2004). The themes in the 2005 workshop fall into four broad categories. Several papers explore the automated assessment of written text - a field that is fast becoming mainstream. These papers describe methods to score essay-length responses, evaluate content-based short answer responses, and identify plagiarized material. Other papers look at methods for generating assessment questions automatically. A third major focus is in teaching language skills - both speech and text-based. Finally, two papers evaluate tools that NLP software developers can use to build educational applications.
Handling Spatial-Correlated Attribute Values in a Rough Set
Authors: Hexiang Bai, Yong Ge
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Rough set theory has been widely used in spatial analysis. However these applications take little account of the spatial characteristics of spatial data, especially spatial dependencies and correlations. This paper proposes a new method to consider spatially correlated information in rough sets theory. This method divides the attributes of geographical objects into two categories, namely spatial correlated attributes and non-spatial correlated attributes. These two types of attributes are handled separately and the results from both types of attributes are then combined to generate the decision rule. An example is given to illustrate how the new method handles spatially correlated information in rough set theory.
Performance and Consistency Improvements of Hash Tree Based Disk Storage Protection
Authors: Fangyong Hou, Dawu Gu, Nong Xiao, Fang Liu, Hongjun He
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Hash tree based disk storage integrity protection suffers from performance penalty and possible losing of consistency. FI-Tree deploys a fixed-structure tree and applies incremental-hash to tree node updating to solve the difficulties of performance and consistency. The biggest advantage of FI-Tree comes from that: to allow tree nodes to be cached to optimize performance, it can maintain consistency between the tree and the protected data with low cost at the same time. Basing on FI-Tree, TNSD constructs an instance of secure disk. TNSD associates one nonce with each data block to be protected, and applies FI-Tree to ensure the nonce to be un-tampered. In such way, data protection can be fulfilled with resistance against any attacks. Related approaches are elaborated, as well as testing results. Theoretical analysis and experimental simulation show that it is a practical and available way to build secure disk.
Removal of 1,2,4-TCB from Flue Gas by Aqueous Chlorine-Dioxide Scrubbing
Authors: Yi Zhao, Peng He, Yinghui Han, Bingjian Zhang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The present study attempts to clean up 1,2,4-trichlorobenzene (TCB) vapor simultaneously from the flue gas in the lab-scale bubbling reactor. Experiments were carried out to examine the effect of various operating parameters like input TCB vapor concentration, pH value of reaction medium, reaction temperature etc. It was found that at the optimum experimental conditions of reaction temperature 50℃, pH value of reaction medium 10, oxygen content in simulating gas 5%~10%, and input TCB concentration 800ug/L, the removal efficiencies of TCB reached above 90%. This work would offer important basic data for industrial application in future.
Canine Pose Estimation: A Computing for Public Safety Solution
Authors: Cristina Ribeiro, Alexander Ferworn, Mieso Denko, James Tran
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

In this paper we discuss determining canine pose in the context of common poses observed in Urban Search and Rescue dogs through the use a sensor network made up of accelerometers. We discuss the use of the Canine Pose Estimation System in a disaster environment, and propose techniques for determining canine pose. In addition we discuss the challenges with this approach in such environments. This paper presents the experimental results obtained from the Heavy Urban Search and Rescue disaster simulation, where experiments were conducted using multiple canines, which show that angles can be derived from acceleration readings. Our experiments show that similar angles were measured for each of the poses, even when measured on multiple USAR canines of varying size. We also developed an algorithm to determine poses and display the current canine pose to the screen of a laptop. The algorithm was successful in determining some poses and had difficulty with others. These results are presented and discussed in this paper.
Empirical Probability Functions Derived from Dihedral Angles for Protein Structure Prediction
Authors: Qiwen Dong, Xin Geng, Shuigeng Zhou, Jihong Guan
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

The development and evaluation of functions for protein energetics is an important part of current research aiming at understanding protein structures and functions. Knowledgebase mean force potentials are derived from statistical analysis of interacting groups in experimentally determined protein structures. Current knowledge-based mean force potentials are based on the inverse Boltzmann’s law, which calculate the ratio of the observed probability with respect to the probability of the reference state. In this study, a general probability framework is presented with the aim to develop novel energy scores. A class of empirical probability functions is derived by decomposing the joint probability of backbone dihedral angles and amino acid sequences. The neighboring interactions are modeled by conditional probabilities. Such probability functions are based on the strict probability theory and some suitable suppositions for convenience of computation. Experiments are performed on several well-constructed decoy sets and the results show that the empirical probability functions presented here outperform previous statistical potentials based on dihedral angles. Such probability functions will be helpful for protein structure prediction,model quality evaluation, transcription factors identification and other challenging problems in computational biology.
Implementation of OpenVG Path and Paint Algorithms on Synchronous Data Triggered Architecture with Optimization
Authors: Ma Sheng, Huang Libo, Wang Zhiying, Dai Kui
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

As a free application programming interface (API) for hardware-accelerated two-dimensional vector and raster graphics, OpenVG is becoming the standard for hardware development. This paper firstly proposes several optimization methods for OpenVG implementation, such as loop unrolling, operation transformation, function in lining, vectorization and address assignment, based on the hardware architecture and programming model of the Synchronous Data Triggered Architecture (SDTA). We then optimally realize the OpenVG path and paint algorithms on the SDTA with the direction of these methods and consideration of the algorithms’ characteristics. The analysis results show that the optimized OpenVG algorithms achieved 3-9 times speedups compared with original ones.
On Free-Start Collisions and Collisions for TIB3
Authors: Florian Mendel, Martin Schläffer
Venue: Proceedings of the 12th International Conference on Information Security (2009)

In this paper, we present free-start collisions for the TIB3 hash functions with a complexity of about 232 compression function evaluations. By using message modification techniques the complexity can be further reduced to 224. Furthermore, we show how to construct collisions for TIB3 slightly faster than brute force search using the fact that we can construct several (different) free-start collisions for the compression function. The complexity to construct collisions is about 2122.5 for TIB3-256 and 2242 for TIB3-512 with memory requirements of 253 and 2100 respectively. The attack shows that compression function attacks have been underestimated in the design of TIB3. Although the practicality of the proposed attacks might be debatable, they nevertheless exhibit non-random properties that are not present in the SHA-2 family.
The Back Analysis of Mechanics Parameters Based on DEPSO Algorithm and Parallel FEM
Authors: He Huang, Zhihua Wei, Zhuoqiu Li, Wenbi Rao
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The back-analysis of mechanics parameters needs iterative forward calculating, resulting in low efficiency; meanwhile the Particle Swarm Optimization (PSO) algorithm and other optimization algorithms are exposed to local optimum possibilities. In this paper, DEPSO-ParallelFEM, a system integrated of an algorithm of hybrid particle swarm with Differential Evolution (DE) operator, termed DEPSO, and parallel Finite Element Method (FEM), is proposed to solve these problems. DEPSO guarantees the particle to escape from local minima by enhancing particle’s diversity through the combination of PSO operator and DE operator; and parallel FEM is applied to improve the computing speed and precision by adopting the techniques of Cluster of Workstation (COW), MPI, Domain Decomposition Method (DDM), and Object-Oriented Programming (OOP) and so on. A computational example proves that this system is of excellent parameter exploration capability and high speed; thus it is of great academic value and significant applicable value.