ppxscal/embedding_network huggingface dataset:
ACABARASE: An Anti-spam CAse-BAsed ACABARASE: An Anti-spam CAse-BAsed ReAsoning SystEm
Authors: César Andrés, Manuel Núñez
Venue: Proceedings of the Third International Conference on Systems (2008)

In this paper we present the anti-spam case-based reasoning system ACABARASE. Our system works by using the classical strategy behind CBR systems: To solve problems based on the solutions to previously solved similar problems. ACABARASE works under both English and Spanish languages, what slightly complicated its development. In addition to present our system, we show experimental results regarding its performance and analyze them.
Letter from the chair
Venue: ACM SIGMIS Database (2008)

I hope you had an enjoyable summer and are looking forward to the new academic year. I am pleased to announce the recipients of the Fifth Annual Magid Igbaria Outstanding Conference Paper of the Year Award, presented at the ACM-SIGMIS CPR (Computer Personnel Research) 2008 Conference at the Omni Charlottesville Hotel in Charlottesville, Virginia, USA, from April 3-5, 2008. Please join me in congratulating Eileen M. Trauth, Jeria L. Quesenberry, Haiyan Huang, and Stephen McKnight for their paper entitled, "Linking Economic Development and Workforce Diversity through Action Research." You can find their award-winning paper in the SIGMIS CPR 2008 Conference Proceedings, available in the ACM Digital Library at: http://portal.acm.org/dl.cfm. I would like to invite you to consider sending a submission to next year's SIGMIS CPR 2009 Conference: Where: University of Limerick campus, Limerick, Ireland When: May 28-30, 2009. The submission deadline is October 31, 2008. Your participation is welcome and encouraged! For more information, please contact the SIGMIS CPR Conference Committee:Conference Chair: Norah Power, University of Limerick Program Chair: Damien Joseph, Nanyang Technological University Treasurer: Indira Guzman, Touro University International Or, check our website for conference information at: http://www.acm.org/sigmis. Our Data Base Editorial Staff also awaits the submission of your best research: Editor-in Chief: Tom Stafford, Fogelman College of Business & Economics, University of Memphis Global Co-Editor: Patrick Y.K. Chau, School of Business, The University of Hong Kong Managing Editor: Colleen Schwarz, E.J. Ourso College of Business, Louisiana State University Technical Editor: Loel Kim, Center for the Study of Rhetoric & Applied Communication, University of Memphis Submission information is available at the Data Base website at: http://the-database.org. Finally, we are pleased to invite you to the Eighth Annual ACM-SIGMIS Reception: Where: International Conference on Information Systems (ICIS2008), Paris, France Location to be determined When: Saturday, December 13, 2008, 5:30 to 7:00 pm Who: All ACM-SIGMIS members and their invited guests are welcome! We appreciate your continued support of SIGMIS. Please feel free to contact any one of us with ideas.
Stability analysis for linear discretisations of the advection equation with Runge-Kutta time integration
Authors: Michael Baldauf
Venue: Journal of Computational Physics (2008)

For the 1-dim. linear advection problem stability limits of Runge-Kutta (RK) methods from 1st to 7th order in combination with upwind or centered difference schemes from 1st to 6th order are presented. The analysis can be carried out in a rather general way by introduction of a broad class of Runge-Kutta methods, here called 'Linear Case Runge-Kutta (LC-RK)' methods, which behave completely similar for linear, time-independent and homogeneous ODE-systems and contain the 'classical' order=stage RK methods. The set of conditions for the coefficients of these LC-RK-schemes could be derived explicitly for arbitrary order N. From an efficiency viewpoint the LC-RK 3rd order methods in combination with upwind 3rd or 5th order or the LC-RK 4th order scheme with 4th order centered difference advection are a good choice. The analysis can be extended easily to multidimensional splited advection for which a necessary stability condition is presented.
Development of Tea Ceremony e-Learning Environment within Immersive Projection Technology
Authors: Yusuke Gotoh, Yasuo Ebara, Tomoki Yoshihisa, Koji Koyamada, Masanori Kanazawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The skill acquisition of the tea ceremony supports the base of the traditional performing arts, and has played an important role in their development. However, it does not advance smoothly due to the problem such as the time required handing down know-how. The skill is a tacit knowledge that belongs only to the individual. The teacher and the student sharing their time and place carry on the tradition of the skill by the observation and the conversation. Therefore, the research that analyzes the skill quantitatively is necessary. In this paper, we develop a tea ceremony e-Learning environment for an immersive mixed environments by Immersive Projection Technology (IPT). By using the tea house presented in the immersive mixed environments, the user can efficiently experience the tea ceremony.
Potential-driven load distribution for distributed data stream processing
Authors: Weihan Wang, Mohamed A. Sharaf, Shimin Guo, M. Tamer Özsu
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

A large class of applications require real-time processing of continuous stream data resulting in the development of data stream management systems (DSMS). Since many of these applications are distributed, distributed DSMSs are starting to receive attention. In this paper, we focus on an important issue in distributed DSMS operation, namely load distribution to minimize end-to-end latency. We identify the often conflicting requirements of load distribution, and propose a "potential-driven" load distribution approach to mimic the movements of objects in the physical world. Our approach also takes into account heterogeneous machines, different network conditions, and resource constraints. We present experimental results that investigate our algorithms from various aspects, and show that they outperform existing techniques in terms of end-to-end latency.
A Markov model for dynamic behavior of ToA-based ranging in indoor localization
Authors: Mohammad Heidari, Kaveh Pahlavan
Venue: EURASIP Journal on Advances in Signal Processing (2008)

The existence of undetected direct path (UDP) conditions causes occurrence of unexpected large random ranging errors which pose a serious challenge to precise indoor localization using time of arrival (ToA). Therefore, analysis of the behavior of the ranging error is essential for the design of precise To A-based indoor localization systems. In this paper, we propose a novel analytical framework for the analysis of the dynamic spatial variations of ranging error observed by a mobile user based on an application of Markov chain. The model relegates the behavior of ranging error into four main categories associated with four states of the Markov process. The parameters of distributions of ranging error in each Markov state are extracted from empirical data collected from a measurement calibrated ray tracing (RT) algorithm simulating a typical office environment. The analytical derivation of parameters of the Markov model employs the existing path loss models for the first detected path and total multipath received power in the same office environment. Results of simulated errors from the Markov model and actual errors from empirical data show close agreement.
The Support Vector Machine Classification System for Patient Document Information Importance Analysis
Authors: Chih-Hung Wu, Yun Ken, Tao Huang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This study proposed a novel two-stage process of integrating support vector machine with expert screening technique to develop an automatic patent categorization system with high accuracy and high validity. The approach is tested on a real world case—the search history involving 264 patent documents of semiconductor equipment components. A 100% patent classification accuracy via the description portion of the patent documents was achieved using our proposed two-stage approach. The results showed that the proposed approach performed well in the real-world case of patent classification. The description field of the patent document was more than adequate for patent classification.
Dynamic Maintenance of Software Systems at Runtime
Authors: Habib Seifzadeh, Mostafa Kermani, Mohsen Sadighi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Software systems suffer one basic problem: They are frequently adapted and updated due to changes in requirements and new bugs surfacing. The result of these adaptations is lower availability and missing state of the program. In addition, applying these adaptations requires professional developers which inflict high costs on the organization. In this article, we introduce several methods for adapting programs at run-time without disrupting program execution. This increases system availability. Also, in order to reduce the need for professionals for program modification, some methods that simplify the implementation of new or changed requirements will be offered. As an example, an application written in Java 1.6 has been produced in which both simplifying requirements implementation and hot-swapping (adapting programs at run-time) have been integrated. In this application, we do hot-swapping by using "Java Platform Debugger Architecture API" and attain simplification of presenting new requirements by using "XML-based languages".
Load-balanced mesh router migration for wireless mesh networks
Authors: Bin Xie, Yingbing Yu, Anup Kumar, Dharma P. Agrawal
Venue: Journal of Parallel and Distributed Computing (2008)

Load-balancing among domains in a wireless mesh network (WMN) is normally achieved by changing the Internet attachment of mesh routers (MRs) that carry the traffic from mobile stations (MSs). The greediness of load-balancing algorithms may force MRs to frequently change their Internet attachments, and thus degrade network performance due to inter-domain mobility of the associated MSs. In this paper, we discuss the negative impact on the performance of MSs' mobility, due to inter-domain reassignment of MR. A MR migration scheme is proposed to achieve a tradeoff between load-balancing and inter-domain reassignment of MR. The proposed load-balancing scheme for WMNs includes: an initialization procedure to divide a WMN into domains, and a load adjustment procedure to rebalance the traffic load among the neighboring domains when required. We also provide a framework for handling inter-domain mobility in support of multi-hop communication using the Multi-hop cellular IP. Our simulation results show that the proposed protocol effectively controls MR's change in connectivity as well as MS's mobility.
Graph and map isomorphism and all polyhedral embeddings in linear time
Authors: Ken-ichi Kawarabayashi, Bojan Mohar
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

For every surface S (orientable or non-orientable), we give a linear time algorithm to test the graph isomorphism of two graphs, one of which admits an embedding of face-width at least 3 into S. This improves a previously known algorithm whose time complexity is nO(g), where g is the genus of S. This is the first algorithm for which the degree of polynomial in the time complexity does not depend on g. The above result is based on two linear time algorithms, each of which solves a problem that is of independent interest. The first of these problems is the following one. Let S be a fixed surface. Given a graph G and an integer k ≥ 3, we want to find an embedding of G in S of face-width at least k, or conclude that such an embedding does not exist. It is known that this problem is NP-hard when the surface is not fixed. Moreover, if there is an embedding, the algorithm can give all embeddings of face-width at least k, up to Whitney equivalence. Here, the face-width of an embedded graph G is the minimum number of points of G in which some non-contractible closed curve in the surface intersects the graph. In the proof of the above algorithm, we give a simpler proof and a better bound for the theorem by Mohar and Robertson concerning the number of polyhedral embeddings of 3-connected graphs. The second ingredient is a linear time algorithm for map isomorphism and Whitney equivalence. This part generalizes the seminal result of Hopcroft and Wong that graph isomorphism can be decided in linear time for planar graphs.
Estimation of the symbol rate of linearly modulated sequences of symbols
Authors: Pierre Jallon, Antoine Chevreuil
Venue: Signal Processing (2008)

The blind estimation of the symbol rate is one of the main issues for blind characterization of linearly modulated sequences. The estimator proposed in this article is based on the autocorrelation function of this kind of signal and exploits its limited frequency support. We prove theoretically that taking into account this property to modify some classical algorithms allows improving significantly their performances. We illustrate this result by numerical simulations, and we show that our estimator correctly detect the symbol rate in nearly 100% of the cases in many contexts as long as the signal to noise ratio is higher than 5dB.
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
Authors: Van H. Vu
Venue: Journal of Graph Theory (1999)

It is well known that almost every graph in the random space G(n, p) has chromatic number of order O(np-log(np)), but it is not clear how we can recognize such graphs without eventually computing the chromatic numbers, which is NP-hard. The first goal of this article is to show that the above-mentioned upper bound on the chromatic number can be guaranteed by simple degree conditions, which are satisfied by G(n, p) almost surely for most values of p. It turns out that the same conditions imply a similar bound for the choice number of a graph. The proof implies a polynomial coloring algorithm for the case p is not too small. Our result has several applications. It can be used to determine the right order of magnitude of the choice number of random graphs and hypergraphs. It also leads to a general bound on the choice number of locally sparse graphs and to several interesting facts about finite fields. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 201&ndash;226, 1999 This article was written while the author was with the Mathematics Department at Yale University.
Product interface reengineering using fuzzy clustering
Authors: Fei Gao, Gang Xiao, Jiu-jun Chen
Venue: Computer-Aided Design (2008)

Reducing interface redundancy and regularizing interface form and dimension can help improve production batch and design originality if the interfaces can be reengineered, and be shared and remain constant from product to product, within a given product family. This paper investigates a methodology for achieving the goal. First, the interface reengineering problem is formalized, and similarity degrees between interfaces are measured by Euclidean proximity through considering a rule of interface similarity between modules or parts in the isostructure property, geometry property, precision property, and performance property. Second, a similarity matrix is introduced to identify the relationships between the interfaces, and steps of interface reengineering are advanced based on fuzzy clustering. Third, detailed analysis and adjustment of interface reengineering are discussed. Finally, the proposed methodology is effectively demonstrated in an instance of motorcycle-hydraulic-disk brake interface reengineering.
Evaluation of robust estimators applied to fluorescence assays
Authors: M. Västilä, S. Peltonen, J. Soukka, E. Albán, J. T. Soini, U. Ruotsalainen
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We evaluated standard robust methods in the estimation of fluorescence signal in novel assays used for determining the biomolecule concentrations. The objective was to obtain an accurate and reliable estimate using as few observations as possible by decreasing the influence of outliers. We assumed the true signals to have Gaussian distribution, while no assumptions about the outliers were made. The experimental results showed that arithmetic mean performs poorly even with the modest deviations. Further, the robust methods, especially the M-estimators, performed extremely well. The results proved that the use of robust methods is advantageous in the estimation problems where noise and deviations are significant, such as in biological and medical applications.
Query expansion using gaze-based feedback on the subdocument level
Authors: Georg Buscher, Andreas Dengel, Ludger van Elst
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We examine the effect of incorporating gaze-based attention feedback from the user on personalizing the search process. Employing eye tracking data, we keep track of document parts the user read in some way. We use this information on the subdocument level as implicit feedback for query expansion and reranking. We evaluated three different variants incorporating gaze data on the subdocument level and compared them against a baseline based on context on the document level. Our results show that considering reading behavior as feedback yields powerful improvements of the search result accuracy of ca. 32% in the general case. However, the extent of the improvements varies depending on the internal structure of the viewed documents and the type of the current information need.
UML and enterprise application integration in automobile industry
Authors: João Ferreira, Francesco Furini, Nuno Silva
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Information integration in enterprises is a nightmare due to the differences in software and hardware platforms and due to syntactic and semantic differences in the schemas of the data sources. This is a well-known problem in the area of Enterprise Application Integration (EAI), where many applications have been developed for the purpose of information integration. Most current tools, however, only address the problems of (soft- and hardware) platform and syntactic heterogeneity; they fail to address semantic differences and they only support one-to-one (syntactical) mappings between individual schemas. We will analyze this problem in automobile industry through a specific UML derivate language and a domain ontology to find an adequate solution.
Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Authors: Gillian Dobbie, Bernard Mans
Venue: ACSC; Vol. 312 (2008)

The Australasian Computer Science Conference (ACSC) series is an annual forum, bringing together research sub-disciplines in Computer Science. The meeting allows academics and researchers to discuss research topics as well as progress in the field, and policies to stimulate its growth. This volume contains papers presented at the Thirty First ACSC in Wollongong, NSW, Australia. ACSC 2008 is part of the Australasian Computer Science Week which ran from Jan 22nd to 25th, 2008. The ACSC 2008 call for papers solicited contributions in all areas of computer science research. This years conference received submissions from Australia, New Zealand, China, France, India, Iran, Jamaica, Jordon, Malaysia, Pakistan, South Africa, Turkey, UK, and Taiwan. The topics addressed by the submitted papers illustrate the broadness of the discipline. The authors categorised their submissions into one or more of the following topics: - Algorithms (9 papers) - Artificial Intelligence (7 papers) - Communications and Networks (4 papers) - Computer Architecture (2 paper) - Computer Vision (4 papers) - Databases (5 papers) - Distributed Systems (6 papers) - E-Commerce (4 papers) - Formal Methods (6 papers) - Graphics (6 papers) - High Performance Computing (7 papers) - Human-Computer Interaction (8 papers) - Mobile Computing (6 papers) - Multimedia (1 paper) - Object Oriented Systems (3 papers) - Ontologies (1 paper) - Operating Systems (5 papers) - Programming Languages (4 papers) - Robotics (1 paper) - Scientific Computing (5 papers) - Security and Trusted Systems (5 papers) - Simulation (6 papers) - Software Engineering (5 papers) - Speech (1 paper) - Theory (3 papers) - Visualization (6 papers) - Web Services (3 papers) The programme committee consisted of 28 highly regarded academics from around the globe, including Australia, Brazil, Canada, Japan, New Zealand, Singapore and USA. All papers were sent to at least three programme committee members for review and every effort was made to obtain at least three reviews. Of the 47 papers submitted, 16 were selected for presentation at the conference. The programme committee invited Professor Joxan Jaffar, to give a keynote on Constraint Logic Programming for Program Analysis. Professor Jaffar has recently completed a stint as Dean of the School of Computing from 2001-2007 at the National University of Singapore. His interests are in programming languages and applications, with emphasis on the logic and constraint programming paradigms. Amongst his main contributions are the principles of constraint logic programming, and the widely-used CLP(R) system. The committee also invited Dr Benjamin Burton and Associate Professor Ewan Tempero to give invited talks. Dr Burtons talk was entitled Informatics Olympiads:Challenges in Programming and Algorithm Design. Associate Professor Temperos talk is entitled On Measuring Java Software.
Practical Inference Control for Data Cubes
Authors: Haibing Lu, Yingjiu Li
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

The fundamental problem for inference control in data cubes is how to efficiently calculate the lower and upper bounds for each cell value given the aggregations of cell values over multiple dimensions. In this paper, we provide the first practical solution for estimating exact bounds in two-dimensional irregular data cubes (i.e., data cubes in which certain cell values are known to a snooper). Our results imply that the exact bounds cannot be obtained by a direct application of the Fr\\'{e}chet bounds in some cases. We then propose a new approach to improve the classic Fr\\'{e}chet bounds for any high-dimensional data cube in the most general case. The proposed approach improves upon the Fr\\'{e}chet bounds in the sense that it gives bounds that are at least as tight as those computed by Fr\\'{e}chet, yet is simpler in terms of time complexity. Based on our solutions to the fundamental problem, we discuss various security applications such as privacy protection of released data, fine-grained access control and auditing, and identify some future research directions.