ppxscal/embedding_network huggingface dataset:
From web archive to WebDigest: concept and examples
Authors: Li Xiaoming, Huang Lianen
Venue: Proceedings of the nineteenth conference on Australasian database - Volume 75 (2008)

Much like a black hole, the Web, since its birth, has been absorbing all sorts of data (information) around the globe, ever generated along the path of human civilization. On the other hand, the digitized and networked (webbed) nature of web data, which generally means "easy to access", gives rise to much imagination on re-discovering, re-engineering, and re-using of the oceanic information. Nevertheless, lunch is not free. The same time when we see the grand opportunities, tremendous challenges are ahead. In this talk, I'll first introduce Web InfoMall (http://www.infomall.cn), the Chinese web archive we have been constructing since 2001. Along with the activities, we observe some useful capabilities have been developed, such as large scale web crawling and very large scale data organization. In addition, we discuss a step beyond the WebArchive, called WebDigest, which is an effort aimed at making use of the data in the web archive. With a web archive and associated capability, "web mining" here has a more or less different meaning, which spans from the structure analysis of the web to named entity and relation extractions, from spatial (if we consider URL as a space) information discovery to temporal information exhibition. The main challenge for us is around the theme of achieving reasonably good performance with affordable cost. As we are from a university lab, the underlying question is: what can be done (and how) in a university lab environment with modest resource. After all, most of the researches started from university lab. We need to understand the feasibilities and compromises while seeing the promises.
Jitter-Buffer Management for VoIP over Wireless LAN in a Limited Resource Device
Authors: Mohsen Baratvand, Mahmoud Tabandeh, Arash Behboodi, Ali Fotowat Ahmadi
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

VoIP over WLAN is a promising technology as a powerful replacement for current local wireless telephony systems. Packet timing Jitter is a constant issue in QoS of IEEE802.11 networks and exploiting an optimum jitter handling algorithm is an essential part of any VoIP over WLAN (VoWiFi) devices especially for the low cost devices with limited resources. In this paper two common algorithms using buffer as a method for Jitter handling are analyzed with relation to different traffic patterns. The effect of different buffer sizes on the quality of voice will be assessed for these patterns. Various traffic patterns were generated using OPNET and Quality of output voice was evaluated based on ITU PESQ method. It was shown that an optimum voice quality can be attained using a circular buffer with a size of around twice that of a voice packet.
ACE: Active Emergence Call Service System for u-Lifecare
Authors: Won-Hee Han, Eun-Ha Song, Laurence T. Yang, Jong-Hyuk Park, Young-Sik Jeong
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

This paper establishes ACE system that supports active emergency call service. ACE system is physically composed of E-Device (Emergency Mobile Device) for the handicapped, single elderly, and children, and E-Server (Emergency Server) with real-time monitoring management feature. E-Device reports emergency situation to emergency institutions and the user’s guardian through internet or CDMA. Therefore, E-Device is devised to be affordable, light-weighted, and small enough for the minorities including the handicapped, the elders, and children could carry around. E-Server is developed as a comprehensive control system which provides realtime monitoring feature in order to manage E-Devices efficiently and guarantee quality service.
Data spectroscopy: learning mixture models using eigenspaces of convolution operators
Authors: Tao Shi, Mikhail Belkin, Bin Yu
Venue: Proceedings of the 25th international conference on Machine learning (2008)

In this paper we develop a spectral framework for estimating mixture distributions, specifically Gaussian mixture models. In physics, spectroscopy is often used for the identification of substances through their spectrum. Treating a kernel function K(x, y) as "light" and the sampled data as "substance", the spectrum of their interaction (eigenvalues and eigenvectors of the kernel matrix K) unveils certain aspects of the underlying parametric distribution p, such as the parameters of a Gaussian mixture. Our approach extends the intuitions and analyses underlying the existing spectral techniques, such as spectral clustering and Kernel Principal Components Analysis (KPCA). We construct algorithms to estimate parameters of Gaussian mixture models, including the number of mixture components, their means and covariance matrices, which are important in many practical applications. We provide a theoretical framework and show encouraging experimental results.
Interfacing human and computer with wireless body area sensor networks: the WiMoCA solution
Authors: Elisabetta Farella, Augusto Pieracci, Luca Benini, Laura Rocchi, Andrea Acquaviva
Venue: Multimedia Tools and Applications (2008)

Wireless Body Area Sensor Networks (WBASN) are an emerging technology enabling the design of natural human---computer interfaces (HCI). Automatic recognition of human motion, gestures, and activities is studied in several contexts. For example, mobile computing technology is being considered as a replacement of traditional input systems. Moreover, body posture and activity monitoring can be used for entertainment and health-care applications. However, until now, little work has been done to develop flexible and efficient WBASN solutions suitable for a wide range of applications. Their requirements pose new challenges for sensor network designs, such as optimizing traditional solutions for use as environmental monitoring-like applications and developing on-the-field stress tests. In this paper, we demonstrate the flexibility of a custom-designed WBASN called WiMoCA with respect to a wide range of posture and activity recognition applications by means of practical implementation and on-the-field testing. Nodes of the network mounted on different parts of the human body exploit tri-axial accelerometers to detect its movements. The advanced digital Micro-electro-mechanical system (MEMS) based inertial sensor has been chosen for WiMoCA because it demonstrated high flexibility of use in many different situations, providing the chance to exploit both static and dynamic acceleration components for different purposes. Furthermore, the sensibility and accuracy of the sensing element is perfectly adequate for monitoring human movement, while keeping cost low and size compact, thus meeting our requirements. We implemented three types of applications, stressing the WBASN in many aspects. In fact, they are characterized by different requirements in terms of accuracy, timeliness, and computation distributed on sensing nodes. For each application, we describe its implementation, and we discuss results about performance and power consumption.
A Lazy Monitoring Approach for Heartbeat-Style Failure Detectors
Authors: Benjamin Satzger, Andreas Pietzowski, Wolfgang Trumler, Theo Ungerer
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Failure detectors are a fundamental part of safe fault-tolerant distributed systems. Many failure detectors use heartbeats to draw conclusions about the state of nodes within a distributed environment. The contribution of this paper is an approach whose benefits are twofold. On the one hand it reduces the network overhead produced by heartbeat-style failure detectors. On the other hand it improves the quality of these failure detectors by providing them with richer information about the current network condition. We call this approach lazy monitoring since the active sending of heartbeats is avoided if possible. As it is independent of the actual failure detection algorithm it can be used in many domains. For evaluation purposes we applied our approach to the Smart Doorplate Project. In this testbed the proposed technique reduced the traffic to 1.2% while providing much more information about the environment to the failure detectors.
Regular expressions: new results and open problems
Authors: Keith Ellul, Bryan Krawetz, Jeffrey Shallit, Ming-wei Wang
Venue: Journal of Automata, Languages and Combinatorics (2005)

Regular expressions have been studied for nearly 50 years, yet many intriguing problems about their descriptive capabilities remain open. In this paper we sketch some new results and discuss what remains to be solved.
The enchanting potential of technology: a dialogical case study of enchantment and the Internet
Authors: Mórna Ní Chonchúir, John Mccarthy
Venue: Personal and Ubiquitous Computing (2008)

Although user experience is now widely accepted as a central concern in human---computer interaction and interaction design, its conceptual and methodological implications are still being worked out. Enchantment has become emblematic in this process by pointing to the enlivening potential of technology in people-technology relations. As part of an ongoing project to deepen our understanding of enchantment in user experience, this paper presents a case study of one person's enchantment with their Internet uses. The analysis suggests three salient aspects of this enchantment: responsive crossing of boundaries; dialogue in personal transformation; and the potential endlessness and depths of enchantment. It also suggests that some characteristics of interaction with the particular medium facilitate enchantment: personal control over self-presentation; the paradox of being able to carefully craft meaning from what is normally chaotic; the possibility of finding and constructing personal narratives online; playing in a vast pool of information. Reflection on the results of this single case analysis points to the value for understanding user experience of in-depth single-case analyses that focus on the personal and particular.
Simpler and More Accurate Throughput Analysis of CDMA Pure ALOHA Networks with Variable Length Traffic
Authors: Shu-Ming Tseng, Yu-Chin Kuo, Yueh-Teng Hsu
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We propose M/M/inf model for the DS CDMA/unslotted ALOHA system with variable number of fixed-length packets. The analyzed throughput of M/M/inf queuing model is closer to the simulation throughput than the analyzed throughput of the previous queuing model is. Moreover, the proposed analysis scheme is simpler.
Spatial classification
Authors: Edwin Diday
Venue: Discrete Applied Mathematics (2008)

The aim of a spatial classification is to position the units on a spatial network and to give simultaneously a set of structured classes of these units ''compatible'' with the network. We introduce the basic needed definitions: compatibility between a classification structure and a tessellation, (m,k)-networks as a case of tessellation, convex, maximal and connected subsets in such networks, spatial pyramids and spatial hierarchies. As like Robinsonian dissimilarities induced by indexed pyramids generalize ultrametrics induced by indexed hierarchies we show that a new kind of dissimilarity called ''Yadidean'' induced by spatial pyramids generalize Robinsonian dissimilarities. We focus on spatial pyramids where each class is a convex for a grid, and we show that there are several one-to-one correspondences with different kinds of Yadidean dissimilarities. These new results produce also, as a special case, several one-to-one correspondences between spatial hierarchies (resp. standard indexed pyramids) and Yadidean ultrametrics (resp. Robinsonian) dissimilarities. Qualities of spatial pyramids and their supremum under a given dissimilarity are considered. We give a constructive algorithm for convex spatial pyramids illustrated by an example. We show finally by a simple example that spatial pyramids on symbolic data can produce a geometrical representation of conceptual lattices of ''symbolic objects''.
Multiparty computation with faulty majority
Authors: D. Beaver
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The problem of performing a multiparty computation when more than half of the processors are cooperating Byzantine faults is addressed. It is shown how to compute any Boolean function of n inputs distributively, preserving the privacy of inputs held by nonfaulty processors and ensuring that faulty processors obtain the function value if and only if the nonfaulty processors do. If the nonfaulty processors do not obtain the correct function value, they detect cheating with high probability. The solution is based on a new type of verifiable secret sharing in which the secret is revealed not all at once but in small increments. This process ensures that all processors discover the secret at roughly the same time. The solution assumes the existence of an oblivious transfer protocol and uses broadcast channels. The processors are not required to have equal computing power.
Visual odometry for robust rover navigation by binocular stereo
Authors: Aldo Cumani, Antonio Guiducci
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

This work deals with the problem of estimating the trajectory of an autonomous rover by passive stereo vision only (visual odometry). The proposed method relies on the tracking of pointwise image features and on the estimation of the robot motion by robust bundle adjustment of the stereo matched features, before and after the motion. Preliminary results from the application of the algorithm both to simulated data and to actual image sequences acquired by a mobile platform are presented and discussed.
Proving Correctness of an Efficient Abstraction for Interrupt Handling
Authors: Gerlind Herberich, Bastian Schlich, Carsten Weise, Thomas Noll
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper presents an approach to the efficient abstraction of interrupt handling in microcontroller systems. Such systems usually operate in uncertain environments, giving rise to a high degree of nondeterminism in the corresponding formal models, which in turn aggravates the state explosion problem. Careful handling of nondeterminism is therefore crucial for obtaining efficient model checking tools. Here, we support this goal by developing a formal computation model and an abstraction method, called interrupt nondeterminism, which instantiates nondeterministic values only if and when this is required by the application code. It is shown how this symbolic technique can be integrated into our explicit CTL model checking tool [mc]square by introducing lazy states. A lazy state consists of explicit and symbolic parts and therefore, represents several concrete states. With regard to interrupt handling, we also give a simulation relation between the concrete and the abstract state space, thus establishing the correctness of our technique. Furthermore, a case study is presented in which three different programs are used to demonstrate the effectiveness of our method.
Polynomial interpolation, an L-function, and pointwise approximation of continuous functions
Authors: Michael I. Ganzburg
Venue: Journal of Approximation Theory (2008)

We show that if {s"k}"k"="1^~ is the sequence of all zeros of the L-function L(s,@g)@?@?"k"="0^~(-1)^k(2k+1)^-s satisfying Res"k@?(0,1),k=1,2,..., then any function from span {|x|^s^"^k}"k"="1^~ satisfies the pointwise rapid convergence property, i.e. there exists a sequence of polynomials Q"n(f,x) of degree at most n such that @?f-Q"n@?"C"["-"1","1"]="~(|f(x)-Q"n(f,x)|)/E"n(f)=0, where E"n(f) is the error of best polynomial approximation of f in C[-1,1]. The proof is based on Lagrange polynomial interpolation to |x|^s, Res>0, at the Chebyshev nodes. We also establish a new representation for |L(x,@g)|.
A tool for teaching interactions between design patterns
Authors: Ezequiel Denegri, Guillermo Frontera, Antonio Gavilanes, Pedro J. Martín
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

We describe the Patterns+UML tool that has been designed to help students of a first year object-oriented programming (OOP) course to apply design patterns to UML class diagrams, to analyze the code generated after their application, and especially to learn how different design patterns interact each other when they share some classes that play a different role in each pattern.
Towards modeling & analysis of consolidated CMP servers
Authors: Padma Apparao, Ravi Iyer, Don Newell
Venue: ACM SIGARCH Computer Architecture News (2008)

As virtualization becomes ubiquitous in data centers, it becomes imperative that the definition of future multi-core platform architectures take into account the performance behavior and requirements of consolidated servers. However, performance analysis of commercial servers has traditionally been focused on individual parallel benchmarks running in dedicated mode. In this paper, we present an approach to developing a performance model for virtualized CMP servers potentially running heterogeneous workloads simultaneously. We show that a consolidation performance model can be developed by decomposing the problem into three constituent parts: (a) core interference due to consolidation, (b) cache interference due to consolidation and (c) virtualization overheads. Having laid out the consolidation framework, we then perform an initial case study with a new consolidation benchmark (vConsolidate). We present vConsolidate measurement characteristics on a Core 2 Duo-based server platform and then apply the performance model in order to predict the performance slowdown of each workload due to consolidation. We show that the model constructed is capable of achieving sufficient accuracy and discuss how to improve the accuracy in the future. Last but not least, we describe the extensions required to develop a complete generalized consolidation performance model.
Regularity selection for effective 3D object reconstruction from a single line drawing
Authors: Sun Yuan, Lee Yong Tsui, Sun Jie
Venue: Pattern Recognition Letters (2008)

Different regularities have been used in the reconstruction of a 3D object from a single-view line drawing. These regularities are not all equally informative in the reconstruction process: certain regularities may correspond mainly to noise, not information; some may overlap with each other or are not too relevant to the reconstruction. This paper studies these regularities comprehensively, so as to select the most effective set that can give robust and reliable 3D reconstruction. The selection is made through a method called automatic relevance determination (ARD), which employs the Bayesian framework and support vector regression estimation. The proposed method is able to identify the worst regularities according to their ARD parameters and eliminate them. The effectiveness of this pruning is evaluated by model validation. The regularity set so obtained is effective for general 3D reconstruction. The experimental results show that the regularity set selected can reduce the reconstruction complexity and produce satisfactory reconstruction performance.
Towards Mutation Analysis for Lustre Programs
Authors: Lydie du Bousquet, Michel Delaunay
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Mutation analysis is usually used to provide indication of the fault detection ability of a test set. It is mainly used for unit testing evaluation. This paper describes mutation analysis principles and their adaptation to the Lustre programming language. Alien-V, a mutation tool for Lustre is presented. Lesar model-checker is used for eliminating equivalent mutant. A first experimentation to evaluate Lutess testing tool is summarized.
Design of parallel algorithms for fractal video compression
Authors: Hong Peng, Meiqing Wang, Choi-Hong Lai
Venue: International Journal of Computer Mathematics (2007)

The intrinsic independent features of the optimal codebook cubes searching process in fractal video compression systems are examined and exploited. The design of a suitable parallel algorithm reflecting the concept is presented. The Message Passing Interface (MPI) is chosen to be the communication tool for the implementation of the parallel algorithm on distributed memory parallel computers. Experimental results show that the parallel algorithm is able to reduce the compression time and achieve a high speed-up without changing the compression ratio and the quality of the decompressed image. A scalability test was also performed, and the results show that this parallel algorithm is scalable.
AI-Cognitive Description in Visual Medical Pattern Mining and Retrieval
Authors: Lidia Ogiela, Ryszard Tadeusiewicz, Marek R. Ogiela
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This publication presents the use of artificial intelligence algorithms based on cognitive resonance for developing a new class of computer systems supporting the interpretation of image patterns and medical diagnostics. Such systems have been named UBIAS - Understanding Based Image Analysis Systems, and have been proposed as a new class of intelligent information systems able to execute so-called Computer Image Understanding. In particular, a BFSA system dedicated to tasks of medical interpretation of images presenting fractures of long bones in extremities is described.
A New Portrait of the Semantic Web in Action
Authors: James Hendler
Venue: IEEE Intelligent Systems (2008)

This special issue, rather than focusing on tools specifically for ontologies, looks at how they're being used and becoming part of the overall Web ecology. This article is part of a special issue called Semantic Web Update.
Teaching SQL: a case study
Authors: Carlos Pampulim Caldeira
Venue: ACM SIGCSE Bulletin (2008)

In this poster we describe a class experiment focused on a different way of teaching SQL language. Classically students are introduced to SQL programming and start right way to write code lines. Based on my teaching experience this is not the ideal methodology. This poster presents a new approach for teaching SQL programming in the context of a Portuguese University: "in order to write first we have to be able to read". This case study - although in its first steps - clearly recognizes the potential benefits of this approach.
On the realization of high-order current-mode filter employing current controlled conveyors
Authors: Erkan Yuce, Shahram Minaei
Venue: Computers and Electrical Engineering (2008)

In this paper, a general structure for realizing high-order current-mode analog filter responses with single-input and three-outputs is presented. The proposed circuit uses dual-output second-generation current controlled conveyors (DO-CCCIIs) and only grounded capacitors (Active-C structure), and can simultaneously realize low-pass, band-pass (if order is even number) and high-pass filter responses. The developed circuit does not require any component matching constraints thus it is suitable for fully integrated circuit (IC) technology. Simulations are performed for the fourth-order Butterworth filter to illustrate the frequency domain performance of the circuit.