ppxscal/embedding_network huggingface dataset:
Subjective and Objective Assesment of Visual Image Quality Metrics and Still Image Codecs
Authors: Thomas Richter, Chaker Larabi
Venue: Proceedings of the Data Compression Conference (2008)

Objective quality assessment of lossy image compression codecs have becomean important part of the recent call of the JPEG committee for AdvancedImage Coding. The aim of this work is twofold: First, we presentstate-of-the-art still image codecs, JPEG in two variations, a visual andPSNR optimal JPEG2000 version, H.264/AVC and therecently proposed HDPhoto format introduced by Micrsoft. Wemeasure the performance of these codecs by subjective, full-referenceordering tests and two visual image quality metrics on a carefully selectedtest set. Second, we evaluate the prediction quality of the metrics bycomparing them with the outcome of the subjective tests.
One-button search extracts wider interests: an empirical study with video bookmarking search
Authors: Masayuki Okamoto, Masaaki Kikuchi, Tomohiro Yamasaki
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

This poster presents an overview of the characteristics of a one-button information retrieval interface with closed captions from TV watching activities, which is intended to lighten the burden of remembering and entering query terms while watching TV. We investigated this interface with an experimental system named Video Bookmarking Search, which estimates query terms from closed captions with named-entity recognition and sentence labeling techniques. According to an empirical evaluation for 1,138 search queries from 206 bookmarks using seven actual TV shows on city life, travel, health, and cuisine, we found wider queries and search results are acceptable through the query-input-free interface, despite the fact that the number of queries and search results that are directly relevant to the users' original intentions is not high. The main reason is a watching user's interest is wider than what is expressed with query terms.
A change-aware development environment by recording editing operations of source code
Authors: Takayuki Omori, Katsuhisa Maruyama
Venue: Proceedings of the 2008 international working conference on Mining software repositories (2008)

Understanding a program and its evolution is not satisfied only by looking at a current snapshot of its source code. Thus, a developer often examines a sequence of its snapshots stored in repositories of versioning systems, and identifies differences between two successive snapshots. Unfortunately, such differences do not represent individual changes of the source code. This paper proposes a mechanism for recording all editing operations a developer has applied to source code on an integrated development environment. The paper also shows a running implementation of the mechanism built as an Eclipse plug-in, which is called OperationRecorder. The experimental results with a small-scale program substantiate that it has a practical use from the viewpoint of its performance.
Integral of Fine Computable functions and Walsh Fourier series
Authors: Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

We define the effective integrability of Fine-computable functions and effectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theorem and Dominated Convergence Theorem. It is also proved that the Walsh-Fourier coefficients of an effectively integrable Fine-computable function form an E-computable sequence of reals and converge effectively to zero. The latter fact is the effectivization of Walsh-Riemann-Lebesgue Theorem. The article is closed with the effective version of Dirichlet's test.
Layered variance shadow maps
Authors: Andrew Lauritzen, Michael McCool
Venue: Proceedings of graphics interface 2008 (2008)

Shadow maps are commonly used in real-time rendering, but they cannot be filtered linearly like standard color, resulting in severe aliasing. Variance shadow maps resolve this problem by representing the depth distribution using moments, which can be linearly filtered. However, variance shadow maps suffer from "light bleeding" artifacts and require high-precision texture filtering hardware. We introduce layered variance shadow maps, which provide simultaneous solutions to both of these limitations. By partitioning the shadow map depth range into multiple layers, we eliminate all light bleeding between different layers. Using more layers increases the quality of the shadows at the expense of additional storage. Because each of these layers covers a reduced depth range, they can be stored in lower precision than would be required with typical variance shadow maps, enabling their use on a much wider range of graphics hardware. We also describe an iterative optimization algorithm to automatically position layers so as to maximize the utility of each. Our algorithm is easy to implement on current graphics hardware and provides an efficient, scalable solution to the problem of shadow map filtering.
A classification method based on subspace clustering and association rules
Authors: Takashi Washio, Koutarou Nakanishi, Hiroshi Motoda
Venue: New Generation Computing (2007)

Class Association Rule (CAR) based classification is a growing topic in recent datamining study for its high interpretability and accuracy. However, most of the approaches have not intensively addressed the classification of instances including numeric attributes. In this paper, a levelwise subspace clustering deriving hyper-rectangular clusters is proposed to efficiently provide quantitative, interpretative and accurate CARs. Significant performance of the proposed approach has been demonstrated through the tests on UCI repository data.
Granularity Considering in a Trust Model for P2P Networks
Authors: Li Mingchu, Ren Yizhi, Kouichi Sakurai, Cui Yongrui, Wang Zhihui
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Trust research is an important issue in P2P networks. Current trust models are lack of flexibility in dynamic environment. This paper presents a fine-grained trust computation model- FineTrust. The main contribution including: offering Gauss-bar function to evaluate the similarity of service satisfaction; considering the reliability of information from different people; setting some parameters in computing trust, such as recommendation consistent, recommendation accuracy, and recommendation error, which make the result of trust evaluation more natural, and so on. Theoretic analyses and simulations show that, the proposed trust model is more precise and more robust.
An SRAM Design-for-Diagnosis Solution Based on Write Driver Voltage Sensing
Authors: A. Ney, P. Girard, S. Pravossoudovitch, A. Virazel, M. Bastian, V. Gouin
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Diagnosis is becoming a major concern with the rapid development of semiconductor memories. It provides information about the location of manufacturing defects in the memory, and its effectiveness allows a fast yield ramp up. Most of existing diagnosis methods uses a fault dictionary to provide detailed information on fault localization. However, these solutions are most of the time unable to distinguish between all faults, and more importantly often fail to identify the actual faulty block of the memory. Identifying which block of a memory (core-cell array, write drivers, address decoders, pre-charge circuits, etc …) is defective allows to saving considerable amount of time during the ramp up phase.In this paper, we propose a very low cost Design-for-Diagnosis (DfD) solution for identifying faulty write drivers. It consists in verifying logic and analog conditions that guarantee the fault-free behavior of the write driver. The proposed solution allows a fast diagnosis (only three consecutive write operations are needed to fully diagnose the write driver) and induces a low area overhead (about 0.5% for a 512x512 SRAM). Beside diagnosis, an additional interest of such a solution is its usefulness during a post-silicon characterization process, where it can be used to extract the main features of the write drivers (logic and analog levels on bit lines).
Mobisense testbed: merging user perception and network performance
Authors: Pablo Vidales, Frank Steuer, Niklas Kirschnick, Marcel Wältermann, Blazej Lewcio, Sebastian Möller
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The convergence of different commercial wireless technologies poses new opportunities for always-on connectivity and nearly ubiquitous access in Next Generation Networks (NGNs). The proposed integrated virtual access platform frees users from the fixed locations, and allows them to enjoy services while they are on the move. However, the possibility to seamlessly roam (on demand) across wireless technologies is a must in NGNs. Even though a wide body of research has been done on seamless mobility, a thorough analysis of user perception of this phenomenon is required in order to successfully design, and further improve, always-on services and mobility management solutions. This paper describes a testbed specially built to investigate the user perception of mobility in NGNs. The Mobisense testbed enables the mapping of user experience to network conditions, focusing on phenomena caused by a user roaming across diverse wireless technologies and the impact on applications and services. The Mobisense setting helps in the analysis of IP services, in particular experiments were done to study user perceived quality of Voice over IP in NGNs. This testbed allows (1) the migration of VoIP calls across heterogeneous wireless networks, (2) network application data tracking, (3) simulation of user mobility patterns, (4) and audio codec changeovers while roaming between networks.
Authenticated Secure Group Communication using Broadcast Encryption Key Computation
Authors: R. Aparna, B. B. Amberker
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Broadcast Encryption deals with broadcasting an encrypted message, so that only a set of users termed privileged can decrypt it. This is made possible with the computation of secret key which is known only to members of the privileged set. This privileged set can be called as a secure group and the communication within the set as Secure Group Communication which provides only confidentiality. Providing authentication forthe messages exchanged between group members in addition toconfidentiality is an important issue in Secure GroupCommunication. We develop a protocol for Secure Authentic Communication where we address authentication for the scheme proposed by Fiat-Naor Broadcast encryption. Authentication scheme used is a multiparty authentication scheme which allows all the users in the system to send and receive messages simultaneously.Our scheme is secure against colluding malicious parties numbering fewer than k. The scheme provides authenticity by using a part of the information keys which is used for secret key computation, thus, without increasing the storage at the user.
A context analysis method for constructing reliable embedded systems
Authors: Naoyasu Ubayashi, Toshiki Seto, Hirotoshi Kanagawa, Susumu Taniguchi, Jun Yoshida, Takeshi Sumi, Masayuki Hirayama
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

This paper proposes a context-dependent requirements analysis method called CAMEmb (Context Analysis Method for Embedded systems) consisting of UML-based context modeling and formal verification support. In CAMEmb, a context model is constructed from initial system requirements by using a UML Profile for Context Analysis. This context model clarifies the relations among hardware components and contexts. After that, the context model is verified in order to check whether a target system behaves correctly under the expected contexts.
Comparing methods to identify defect reports in a change management database
Authors: Elaine J. Weyuker, Thomas J. Ostrand
Venue: Proceedings of the 2008 workshop on Defects in large software systems (2008)

A key problem when doing automated fault analysis and fault prediction from information in a software change management database is how to determine which change reports represent software faults. In some change management systems, there is no simple way to distinguish fault reports from changes made to add new functionality or perform routine maintenance. This paper describes a comparison of two methods for classifying change reports for a large software system, and concludes that, for that particular system, the stage of development when the report was initialized is a more accurate indicator of its fault status than the presence of certain keywords in the report's natural language description.
On the complexity of learning from counterexamples
Authors: W. Maass, G. Turan
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The complexity of learning concepts belonging to various concrete concept classes C contained in 2/sup X/ over a finite domain X is analyzed in terms of the number of counterexamples that are needed in the worst case. It turns out that for many interesting concept classes there exist exponential differences between the number of counterexamples that are required by a 'naive' learning algorithm for C (e.g. one that always outputs the minimal consistent hypothesis) and a 'smart' learning algorithm for C, which attempts to make a more sophisticated prediction. theta (log n) bounds are given for the number of counterexamples that are required for learning boxes, balls, and halfspaces in a d-dimensional discrete space X=(1, . . ., n)/sup d/ (for every finite dimension d). Also given are an upper bound of O(d/sup 3/) and a lower bound of Omega (d/sup 2/) for the complexity of learning a threshold function with d input bits (i.e. X=(0, 1)/sup d/). For each of these concept classes one can give learning algorithms that are both optimal (or close to optimal in the case of threshold functions) with regard to the number of counterexamples which they require and computationally feasible. The complexity of learning the concept classes on several variations of the learning model considered is determined. The relationship between these learning models and some related combinatorial invariants is clarified.
NEW MODEL BASED ON CELLULAR AUTOMATA AND MULTIAGENT TECHNIQUES
Authors: Daisuke Yamaguchi, Yasser Fouad Mahmoud Hassan, Eiichiro Tazaki
Venue: Cybernetics and Systems (2007)

The need for intelligent systems has grown in the past decade because of the increasing demand on humans and machines to perform better. The researchers of artificial intelligence (AI) have responded to these needs with the development of intelligent hybrid systems. This paper describes the modeling language for interacting hybrid systems in which we will build a new hybrid model of cellular automata and multiagent technology. Simulations with complex behavior will be model social dynamics where the focus is on the emergence of properties of local interactions. Therefore, in our approach, cellular automata form a useful framework for the multiagent simulation model and the model will be used for traffic system which lies in coordinating the local behavior of individual agent to provide an appropriate system-level behavior in grid of interacting organisms.
On the implicit acquisition of a context-free grammar by a simple recurrent neural network
Authors: Bo Cartling
Venue: Neurocomputing (2008)

The performance of a simple recurrent neural network on the implicit acquisition of a context-free grammar is re-examined and found to be significantly higher than previously reported by Elman. This result is obtained although the previous work employed a multilayer extension of the basic form of simple recurrent network and restricted the complexity of training and test corpora. The high performance is traced to a well-organized internal representation of the grammatical elements, as probed by a principal-component analysis of the hidden-layer activities. From the next-symbol-prediction performance on sentences not present in the training corpus, a capacity of generalization is demonstrated.
CRT-MAC: A Power-Saving Multicast Protocol in the Asynchronous Ad Hoc Networks
Authors: Yu-Chen Kuo, Chih-Nung Chen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

The asynchronous PS (Power-Saving) protocol was designed to synchronize two wireless hosts in the asynchronous ad hoc network such that those two wireless hosts can transmit an unicast message even though they have asynchronous wakeup frequencies. However, for transmitting a multicast message to more than one receiver, the protocol could not guarantee that all receivers can wake up simultaneously and then receive the multicast message. In this paper, we propose a new asynchronous PS protocol, named CRT-MAC PS protocol, for the multicast transmission in the asynchronous ad hoc networks. We define the difference m-pair property to guarantee that m different wakeup frequencies have the intersection. Thus, m wireless hosts with m different wakeup frequencies satisfying the difference m-pair property could wake up simultaneously. The CRT-MAC PS protocol utilizes the concept of Chinese Remainder Theorem to generate m wakeup frequencies which satisfy the difference m-pair property. When m wireless hosts use the wakeup frequency generated by the Chinese Remainder Theorem to transmit the multicast message, they will wake up simultaneously and receive the multicast message.
Type-matching clock tree for zero skew clock gating
Authors: Chia-Ming Chang, Shih-Hsu Huang, Yuan-Kai Ho, Jia-Zong Lin, Hsin-Po Wang, Yu-Sheng Lu
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR gates, and buffer gates. If the logic gates at the same level are in different types, which have different timing behaviors, the control of clock skew becomes difficult. Based on that observation, in this paper, we present a novel clock tree design style, called type-matching clock tree, to ensure that the logic gates at the same level are in the same type. We prove that any clock control logic can always be transformed to our type-matching clock tree. Then, based on the idea of type-matching clock tree, we propose a zero skew gated clock tree synthesis algorithm. Compared with the industry-strength gated clock tree synthesis, experimental data show that our approach can significantly reduce the clock skew in every process corner with a small penalty on the clock tree area and the clock tree power consumption.
Control-Based Adaptive Middleware for Real-Time Image Transmission over Bandwidth-Constrained Networks
Authors: Xiaorui Wang, Ming Chen, Huang-Ming Huang, Venkita Subramonian, Chenyang Lu, Christopher D. Gill
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include avionics mission re-planning over Link-16, security systems based on wireless camera networks, and online collaboration using camera phones. Meeting image transmission deadlines is a key challenge in such systems due to unpredictable network conditions. In this paper, we present CAMRIT, a Control-based Adaptive Middleware framework for Real-time Image Transmission in distributed real-time embedded systems. CAMRIT features a distributed feedback control loop that meets image transmission deadlines by dynamically adjusting the quality of image tiles. We derive an analytic model that captures the dynamics of a distributed middleware architecture. A control theoretic methodology is applied to systematically design a control algorithm with analytic assurance of system stability and performance, despite uncertainties in network bandwidth. Experimental results demonstrate that CAMRIT can provide robust real-time guarantees for a representative application scenario.
Microsoft Visual Basic Interview Questions: Microsoft VB Certification Review
Authors: Terry,  Sanchez-Clark
Venue:  (2007)

The Ultimate Reference & Interview Guide for Microsoft Visual Basic Developers! In-depth questions, answers, and explanations It's clear that Visual Basics is the future for Windows programmers and administrators, but finding up-to-date and user friendly resources can be challenging. From helping you to assess your VB skills to evaluating candidates for a job, this book will help you understand what you really need to know. The book is organized around common challenges with Visual Basic implementation. Each question includes everything you need to know to master the interview or properly evaluate a candidate. More than just a rehash of Microsoft documentation and sales presentations, each question is based on project knowledge and experience gained on successful high-profile Visual Basic implementations. Key topics include: . Troubleshooting during implementations . New features of VB 2005 . Design, performance tuning, audit and security . Database client/server development and monitoring
PERMIS: a modular authorization infrastructure
Authors: David Chadwick, Gansen Zhao, Sassa Otenko, Romain Laborde, Linying Su, Tuan Anh Nguyen
Venue: Concurrency and Computation: Practice Experience (2008)

Authorization infrastructures manage privileges and render access control decisions, allowing applications to adjust their behavior according to the privileges allocated to users. This paper describes the PERMIS role-based authorization infrastructure along with its conceptual authorization, access control, and trust models. PERMIS has the novel concept of a credential validation service, which verifies a user's credentials prior to access control decision-making and enables the distributed management of credentials. PERMIS also supports delegation of authority; thus, credentials can be delegated between users, further decentralizing credential management. Finally, PERMIS supports history-based decision-making, which can be used to enforce such aspects as separation of duties and cumulative use of resources. Details of the design and the implementation of PERMIS are presented along with details of its integration with Globus Toolkit, Shibboleth, and GridShib. A comparison of PERMIS with other authorization and access control implementations is given, along with suggestions where future research and development are still needed. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Automatically constructing concept maps based on fuzzy rules for adapting learning systems
Authors: Shih-Ming Bai, Shyi-Ming Chen
Venue: Expert Systems with Applications: An International Journal (2008)

In recent years, some methods have been presented for dealing with concept maps construction for providing the adaptive learning guidance to students. In this paper, we present a new method to automatically construct concept maps based on fuzzy rules and students' testing records. We apply fuzzy rules and fuzzy reasoning techniques to automatically construct concept maps and evaluate the relevance degrees between concepts. The proposed method provides a useful way to automatically construct concept maps in adaptive learning systems.