ppxscal/embedding_network huggingface dataset:
Discovery of user communities based on terms of web log data
Authors: Tsuyoshi Murata
Venue: New Generation Computing (2007)

The Web is a huge network composed of Web pages and hyperlinks. It is often reported that related Web pages are densely linked with each other. Finding groups of such related pages, which are called Web communities, is important for information retrieval from the Web. Several attempts have been made for the discovery of Web communities such as Kumar's trawling and Flake's method. In addition to the communities of related Web pages, there are communities of users sharing common interests. Finding the latter communities, which we called user communities in this paper, is also important for clarifying the behaviors of Web users. It is expected that the characteristics of user communities in the Web correspond to those in real human communities. A method for discovering user communities is described in this paper. Client-level log data (Web audience measurement data) is used as the data of users' Web watching behaviors. Maximal complete bipartite graphs are searched from term-user graph obtained from the log data without analyzing the contents of Web pages. Experimental results show that our method succeeds in discovering many interesting user communities with labels that characterize the communities.
Towards a framework for corporate e-learning evaluation
Authors: Lúcia Blondet Baruque, Cássia Blondet Baruque, Rubens Nascimento Melo
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

The main focus of current researches is on technological and pedagogical aspects of web based learning. However, e-learning is a complex process that incorporates organizational, administrative, instructional, and technological risks. As such, various aspects should be considered for the success of e-learning. Although a lot of work has been done regarding the management, planning and implementation of e-learning, there is a lack of benchmarks to determine its success. To this end, we propose the use of an e-Learning Governance Reference Model -- eLGORM [1] that goes beyond the technological and pedagogical aspects of e-learning. In this paper we propose applying the governance principles in e-learning, based on a risk-oriented approach. We. briefly present eLGORM's processes and sub-processes and propose control standards to function as a benchmarking reference.
Maximum (s,t)-flows in planar networks in O(|V|log|V|) time
Authors: K. Weihe
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Let G=(V, A) be a directed, planar graph, let s, t /spl isin/ V, s/spl ne/t, and let c/sub a/>0 be the capacity of an arc a/spl isin/A. The problem is to find a maximum flow from s to t in G: subject to these capacities. The fastest algorithm known so far requires /spl Oscr/(|V|/spl middot//sup 3//spl radic/|V|/spl middot/log|V|) time, whereas the algorithm introduced in this paper requires only /spl Oscr/(|V|log|V|) time.
Identity-Based Conference Key Distribution Scheme Using Sealed Lock
Authors: Yongquan Cai, Xiuying Li
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In order to hold secure electronic conference in communication networks via insecure channels, a conference key distribution system should be constructed. The conference key distribution system is used for distributing a conference key shared among the participants of the conference and hence secure communications are achieved. In this paper, by using the sealed lock proposed in [1], we propose an identity-based conference key distribution scheme with user anonymity. We also show that, our scheme not only withstands passive attack, impersonation attack, and conspiracy attack, but also provides forward security of the chairman. These properties make it quite effective and practical.
OnCU system: ontology-based category utility approach for author name disambiguation
Authors: Young-Tack Park, Je-Min Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Author name disambiguation is essential for improving performance of document indexing, retrieval, and web search. Author name disambiguation resolves the conflict when multiple authors share the same name label. This paper introduces a novel approach which exploits ontologies and ontology-based category utility for author name disambiguation. Author name disambiguation determines the correct author from various candidate authors in the populated author ontology. Candidate authors are evaluated using proposed ontology-based category utility to resolve disambiguation. Ontology-based category utility has been proposed to exploit semantic information in ontology for semantic analysis for disambiguation. The ontology-based category utility increases the number of disambiguation by about 10% compared with that of category utility, and increases the overall amount of accuracy by around 98%.
A generalization of the remainder in multivariate polynomial interpolation
Authors: Dana Simian
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

The aim of this article is to introduce a generalization of the interpolation remainder in multivariate interpolation and to study it, in least interpolation schemes and in minimal interpolation ones. This generalization, we named λ-remainder, allows us a deeper analysis of the error in the interpolation process. Connected to the λ - remainder, we introduced the notion of λ - error order of interpolation. In the end we provide particular applications of the results we obtained. Interesting additionally theorems are also proved.
A note on mixed graphs and directed splitting off
Authors: Steffen Enni
Venue: Journal of Graph Theory (1998)

We give counterexamples to two conjectures of Bill Jackson in Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs (Journal of Graph Theory 12(3):429&ndash;436, 1988) concerning orientations of mixed graphs and splitting off in digraphs, and prove the first conjecture in the (di-) Eulerian case(s). Beside that we solve a degree constrained non-uniform directed augmentation problem for di-Eulerian mixed graphs. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 27: 213&ndash;221, 1998
Coordination protocols for a reliable sensor, actuator, and device network (SADN)
Authors: Keiji Ozaki, Tomoya Enokido, Makoto Takizawa
Venue: Mobile Information Systems (2008)

A sensor, actuator, and device network (SADN) is composed of three types of nodes, which are sensor, actuator, and actuation device nodes. Sensor nodes and actuator nodes are interconnected in wireless networks as discussed in wireless sensor and actuator networks (WSANs). Actuator nodes and device nodes are interconnected in types of networks, i.e. wireless and wired network. Sensor nodes sense an physical event and send sensed values of the event to actuator nodes. An actuator node makes a decision on proper actions on receipt of sensed values and then issue the action requests to the device nodes. A device node really acts to the physical world. For example, moves a robot arms by performing the action on receipt of the action request. Messages may be lost and nodes may be faulty. Especially, messages are lost due to noise and collision in a wireless network. We propose a fully redundant model for an SADN where each of sensor, actuator, and device functions is replicated in multiple nodes and each of sensor-actuator and actuator-device communication is realized in many-to-many type of communication protocols. Even if some number of nodes are faulty, the other nodes can perform requested tasks. Here, each sensor node sends sensed values to multiple actuator nodes and each actuator node receives sensed values from multiple sensor nodes. While multiple actuator nodes communicate with multiple replica nodes of a device. Even if messages are lost and some number of nodes are faulty, device nodes can surely receive action requests required for sensed values and the actions are performed. In this paper, we discuss a type of semi-passive coordination (SPC) protocol of multiple actuator nodes for multiple sensor nodes. We discuss a type of active coordination protocol for multiple actuator nodes and multiple actuation device nodes. We evaluate the SPC protocol for the sensor-actuator coordination in terms of the number of messages exchanged among actuators.
Spatial interaction of crime incidents in Japan
Authors: Kazuhiko Kakamu, Wolfgang Polasek, Hajime Wago
Venue: Mathematics and Computers in Simulation (2008)

We analyze the development of 18 types of criminal records in Japan for the period 1991-2001 across 47 prefectures with spatial lag and spatio-temporal heteroscedasticity. We explore the hypothesis that crime data are related to socio-economic variables in Japan. We extend the Bayesian approach of LeSage [J.P. LeSage, Bayesian estimation of spatial autoregressive models, Int. Regional Sci. Rev. 20 (1997) 113-129] for spatio-temporal Bayesian models. Additionally we analyze unobserved heteroscedasticity in the panel model by variance inflation factors as in Geweke [J. Geweke, Bayesian treatment of the independent Student-t linear model, J. Appl. Econ. 8 (1993) 19-40]. Positive and significant spatial dependencies can be found for 12 types of crimes and the influence of the socio-economic variables varies over the type of crimes.
Graph colouring with no large monochromatic components
Authors: Nathan Linial, JiŘÍ MatouŠek, Or Sheffet, GÁbor Tardos
Venue: Combinatorics, Probability and Computing (2008)

For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a colouring of the vertices of G by t colours with no monochromatic connected subgraph having more than m vertices. Let <private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009140_char1"/></private-char> be any non-trivial minor-closed family of graphs. We show that mcc2(G) = O(n2/3) for any n-vertex graph G ∈ <private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009140_char1"/></private-char>. This bound is asymptotically optimal and it is attained for planar graphs. More generally, for every such <private-char><inline-graphic mime-subtype="gif" xlink="S0963548308009140_char1"/></private-char>, and every fixed t we show that mcct(G)=O(n2/(t+1)). On the other hand, we have examples of graphs G with no Kt+3 minor and with mcct(G)=Ω(n2/(2t−1)). It is also interesting to consider graphs of bounded degrees. Haxell, Szabó and Tardos proved mcc2(G) ≤ 20000 for every graph G of maximum degree 5. We show that there are n-vertex 7-regular graphs G with mcc2(G)=Ω(n), and more sharply, for every ϵ > 0 there exists cϵ > 0 and n-vertex graphs of maximum degree 7, average degree at most 6 + ϵ for all subgraphs, and with mcc2(G) ≥ cϵn. For 6-regular graphs it is known only that the maximum order of magnitude of mcc2 is between <inline-graphic mime-subtype="gif" xlink="S0963548308009140_inline1"><alt-text>$\sqrt n$</alt-text></inline-graphic> and n. We also offer a Ramsey-theoretic perspective of the quantity mcct(G).
Performance Evaluation of Advanced High-Speed Data Transfer Methods in Long-Distance Broadband Networks
Authors: Masaaki Noro, Fumiaki Tameshige, Ken-ichi Baba, Shinji Shimojo
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Remote backup and some grid applications transfer large amounts of data over long distance networks. The throughput of TCP Reno and NewReno over LFNs (large fat pipe networks) is much smaller than application requirements. High speed protocols are being developed to overcome this problem. However, the fairness of these high speed protocols with conventional TCP (Reno or NewReno) is not sufficient in LFN. Some TCP based high speed protocols (e.g., TCP Westwood and BIC TCP) estimate available bandwidth to improve fairness. These protocols estimate available bandwidth on the sender side by using Ack packets, while UDT (UDP based data transfer protocol) is a high speed protocol that estimates available bandwidth on the receiver side by using packet pair algorithms. Estimating available bandwidth on the receiver side should be more accurate than estimating it with Acks. However, the fairness of UDT with conventional TCP and UDT itself over an LFN is not good enough. The UDT protocol estimates a much greater value than the actual available bandwidth when a network is congested. The UDT detects congestion too late in LFN environments. We propose gUDT (gentle UDT) and ERED to improve fairness over that currently provided in LFNs.
Multi-tiered design rationale for change set based product line architectures
Authors: Scott A. Hendrickson, Swaminathan Subramanian, André van der Hoek
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

Knowledge of why some product line architecture (PLA) consists of the specific features and feature interactions that constitute its overall structure is an invaluable resource for an architect. However, most PLA modeling techniques do not model these concepts explicitly. This requires that the architect express rationale separately, which increases the likelihood that it diverges and slowly but surely loses its value. To address this, we present an approach to capturing rationale that relies on a particular form of PLA modeling, namely PLAs modeled using change sets and relationships. In so doing, we enable the architect to express rationale concerning the PLA at three different tiers, covering individual elements in the PLA, change sets and their raison d'être, and the relationships that govern how individual product architectures are composed.
Analyzing composability of applications on MPSoC platforms
Authors: Akash Kumar, Bart Mesman, Bart Theelen, Henk Corporaal, Yajun Ha
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Modern day applications require use of multi-processor systems for reasons of performance, scalability and power efficiency. As more and more applications are integrated in a single system, mapping and analyzing them on a multi-processor platform becomes a multi-dimensional problem. Each possible set of applications that can be concurrently active leads to a different use-case (also referred to as scenario) that the system has to be verified and tested for. Analyzing the feasibility and resource utilization of all possible use-cases becomes very demanding and often infeasible. Therefore, in this paper, we highlight this issue of being able to analyze applications in isolation while still being able to reason about their overall behavior - also called composability. We make a number of novel observations about how arbitration plays an important role in system behavior. We compare two commonly used arbitration mechanisms, and highlight the properties that are important for such analysis. We conclude that none of these arbitration mechanisms provide the necessary features for analysis. They either suffer from scalability problems, or provide unreasonable estimates about performance, leading to waste of resources and/or undesirable performance. We further propose to use a Resource Manager (RM) to ensure applications meet their performance requirements. The basic functionalities of such a component are introduced. A high-level simulation model is developed to study the performance of RM, and a case study is performed for a system running an H.263 and a JPEG decoder. The case study illustrates at what granularity of control a resource manager can effectively regulate the progress of applications such that they meet their performance requirements.
Truly alphabet-independent two-dimensional pattern matching
Authors: Z. Galil
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

A. Amir, G. Benson and M. Farach (see Proc. 24th STOC, p.59-68 (1992)) gave an algorithm for two-dimensional pattern matching (ABF for short) whose text processing is independent of the alphabet and takes O(n/sup 2/) time, but whose pattern processing is dependent on the alphabet and takes O(m/sup 2/log mod Sigma mod ) time. The authors present an algorithm that is truly independent of the alphabet and takes linear O(m/sup 2/+n/sup 2/) time. As in the Knuth-Morris-Pratt algorithm, the only operation on the alphabet is the equality test of two symbols. All previous algorithms except the ABF algorithm reduce the two-dimensional problem into one-dimensional string matching, and use known techniques in string matching. The ABF algorithm uses two-dimensional periodicity for text processing, but their pattern processing resorts to one-dimensional techniques. The authors present a two-dimensional technique for both pattern processing and text processing.
A low-power reconfigurable logic array based on double-gate transistors
Authors: Paul Beckett
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

fine-grained reconfigurable architecture based on double gate technology is proposed and analyzed. The logic function operating on the first gate of a double-gate (DG) transistor is reconfigured by altering the charge on its second gate. Each cell in the array can act as logic or interconnect, or both, contrasting with current field-programmable gate array structures in which logic and interconnect are built and configured separately. Simulation results are presented for a fully depleted SOI DG-MOSFET implementation and contrasted with two other proposals from the literature based on directed self-assembly.
Usability evaluation of a mobile government service: mPAL-my cpf
Authors: Yogesh Tadwalkar, Yi Xiaoli, Rudi Lim
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

This paper presents findings from usability evaluation of 'mPAL-my cpf' - a mobile government service provided by Central Provident Fund, Singapore. 20 users between 22-45 years of age participated in the tests. The focus of evaluation was to assess the mental model, information architecture and perceived utility of the overall application as well as learnability, efficiency, and comprehension of the 6 specific offerings. A total of 65 usability problems were found with most severe issues observed in understanding how the m-service works and installing it on the mobile phone. Navigation problems included inconsistent placement of options tagged to soft keys and accidental logouts. Problems in information comprehension included excessive text and inability to find the key data quickly. Despite convenience of ubiquitous and anytime access, overall utility of 'mPAL' service was perceived as low by users due to complexity involved in using it, lack of unique value as compared to accessing the same information via website, and concerns about security. Based on these and other findings, the paper also recommends a broad framework for designing and evaluating future m-government applications.
Pay-as-you-go user feedback for dataspace systems
Authors: Shawn R. Jeffery, Michael J. Franklin, Alon Y. Halevy
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or concept. Dataspaces propose a pay-as-you-go approach: automated mechanisms such as schema matching and reference reconciliation provide initial correspondences, termed candidate matches, and then user feedback is used to incrementally confirm these matches. The key to this approach is to determine in what order to solicit user feedback for confirming candidate matches. In this paper, we develop a decision-theoretic framework for ordering candidate matches for user confirmation using the concept of the value of perfect information (VPI). At the core of this concept is a utility function that quantifies the desirability of a given state; thus, we devise a utility function for dataspaces based on query result quality. We show in practice how to efficiently apply VPI in concert with this utility function to order user confirmations. A detailed experimental evaluation on both real and synthetic datasets shows that the ordering of user feedback produced by this VPI-based approach yields a dataspace with a significantly higher utility than a wide range of other ordering strategies. Finally, we outline the design of Roomba, a system that utilizes this decision-theoretic framework to guide a dataspace in soliciting user feedback in a pay-as-you-go manner.
A Rapid and Efficient Pre-deployment Key Scheme for Secure Data Transmissions in Sensor Networks Using Lagrange Interpolation Polynomial
Authors: Hua-Yi Lin, De-Jun Pan, Xin-Xiang Zhao, Zhi-Ren Qiu
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This study proposes a pre-deployment key management scheme that requires a few memory capacities and CPU computations to address secure data transmissions in Wireless Sensor Networks (WSNs). The proposed scheme exploits threshold key management mechanisms by Lagrange Interpolation polynomial generating a key set for sensor nodes, and uses symmetric and irreversible cryptography schemes to encrypt transmitted data by the generated keys with Message Authentication Code (MAC). The sensor nodes merely have to aggregate and encrypt received data without complicated cryptography operations. The proposed approach can achieve rapid and efficient secure data transmissions with low communications, and is proper to be implemented on large-scale sensor networks.
Secure rural supply chain management using low cost paper watermarking
Authors: Ashlesh Sharma, Lakshminarayanan Subramanian, Eric A. Brewer
Venue: Proceedings of the second ACM SIGCOMM workshop on Networked systems for developing regions (2008)

Supply chain systems in rural developing regions are extremely fragile and are vulnerable to a wide range of security threats including theft, fraud and counterfeit goods. In this paper, we propose the design of a secure, low cost supply chain management system that leverages cheap cellphones and a low-cost paper watermarking system that can authenticate and verify the integrity of goods in a supply chain. Unlike many sophisticated solutions which have deployment problems due to the harsh ground realities in rural regions, our system is easy to use, deploy and does not require significant changes to the existing operational model. In addition, our system relies only on paper and cellphones, both of which are ubiquitously used in rural developing regions.
A study of moving mesh PDE methods for numerical simulation of blowup in reaction diffusion equations
Authors: Weizhang Huang, Jingtang Ma, Robert D. Russell
Venue: Journal of Computational Physics (2008)

A new concept called the dominance of equidistribution is introduced for analyzing moving mesh partial differential equations for numerical simulation of blowup in reaction diffusion equations. Theoretical and numerical results show that a moving mesh method works successfully when the employed moving mesh equation has the dominance of equidistribution. The property can be verified using dimensional analysis. In several aspects the current work generalizes previous work where a moving mesh equation is shown to have this dominance of equidistribution if it preserves the scaling invariance of the underlying physical partial differential equation and uses a small, constant value for @t (a parameter used for adjusting response time of the mesh movement to the change in the physical solution). Also, cases with both constant and variable @t are considered here.