ppxscal/embedding_network huggingface dataset:
Pattern Mining in Frequent Dynamic Subgraphs
Authors: Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wackersreuther
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowledge. While current data mining deals with static graphs that do not change over time, coming years will see the advent of an increasing number of time series of graphs. In this article, we investigate how pattern mining on static graphs can be extended to time series of graphs. In particular, we are considering dynamic graphs with edge insertions and edge deletions over time. We define frequency in this setting and provide algorithmic solutions for finding frequent dynamic subgraph patterns. Existing subgraph mining algorithms can be easily integrated into our framework to make them handle dynamic graphs. Experimental results on real-world data confirm the practical feasibility of our approach.
Performance Improvement of MDD Tools
Authors: Benoit Langlois, Daniel Exertier, Stephane Bonnet
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

From first to mature versions of Model-Driven Development (MDD) tools, there is a gap, as for any other software applications. All functional requirements must be met, including qualities of services, at the risk of seeing MDD tools rejected by users. In this paper, we focus on performance, especially for large-scale developments. After an overview of methodological elements, we give a list of reusable practices on performance. We conclude by a set of observations and stakes in order to understand where efforts must be applied during the development process.
An Effective Approach for Accurate Estimation of Trust of Distant Information Sources in the Semantic Web
Authors: Vangelis G. Bintzios, Thanasis G. Papaioannou, George D. Stamoulis
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

To assess the trustworthiness of the information published in the World Wide Web referrals are often employed. This is due to the fact that most information sources are visited only occasionally by the same client, and thus, direct own experience rarely suffices. The accuracy of trust inference for unknown information sources may considerably deteriorate due to "noise" or to the intervention of malicious nodes producing and propagating untrustworthy referrals. In this paper, we describe an innovative approach for trust inference in the Semantic Web and in trust networks in general, referred to as FACiLE (Faith Assessment Combining Last Edges). Unlike all other approaches, FACilE infers a trust value for an information source from a proper combination of only the direct trust values of its neighbours. We evaluate the efficiency of our approach by means of a series of simulation experiments run for a wide variety of mixes of sources of untrustworthy information. FACiLE outperforms other trust-inference approach in the most interesting cases of population mixes.
Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach
Authors: Dong Xin, Jiawei Han, Xiaolei Li Zheng Shao Benjamin W. Wah
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Data cube computation is one of the most essential but expensive operations in data warehousing. Previous studies have developed two major approaches, top-down versus bottom-up. The former, represented by the MultiWay Array Cube (called the MultiWay) algorithm [30], aggregates simultaneously on multiple dimensions; however, it cannot take advantage of a priori pruning [2] when computing iceberg cubes (cubes that contain only aggregate cells whose measure values satisfy a threshold, called the iceberg condition). The latter, represented by BUC [6] , computes the iceberg cube bottom-up and facilitates a priori pruning. BUC explores fast sorting and partitioning techniques; however, it does not fully explore multidimensional simultaneous aggregation. In this paper, we present a new method, Star-Cubing, that integrates the strengths of the previous two algorithms and performs aggregations on multiple dimensions simultaneously. It utilizes a star-tree structure, extends the simultaneous aggregation methods, and enables the pruning of the group-bys that do not satisfy the iceberg condition. Our performance study shows that Star-Cubing is highly efficient and outperforms the previous methods.
Developing Personal Network Business Models
Authors: Dan Saugstrup, Anders Henten
Venue: Proceedings of the International Conference on Mobile Business (2006)

The aim of the paper is to examine the issue of business modeling in relation to personal networks, PNs. The paper builds on research performed on business models in the EU IST MAGNET1 project (My personal Adaptive Global NET). The paper presents the Personal Network concept and briefly reports on the 'state of the art' in the field of business modeling. Furthermore, the paper suggests three generic business models for PNs: a service oriented model, a self-organized model, and a combination model. Finally, examples of relevant services and applications in relation to three different cases are presented and analyzed in light of business modeling of PN.
Sharing Session Keys in Encrypted Databases
Authors: Yi Tang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Outsourcing database to database service providers demonstrates an emerging computation paradigm in many organizations. To meet the requirement of protecting sensitive data from outside providers, a bucket-based storage method is proposed to store the data encrypted. However, this storage method does not address the access control from the inside users, and an inside user may have enough rights to access the query results. In this paper, we propose a simple method to protect sensitive data both from insiders and outsiders on the bucket-based method. The session keys, used to encrypt sensitive data, are stored encrypted with corresponding tuples on remote databases. By constructing the user abilities to decrypt these encrypted keys on hierarchies, only the users in higher hierarchies are allowed to decrypt the encrypted session keys issued in some lower hierarchies. This method combines key distribution with access control and can be applied in the small enterprises where the users are structured in hierarchies.
Detection and Correction Process Modeling Considering the Time Dependency
Authors: Y. P. Wu, Q. P. Hu, M. Xie, S. H. Ng
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Most of the models for software reliability analysis are based on reliability growth models which deal with the fault detection process only. In this paper, some useful approaches to the modeling of both software fault detection and fault correction processes are discussed. Since the estimation of model parameters in software testing is essential to give accurate prediction and help make the right decision about software release, the problem of estimating the parameters is addressed here. Taking into account the dependency between the fault correction process and the fault detection process, a new explicit formula for the likelihood function is derived and the maximum likelihood estimates are obtained under various time delay assumptions. An actual set of data from a software development project is used as an illustrative example. A Monte Carlo simulation is carried out to compare the predictive capability between the LSE method and the MLE method.
A wearable fatigue monitoring system: application of human-computer interaction evaluation
Authors: Soichiro Matsushita, Ayumi Shiba, Kan Nagashima
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

We developed a wearable fatigue monitoring system with a high-sensitivity 2-axis accelerometer and an on-board signal processing microcontroller. The proposed system measures faint motion of the user's head while the user is trying to stand still for 30 seconds. The two axes of the accelerometer were settled parallel to the ground. As one of the candidates for diagnostic parameters, we adopted a time-integral of acceleration trace pattern length, which was defined as the length between the adjacent two acceleration X-Y plots. As artificially introduced physical stress such as running as well as some physically or mentally exhausted situations made consistent changes in the acceleration trace length, the proposed system was shown to have a capability of evaluating the degree of tiredness. Then we applied the proposed system to evaluation of human-computer interaction. We performed experiments on a computer entertainment using immersive display devices such as head-mounted displays and wide-angle plasma displays. As a result, the measured values of the acceleration trace length showed some inconsistency with user-interviews consist of subjective questionnaires about the user's fatigue.
A Best Practice Guide to Resources Forecasting for the Apache Webserver
Authors: Gunther A. Hoffmann, Kishor S. Trivedi, Miroslaw Malek
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Recently, measurement based studies of software systems prolifirated, reflecting an increasingly empirical focus on system availability, reliability, aging and fault tolerance. However, it is a non-trivial, error-prone, arduous, and time-consuming task even for experienced system administrators and statistical analysts to know what a reasonable set of steps should include to model and successfullypredict performance variables or system failures of a complex software system. Reported results are fragmented and focus on applying statistical regression techniques to captured numerical system data. In this paper, we propose a best practice guide for building empirical models based on our experience with forecasting Apache web sewer performance variables and forecasting call availability of a real world telecommunication system. To substantiate the presented guide and to demonstrate our approach step-by-step we model and predict the response time and the amount of free physical memory of an Apache web sewer system. Additionally, we present concrete results for a) variable selection where we cross benchmark three procedures, b) empirical model building where we cross benchmark four techniques and c) sensitivity analysis. This besr practice guide intends to assist in configuring modeling approaches systematically for best estimation andprediction results.
Simulation-based advanced WIP management and control in semiconductor manufacturing
Authors: Kazuo Miyashita, Tsukasa Okazaki, Hirofumi Matsuo
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We develop a hierarchical distributed production planning and control methodology, called DISCS, for a large and unstable semiconductor manufacturing process. The upper layer of DISCS periodically optimizes work-in-process inventory (WIP) levels to meet demands and sets a target WIP level for each workstation. One of key technologies required for the purpose is a fast simulation method to make the iterative optimization process tractable. In the lower layer, dispatching decisions are made at each workstation based on its target WIP level. Computational experiments using wafer fabrication process data show that DISCS, when compared with a traditional control method, succeeds in meeting the demand while keeping lower WIP levels. This indicates that DISCS is a promising methodology for production planning and control in semiconductor manufacturing.
Verification Methodology for Self-Repairable Memory Systems
Authors: Jin-Fu Li, Chun-Hsien Wu
Venue: Proceedings of the 15th Asian Test Symposium (2006)

With the nanometer-scale semiconductor technology, built-in self-repair (BISR) schemes are emerging techniques for improving the yield of embedded memories. A built-in self-repairable memory system typically consists of repairable memory cores, wrappers, built-in self-test (BIST) circuit, fuse group, and built-in redundancy-analyzer. This paper presents a system-level verification methodology for built-in self-repairable memory systems. The proposed verification methodology can verify the connectivity between the wrappers and self-repairable memories in a self-repairable memory system. Also, it can verify the wrapper misplaced design errors.
Education
Authors: Andrew J. Bernoff
Venue: SIAM Review (2006)

When Google debuted in the late 1990s and began its meteoric rise to become the Internet&apos;s zeitgeist at the turn of the millennium, the subtext for mathematics could have been that linear algebra matters. At its core, Google is built on the PageRank algorithm, which is a clever way of ranking the importance of a page by how it links to other pages. Amazingly, armed with a basic understanding of directed graphs and eigenvalues problems, the PageRank concept is easily accessible to students in an introductory linear algebra course. This issue&apos;s Education section article,"The $25,000,000,000 Eigenvector: The Linear Algebra behind Google" by Kurt Bryan and Tanya Leise, provides just such an introduction to the ideas behind PageRank. The authors describe the algorithm intuitively, translate the problem into mathematics, and then give a quick tutorial on its solution. Along the way, they illustrate the link between graph theory and linear algebra, introduce the reader to some examples of analysis problems that arise in these subjects, and give a glimmer of the numerical algorithm used to make the actual calculation. The paper is liberally strewn with exercises suitable for linear algebra novices. The ideas in the paper could easily be adapted as an applications lecture or two in a first linear algebra course. It also is written at a level where it should make a nice supplement or basis for a project in either linear algebra or graph theory. Finally, it provides a definitive answer to why the aspiring business student really should pay attention in math class; the resulting payday could literally be a few billion dollars.
Pose-Invariant Physiological Face Recognition in the Thermal Infrared Spectrum
Authors: P. Buddharaju, I. T. Pavlidis, P. Tsiamyrtzis
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present a novel framework for face recognition based on physiological information. The motivation behind this effort is to capitalize on the permanency of innate characteristics that are under the skin. To establish feasibility, we propose a specific methodology to capture facial physiological patterns using the bioheat information contained in thermal imagery. First, the algorithm delineates the human face from the background using the Bayesian framework. Then, it localizes the superficial blood vessel network using image morphology. The extracted vascular network produces contour shapes that are characteristic to each individual. The branching points of the skeletonized vascular network are referred to as Thermal Minutia Points (TMP) and constitute the feature database. To render the method robust to facial pose variations we collect for each subject to be stored in the database five (5) different pose images (center, mid-left profile, left profile, mid-right profile, and right profile). During the classification stage, the algorithm first estimates the pose of the test image. Then, it matches the local and global TMP structures extracted from the test image with those of the corresponding pose images in the database. We have conducted experiments on a sizeable database of thermal facial images collected in our lab. The good experimental results show that the proposed methodology has merit. More important, the results demonstrate the feasibility of the physiological framework in face recognition and open the way for further methodological and experimental research in the area.
Combinatorial generation by fusing loopless algorithms
Authors: Tadao Takaoka, Stephen Violich
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loop-less algorithms can be fused to produce a new loop-less algorithm that solves the original problem. We demonstrate this method with two new loopless algorithms, MIXPAR and MULTPERM. MIXPAR generates well-formed parenthesis strings containing two different types of parentheses. MULTPERM generates multiset permutations in linear space using only arrays; it is simpler and more efficient than the recent algorithm of Korsh and LaFollette (2004).
PAT goes to college: evaluating a cognitive tutor for developmental mathematics
Authors: Kenneth R. Koedinger, Erika L. F. Sueker
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

This report describes an adaptation of the Practical Algebra Tutor, "PAT," for college-level developmental mathematics, and initial evaluations of PAT at two college sites. PAT is a software learning environment that presents students with real-world problem situations, modern mathematical representational tools to analyze these situations, and constant background support from a "cognitive tutor"-- an intelligent computer tutor based on the ACT theory of cognition. Previous classroom evaluations showed that high-school students using PAT outperformed students in regular classes by 15% on standardized tests, and by 100% on assessments of authentic problem-solving. In two colleges, PAT students performed more than 50% better than students in regular classes on a performance-based assessment. This assessment requires students to use mathematical representations to analyze a real-world problem situation. It captures the reform objectives of the PAT approach, which are consistent with new national standards for mathematics.
A parallel AR spectral estimation using a new class of filter bank
Authors: K. Nishikawa, K. Miyazaki, H. Kiya
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

It is reconfirmed that the aliasing terms cannot be cancelled under the ordinary perfect reconstruction filter bank conditions and therefore the perfect reconstruction filter banks cannot be used for the purpose. To realize parallel spectral estimation, the sufficient filter bank conditions are derived and the general procedure for parallel estimation is shown. Then the proposed method is applied to the Levinson-Durbin algorithm and it is demonstrated that the method can be implemented effectively with the algorithm.
Persuasive interaction for collectivist cultures
Authors: Rilla Khaled, Robert Biddle, James Noble, Pippin Barr, Ronald Fischer
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

Persuasive technology is defined as "any interactive product designed to change attitudes or behaviours by making desired outcomes easier to achieve". It can take the form of interactive web applications, hand held devices, and games. To date there has been limited research into persuasive technology outside of America. Cross-cultural research shows that in order for persuasion to be most effective, it is often necessary to draw upon important cultural themes of the target audience. Applying this insight to persuasive technology, we claim that the set of persuasive technology strategies as described by B J Fogg caters to a largely individualist audience. Drawing upon cross-cultural psychology and sociology findings about patterns of behaviour commonly seen in collectivists, we present a principled set of collectivism-focused persuasive technology strategies. These strategies are: group opinion, group surveillance, deviation monitoring,disapproval conditioning, and group customisation. We also demonstrate how application of the strategies can support the design of a collectivist, persuasive game.
Application Programming Interface offering classification services to end-user applications
Authors: Karol Molnar, Martin Kyselak
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

There are several sophisticated and practically tested technologies supporting Quality of Service (QoS) through a communication network. On the other hand, the extension of QoS support towards end-user applications is quite rare. The Application Programming Interface (API) described in this paper represents a possibility how to extend QoS in this direction under the Microsoft Windows environment. The solution presented is closely related to the DiffServ technology, i.e. packet marking based on the type of the network service the packet was generated by.
A generalized Maxwell-slip friction model appropriate for control purposes
Authors: V. Lampaert, F. Al-Bender, J. Swevers
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Under the increasing demand for more accurate high-performance motion systems, various friction models appropriate for control purpose of mechanical systems have been proposed. Most of these friction models formulate a heuristic dynamical model based on a few observed typical friction properties (e.g. a Stribeck curve for constant velocities and a hysteresis behaviour in presliding regime). This paper presents a novel friction model, called the generalized Maxwell-slip (GMS) model, appropriate for control purpose, based on a physically motivated friction model, i.e. a generic friction model which simulates the contact physics at asperity level. This paper compares the GMS model with some well-known existing models and shows that the novel model is capable of predicting accurately not only the presliding regime and Stribeck effect, but also friction lag, transition behavior, break-away force and the non-drifting ('stiction') property.