ppxscal/embedding_network huggingface dataset:
The influence of quality criteria on parents' evaluation of medical web-pages: An Italian randomised trial
Authors: Vincenzo Currò, Paola Sabrina Buonuomo, Annaluce Zambiano, Andrea Vituzzi, Roberta Onesimo, Alessandro D'Atri
Venue: Technology and Health Care (2007)

The aim of this study is to verify the usefulness for parents of a web evaluation framework composed of ten quality criteria to improve their ability to assess the quality level of medical web sites. We conducted a randomised controlled trial that included two groups of parents who independently evaluated five paediatric web sites by filling out two distinct questionnaires: group A with the evaluation framework, group B without it. 40 volunteers were recruited from parents referring to the General Paediatrics Out-patients Department who satisfied the following eligibility criteria: Internet users, at least 1 child under 12 months old, no professional skill in Internet and medicine. The survey was taken between February 2, 2000 and March 22, 2000. Parents evaluated each web site and assigned a score, compared with a gold standard created by a group of experts. Suggesting evaluation criteria to parents seem useful for an improvement of their ability to evaluate web sites.
The Study of Using Sure Stream to Construct Ubiquitous Learning Environment
Authors: Koun-Tem Sun, Hsin-Te Chan
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Over the recent years, with the rapid development of science and technology, the Internet has become a necessary part of human life and is used for communication, transmission of files and remote login, etc. However, most mobile learning platforms on the market face a common problem: the traditional multi-point communication technique is limited by the bandwidth of the network, and therefore, users cannot obtain the best learning scenery. In this study, we adopted the theory of context-aware learning and introduced novel communication techniques, and proposed a technique using Sure Stream Streaming Service, with the aim of ensuring the smoothness and stability of media communication. We, based on the characteristics of HSDPA mobile communication, established an environment for Ubiquitous Learning, creating good conditions for E-learning. In this study, we also tested various types of wireless communication media on the market, and generated corresponding test reports as reference materials for related researches.
Efficient Contouring on Unstructured Meshes for Partial Differential Equations
Authors: Hassan Goldani-Moghaddam, Wayne H. Enright
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We introduce three fast contouring algorithms for visualizing the solution of partial differential equations based on the PCI (pure cubic interpolant). The PCI is a particular piecewise bicubic polynomial interpolant defined over an unstructured mesh. Unlike standard contouring approaches, our contouring algorithms do not need a fine-structured approximation and work efficiently with the original scattered data. The basic idea is to first identify the intersection points between contour curves and the sides of each triangle and then draw smooth contour curves connecting these points. We compare these contouring algorithms with the built-in Matlab contour procedure and other contouring algorithms. We demonstrate that our algorithms are both more accurate and faster than the others.
Removing randomness in parallel computation without a processor penalty
Authors: M. Luby
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Some general techniques are developed for removing randomness from randomized NC algorithms without a blowup in the number of processors. One of the requirements for the application of these techniques is that the analysis of the randomized algorithm uses only pairwise independence. The main new result is a parallel algorithm for the Delta +1 vertex coloring problem with running time O(log/sup 3/ nlog log n) using a linear number of processors on a concurrent-read-concurrent-write parallel random-access machine. The techniques also apply to several other problems, including the maximal-independent-set problem and the maximal-matching problem. The application of the general technique to these last two problems is mostly of academic interest, because NC algorithms using a linear number of processors that have better running times have been previously found.
Conjunctive query containment and answering under description logic constraints
Authors: Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini
Venue: ACM Transactions on Computational Logic (TOCL) (2008)

Query containment and query answering are two important computational tasks in databases. While query answering amounts to computing the result of a query over a database, query containment is the problem of checking whether, for every database, the result of one query is a subset of the result of another query. In this article, we deal with unions of conjunctive queries, and we address query containment and query answering under description logic constraints. Every such constraint is essentially an inclusion dependency between concepts and relations, and their expressive power is due to the possibility of using complex expressions in the specification of the dependencies, for example, intersection and difference of relations, special forms of quantification, regular expressions over binary relations. These types of constraints capture a great variety of data models, including the relational, the entity-relationship, and the object-oriented model, all extended with various forms of constraints. They also capture the basic features of the ontology languages used in the context of the Semantic Web. We present the following results on both query containment and query answering. We provide a method for query containment under description logic constraints, thus showing that the problem is decidable, and analyze its computational complexity. We prove that query containment is undecidable in the case where we allow inequalities in the right-hand-side query, even for very simple constraints and queries. We show that query answering under description logic constraints can be reduced to query containment, and illustrate how such a reduction provides upper-bound results with respect to both combined and data complexity.
Test Generation with DHT Networks
Authors: Harry Gros-Desormeaux, Hacène Fouchal, Philippe Hunel
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We propose in this paper to use DHT networks to cope with test generation for very large and complex systems. Indeed, conformance testing is known to be impracticable for this kind of systems. After a brief description of our first distributed environment used to deal with test generation, we propose to use the localization scheme of resources on DHT networks in order to distribute the specification among all peers. Our new algorithms are explained and described, and finally, seem to be, to the best of our knowledge, the first practicable solution usable for test generation for very large systems without specification simplification.
Short Communication: Improving connectivity in vehicular ad hoc networks: An analytical study
Authors: Saleh Yousefi, Eitan Altman, Rachid El-Azouzi, Mahmood Fathy
Venue: Computer Communications (2008)

Connectivity in vehicular ad hoc networks may degrade dramatically in sparse traffic and also high speed highways. In this paper we study a way to improve the connectivity by adding some extra nodes with higher transmission range which we call mobile base-stations. These nodes can also offer commercial services (e.g. advertisement, video, audio, etc.) to the vehicles on roads. Besides, the financial profit of those services also depends on a satisfactory connectivity. We use an equivalent M/G/~ queuing model in order to investigate the connectivity. We further take into account the case when some vehicles do not participate in the network either because they are not equipped with wireless transceivers or some other reasons like security concerns. Moreover, connectivity in presence of fixed Road Side Units (RSUs) is also studied. Our proposed analytical model can be used to find the optimum values of the number of base-stations as well as their transmission range in order to achieve a desired degree of connectivity.
Traps in chaotic maps and correction methods
Authors: Rostislav HučKa
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

Construction of pseudo-random sequence generator using chaotic map may occur various difficulties. One of them is when the global properties of the used map are overridden by local ones, it's called a trap. In this paper are described various methods to eliminate traps in special types of chaotic maps and keep other map properties untouched.
SGL: a scalable language for data-driven games
Authors: Robert Albright, Alan Demers, Johannes Gehrke, Nitin Gupta, Hooyeon Lee, Rick Keilty, Gregory Sadowski, Ben Sowell, Walker White
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We propose to demonstrate SGL, a language and system for writing computer games using data management techniques. We will demonstrate a complete game built using the system, and show how complex game behavior can be expressed in a declarative scripting language. The demo will also illustrate the workflow necessary to modify a game and include a visualization of the relational operations that are executed as the game runs.
Content based video matching using spatiotemporal volumes
Authors: Arslan Basharat, Yun Zhai, Mubarak Shah
Venue: Computer Vision and Image Understanding (2008)

This paper presents a novel framework for matching video sequences using the spatiotemporal segmentation of videos. Instead of using appearance features for region correspondence across frames, we use interest point trajectories to generate video volumes. Point trajectories, which are generated using the SIFT operator, are clustered to form motion segments by analyzing their motion and spatial properties. The temporal correspondence between the estimated motion segments is then established based on most common SIFT correspondences. A two pass correspondence algorithm is used to handle splitting and merging regions. Spatiotemporal volumes are extracted using the consistently tracked motion segments. Next, a set of features including color, texture, motion, and SIFT descriptors are extracted to represent a volume. We employ an Earth Mover's Distance (EMD) based approach for the comparison of volume features. Given two videos, a bipartite graph is constructed by modeling the volumes as vertices and their similarities as edge weights. Maximum matching of this graph produces volume correspondences between the videos, and these volume matching scores are used to compute the final video matching score. Experiments for video retrieval were performed on a variety of videos obtained from different sources including BBC Motion Gallery and promising results were achieved. We present qualitative and quantitative analysis of retrieval along with a comparison with two baseline methods.
The 1-to-7 phase decoder circuit design using VHDL
Authors: Serafim Poriazis
Venue: Proceedings of the 9th International Conference on Circuits (2005)

The design of the 1-to-7 Phase Decoder (PD7) circuit is described by using a core written in synthesizable VHDL. The circuit decodes the input line that carries a sequential pattern of seven clock phases into seven output lines by streaming sets of forteen clock phases. A phase difference equal to the half period of a clock signal is used at the input line and this is maintained between the consecutive output line transitions. The core model of the PD7 is given in behavioral VHDL description and the simulation and synthesis results are generated for targeting an FPGA device. The inverse function of the PD7 is obtained through an EXOR7 gate in a serial configuration. An extension of the circuit behavior is verified by applying the phased outputs of the PD7 circuit into seven replicas of the core and the associated simulation and synthesis results are obtained by using a 7×7 phase aggregation configuration.
From Use Cases to Framelets for Building Application Frameworks
Authors: Sarun Intakosum
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Framework-based software development has been proven a useful technique to develop an application. However, the development of a large application framework itself is considered complex. There are two major causes for this problem, the size of a framework and the vague framework requirements. The idea of framelet a small but complete framework, can be applied to solve the former. The Framelet-based Approach for Framework Development (FAFD) has been proposed to address the later. There are some improvements in term of use case requirements description to the approach after it was first presented. This paper aims to report such improvements as well as the ongoing researches on the FAFD.
Development of an adaptive learning system with two sources of personalization information
Authors: Judy C. R. Tseng, Hui-Chun Chu, Gwo-Jen Hwang, Chin-Chung Tsai
Venue: Computers Education (2008)

Previous research of adaptive learning mainly focused on improving student learning achievements based only on single-source of personalization information, such as learning style, cognitive style or learning achievement. In this paper, an innovative adaptive learning approach is proposed by basing upon two main sources of personalization information, that is, learning behavior and personal learning style. To determine the initial learning styles of the students, the [Keefe, J. W. (1987). Learning Styles: Theory and Practice. Reston, VA: National Association of Secondary School Principals.] questionnaire is employed in our approach. To more precisely reflect the learning behaviors of each student, the interactions and learning results of each student are analyzed when adjusting the subject materials. Based on the innovative approach, an adaptive learning system has been developed; moreover, an experiment was conducted to evaluate the performance of our approach. By analyzing the results from three groups of students using different adaptive learning approaches, it can be found that the innovative approach is helpful in improving both the learning achievement and learning efficiency of individual students.
Network synchronization with polylogarithmic overhead
Authors: B. Awerbuch
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the network to participate in each pulse of the synchronization process. The resulting communication overhead depends linearly on the number n of network nodes. A synchronizer with overhead only polylogarithmically dependent on n is introduced. This synchronizer can also be realized with polylog(n) space. The polylog-overhead synchronizer is based on involving only the relevant portions of the network in the synchronization process.
Some remarks on the odd hadwiger&#x2019;s conjecture
Authors: Ken-ichi Kawarabayashi, Zi-Xia Song
Venue: Combinatorica (2007)

We say that H has an odd complete minor of order at least l if there are l vertex disjoint trees in H such that every two of them are joined by an edge, and in addition, all the vertices of trees are two-colored in such a way that the edges within the trees are bichromatic, but the edges between trees are monochromatic. Gerards and Seymour conjectured that if a graph has no odd complete minor of order l, then it is (l &#x2212; 1)-colorable. This is substantially stronger than the well-known conjecture of Hadwiger. Recently, Geelen et al. proved that there exists a constant c such that any graph with no odd K k -minor is ck&#x221a;logk-colorable. However, it is not known if there exists an absolute constant c such that any graph with no odd K k -minor is ck-colorable. Motivated by these facts, in this paper, we shall first prove that, for any k, there exists a constant f(k) such that every (496k + 13)-connected graph with at least f(k) vertices has either an odd complete minor of size at least k or a vertex set X of order at most 8k such that G&#x2013;X is bipartite. Since any bipartite graph does not contain an odd complete minor of size at least three, the second condition is necessary. This is an analogous result of B&#x00f6;hme et al. We also prove that every graph G on n vertices has an odd complete minor of size at least n/2&#x03b1;(G) &#x2212; 1, where &#x03b1;(G) denotes the independence number of G. This is an analogous result of Duchet and Meyniel. We obtain a better result for the case &#x03b1;(G)= 3.
A Clustered Wireless Sensor Network Model Based on Log-Distance Path Loss
Authors: Frank Comeau, Shyamala Sivakumar, William J. Phillips, William Robertson
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

Clustered wireless sensor network models typically assume that a clear line-of-sight path separates the transmitter and receiver within a cluster; an accurate assumption for relatively short distances. For longer distances, and in environments that are obstructed, the log-distance path loss model agrees better with measurements. In this paper, communication within a cluster is modeled using the free space propagation model for distances less than a crossover distance, d0, and the log – distance path loss model with loss exponent n > 2 for distances greater than d0. We determine the optimum number of clusters for minimizing the energy expended in the clustered WSN given the network geometry, the number of nodes in the network, the crossover distance d0, and the amount of data compression.
Front-end Electronics Design based on Vernier Method for a High Resolution MicroPET
Authors: Xiaowen Kang, Yaqiang Liu, Xishan Sun, Shi Wang, Yan Xia, Zhicheng Zhang, Zhaoxia Wu, Yongjie Jin
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The design of a high resolution small animal positron emission tomography (MiroPET) camera was presented. This MicroPET has 10 photomultiplier tube (PMT)-Sharing-modular detectors. Each detector has 21 PMTs decoded with 180 BGO crystal elements. A new and low cost design of Time-to-Digital Convertor (TDC) based on Vernier method was developed. We use only one FPGA EPF10K30A and achieve 1.3ns timing resolution performance. Such TDC design gives us chance to realize TDC and ADC all together on one Printed Circuit Board (PCB), which would also significantly decrease complication of coincidence processing compared with our previous design. Our preliminary results showed: Vernier TDC had a less than 1.3ns timing resolution that met the demand for coincidence measurement for MicroPET. No inacceptable degradation was observed in time resolution when the temperature changes from 20 °C to 40°C. We obtain the 16.6% energy resolution, using this new easily compact modular electronic architecture.
Filtering Short Message Spam of Group Sending Using CAPTCHA
Authors: Peizhou He, Yong Sun, Wei Zheng, Xiangming Wen
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

the users, and the volume of short message spam becomes more and more large, especially the function of group Sending is used in short message. This paper proposes a method to filter short message spam of group sending, in other words, it utilizes CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart) method to filter short message spam. If the Short Message Service (SMS) can pass the CAPTCHA, it will be identified as legitimate SMS and transmitted by Short Message processing Center. Conversely, if the SMS can not pass the CAPTCHA, it will be identified as SMS spam and deleted by Short Message processing Center. Finally, it has been simulated with Smartphone of Microsoft Visual Studio 2005. Index Terms--SMS spam (short message service spam), group sending, CAPTCHA (Completely Automated Public Turing test to tell Computers and Human Apart), (OCR) Optical Character Recognition, user authentication.
Electronic marketplace definition and classification: literature review and clarifications
Authors: S. Wang, N. P. Archer
Venue: Enterprise Information Systems (2007)

The definitions and classifications of any new phenomenon build a strong foundation for further research. Although research on electronic marketplaces (EMs) has proliferated in recent years, related definitions and classifications are still confusing and misleading. The purpose of this paper is to perform a review of the EM literature, and to clarify and explain published information about electronic marketplaces. For EM definitions, we emphasise (1) the difference between EMs as governance structures and as business models, and (2) EMs at different levels of centralisation. For EM classifications, we summarise nine of the most commonly mentioned classifications, and examine the differences and correlations among them. By doing so, potential confusion and common misunderstanding about the different EM definitions and classifications are clarified.
Event queries on correlated probabilistic streams
Authors: Christopher Ré, Julie Letchner, Magdalena Balazinksa, Dan Suciu
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga [14], SASE [46] or SnoopIB[1], assume the data is precise. Noise in the data can be captured using techniques such as hidden Markov models. Inference on these models creates streams of probabilistic events which cannot be directly queried by existing systems. To address this challenge we propose Lahar1, an event processing system for probabilistic event streams. By exploiting the probabilistic nature of the data, Lahar yields a much higher recall and precision than deterministic techniques operating over only the most probable tuples. By using a novel static analysis and novel algorithms, Lahar processes data orders of magnitude more efficiently than a naïve approach based on sampling. In this paper, we present Lahar's static analysis and core algorithms. We demonstrate the quality and performance of our approach through experiments with our prototype implementation and comparisons with alternate methods.
Student understanding of object-oriented programming as expressed in concept maps
Authors: Kate Sanders, Jonas Boustedt, Anna Eckerdal, Robert McCartney, Jan Erik Moström, Lynda Thomas, Carol Zander
Venue: ACM SIGCSE Bulletin (2008)

In this paper, we present the results of an experiment in which we sought to elicit students' understanding of object-oriented (OO) concepts using concept maps. Our analysis confirmed earlier research indicating that students do not have a firm grasp on the distinction between "class" and "instance." Unlike earlier research, we found that our students generally connect classes with both data and behavior. Students rarely included any mention of the hardware/software context of programs, their users, or their real-world domains. Students do mention inheritance, but not encapsulation or abstraction. And the picture they draw of OO is a static one: we found nothing that could be construed as referring to interaction among objects in a program. We then discuss the implications for teaching introductory OO programming.