ppxscal/embedding_network huggingface dataset:
Finding recent frequent itemsets adaptively over online data streams
Authors: Joong Hyuk Chang, Won Suk Lee
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be changed as time goes by. Identifying the recent change of a data stream, specially for an online data stream, can provide valuable information for the analysis of the data stream. In addition, monitoring the continuous variation of a data stream enables to find the gradual change of embedded knowledge. However, most of mining algorithms over a data stream do not differentiate the information of recently generated transactions from the obsolete information of old transactions which may be no longer useful or possibly invalid at present. This paper proposes a data mining method for finding recent frequent itemsets adaptively over an online data stream. The effect of old transactions on the mining result of the data steam is diminished by decaying the old occurrences of each itemset as time goes by. Furthermore, several optimization techniques are devised to minimize processing time as well as main memory usage. Finally, the proposed method is analyzed by a series of experiments.
The Generalized Solvability and Optimization of Parabolic Systems in Domains with Thin Low-Permeable Inclusions
Authors: S. I. Lyashko, D. A. Nomirovskii
Venue: Cybernetics and Systems Analysis (2003)

The problem of existence and uniqueness of the generalized solution and optimization of a parabolic system with low-permeable inclusions (imperfect interface) is considered. The investigation is based on the a priori inequalities in negative norms.
Upsetting the apple cart
Authors: Dennis Fowler
Venue: netWorker (2003)

There's nothing new about disruptive technology. The automobile did a number on the buggy-whip industry and sure sent a lot of horses out to pasture. Commercial air travel relegated passenger trains to the background. Maybe the dot-com bubble burst, but the technology underlying it continues to churn things up.
An analogue of Euler's identity and new combinatorial properties ofn-colour compositions
Authors: A. K. Agarwal
Venue: Journal of Computational and Applied Mathematics (2003)

An analogue of Euler's partition identity: "The number of partitions of a positive integer v into odd parts equals the number of its partitions into distinct parts" is obtained for ordered partitions. The ideas developed are then used in obtaining several new combinatorial properties of the n-colour compositions introduced recently by the author.
On some slowly convergent series involving the Hurwitz zeta-function
Authors: M. Hashimoto, S. Kanemitsu, Y. Tanigawa, M. Yoshimoto, W.-P. Zhang
Venue: Journal of Computational and Applied Mathematics (2003)

We shall extract the essence of the Adamchik-Srivastava generating function method (Analysis (Munich) 18 (1998) 131) by proving the most far-reaching Ramanujan-Yoshimoto formula and by showing that some of the results stated in Srivastava and Choi (Series Associated with the Zeta and Related Functions, Kluwer Academic Publishers, Dordrecht, 2001) are simple consequences of the above-mentioned formula.
Intentions to use groupware: the influence of users' perceptions
Authors: Craig Van Slyke, Hao Lou, John Day
Venue: Advanced topics in information resources management (2003)

Information technologies that support groups of individuals have become increasingly visible. While some of these, such as electronic mail, have become almost ubiquitous in many organizations, other groupware applications have not enjoyed similar acceptance. This study uses diffusion of innovation theory to investigate factors that may influence intentions to use a specific groupware application, Lotus Domino discussion databases. Findings indicate that intentions to use Domino discussion databases are impacted by perceptions of relative advantage, complexity, compatibility and result demonstrability. There was not a significant relationship between intentions to use and perceived trialability, visibility or voluntariness. Suggestions for positively impacting important perceptions are also offered. Those interested in increasing the use of groupware technologies may find these suggestions helpful in guiding their efforts.
Modeling object characteristics of dynamic Web content
Authors: W. Shi, E. Collins, V. Karamcheti
Venue: Journal of Parallel and Distributed Computing (2003)

Requests for dynamic and personalized content have increasingly become a significant part of Internet traffic, driven both by a growth in dynamic Web services and a "trickle-down" effect stemming from the effectiveness of caches and content-distribution networks at serving static content. To efficiently serve this trend, several server-side and cache-side techniques have recently been proposed. Although such techniques, which exploit different forms of reuse at the sub-document level, appear promising, a significant impediment to their widespread deployment is (1) the absence of good models describing characteristics of dynamic Web content and (2) the lack of effective synthetic content generators, which reduce the effort involved in verifying the effectiveness of a proposed solution.This paper addresses both of these shortcomings. Its primary contribution is a set of models that capture the characteristics of dynamic content both in terms of independent parameters such as the distributions of object sizes and their freshness, times, as well as derived parameters such as content reusability across time and linked documents. These models are derived from an analysis of the content from six representative news and e-commerce sites, using both size-based and level-based splitting techniques to infer document objects. A secondary contribution is a Java-based dynamic content emulator, which uses these models to generate edgeside include-based dynamic content and serve requests for whole documents as well as separate objects.
Affine Invariant Features from the Trace Transform
Authors: Maria Petrou, Alexander Kadyrov
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--The trace transform is a generalization of the Radon transform that allows one to construct image features that are invariant to a chosen group of image transformations. In this paper, we propose a methodology and appropriate functionals that can be computed from the image function and which can be used to calculate features invariant to the group of affine transforms. We demonstrate the usefulness of the constructed image descriptors in retrieving images from an image database and compare it with relevant state-of-the-art object retrieval methods.
XPath query transformation based on XSLT stylesheets
Authors: Sven Groppe, Stefan Böttcher
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Whenever XML data must be shared by heterogeneous applications, transformations between different application-specific XML formats are necessary. The state-of-the-art method transforms entire XML documents from one application format into another e.g. by using an XSLT stylesheet, so that each application can work locally on its preferred format. In our approach, we use an XSLT stylesheet in order to transform a given XPath query such that we retrieve and transform only that part of the XML document which is sufficient to answer the given query. Among other things, our approach avoids problems of replication, saves processing time and in distributed scenarios, transportation costs.
Semantic Biological Image Management and Analysis
Authors: Charlie Chubb, Yoshi Inagaki, Carl Cotman, Brian Cummings, Phillip C.-Y. Sheu
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Most commercially available image retrieval systems are so generic that they are not specialized to handle biological images and the feature domains associated with them. In molecular biology, neurobiology and cellular biology, for example, the recognition, classification and retrieval of distinct cellular features is a critically needed tool representing a computational problem that embodies the central challenges facing biological image database research. It often requires the consideration of expert/conceptual knowledge of images and the objectscontained within such images.This paper discusses the feasibility of developing a set of imaging algorithms that allows the user to train an imaging system/database to recognize biological objects of various sorts based on their own criteria. The image software builds a model of the selected objects by reiterative training, evolving the ability (i.e., the underlying rules) to recognize these objects. These objects are in turn archived into a growing database that builds upon the experience ofmultiple individuals that can be referred to as an object zoo. The user can search these zoos using newly acquired images based on similarly using more narrow or broadened criteria based on a new, semantic database framework called Semantic Objects.
Segmenting Customer Transactions Using a Pattern-Based Clustering Approach
Authors: Yinghui Yang, Balaji Padmanabhan
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Grouping customer transactions into categories helpsunderstand customers better. The marketing literaturehas concentrated on identifying important segmentationvariables (e.g. customer loyalty) and on using clusteringand mixture models for segmentation. The data miningliterature has provided various clustering algorithms forsegmentation. In this paper we investigate using"pattern-based" clustering approaches to groupingcustomer transactions. We argue that there are clustersin transaction data based on natural behavioral patterns,and present a new technique, YACA, that groupstransactions such that itemsets generated from eachcluster, while similar to each other, are different fromones generated from others. We present experimentalresults from user-centric Web usage data thatdemonstrates that YACA generates a highly effectiveclustering of transactions.
Explicitness and interactivity
Authors: Päivö Laine, Lic. Phil
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The objective of this paper is to examine the contribution of verbally coded information to the interactivity of web pages. The language of hyperlink and button links is analysed with regard to its reference to concrete user action, virtual interactive operation and target page content. The interactivity is measured on the basis of the significance of the consequences of clicking an interactive label. The data has been gathered from the websites of English-language electronic stores. The role of linguistic code is examined from the perspective of relevance to the user. The correct prediction of relev&aacute;nce is assumed to contribute to interactivity by increasing confidence and reducing hesitation.
Simulation based verification of register-transfer level behavioral synthesis tools
Authors: R. Ernst, S. Sutarwala, J. Y. Jou, M. Tong
Venue: Proceedings of the conference on European design automation (1990)

We present a simulation based system for verification of register-transfer level behavioral synthesis tools. Applications are tool debugging and automatic regression test. Key feature is a transformation of sequential circuits for application of pseudo-random test patterns. The results show a high relevance of verification with pseudo-random patterns.
Intelligent Database Design Diagnosis: Performance Assessment with the Provision of Domain Knowledge
Authors: Shahrul A. Noah, Michael D. Williams
Venue: Artificial Intelligence Review (2004)

Techniques for representing and exploiting domain knowledge (such as the dictionary, thesaurus and knowledge reconciliation techniques) have long been used by intelligent database design tools when performing the task of design synthesis. However, the capacity of these techniques to enhance the diagnostic capabilities of intelligent database design tools has yet to be explored and evaluated. This paper presents such an evaluation, focusing upon the aforementioned techniques of dictionary, thesaurus and knowledge reconciliation. Results obtained from this investigation suggest that use of these techniques has the potential to increase the diagnostic capabilities of intelligent database design tools by facilitating detection and resolution of design inconsistencies that would remain undiscovered in situations where such system-held domain knowledge was not available.
On the Number of Simple Cycles in Planar Graphs
Authors: Helmut Alt, Ulrich Fuchs, Klaus Kriegel
Venue: Combinatorics, Probability and Computing (1999)

Let C(G) denote the number of simple cycles of a graph G and let C(n) be the maximum of C(G) over all planar graphs with n nodes. We present a lower bound on C(n), constructing graphs with at least 2.28n cycles. Applying some probabilistic arguments we prove an upper bound of 3.37n.We also discuss this question restricted to the subclasses of grid graphs, bipartite graphs, and 3-colourable triangulated graphs.
Authenticity by typing for security protocols
Authors: Andrew D. Gordon, Alan Jeffrey
Venue: Journal of Computer Security (2003)

We propose a new method to check authenticity properties of cryptographic protocols. First, code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity properties by annotating the code with correspondence assertions in the style of Woo and Lam. Third, figure out types for the keys, nonces, and messages of the protocol. Fourth, check that the spi-calculus code is well-typed according to a novel type and effect system presented in this paper. Our main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi. It is feasible to apply this method by hand to several well-known cryptographic protocols. It requires little human effort per protocol, puts no bound on the size of the opponent, and requires no state space enumeration. Moreover, the types for protocol data provide some intuitive explanation of how the protocol works. This paper describes our method and gives some simple examples. Our method has led us to the independent rediscovery of flaws in existing protocols and to the design of improved protocols.
Hybrid Architectural Dynamic Thermal Management
Authors: Kevin Skadron
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

When an application or external environmental conditions cause a chip's cooling capacity to be exceeded, dynamic thermal management (DTM) dynamically reduces the power density on the chip to maintain safe operating temperatures. The challenge is that even though this reduction in power density reduces heat dissipation and can be used to regulate temperature and reduce the need for expensive thermal packages, reducing power density may come at acost in execution speed. This paper shows the importance of processor-architecture techniques for DTM, and proposes a new, "hybrid," low-overhead implementation based oncombining fetch gating and dynamic voltage scaling (DVS). When thermal stress is low, fetch gating is superior because it exploits instruction-level parallelism (ILP). Once thermal stress becomes severe enough that fetch gating degrades ILP, DVS is engaged instead to take advantage of its greater ability to reduce power density. We show that under a variety of assumptions about DVS implementation, a hybrid policy reduces DTM performance overhead by 25% on average compared to DVS, and is easy to design.
Debugging with Reverse Watchpoint
Authors: Kazutaka Maruyama, Minoru Terada
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Many programmers have had to deal with an overwrittenvariable resulting for example from an aliasing problem.The culprit is obviously the last write-access to that memorylocation before the manifestation of the bug. The usualtechnique for removing such bugs starts with the debuggerby (1) finding the last write and (2) moving the control pointof execution back to that time by re-executing the programfrom the beginning. We call the feature to implement thisprocess "reverse watchpoint" and believe automating it isimportant.In this paper we propose a new concept, "position", thatis, a point in the program execution trace, as needed forstep (2) above. The position enables debuggers to automatethe control of program execution to support common debuggingactivities. We have implemented position in Java witha bytecode transformer. Measurements show that positioncan be provided with an acceptable amount of overhead.
Towards the Reverse Engineering of UML Sequence Diagrams
Authors: L. C. Briand, Y. Labiche, Y. Miao
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

The objective of the work reported here is to defineand assess a method to reverse engineer UML sequencediagrams from execution traces. We do so based onformal transformation rules and we reverse engineerdiagrams that show all relevant technical information,including conditions, iterations of messages, and specificobject identities and types being involved in theinteractions. We present the fundamental principles ofour methodology, illustrate it with examples, and validateit through a case study.
Sifting and winnowing: approaches to finding useful information on the web
Authors: Matthew Zeidenberg
Venue:  (2003)

The Web has started a social transformation in which information flows more widely and could be made more reliable. But we need tools to make this flood of information more useful. I argue that web search engines, directories, and collaborative filtering systems should be combined into unified systems based on the general concept of information filtering. Such filtering can be used with Web pages, user reputations, and anything subject to a price or a poll. An information filtering mechanism can supplement or perhaps supplant markets and other institutions. Computers are best at processing large amounts of textual information quickly and making a good first guess on such attributes of a page as what category it belongs in, what other pages it is close to, and its rank relative to the other pages. Communities supporting user reputations are best at final judgments. A system that combines a Web directory and search engine can be built by spidering off the initial directory pages and using a multi-resolution version of the Naive Bayes algorithm that classifies the new pages in a scalable manner. I also show that links can add valuable information about what category in which a page belongs. By collecting human judgments about a set of pages, I find only a weak relationship between these judgments and a count of in-links to these pages. If human judgments are what one is looking for, there is no way to get such judgments that is better than gathering them directly, through collaborative filtering. I experiment with various ways of clustering web pages, first by using links and pruning out highly-referenced pages, second by using the WordNet electronic lexicon, and third by using semantic networks constructed from the document text. All of these methods are successful, to varying degrees. I build a linear system for collaborative filtering with an explicit relation between document and author. Ratings of documents reflect on their authors; and these influence the weight given to their rating of other documents. Such a system is shown to be stable after relaxation.
Revisiting IP QoS: why do we care, what have we learned? ACM SIGCOMM 2003 RIPQOS workshop report
Authors: Grenville J. Armitage
Venue: ACM SIGCOMM Computer Communication Review (2003)

ACM SIGCOMM 2003 included a number of workshops, including the all-day workshop "Revisiting IP QoS: Why do we care, what have we learned? (RIPQOS)." The goal of RIPQOS was to critique the evolution and deployment of IP quality of service (QoS) mechanisms, from both the research and operational community perspectives. The workshop's name was a challenge to all interested communities to reflect on whether IP QoS has lived up to the hype or whether it is simply misunderstood. The workshop saw 6 papers, 2 short papers, a discussion panel, a range of opinions and lots of questions. This report attempts to capture the essence of our workshop's discussions, presentations and experiences.
Numerical solution of retarded functional differential equations as abstract Cauchy problems
Authors: S. Maset
Venue: Journal of Computational and Applied Mathematics (2003)

An approach for the numerical solution of linear delay differential equations, different from the classical step-by-step integration, was presented in (Numer. Math. 84 (2000) 351). The problem is restated as an abstract Cauchy problem (or as the advection equation with a particular nonstandard boundary condition) and then, by using a scheme of order one, it is discretized as a system of ordinary differential equations by the method of lines. In this paper we introduce a class of related schemes of arbitrarily high order and we then extend the approach to general retarded functional differential equations. An analysis of convergence, and of asymptotic stability when the numerical schemes are applied to the complex scalar equation y'(t)=ay(t)+ by(t-1),is provided.
Mobility and stability evaluation in wireless multi-hop networks using multi-player games
Authors: F. Fitzek, L. Badia, M. Zorzi, G. Schulte, P. Seeling, T. Henderson
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Multi-hop networks have gained a lot of interest in recent years. A lot of work was contributed in the field of protocol design and performance of multi-hop networks. It is generally accepted that mobility has a huge impact on the protocol performance; even more for multi-hop networks. Obtaining realistic measurements of mobility, however, is complex and expensive. Thus, we adopt virtual world scenarios to explore the mobility issue, by using the well-known multi-player game, Quake II. The advantage of the Quake II engine is that users move within virtual worlds under realistic constraints, whereas other mobility models may offer insufficient accuracy or operate under unrealistic assumptions. Moreover, it is very easy to create new virtual worlds and to adapt them to specialized needs. In this paper, we propose an analytical framework for mobility measurements in virtual worlds that could be adopted for the design of communication protocols. Our framework enables the study of the impact of mobility on connectivity and stability of the network, giving useful insights for improving communication performance. An interesting application of our approach is the analysis of coverage extension of so called hotspots or emergency situations, where the fixed network infrastructure is insufficient or non-existent. In these extreme cases, multi-hop networks can be used to setup communication quickly. As these situations comprise a plethora of different cases and scenarios, our model is appropriate for their analysis, due to its generality. We use our framework to investigate the performance of multi-hop networks based on IEEE 802.11a technology. In contrast to other contributions focusing only on connectivity, the IEEE 802.11a technology also considers multi-rate connections. Our framework covers the evaluation of simple connectivity as well as link quality stability in the presence of mobility, a combination that has not been considered thus far. Therefore we introduce two simple routing schemes and highlight the performance of these protocols in presence of mobility. Furthermore we come up with four definitions of stability and investigate protocols for multi-hop networks in terms of this parameter. Our other contributions are the changes to the Quake II engine and the availability of mobility trace files.