ppxscal/embedding_network huggingface dataset:
Security policy refinement and enforcement for the design of multi-level secure systems
Authors: Jie Zhou Jim Alves-Foss
Venue: Journal of Computer Security (2008)

The successful design and implementation of secure systems must include security concerns from the beginning. A component that processes data at multiple security levels is critical and must go through additional evaluation to ensure the processing is secure. It is common practice to isolate and separate the processing of data at different levels into different components. In this paper we present policy-based architectural refinement techniques for the design of multi-level secure (MLS) systems. In addition, a policy refinement language is proposed to specify the rules of refinement patterns, and the hierarchy of the refinement patterns is presented. We discuss which security policies must be satisfied through the refinement process, including when separation works and when it does not. The process oriented approach will lead to verified engineering techniques for the design of MLS systems, which should greatly reduce the cost of certification of those systems.
A collaborative filtering-based approach to personalized document clustering
Authors: Chih-Ping Wei, Chin-Sheng Yang, Han-Wei Hsiao
Venue: Decision Support Systems (2008)

Document clustering is an intentional act that reflects individual preferences with regard to the semantic coherency and relevant categorization of documents. Hence, effective document clustering must consider individual preferences and needs to support personalization in document categorization. Most existing document-clustering techniques, generally anchoring in pure content-based analysis, generate a single set of clusters for all individuals without tailoring to individuals' preferences and thus are unable to support personalization. The partial-clustering-based personalized document-clustering approach, incorporating a target individual's partial clustering into the document-clustering process, has been proposed to facilitate personalized document clustering. However, given a collection of documents to be clustered, the individual might have categorized only a small subset of the collection into his or her personal folders. In this case, the small partial clustering would degrade the effectiveness of the existing personalized document-clustering approach for this particular individual. In response, we extend this approach and propose the collaborative-filtering-based personalized document-clustering (CFC) technique that expands the size of an individual's partial clustering by considering those of other users with similar categorization preferences. Our empirical evaluation results suggest that when given a small-sized partial clustering established by an individual, the proposed CFC technique generally achieves better clustering effectiveness for the individual than does the partial-clustering-based personalized document-clustering technique.
Detection of Unfaithfulness and Robust Causal Inference
Authors: Jiji Zhang, Peter Spirtes
Venue: Minds and Machines (2008)

Much of the recent work on the epistemology of causation has centered on two assumptions, known as the Causal Markov Condition and the Causal Faithfulness Condition. Philosophical discussions of the latter condition have exhibited situations in which it is likely to fail. This paper studies the Causal Faithfulness Condition as a conjunction of weaker conditions. We show that some of the weaker conjuncts can be empirically tested, and hence do not have to be assumed a priori. Our results lead to two methodologically significant observations: (1) some common types of counterexamples to the Faithfulness condition constitute objections only to the empirically testable part of the condition; and (2) some common defenses of the Faithfulness condition do not provide justification or evidence for the testable parts of the condition. It is thus worthwhile to study the possibility of reliable causal inference under weaker Faithfulness conditions. As it turns out, the modification needed to make standard procedures work under a weaker version of the Faithfulness condition also has the practical effect of making them more robust when the standard Faithfulness condition actually holds. This, we argue, is related to the possibility of controlling error probabilities with finite sample size ("uniform consistency") in causal inference.
Chaos and Graphics: Fractal tetrahedra: What's left in, what's left out, and how to build one in four dimensions
Authors: Michael Frame, Nial Neger
Venue: Computers and Graphics (2008)

We investigate several projections of the Sierpinski hypertetrahedron and observe that the iterative construction of the hypertetrahedron gives rise to an iterative construction of the projections. In addition, we show that the complements of these projections give some insight into the structure of the hypertetrahedron. Finally, we show that projections into three dimensions of fractals in four dimensions can give rise to collections of new fractals.
Creating gene set activity profiles with time-series expression data
Authors: T. A. Knijnenburg, L. F. A. Wessels, M. J. T. Reinders
Venue: International Journal of Bioinformatics Research and Applications (2008)

The use of predefined gene sets has become crucial in the interpretation of genomewide expression data. A limitation of the existing techniques that relate gene expression levels to gene sets is that they cannot readily be applied to time-course microarray data. The ability to attach statistical significance to the behaviour of biological processes over time would greatly contribute to understanding the complex regulatory mechanisms in the cell. We propose a statistical testing procedure based on the central limit theorem to assess the enrichment of a gene set. The technique is applied on time-course microarray data to generate gene-set specific 'activity profiles'.
A Framework for Dependable Trust Negotiation in Open Environments
Authors: Nicola Dragoni, Ayda Saidane
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

Automated Trust Negotiation (TN) is a promising approach to allow strangers to access sensitive data and services in open environments, such as the Web. Although the amount of literature on TN is growing, two key issues have still to be addressed. The first one concerns a typical feature of real-life negotiations: we are usually willing to trade the disclosure of personal attributes in exchange for additional services and only in a particular order (according to our preferences). The second issue concerns dependability. By their nature TN systems are used in unreliable open contexts where it is important not only to protect negotiations against malicious attack, but also against accidental failures.In this paper we address the foregoing issues proposing a novel framework for dependable TN where services, needed credentials, and behavioral constraints on the disclosure of privileges are bundled together. The framework also supports clients and servers that have a hierarchy of preferences among the different bundles.
Modeling and Managing Mobile Commerce Spaces Using RESTful Data Services
Authors: S. McFaddin, D. Coffman, J. H. Han, H. K. Jang, J. H. Kim, J. K. Lee, M. C. Lee, Y. S. Moon, C. Narayanaswami, Y. S. Paik, J. W. Park, D. Soroker
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

This paper advocates the use of RESTful data services in mobile commerce information spaces. REST is a restriction of web services to a simple protocol centered on a limited set of access operations against data resources. This paper analyzes how REST may be used as a general design principle for mobile commerce spaces.This analysis is threefold. First, it provides an abstract component model that contains a minimal embodiment of the REST functionality needed to support mobile commerce. Second, it describes and analyzes the operation of a mobile commerce space, resulting in a reference REST-based data decomposition that may be reused across a variety of domains. Third, it provides and analyzes a set of usage cases in the mobile commerce domain, which can form the basis of future REST-oriented programming models and tools. This analysis is based on a substantial mobile commerce framework we have implemented, called Celadon. This framework is currently being used to demonstrate several ambitious mobile commerce applications.
CASAN: Clustering algorithm for security in ad hoc networks
Authors: Mohamed Elhoucine Elhdhili, Lamia Ben Azzouz, Farouk Kamoun
Venue: Computer Communications (2008)

Clustering in ad hoc networks is an organization method which consists in grouping the nodes into clusters (groups) managed by nodes called clusterheads. This technique has been used for different goals as routing efficiency, transmission management, information collection, etc. As far as we know, no existing clustering algorithms have taken into account the trust level of nodes for clusterheads election. In this paper, we propose a clustering algorithm for security in ad hoc networks that we called CASAN. CASAN aims to elect trustworthy, stable and high-energy clusterheads that can be used to offer security for application level. Simulations were conducted to evaluate CASAN in terms of clusters stability, load balancing and number of hops to clusterheads. Furthermore, we compare CASAN performances to an existing clustering algorithm called weighted clustering algorithm. Results show that it gives a convenient network division with stable clusters and mainly one hop members.
Testing the Reasoning for Question Answering Validation
Authors: Anselmo Peñas, Álvaro Rodrigo, Valentín Sama, Felisa Verdejo
Venue: Journal of Logic and Computation (2008)

Question answering (QA) is a task that deserves more collaboration between natural language processing (NLP) and knowledge representation (KR) communities, not only to introduce reasoning when looking for answers or making use of answer type taxonomies and encyclopaedic knowledge, but also, as discussed here, for answer validation (AV), that is to say, to decide whether the responses of a QA system are correct or not. This was one of the motivations for the first Answer Validation Exercise at CLEF 2006 (AVE 2006). The starting point for the AVE 2006 was the reformulation of the answer validation as a recognizing textual entailment (RTE) problem, under the assumption that a hypothesis can be automatically generated instantiating a hypothesis pattern with a QA system answer. The test collections that we developed in seven different languages at AVE 2006 are specially oriented to the development and evaluation of answer validation systems. We show in this article the methodology followed for developing these collections taking advantage of the human assessments already made in the evaluation of QA systems. We also propose an evaluation framework for AV linked to a QA evaluation track. We quantify and discuss the source of errors introduced by the reformulation of the answer validation problem in terms of textual entailment (around 2%, in the range of inter-annotator disagreement). We also show the evaluation results of the first answer validation exercise at CLEF 2006 where 11 groups have participated with 38 runs in seven different languages. The most extensively used techniques were Machine Learning and overlapping measures, but systems with broader knowledge resources and richer representation formalisms obtained the best results.
Probabilistic Communication Complexity
Authors: R. Paturi
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

We study (unbounded error) probabilistic communication complexity. Our new results include -one way and two complexities differ by at most 1 - certain functions like equality and the verification of Hamming distance have upper bounds that are considerably better than their counterparts in deterministic, nondeterministic, or bounded error probabilistic model - there exists a function which requires /spl Omega/(logn) information transfer. As an application, we prove that a certain language requires /spl Omega/(nlogn) time to be recognized by a 1-tape (unbounded error) probabilistic Turing machine. This bound is optimal. (Previous lower bound results [Yao 1] require acceptance by bounded error computation. We believe that this is the first nontrivial lower bound on the time required by unrestricted probabilistic Turing machines.
An effective vertical handoff scheme based on service management for ubiquitous computing
Authors: Chung-Pyo Hong, Charles C. Weems, Shin-Dug Kim
Venue: Computer Communications (2008)

When a ubiquitous computing environment is based on seamless connectivity, intelligent network management among heterogeneous network interfaces, called vertical handoff (VHO), is required. However, conventional VHO schemes are based only on network information, and do not address service management for seamless service execution. This paper thus proposes a middleware architecture supporting efficient seamless connectivity with service management. In this architecture, we define core modules to perform VHOs in accordance with the context of services and user intention, in addition to network information. We also define profiles that express the contexts associated with the VHO process and service management. With the proposed scheme, we show that the number of unnecessary VHOs and application failures is significantly reduced, leading to an enhancement of around 34% in data throughput. The approach also reduces application failures by 50% and the number of VHOs by 32%.
An application of an associative learning model to a Morris pool with a single landmark
Authors: M. Grau-Sánchez, M. Noguera, J. L. Díaz-Barrero, V. D. Chamizo, T. Rodrigo
Venue: Computers Mathematics with Applications (2008)

A simplified model that studies stimuli representation and the set of algorithms that let us analyze associative learning in some particular cases with predetermined values of the salience of the stimuli is presented. We simulate an experiment where rats were trained in a Morris pool to find a hidden platform in the presence of a single landmark. The results obtained agree with a previous study where it was found that the control acquired by a single landmark is different depending on its relative distance from the hidden platform. In this paper, some simplified equations of the associative learning model have been used.
Radio Silence of the Pearl Harbor Strike Force Confirmed Again: The Saga of Secret Message Serial (SMS) Numbers
Authors: Philip H. Jacobsen
Venue: Cryptologia (2007)

By analyzing all the available Secret Message Serial (SMS) numbers originated by the Japanese CinC 1st Air Fleet, it is clear that no messages were sent by radio during the formation of the Strike Force or during its transit to Hawaii. It was not until the attack on Pearl Harbor had commenced that radio transmissions began. The Strike Force maintained strict radio silence and thus there was no Allied foreknowledge of the attack through radio communications-despite revisionist claims to the contrary.
Key Distribution Scheme Using Matched Filter Resistant against DoS Attack
Authors: Ryuzou Nishi, Yoshiaki Hori, Kouichi Sakurai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The vulnerabilities, e.g., DoS attack or dictionary attack, are shown in 4-Way Handshake which is the re-key protocol used in Wireless LAN security standard IEEE 802.11i. And the countermeasures against these are already proposed. In this paper, we propose key distribution scheme using matched filter. This paper shows that our proposal improves the resistance against DoS attack with less computational overhead compared with previous approaches, and is also effective against dictionary attack.
Recognition of articulated roberts in the RoboCup domain
Authors: Luigi Cinque, Enver Sangineto, Steven Tanimoto
Venue: Machine Graphics Vision International Journal (2006)

This paper presents a system for articulated object recognition. The system has been tested in the RoboCup domain (four-legged league), an international competition among autonomous doglike robots playing soccer. Nevertheless, the proposed method does not depend on any specific domain, but is thought to be applicable to generic objects composed of rigid subparts linked by rotational and/or translational joints.
VisiQ: Supporting visual and interactive query refinement
Authors: Orland Hoeber, Xue Dong Yang, Yiyu Yao
Venue: Web Intelligence and Agent Systems (2007)

It has been well documented that Web searchers have difficulties crafting queries to fulfill their information needs. The VisiQ system uses a concept knowledge base produced using the ACM Computing Classification System to generate a query space that represents the query terms in relation to the concepts they describe and the terms that are related to these concepts. A visual representation of this query space allows the users to interpret the relationships between their query terms and the query space. Interactive query refinement within this visual representation takes advantage of users' visual information processing abilities, allowing them to choose terms that accurately represent their information needs. A preview of the search results from Google provides the users with an indication of the current state of their query refinement process. VisiQ allows the users to take an active role in the information retrieval process, supporting the fundamental shift from information retrieval systems to information retrieval support systems.
Sense-and-respond supply chain using model-driven techniques
Authors: S. Kapoor, B. Binney, S. Buckley, H. Chang, T. Chao, M. Ettl, E. N. Luddy, R. K. Ravi, J. Yang
Venue: IBM Systems Journal (2007)

The results of an effort to build a sense-and-respond solution for a supply chain by Using a model-driven development framework are described in this paper. One of the components of the framework is the IBM Research-developed model-driven business-transformation (MDBT) toolkit, a set of formal models, methods, and tools. The inventory optimization analytics used to improve supply chain performance are also described. This approach is illustrated through a case study involving the IBM System x™ supply chain.
Novel frequency doubler circuits and dividers using duty cycle control buffers
Authors: Hwang-Cherng Chow, Hsing-Chung Liang
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A novel high and low speed output buffer circuit is proposed for Universal Serial Bus (USB) interface applications. Operation principles of this novel buffer are developed based on slew rate control and delayed turn-on technique. The mechanism for slew rate control is process variation self compensating. So, both precise rise and fall times of the output signal have been obtained for low speed operation. Moreover, the pull-up and pull-down output drivers are divided into several sub-drivers in parallel with the delayed turn-on characteristics. Therefore, the change of rate of di/dt decreases. And the simultaneous switching noise, based on simulations, are reduced from maximum overshoot 3.47V to 3.36V and maximum undershoot from -0.427V to -0.068V, respectively. This proposed output buffer design is low cost due to its easy realization in a digital CMOS process. The disclosed output buffer has been integrated in a complete USB transceiver circuit. Based on measured silicon data, satisfactory functions of the whole USB application IC have been obtained.
Controlled, systematic, and efficient code replacement for running java programs
Authors: Angela Nicoara, Gustavo Alonso, Timothy Roscoe
Venue: Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008 (2008)

In this paper we present PROSE, a system that performs reversible and systematic changes to running Java applications without requiring them to be shut down. PROSE is motivated by scenarios such as hotfixes, online program instrumentation and debugging, and evolution of critical legacy applications. In PROSE, changes to running applications are performed by replacing method bodies. To select which code to replace, PROSE supports matching based on both type information and regular expressions. New code can invoke the method it replaces, facilitating code evolution. Changes are composable, and may be reordered or selectively withdrawn at any time. Furthermore, the dynamic changes are expressed as Java classes rather than through an additional programming language. We describe the architecture of PROSE, the challenges of using aggressive inlining to achieve performance, and use standard benchmarks to demonstrate code performance comparable with, or better than, compile-time systems from the Aspect-Oriented Programming community.
Problem solving in community: a necessary shift in cs pedagogy
Authors: Sarah Monisha Pulimood, Ursula Wolz
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

Supporting a workforce that can create, not simply consume, computing technology requires a shift in pedagogy toward problem solving in a gender neutral, culturally and ethnically diverse community. It requires an authentic learning environment in which students solve real problems as a collaborative community with their peers from other disciplines. We report on three pedagogical approaches, namely student selected projects in a CS course, a multidisciplinary project-based course, and courses that partner across disciplines that provide on-demand content.
A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory
Authors: Emmanuel Agullo, Abdou Guermouche, Jean-Yves L'Excellent
Venue: Parallel Computing (2008)

The memory usage of sparse direct solvers can be the bottleneck to solve large sparse systems of linear equations of the form Ax=b. In order to solve large problems, we have designed a robust out-of-core solver, in which computed factors are stored on disk. We use large real-life problems (up to several million equations and several hundred million nonzeros) to show that we can significantly reduce the core memory usage in parallel (on up to 128 processors), with a time performance comparable to that of a parallel in-core solver. A careful study shows how the low-level I/O mechanisms impact the performance. We describe a low-level I/O layer that avoids the perturbations introduced by system buffers and allows consistently good performance results. To go significantly further in the memory reduction, it is interesting to also store the intermediate working memory on disk. In this paper we describe algorithmic models to address this issue, and study their potential in terms of both memory requirements and I/O volume. The out-of-core solver discussed in this paper is publicly available and already used by several academic and industrial groups. The results of the algorithmic modelling will be the basis to design a new version of this solver; this work may also be a useful reference for other developers of sparse out-of-core solvers.