ppxscal/embedding_network huggingface dataset:
An Example-based Prior Model for Text Image Super-resolution
Authors: Jangkyun Park, Younghee Kwon, Jin Hyung Kim
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a prior model for text image superresolution in the Bayesian framework. In contrast to generic image super-resolution task, super-resolution of text images can be benefited from strong prior knowledge of the image class: Firstly, low-resolution images are assumed to be generated from a highresolution image by a sort of degradation which can be grasped through example pairs of the original and the corresponding degradation; Secondly, text images are composed of two homogeneous regions, text and background regions. These properties were represented in a Markov Random Field (MRF) framework. Experiments showed that our model is more appropriate to text image super-resolution than the other prior models.
Contribution of fast and slow states to negative bias temperature instabilities in HfxSi(1-x)ON/TaN based pMOSFETs
Authors: M. Aoulaiche, M. Houssa, R. Degraeve, G. Groeseneken, S. De Gendt, M. M. Heyns
Venue: Microelectronic Engineering (2005)

Fast and slow states contributions to threshold voltage shifts of HfSiON/TaN gate stacks under negative bias temperature (NBT) stress are investigated. Fast states contribution to the total defects produced ranges between about 20 and 50%, depending on stress bias and temperature. The time and temperature dependence of the fast states is consistent with the reaction-diffusion model, while the kinetics and temperature dependence of the slow states suggest the production of hole traps in the bulk of the gate dielectric stack. Fast and slow states are recovered when the NBT stress is interrupted, the fraction of slow states recovered being larger by a factor about 2.
Class-based weighted fair queueing: validation and comparison by trace-driven simulation: Research Articles
Authors: Rachid El Abdouni Khayari
Venue: International Journal of Communication Systems (2005)

World-wide web as well as proxy servers rely for their scheduling on services provided by the underlying operating system. In practice, this means that some form of first-come-first-served (FCFS) scheduling is utilized. Although FCFS is a reasonable scheduling strategy for job sequences that do not show much variance, for the world-wide web it has been shown that the requested-object sizes do exhibit heavy tails. Under these circumstances, job scheduling on the basis of shortest-job first (SJF) or shortest remaining processing time (SRPT) has been shown to minimize the total average waiting time. However, these methods have the disadvantage of potential job starvation.In order to avoid the problems of both FCFS and SJF we present in this paper a new scheduling approach called class-based interleaving weighted fair queueing (CI-WFQ). This scheduling approach exploits the specific characteristics of the job stream being served, that is, the distribution of the sizes of the objects being requested, to set its parameters such that good mean response times are obtained and starvation does not occur. In that sense, the new scheduling strategy can be made adaptive to the characteristics of the job stream being served.In this paper we compare the new scheduling approach (using trace-driven simulations) to FCFS, SJF and the recently introduced &alpha;-scheduling, and show that CI-WFQ combines very good performance (as far as mean and variance of response time and blocking probability are concerned) with a scheduling complexity almost as low as for FCFS (and hence, lower than for SJF and &alpha;-scheduling). The use of trace-driven simulation is essential, since the special properties of the arrival process makes analytical solutions very difficult to achieve. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Detecting group activities using rigidity of formation
Authors: Saad M. Khan, Mubarak Shah
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Most work in human activity recognition is limited to relatively simple behaviors like sitting down, standing up or other dramatic posture changes. Very little has been achieved in detecting more complicated behaviors especially those characterized by the collective participation of several individuals. In this work we present a novel approach to recognizing the class of activities characterized by their rigidity in formation for example people parades, airplane flight formations or herds of animals. The central idea is to model the entire group as a collective rather than focusing on each individual separately. We model the formation as a 3D polygon with each corner representing a participating entity. Tracks from the entities are treated as tracks of feature points on the 3D polygon. Based on the rank of the track matrix we can determine if the 3D polygon under consideration behaves rigidly or undergoes non-rigid deformation. Our method is invariant to camera motion and does not require an a priori model or a training phase.
Robots in the desert: a research parable for our times
Authors: David A. Patterson
Venue: Communications of the ACM (2005)

DARPA's grand challenge spurred advances in the application of AI and, ironically, acted as a referendum on its de-emphasis on academic research.
IP layer load balance using fuzzy logic under IPv6 anycast mechanism
Authors: Chi-Yuan Chang, Wei-Ming Chen, Han-Chieh Chao, T. G. Tsuei, Hong Bin Liu
Venue: International Journal of Network Management (2005)

With the emergence of databases and Internet technology, the way data is acquired and accessed has changed with more convenient service. After years of evolution, the current IPv6 Internet Protocol (IP) has enabled the user to check any database worldwide by logging onto the Internet whenever you want and regardless of where you are. The load balance or efficiency issue arises when many users overload a server or database. This paper addresses this issue using the anycast characteristics. An active router design is developed to receive the server load information. This information is in turn used to determine the server's response to solve the load balance problem.
Analyzing TDMA with Slot Skipping
Authors: B. Andersson, E. Tovar, N. Pereira
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to a rate monotonic policy (as an example). We present the analysis in two steps. Firstly, we address the case where a node is only permitted to transmit a maximum of one message per TDMA cycle. Secondly, we generalise the analysis to the case where a node is assigned a budget of messages per TDMA cycle it may transmit. A simple algorithm to assign budgets to nodes is also presented.
Learning polynomial networks for classification of clinical electroencephalograms
Authors: V. Schetinin, J. Schult
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

We describe a polynomial network technique developed for learning to classify clinical electroencephalograms (EEGs) presented by noisy features. Using an evolutionary strategy implemented within group method of data handling, we learn classification models which are comprehensively described by sets of short-term polynomials. The polynomial models were learnt to classify the EEGs recorded from Alzheimer and healthy patients and recognize the EEG artifacts. Comparing the performances of our technique and some machine learning methods we conclude that our technique can learn well-suited polynomial models which experts can find easy-to-understand.
An Automate Test Case Generation Approach: Using Match Technique
Authors: Zhenyu Liu, Genxing Yang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The paper studies the principle of test case reuse technique and put forward an automatically test case generation approach. The paper proposes standardized description of the test case firstly. The reusable test case is depicted in a way similar to the definition of software component. And then the interface of test case is defined using the analogous method of the description of facet in reusable software component. Based on these technique, an automate method of test case is presented. An algorithm of the mapping from case search to test case tree is given to fulfill the goal of reusing test case. Based on the architecture given in the paper, the software test case could be reused and generated automatically during the development of test case. The technology of test case generation could improve test efficiency and qualification.
Language Identification of Character Images Using Machine Learning Techniques
Authors: Ying-Ho Liu, Fu Chang, Chin-Chin Lin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a new approach for identifying the language type of character images. We do this by classifying individual character images to determine the language boundaries in multilingual documents. Two effective methods are considered for this purpose: the prototype classification method and support vector machines (SVM). Due to the large size of our training dataset, we further propose a technique to speed up the training process for both methods. Applying the two methods to classifying characters into Chinese, English, and Japanese (including Hiragana and Katakana) has produced very accurate and comparable test results.
Pattern-Based Information Integration in Dynamic Environments
Authors: Jurgen Gores
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

The convenient availability of information is an essential factor in science and business. While internet technology has made large amounts of data available to the general public, the data is largely provided in human-readable format only. New technologies are now making direct access to millions of structured or semi-structured databases possible, but only through integration of these data sources maximum benefit can be gained. Traditional approaches to information integration, which involve human development teams and work in a controlled environment with a stable set of data sources, are not applicable due to the dynamic nature of such an environment. Therefore a higher degree of automation of this process is required. We present the PALADIN project (Pattern-based Architecture for LArge-scale Dynamic INformation integration), that uses machine-understandable patterns to capture and apply expert experience in the integration planning process.
A Binary Tree for Probability Learning in Eye Detection
Authors: Junwen Wu, Mohan M. Trivedi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

In this paper we proposed to solve the eye detection and localization problem under a general statistical model based object detection framework. A binary tree representation is used to discover the objects¿ underlying statistical structure. Tree structures enable us to describe the object local statistical structure in a coarse-to-fine fashion. Each subtree explains the statistics for certain local substructure. The tree is built in a top-down fashion. Subsets with negligible conditional independency are found by k-means clustering using mutual information. The conditionally independent features are separated into different subtrees, while more dependent features are tended to appear close in the tree. The distribution of the object can be learned accordingly. Gaussian mixture in the independent component analysis (ICA) subspace is used to model the distribution of each high dependent feature subset, where each independent component explains the local substructure. The use of tree structure enables us to learn the distribution recursively by applying Bayesian criterion. Substantial experiments were done to evaluate the performance over the eyes detection accuracy as well as the localization ability. Experimental results show a better detection accuracy than the Viisage system with a reasonable localization ability, which validate the algorithm.
Efficient Method of Combinatorial Item Set Analysis Based on Zero-Suppressed BDDs
Authors: Shin-ichi Minato, Hiroki Arimura
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Manipulation of large-scale combinatorial data is one of the important fundamental technique for web information retrieval, integration, and mining. In this paper, we propose a new approach based on BDDs (Binary Decision Diagrams) for database analysis problems. BDDs are graph-based representation of Boolean functions, now widely used in system design and verification area. Here we focus on Zero-suppressed BDDs (ZBDDs), a special type of BDDs, which are suitable for handling large-scale sets of combinations. Using ZBDDs, we can implicitly enumerate combinatorial item set data and efficiently compute set operations over the ZBDDs. We present some encouraging experimental results of frequent item set mining problem for practical benchmark examples, some of which have never been generated by previous method.
Service-oriented device communications using the devices profile for web services
Authors: François Jammes, Antoine Mensch, Harm Smit
Venue: Proceedings of the 3rd international workshop on Middleware for pervasive and ad-hoc computing (2005)

This paper outlines the benefits of adopting service-oriented architectures at the level of communications between resource-constrained embedded devices. It focuses on the usage of the Devices Profile for Web Services as the underpinning of such architectures for "smart" devices and discusses an early implementation thereof. It further illustrates how "dumb" or "legacy" devices can be integrated using a gatewaying approach.
Network Security Basics
Authors: Gerald A. Marin
Venue: IEEE Security and Privacy (2005)

Writing a basic article on network security is something like writing a brief introduction to flying a commercial airliner. Much must be omitted, and an optimistic goal is to enable the reader to appreciate the skills required. The practical networking aspects of security include computer intrusion detection, traffic analysis, and network monitoring. This article focuses on these aspects because they principally entail a networking perspective.
Higher Education: Who Cares What the Customer Wants?
Authors: Sorel Reisman
Venue: IT Professional (2005)

Higher education business process surveys, like the one recently released by the Educause Center for Applied Research (ECAR), tend to ignore the most important part of what they're studyingthe costumers and services. Taxpayers inevitably foot the bill for such studies and the author concludes that maybe the best way to solve this problem is for American colleges and universities to actually start behaving more like businesses.
A hardware-secured credential repository for Grid PKIs
Authors: M. Lorch, J. Basney, D. Kafura
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Public key infrastructures suffer from usability and security problems associated with the request for and secure management of end user credentials. Online credential repositories provide mechanisms to ease these shortcomings but pose attractive targets for attacks due to the accumulation of credentials and the need for remote access to these credentials. Through the extension of an existing credential repository with a cryptographic coprocessor for secure storage of credentials an increase in the security of the service can be achieved. This higher security permits the use of online credential repositories with a wide variety of certificates without violating certification authority regulations. Also, the improved performance afforded by hardware support improves the scalability of a centralized credential storage.
Multiple Transient Faults in Logic: An Issue for Next Generation ICs
Authors: Daniele Rossi, Martin Omana, Fabio Toma, Cecilia Metra
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In this paper, we first evaluate whether or not a multiple Transient Fault (multiple TF) generated by the hit of a single cosmic ray neutron can give rise to a bidirectional error at the circuit output (that is an error in which all erroneous bits are 1s rather than 0s, or vice versa, within the same word, but not both). By means of electrical level simulations we will show that this can be the case. Then, we present a software tool that we have developed in order to evaluate the likelihood of occurrence of such bidirectional errors for Very Deep Submicron (VDSM) ICs. The application of this tool to benchmark circuits has proven that such a probability can not be neglected for several benchmark circuits. Finally, we evaluate the behavior of conventional self-checking circuits (generally designed accounting only for single TFs) with respect to such events. We show that the modifications generally introduced to their functional blocks in order to avoid output bidirectional errors due to single TFs (as required when an AUED code is implemented) can significantly reduce (up to the 40%) also the probability to have bidirectional errors because of multiple TFs.
Efficient hierarchical self-scheduling for MPI applications executing in computational Grids
Authors: Cristina Boeres, Aline P. Nascimento, Vinod E. F. Rebello, Alexandre C. Sena
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

The execution of distributed applications on the grid is already a reality. As both the number of applications grow and grids scale, efficient utilization of the available but shared heterogeneous resources will be essential. The EasyGrid middleware is a hierarchically distributed Application Management System embedded into MPI applications to facilitate their efficient execution in computational grids. The overhead of employing a distinct AMS to make each application system aware does however bring at least two benefits. First, the (scheduling) policies adopted can be tailored to the specific needs of each application leading to improved performance. Second, distributing the management effort amongst the applications themselves makes grid management more scalable. This paper describes a low intrusion implementation of a hybrid scheduling strategy designed to cope with the dynamic behaviour of grid environments. Using application-specific scheduling policies, near-optimal runtimes highlight the advantages of self-scheduling when executing one or more system aware applications on a grid.
Privacy and Data Privacy Issues in Contemporary China
Authors: Lü Yao-Huai
Venue: Ethics and Information Technology (2005)

Recent anthropological analyses of Chinese attitudes towards privacy fail to pay adequate attention to more ordinary, but more widely shared ideas of privacy --- ideas that, moreover, have changed dramatically since the 1980s as China has become more and more open to Western countries, cultures, and their network and computing technologies. I begin by reviewing these changes, in part to show how contemporary notions of privacy in China constitute a dialectical synthesis of both traditional Chinese emphases on the importance of the family and the state and more Western emphases on individual rights, including the right to privacy. This same synthesis can be seen in contemporary Chinese law and scholarship regarding privacy. A review of recent work in philosophical ethics demonstrates that information ethics in China is in its very early stages. In this work, privacy is justified as an instrumental good, rather than an intrinsic good. I argue by way of conclusion that privacy protections will continue to expand in China, in part under the pressures of globalization, increasing trade with and exposure to Western societies, and the increasing demands for Western-style individual privacy by young people. Even so, I argue that these emerging conceptions of privacy will remain distinctively Chinese --- i.e., they will retain a basic consistency with traditional Chinese values and approaches.
Storage and Query over Encrypted Character and Numerical Data in Database
Authors: Zheng-Fei Wang, Wei Wang, Bai-Le Shi
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

There is some private and sensitive data in Database, which need to be protected from attacking. In order to reinforce the security of data, an effective mechanism, cryptographic support has been widely used. However, we must make a tradeoff between the performance and the security because encryption and decryption greatly degrade the query performance. To solve such a problem, a novel approach is proposed in this paper that can quickly execute SQL query on the encrypted data. For character data, it not only encrypts them, but also turns the character data into characteristic values via a characteristic function and stores them as additional fields. For numerical data, it not only encrypts them, but also creates its B+ tree index before the encryption in order to keep the ordering of each record in the index. Furthermore, we give the algorithms of querying the encrypted data based on the storage models. Results of sets of experiments validate the functionality and usability of our approach.
Carbon Nanotube Electronics
Authors: Ali Javey, Hongjie Dai
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

The potentials of carbon nanotubes as building blocks for future electronics are explored. They are found to perform favorably in terms of ON state current density as compared to the conventional Si technology, owing to their superb electron transport properties and compatibility with high-ê gate dielectrics.