ppxscal/embedding_network huggingface dataset:
Decidability and proof systems for language-based noninterference relations
Authors: Mads Dam
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least implicit belief in the programming languages community that partial approaches based on type systems or other static analysis techniques are necessary for noninterference analyses to be tractable. In this paper we show that this belief is not necessarily true. We focus on the notion of strong low bisimulation proposed by Sabelfeld and Sands. We show that, relative to a decidable expression theory, strong low bisimulation is decidable for a simple parallel while-language, and we give a sound and relatively complete proof system for deriving noninterference assertions. The completeness proof provides an effective proof search strategy. Moreover, we show that common alternative noninterference relations based on traces or input-output relations are undecidable. The first part of the paper is cast in terms of multi-level security. In the second part of the paper we generalize the setting to accommodate a form of intransitive interference. We discuss the model and show how the decidability and proof system results generalize to this richer setting.
Sweep based Multiple Ant Colonies Algorithm for Capacitated Vehicle Routing Problem
Authors: Liu Zhishuo, Cai Yueting
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

A new meta-heuristic method of ant colony algorithm called SbMACA is developed for solving the Capacitated Vehicle Routing Problem (CVRP). The SbMACA is different from other ACAs developed before in four aspects. First, at the beginning of constructing each new subtour during the route construction, ant does not depart from the depot, but randomly from the vertices that have not been visited so far. Secondly, ants in nature could not sense the pheromone until its amount is greater than certain threshold. Therefore, similarly in the SbMACA, when the ants select the next vertex to transit, the pheromone would be neglected if its amount is less than the prespecified threshold. Thirdly, once the ants have constructed their solutions, each ant's solution might be improved by applying Sweep Algorithm which makes improvement to the solutions by exchanging the vertices between subtours. Finally, a new Multiple Ant Colonies technique is proposed, in which multiple ant colonies are executed separately and simultaneously, and after all colonies are in the state of stagnation, communication among them is carried out in order to do favor to leave the local peaks. Experiment shows that the SbMACA is able to find solutions for CVRP within 0.28% of known optimal solutions and is one of the best ACA heuristics developed so far. Additionally, the performance of SbMACA is compared with that of other ACA heuristics and another meta-heuristics Tabu Search respectively.
Personas como modelo de usu&aacute;rios de servi&ccedil;os de governo eletr&ocirc;nico
Authors: Lucia Filgueiras, Plinio Aquino,  Jr., Rodrigo Sakai, Álvaro Gregório Filho, Carlos Torres, Iara Barbarian
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

Efforts towards Internet use as a means for public services are definitely increasing worldwide. In Sao Paulo State, Brazil, usability is considered an important factor to citizen-centric e-government. The dispersed nature of e-government development, by many different teams and the broad audience of internet makes user modeling an essential task for communicating user characteristics to designers. The persona modeling technique is a valuable tool to this task.. This paper presents the process of obtaining personas from user data in e-poupatempo and their use for design and usability evaluation.
Architecture and Performance of the HI-Space Projector-Camera Interface
Authors: Richard May, Bob Baddeley
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This paper presents the architecture and configuration of the Human Information Workspace (HI-Space) interaction environment. HI-Space is a projector-camera-microphone system that recognizes gesture, object and speech input. The system creates input stream events and uses HI-Space aware interface components allowing the creation of independent applications through an API. To help understand performance characteristics of HI-Space, a procedure is presented that was used to determine the total system lag of the HI-Space to be 71 ms with an 11 ms standard deviation. A study is also presented that directly compares HI-Space and a mouse in the task of acquiring stationary targets. The study shows that users can acquire targets faster and just as accurately on the HI-Space system. Finally, an example application to support analysis of 3D biological data sets is discussed. The application is an ongoing research effort to explore complex interface design using the HI-Space architecture.
Deterministic QoS guarantees for multicast multimedia applications
Authors: Steven Martin, Pascale Minet, Laurent George
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In this paper, we focus on deterministic Quality of Service (QoS) guarantees in terms of end-to-end response time and jitter that can be granted to multicast multimedia applications. These deterministic guarantees are based on a worst case analysis. With regard to the computation of the bound on the end-to-end response time, we first show that the trajectory approach dominates the holistic one, whatever the scheduling policy used in the node. We then design a solution based on this result for multicast multimedia applications subject to end-to-end deadline and jitter constraints. The solution we propose allows to achieve a fair delivery of the multimedia content to a group of clients. This solution is a basic block that can be used to design new interactive multimedia applications, such as live multicast, voting games and question/answer games. Because of the domination property, this solution allows to accept more flows meeting the requested QoS. Moreover, this solution can be easily implemented on existing routers.
Interval Branch and Bound with Local Sampling for Constrained Global Optimization
Authors: M. Sun, A. W. Johnson
Venue: Journal of Global Optimization (2005)

In this article, we introduce a global optimization algorithm that integrates the basic idea of interval branch and bound, and new local sampling strategies along with an efficient data structure. Also included in the algorithm are procedures that handle constraints. The algorithm is shown to be able to find all the global optimal solutions under mild conditions. It can be used to solve various optimization problems. The local sampling (even if done stochastically) is used only to speed up the convergence and does not affect the fact that a complete search is done. Results on several examples of various dimensions ranging from 1 to 100 are also presented to illustrate numerical performance of the algorithm along with comparison with another interval method without the new local sampling and several noninterval methods. The new algorithm is seen as the best performer among those tested for solving multi-dimensional problems.
Workshop on Program Comprehension through Dynamic Analysis (PCODA '05)
Authors: Orla Greevy, Abdelwahab Hamou-Lhadj, Andy Zaidman
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Software maintenance and evolution can be made easier if program comprehension techniques are used. Understanding a software system would typically necessitate a combination of static and dynamic analysis techniques. The aim of this workshop is to gather researchers working in the area of program comprehension with an emphasis on dynamic analysis. We are interested in investigating how dynamic analysis techniques are used or can be used to enable better comprehension of a software system.
Multi-Scale Clustering for Gene Expression Profiling Data
Authors: Shigeyuki Oba, Kikuya Kato, Shin Ishii
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

In cluster analyses, setting the scale parameter which is implicitly related to the complexity of the data distribution is an important issue; different scale values lead to different results and hence cause different interpretation. In this study, we discuss a framework of multi-scale clustering, where clustering is done with multiple scale values and then the obtained results are compiled into a visually appropriate form to observe overall structures of the clusters. For such purpose, a brick view method is proposed in this study. The construction of a brick view diagram consists of a re-indexing procedure of clusters obtained with various scale values and a sorting procedure of samples so as to minimize the distortion defined based on the multiple clustering results. Although some popular clustering methods, such as K-means, spherical K-means, and hierarchical clustering, have been used within the multi-scale framework, we introduce mean-shift clustering based on the kernel density estimation for directional data. We evaluate our approach and existing hierarchical clustering by using an artificial data set and a real data set of gene expression profiles. The results show global structures of distributions can be observed well and in a stable manner, in the brick view diagram.
Power Saving of a Dynamic Width Controller for a Monolithic Current-Mode CMOS DC-DC Converter
Authors: Hung-Ch Lee, Kuo-Tai Chang, Ke-Horng Chen, Wen Tsao Chen
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

We propose the dynamic power MOS width controlling technique and the adaptive gate driver voltage technique to find out the better approach to power saving in DC-DC converters. It demonstrates that the dynamic power MOS width controlling technique has much improvement in power consumption than that of the adaptive gate driver voltage technique when the load current is heavy or light. After the dynamic power MOS width modification, the simulation results show that the efficiency of current-mode DC-DC buck converter can be improved from 92% to about 98% in heavy load and from 15% to about 16.3% in light load. However, the adaptive gate driver voltage technique has only little improvement of power saving. It means that the dynamic width controller is the better approach to power saving in the DC-DC converter.
Color segmentation based on adjustable fuzzy neural networks and high level understanding of maps
Authors: Ning Zhong
Venue:  (2004)

To digitize and record electronically the huge collection of topographical maps, development of a framework for computer-based color segmentation and high-level map understanding has shown an increasing importance. Color map segmentation requires special treatment with respect to line features. However, few research efforts have been put into this area. A novel approach of color segmentation based on adjustable fuzzy neural networks is proposed. The approach is capable of capturing pixel variations along thin line features. Based on a physics model, two heuristics have been derived, which suggest certain pixel variation behaviors in overlapping and boundary areas respectively. Fuzzy neural networks combined with self-adjustment components have been developed. The self-adjustment components dynamically adjust sample pixels among different sample clusters in neural network training. A feature that distinguishes this method from previous supervised neural computing methods is that, by adoption of self-adjustment architectures, it does not strictly require that all samples should have their desired outputs given in advance. Experiments show that the developed method can produce satisfactory segmentation results. This study also proposes a novel method for high-level map understanding. A Description Logics (DL) language, GALC&ell;,D , is introduced to represent spatial objects and their relationships. A set of derivation rules is then proposed to derive a special grammar, called map grammar, from the DL representation. Thus, the map understanding process can be treated as a grammar parsing process. The map grammar is different from traditional grammars in that: (1) it allows for ambiguity; and (2) the input is a collection of primitive map objects instead of an ordered sequence of tokens. A map grammar parsing algorithm based on the Multiple Path Stack (MPS) is proposed. One advantage of this approach is that the knowledge representation is verifiable at design time. In addition, the implementation based on this approach is more robust and highly reusable, since the knowledge representation is separated from the inference mechanism. This research is a first step towards applying DL theory to map understanding. A prototype map understanding system was developed and applied on several test maps. The results show that this method can obtain a satisfactory interpretation of map phenomena.
Properties and dynamic behavior of electron traps in HfO2/SiO2 stacks
Authors: C. Z. Zhao, M. B. Zahid, J. F. Zhang, G. Groeseneken, R. Degraeve, S. De Gendt
Venue: Microelectronic Engineering (2005)

This paper focuses on electron traps in HfO2/SiO2 stacks. Three issues are addressed: the impact of measurement techniques on trapping, the dependence of trapping on the conduction mechanism, and the trapping kinetics. It will be shown that the traditional 'DC Id∼Vg' technique can underestimate the trap density. Trapping is sensitive to the conduction mechanism. The trap-assisted conduction, such as SILC and thermally enhanced conduction, contributes little to the trapping. Possible explanations for this phenomenon will be explored. Trapping follows the first order model and the capture cross section of traps is estimated.
DAG Based In-Network Aggregation for Sensor Network Monitoring
Authors: Shinji Motegi, Kiyohito Yoshihara, Hiroki Horiuchi
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

Wireless sensor network monitoring is important for network maintenance, since it keeps the observer aware of node failures, resource depletion etc. Since communication overheads increase if the sink collects data individually from all sensor nodes, in-network data aggregation methods have been proposed which reduce the overheads. They form a routing tree and data follows up from the edge of the tree to the sink. However, in the event of heavy packet loss, the error margin of the collected data received by the sink grows. Furthermore, when the assumed hop count of the edge of the tree is smaller than the actual count, data can not be followed up from the edge. For the reasons mentioned above, observers find it problematic to assess the state of the network, since the error margin increases as the accuracy of the collected data falls. In this paper, we propose a new in-network aggregation method for sensor network monitoring. The method provides fault tolerance for packet loss by forming a Directed Acyclic Graph (DAG), which allows a node to have multiple parent nodes. In addition, the method can ensure correct data transmission timing, according to the actual hop count of the edge of the DAG. Furthermore, we evaluated the proposed method in comparison with the existing methods, from the perspective of the error margin of the collected data.
Delay-Centric Link Quality Aware OLSR
Authors: Keun Jae Lee, Min Soo Kim, Song Yean Cho, Byung In Mun
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper introduces a delay-centric link quality aware routing protocol, LQOLSR (Link Quality aware Optimized Link State Routing). The LQOLSR chooses find fast and high quality routes in mobile ad hoc networks (MANET). LQOLSR predicts a packet transmission delay according to multiple transmission rates in IEEE 802.11 and selects the fastest route from source to destination by estimating relative transmission delay between nodes. We implement a LQOLSR protocol by modifying the basic OLSR (Optimized Link State Routing) protocol. We evaluate and analyze the performance in a real testbed established in an office building.
Countering Network Worms Through Automatic Patch Generation
Authors: Stelios Sidiroglou, Angelos D. Keromytis
Venue: IEEE Security and Privacy (2005)

To counter zero-day worms that exploit software flaws such as buffer overflows, this end-point architecture uses source code transformations to automatically create and test software patches for vulnerable segments of targeted applications.
An Efficient and Robust Real-Time Contour Tracking System
Authors: Giorgio Panin, Alexander Ladikos, Alois Knoll
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

In this paper we present an efficient and robust real-time system for object contour tracking in image sequences. The developed application partly relies on an optimized implementation of a state-of-the-art curve fitting algorithm, and integrates important additional features in order to achieve robustness while keeping the speed of the main estimation algorithm. An application program has been developed, which requires only a few standard libraries available on most platforms, and runs at video frame rate on a common PC with standard hardware equipment.
Client-Class based Admission Control Algorithm in Web Server Using Cluster Analysis
Authors: Hea-Sook Park, Eun-Kyung Jung, Doo-Kwon Baik
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

This paper analyzes the level of contribution vis-àvis the clients' service patterns in multimedia contents services and profits for consolidating a company's profits through the cluster analysis of clients' data applying the TwoStep Cluster Method of CRM. And this paper proposes a new algorithm for allocating the media server's resources selectively by clusters using the cluster analysis. Clients were grouped into 4 clusters according to the contribution level in terms of profits. Likewise, the CRFS (Client Request Filtering System) was suggested to allocate media server resources per cluster. CRFS issues admission within the resource limit of the cluster where the client belongs.
The evolution of storage service providers: techniques and challenges to outsourcing storage
Authors: Ragib Hasan, William Yurcik, Suvda Myagmar
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

As enterprise storage needs grow, it is challenging to manage storage systems. The costs of locally managing, supporting, and maintaining resilience in storage systems has skyrocketed. Also, companies must comply with a growing number of federal and state legislations mandating secure handling of electronic information.In this context, outsourcing of storage to utility-model based service providers has emerged as a popular and often cost-effective option. However, this raises issues related to data safety and storage techniques. In this paper, we discuss the business model and evolution of service-oriented companies known as Storage Service Providers and examine the challenges organizations should consider when outsourcing their storage management. To our knowledge, this is the first work to study the SSP model from both technical and business viewpoints. Lastly, we present two case studies, one of a failed SSP and the other of a successful market leader.
Reusable Knowledge for Satisficing Usability Requirements
Authors: Luiz Marcio Cysneiros, Vera Maria Werneck, Andre Kushniruk
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Usability is becoming increasingly recognized as being an important factor in the acceptance of systems by end users. There is a basic need for systematic approaches to reason, model and analyze usability from the early stages of software development. Furthermore, it is necessary to develop a usable ontology or classification of measurable aspects that can be used to aid in the specification of usability requirements. These ontologies should be represented in a way that facilitates their use as guidelines for the requirements elicitation process. This work builds on review of literature in the area of human-computer interaction and the emerging field of usability engineering in developing a catalog of aspects of usability that can be considered during requirements gathering. This catalogue is used to guide the requirements engineer through alternatives for achieving usability for information systems. The approach uses i framework, having usability modeled as a special type of goal.
Query Routing: Finding Ways in the Maze of the DeepWeb
Authors: Govind Kabra, Chengkai Li, Kevin Chen-Chuan Chang
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

This paper presents a source selection system based on attribute co-occurrence framework for ranking and selecting Deep Web sources that provide information relevant to users requirement. Given the huge number of heterogeneous Deep Web data sources, the end users may not know the sources that can satisfy their information needs. Selecting and ranking sources in relevance to the user requirements is challenging. Our system finds appropriate sources for such users by allowing them to input just an imprecise initial query. As a key insight, we observe that the semantics and relationships between deep Web sources are self-revealing through their query interfaces, and in essence, through the co-occurrences between attributes. Based on this insight, we design a co-occurrence based attribute graph for capturing the relevances of attributes, and using them in ranking of sources in the order of relevance to user's requirement. Further, we present an iterative algorithm that realizes our model. Our preliminary evaluation on real-world sources demonstrates the effectiveness of our approach.
Perceptual auditory design: Comments on Edwards and Mitsopoulos, ICAD 1998
Authors: Alistair D. N. Edwards, Evangelos Mitsopoulos
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Mitsopoulos and Edwards ICAD 1998 paper deals with the design of auditory widgets as exemplars of applying sound psychological theories of auditory perception and attention in the field of auditory interface design. The research, briefly herein described, is presented in detail in Mitsopoulos [2000]. Future work at all three levels of the methodology is foreseen, as well as in the integration of input and output modalities.
Text Extraction from Gray Scale Historical Document Images Using Adaptive Local Connectivity Map
Authors: Zhixin Shi, Srirangaraj Setlur, Venu Govindaraju
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents an algorithm using adaptive local connectivity map for retrieving text lines from the complex handwritten documents such as handwritten historical manuscripts. The algorithm is designed for solving the particularly complex problems seen in handwritten documents. These problems include fluctuating text lines, touching or crossing text lines and low quality image that do not lend themselves easily to binarizations. The algorithm is based on connectivity features similar to local projection profiles, which can be directly extracted from gray scale images. The proposed technique is robust and has been tested on a set of complex historical handwritten documents such as Newton's and Galileo's manuscripts. A preliminary testing shows a successful location rate of above 95% for the test set.