ppxscal/embedding_network huggingface dataset:
SIB: Database and Tool for the Integration and Browsing of Large Scale Image Hhigh-Throughput Screening Data
Authors: Karol Kozak, Marta Kozak, Eberhard Krausz
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Data management has become one of the central issues in high-throughput biological screening. In particular High-throughput Screening (HTS), applying automated microscopy, requires a system which is capable of storing and analyzing vast amounts of image and numeric data. These data include comprehensive information about the bioactive molecules, the targeted genes, and images as well as their extracted data matrices after acquisition. Here we present a web-based bioinformatics solution for the management of images from different screening microscopes: the Screening Image Browser (SIB). The following points describe this tool as well as an image retrieval mechanism, both working as a framework for browsing and analyzing screening information. A major outcome of this database will be a unique, fully operational, distributed digital library of screening image data accessible to researchers. SIB is a scientific database that enables effective data management accessible through a standard web-browser interface. The application utilizes a robust security architecture and is designed for efficient data exploration.
Effect of Feedback during Lecture Style Delivery Both in a Face-to-Face Classroom & during a Distance Education Television Session in a Developing Country like Bangladesh without the Use of Internet
Authors: Yousuf M. Islam, Zillur Rahman, Shafiq Shamsur Razzaq, Md. Abu Sayed, Shakib Zaman
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Distance Education [1] lectures aired over national television without means of interactivity has had very little success in providing Open University style of education in a developing country like Bangladesh. This paper explores some effects of providing feedback to students on their participation in a distance education scenario and in a normal face-to-face classroom situation. The techniques applied do not make use of Internet in rural regions and may be suitable for developing countries like Bangladesh.
A Fire-Alarming Method Based on Video Processing
Authors: Ping-He Huang, Jing-Yong Su, Zhe-Ming Lu, Jeng-Shyang Pan
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper presents a fire-alarming method based on video processing. We propose a system that uses color and motion information extracted from video sequences to detect fire. Flame can be recognized according to its color which is a primary element of fire images. Thus choosing a suitable color model is the key to detect flames from fire images. An effective fire detection criterion based on color model is proposed in this paper by intensive experiments and trainings. The detection criterion is used to make a raw localization of fire regions first. However, color alone is not enough for fire detection. To identify a real burning fire, in addition to chromatic features, dynamic features are usually adopted to distinguish other fire aliases. In this paper, both the growth of fire region and the invariability of flame are utilized to further detect the fire regions as a complement of the detection criterion. The effectiveness of the proposed fire-alarming method is demonstrated by the experiments implemented on a large number of scenes.
Mechanism design for policy routing
Authors: Joan Feigenbaum, Rahul Sami, Scott Shenker
Venue: Distributed Computing (2006)

The Border Gateway Protocol (BGP) for inter-domain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these preferences as arising from an AS's underlying utility for each route and study the problem of finding a set of routes that maximizes the overall welfare (i.e., the sum of all ASes' utilities for their selected routes).We show that, if the utility functions are unrestricted, this problem is NP-hard even to approximate closely. We then study a natural class of restricted utilities that we call next-hop preferences. We present a strategyproof, polynomial-time computable mechanism for welfare-maximizing routing over this restricted domain. However, we show that, in contrast to earlier work on lowest-cost routing mechanism design, this mechanism appears to be incompatible with BGP and hence difficult to implement in the context of the current Internet. Our contributions include a new complexity measure for Internet algorithms, dynamic stability, which may be useful in other problem domains.
Identification of Document Language is Not yet a Completely Solved Problem
Authors: Joaquim Ferreira da Silva, Gabriel Pereira Lopes
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Existing Language Identification (LID) approaches do reach 100% precision, in most common situations, when dealing with documents written in just one language, and when those documents are large enough. However, LID approaches do not provide a reliable solution for some situations: when there is need to discriminate the correct variant of the language used in a text, for example, European or Brazilian variants of Portuguese, UK or USA English variants, or any other language variants. Another hard context occur with small touristic advertisements on the web, addressing foreigners but using local language to name most local entities. In this paper, we present a fully statisticsbased LID approach which learns the most discriminant information according to each context, and identifies the correct language or language variant a text is written in. This methodology is shown to be correct for normal texts and maintains its robustness in hard LID contexts.
Effects of Selective Attention on Perceptual Filling-in
Authors: P. De Weerd, E. Smith, P. Greenberg
Venue: Journal of Cognitive Neuroscience (2006)

After few seconds, a figure steadily presented in peripheral vision becomes perceptually filled-in by its background, as if it "disappeared". We report that directing attention to the color, shape, or location of a figure increased the probability of perceiving filling-in compared to unattended figures, without modifying the time required for filling-in. This effect could be augmented by boosting attention. Furthermore, the frequency distribution of filling-in response times for attended figures could be predicted by multiplying the frequencies of response times for unattended figures with a constant. We propose that, after failure of figure&ndash;ground segregation, the neural interpolation processes that produce perceptual filling-in are enhanced in attended figure regions. As filling-in processes are involved in surface perception, the present study demonstrates that even very early visual processes are subject to modulation by cognitive factors.
Blind channel identification based on second order cyclostationary statistics
Authors: Y. Li, Z. Ding
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

For finite impulse response (FIR), channels with uncorrelated input sequences, L. Tong et al. (1991, 1992) have proposed an identification method under the special rank condition. The relationship is established between the rank condition and identifiability of FIR channels using second-order cyclostationary statistics. The method is generalized to the FIR channels with correlated input sequences. For general autoregressive moving average (ARMA) channels, a method is proposed that directly identifies the zeros and the poles of channels. Computer simulation results show the effectiveness of the proposed method.
Analysis of a heuristic for acyclic edge colouring
Authors: C. R. Subramanian
Venue: Information Processing Letters (2006)

An acyclic edge colouring of a graph is a proper edge colouring in which the union of any two colour classes does not contain a cycle, that is, forms a forest. It is known that there exists such a colouring using at most 16Δ(G) colours where Δ(G) denotes the maximum degree of a graph G. However, no non-trivial constructive bound (which works for all graphs) is known except for the straightforward distance 2 colouring which requires Δ2 colours. We analyse a simple O(mnΔ2(log Δ)2) time greedy heuristic and show that it uses at most 5Δ(log Δ + 2) colours on any graph.
Real-World Challenges of Pervasive Computing
Authors: Albrecht Schmidt, Sarah Spiekermann, Anatole Gershman, Florian Michahelles
Venue: IEEE Pervasive Computing (2006)

At the Pervasive Technology Applied workshop (part of Pervasive 2006), practitioners and researchers discussed how to bridge the gap between academic research and the practical hurdles in pervasive technology. The wide range of submissions demonstrated the great potential of applied pervasive technologies. In the emerging discussions, participants highlighted the most important technical and cooperation issues.
ODE methods for Markov chain stability with applications to MCMC
Authors: G. Fort, E. Moulines, S. Meyn, P. Priouret
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

Fluid limit techniques have become a central tool to analyze queueing networks over the last decade, with applications to performance analysis, simulation, and optimization.In this paper some of these techniques are extended to a general class of skip-free Markov chains. As in the case of queueing models, a fluid approximation is obtained by scaling time, space, and the initial condition by a large constant. The resulting fluid limit is the solution of an ODE in "most" of the state space. Stability and finer ergodic properties for the stochastic model then follow from stability of the set of fluid limits. Moreover, similar to the queueing context where fluid models are routinely used to design control policies, the structure of the limiting ODE in this general setting provides an understanding of the dynamics of the Markov chain. These results are illustrated through application to Markov Chain Monte Carlo.
Assessing motion-coherency in video watermarking
Authors: Vinod P., Gwenaël Doërr, P. K. Bora
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

Motion coherent watermarking has been recently proposed as a means to combat temporal frame averaging along the motion axis (MC-TFA). The fundamental idea consists in exploiting motion-compensation primitives to force a physcal point of the scene to always carry the same watermark sample wherever it is projected in the video. However, for a given watermarking system, there is no simple tool to assess whether the produced watermark is motion-coherent or not. Today, this assessment relies on a computationally expensive procedure, namely (i) embed a watermark, (ii) perform the MC-TFA attack, (iii) check for the presence of the watermark. Therefore, the goal of this article is to provide the community with an efficient and accurate oracle which reports whether a video sequence contains any non-motion coherent component or not. This is done in practice by looking at the statistics of the difference between a frame and a motion predicted version of it.
Constructing Cube Blocks Effectively for Stream Data Analysis
Authors: Lizheng Jiang, Dongqing Yang, Shiwei Tang, Xiuli Ma, Dehui Zhang
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

With the rapid growth of WWW, many applications based on web are generating tremendous amount of data. Analyzing and mining such data will be important for administrators and other users. Because these data are increasing continuously and rapidly, retrieving these data efficiently and effectively are challenging tasks. In this paper, we propose a new Cube Block model to organize multi-dimensional data efficiently for online analysis and mining. The main idea of Cube Block model is to split the whole data set into blocks by dividing time into exponential time frames. In each block, we omit individual time identifiers of data items and aggregate duplicate data items to one data cell. Cube Block model uses the approximating method to get historical data in any time interval. The approximation accuracy is guaranteed by an upper bound and a lower bound. For the implementation of Cube Block model, we develop the CB-Builder system to scan data and construct cube blocks. CB-Builder's algorithm complexity (runtime and space cost) is analyzed in this paper. Experiments on synthetic data sets demonstrate that Cube Block model with its implementation CB-Builder is an effective and efficient tool for web application data analysis and mining.
An Automated BIST Architecture for Testing and Diagnosing FPGA Interconnect Faults
Authors: Jack Smith, Tian Xia, Charles Stroud
Venue: Journal of Electronic Testing: Theory and Applications (2006)

We present an efficient built-in self-test (BIST) architecture for testing and diagnosing stuck-at faults, delay faults, and bridging faults in FPGA interconnect resources. The BIST structure contains self-enabling test pattern generators, self-configurable switch matrices, and response analyzers that all work together and reprogram themselves without any external intervention. This eliminates downloading configuration bitstreams into the FPGA after the start of testing and, hence, reduces test time. Our technique requires only six different switch matrix configurations to test the interconnect, which is fewer than prior methods, while retaining good diagnostic resolution. The area overhead to add self-configurable test structures to Xilinx FPGAs is as low as 0.5%.
Fault-diameter of generalized Cartesian products
Authors: Iztok Banic, Janez Zerovnik
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a kG-connected graph and D_c(G) denote the diameter of G after deleting any of its c \lt kG vertices. For a product of three factors G_1, G_2 and G_3, we prove that D_a+b+c+2(G) \lt D_a(G_1) + D_b(G_2) + D_c(G_3) + 1. We indicate how analogous proof gives the upper bound D_a+b+1(G) \lt D_a(G_1) + D_b(G_2) + 1 for the product of two factors. Finally, we show that D_a+b+1(G) \lt D_a(F) + D_b(B)+1 if G is a graph bundle with fibre F over base B, a \lt k_F,and b \lt k_B.
Using an Ensemble of One-Class SVM Classifiers to Harden Payload-based Anomaly Detection Systems
Authors: Roberto Perdisci, Guofei Gu, Wenke Lee
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Unsupervised or unlabeled learning approaches for network anomaly detection have been recently proposed. In particular, recent work on unlabeled anomaly detection focused on high speed classification based on simple payload statistics. For example, PAYL, an anomaly IDS, measures the occurrence frequency in the payload of n-grams. A simple model of normal traffic is then constructed according to this description of the packets' content. It has been demonstrated that anomaly detectors based on payload statistics can be "evaded" by mimicry attacks using byte substitution and padding techniques. In this paper we propose a new approach to construct high speed payload-based anomaly IDS intended to be accurate and hard to evade. We propose a new technique to extract the features from the payload. We use a feature clustering algorithm originally proposed for text classification problems to reduce the dimensionality of the feature space. Accuracy and hardness of evasion are obtained by constructing our anomaly-based IDS using an ensemble of one-class SVM classifiers that work on different feature spaces.
The Visual Exploration ofWeb Search Results Using HotMap
Authors: Orland Hoeber, Xue Dong Yang
Venue: Proceedings of the conference on Information Visualization (2006)

While the information retrieval techniques used by web search engines have improved substantially over the years, the search results have continued to be represented in a simple list-based format. Although this list-based representation makes it easy to evaluate a single document, it does not support the users in the broader tasks of manipulating the search results, comparing documents, or finding a set of relevant documents. HotMap provides a compact visual representation of web search results at two levels of detail, and supports the interactive exploration of web search results. User studies have shown that HotMap can result in fewer low-relevance documents being considered, and generates a higher level of confidence, ease of use, and satisfaction than a Google-like interface.
Model and method for evaluating creditability of C2C electronic trade
Authors: Lifang Peng, Zhong Chen, Qi Li
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Trust is emerging as a key element of success in the on-line environment. Many people do not trust in the electronic trade because of the trust problem. The behaviors of distrust or cheating are happened in electronic trade from time to time recently, especially in C2C electronic trade. The paper analyses the necessity of establishing the transaction credit evaluation, and proposes the transaction credit evaluation model and assessment method in C2C electronic trade. The model and method aims at providing helps to prevent the transaction side from cheating in a certain degree during the transaction, and helps to establish a trustworthy electronic trade environment.
Seamless Image Stitching of Scenes with Large Motions and Exposure Differences
Authors: Ashley Eden, Matthew Uyttendaele, Richard Szeliski
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper presents a technique to automatically stitch multiple images at varying orientations and exposures to create a composite panorama that preserves the angular extent and dynamic range of the inputs. The main contribution of our method is that it allows for large exposure differences, large scene motion or other misregistrations between frames and requires no extra camera hardware. To do this, we introduce a two-step graph cut approach. The purpose of the first step is to fix the positions of moving objects in the scene. In the second step, we fill in the entire available dynamic range. We introduce data costs that encourage consistency and higher signal-to-noise ratios, and seam costs that encourage smooth transitions. Our method is simple to implement and effective. We demonstrate the effectiveness of our approach on several input sets with varying exposures and camera orientations.
Toward immersive telecommunication: 3D video avatar with physical interaction
Authors: Sang-Yup Lee, Ig-Jae Kim, Sang C. Ahn, Myo-Taeg Lim, Hyoung-Gon Kim
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

Immersive telecommunication is a new challenging field that enables a user to share a virtual space with remote participants. The main objective is to offer rich communication modalities, as similar as those used in the face-to-face meetings like gestures, gaze awareness, realistic images, and correct sound direction. Moreover, full body interaction with physics simulation is presented as a natural interface. As a result, the user can be immersed and has interaction with virtual objects including remote participants. This would overcome the limitations both of the conventional video-based telecommunication and also the VR-based collaborative virtual environment approaches.
An Efficient Access Forwarding Method Based On Caches On Storage Nodes
Authors: Dai Kobayashi, Akitsugu Watanabe, Ryo Taguchi, Toshihiro x. Toshihiro Uehara2, Haruo Yokota
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In this paper, we discuss access forwarding schemes for the replication that achieve balanced access load distribution for data replicas on multiple storage nodes. In parallel storage systems, it is significant to handle skew of accessrequest distribution. Although replication is commonly used to solve such problems, it decreases hit ratios of cache memories on each storage nodes. We first obtain a result that it uses cache memories efficiently to forward accesses that target at data in less demand with a simple experiment. We also propose a method that uses hit ratios of each cache to recognize the popularity of data with low costs. Results of experiments with the method show that it helps the replication use the limited cache space efficiently.
Solutions to a Complete Web Service Discovery and Composition
Authors: Mohamrnad A. Makhzan, Kwei-Jay Lin
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to- end DAG based search approach. The assumption is that a user provides a X m file stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.
Augmented Reality for the Real World
Authors: Brett Wilkinson, Paul Calder
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Augmented Reality (AR) systems suitable for use in everyday situations should not intrude unduly on their user's lifestyle (or that of others around them). This paper argues that such systems should make use of technologies and devices such as mobile phones, PDAs, and portable entertainment units that people are likely to be already using for other purposes. However, such devices have limited capabilities, which present challenges when designing a system for interaction with a 3D world. This paper describes a prototype lightweight AR system built from off-the-shelf components and discusses some of the techniques we are developing to enable effective interaction with the system.
Adolescents' use of self-regulatory processes and their relation to qualitative mental model shifts while using hypermedia
Authors: Jeffrey A. Greene, Roger Azevedo
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This study examined 148 adolescents' use of self-regulated learning (SRL) processes when learning about the circulatory system using hypermedia. All participants scored in the lowest category on a measure of conceptual understanding regarding their mental model. We examined participants' verbal protocols to determine the relationship between SRL processes and qualitative shifts in students' mental models from pretest to posttest. Results indicated that participants who exhibited a qualitative shift in their mental models, pretest to posttest, displayed differential use of six SRL processes. These SRL processes included metacognitive monitoring activities, learning strategies, and indications of task difficulty. We propose that these SRL processes can account for the participants' shift in mental model. Implications for the design of hypermedia learning environments are presented.