ppxscal/embedding_network huggingface dataset:
Bill Neugent MITRE Fellow, Chief Engineer Information Security Division
Authors: Bill Neugent
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Bill Neugent works for MITRE, which is a not-for-profit organization chartered to work in the public interest. At MITRE, Neugent holds the honorary title of Fellow and is also Chief Engineer for 300 cybersecurity experts who advise the federal government, especially the military and intelligence communities. In addition, he wears a corporate hat as the Enterprise Systems Engineering (ESE) Information Assurance Chief Engineer. His recent ESE work has focused on countering sophisticated cyber threats. Recently, supporting the Office of the Assistant Secretary of Defense for Networks and Information Integration (OASD/NII), he has helped orchestrate a large government team in assessing whether DoD can achieve mission assurance for critical functions despite sophisticated attacks on DoD's IT underpinnings. He has also led numerous independent program assessments. He has done work for both DoD and the Intelligence Community on globalization and its impact on information assurance. He has also done extensive work on cross-boundary information sharing. He has been a leader in the development of programs to mitigate insider threats. In the 1980s he created and taught a graduate course in cybersecurity at The American University, one of the first such courses in the country. Neugent is also a novelist. His debut novel, No Outward Sign (Writers Club Press), shows a cyberterrorist attack on America. Days after the book's release on Amazon.com, sales surged until the novel became one of Amazon's 500 best-selling books.
Rethinking rank swapping to decrease disclosure risk
Authors: Jordi Nin, Javier Herranz, Vicenç Torra
Venue: Data Knowledge Engineering (2008)

Nowadays, the need for privacy motivates the use of methods that allow to protect a microdata file both minimizing the disclosure risk and preserving the data utility. A very popular microdata protection method is rank swapping. Record linkage is the standard mechanism used to measure the disclosure risk of a microdata protection method. In this paper we present a new record linkage method, specific for rank swapping, which obtains more links than standard ones. The consequence is that rank swapping has a higher disclosure risk than believed up to now. Motivated by this, we present two new variants of the rank swapping method, which make the new record linkage technique unsuitable. Therefore, the real disclosure risk of these new methods is lower than the standard rank swapping.
Too Few or Too Many Properties? Measure it by ATPG!
Authors: Franco Fummi, Graziano Pravadelli
Venue: Journal of Electronic Testing: Theory and Applications (2007)

Verification of a design, based on model checking, requires the identification of a set of formal properties manually derived from the specification of the design under verification (DUV). Such a set can include too few or too many properties. This paper proposes to use a functional ATPG to identify missing properties and to remove unnecessary ones. In particular, the paper refines, extends, and compares, with other symbolic approaches, a methodology to estimate the completeness of formal properties, which exploits a functional fault model and a functional ATPG. Moreover, the same fault model and ATPG are used to face the opposite problem of identifying useless properties, that is, properties which are in logical consequence. Logical consequence between properties is generally examined by using theorem proving, which may require a large amount of time and space resources. On the contrary, the paper proposes a faster approach which analyzes logical consequence by observing the property capability of revealing functional faults. The joint use of the methodologies allows to optimize the set of properties used for several verification sessions needed to check all design phases of an incremental design flow.
Mental Fatigue Estimation Based on Multichannel Linear Descriptors and Support Vector Machine with Optimizing Parameters
Authors: Chong Zhang, Chongxun Zheng, Xiaolin Yu, Yangyi Ou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, three parameters of multichannel linear descriptors i.e. \Omega, \Phi and \Sigma are used to measure the level of mental fatigue for the first time. The multichannel linear descriptors of electroencephalogram (EEG) from electrode arrays (Fp1, Fz, and Fp2) are extracted as the features of brain activity in different mental fatigue state. Then support vector machine (SVM) with optimizing parameters is used to identify two mental fatigue states. For comparison, linear discriminant analysis based on mahalanobis distance (MDBC) is also used to identify such two mental fatigue states. The experimental results show that SVM classifier with optimizing parameters is much suitable for our study, and it achieves the average maximum classification accuracy of 91.67%. The investigation also suggests that the values of \Omega, \Phi and \Sigma of EEG strongly correlate with mental fatigue, which can effectively distinguish two mental fatigue states, so that they are expected to serve as the indexes to evaluate mental fatigue level objectively.
BibFinder/StatMiner: effectively mining and using coverage and overlap statistics in data integration
Authors: Zaiqing Nie, Subbarao Kambhampati, Thomas Hernandez
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition there are no effective approaches for learning the needed statistics. In this paper we present StatMiner, a system for estimating the coverage and overlap statistics while keeping the needed statistics tightly under control. StatMiner uses a hierarchical classification of the queries, and threshold based variants of familiar data mining techniques to dynamically decide the level of resolution at which to learn the statistics. We will demonstrate the major functionalities of StatMiner and the effectiveness of the learned statistics in BibFinder, a publicly available computer science bibliography mediator we developed. The sources that BibFinder integrates are autonomous and can have uncontrolled coverage and overlap. An important focus in BibFinder was thus to mine coverage and overlap statistics about these sources and to exploit them to improve query processing.
Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes
Authors: Srinivasan Seetharaman, Mostafa Ammar
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

The Internet is a complex structure arising from the interconnection of numerous autonomous systems (AS), each exercisingits own administrative policies to reflect the commercial agreements behind the interconnection. However, routing in serviceoverlay networks is quite capable of violating these policies to its advantage. To prevent these violations, we see an impendingdrive in the current Internet to detect and filter overlay traffic. In this paper, we first present results from a case studyoverlay network, constructed on top of Planetlab, that helps us gain insights into the frequency and characteristics of thedifferent inter-domain policy violations. We further investigate the impact of two types of overlay traffic filtering thataim to prevent these routing policy violations: blind filtering and policy-aware filtering. We show that such filtering canbe detrimental to the performance of overlay routing. We next consider two approaches that allow the overlay network to realizethe full advantage of overlay routing in this context. In the first approach, overlay nodes are added so that good overlaypaths do not represent inter-domain policy violations. In the second approach, the overlay acquires transit permits from certainASes that allow certain policy violations to occur. We develop a single cost-sharing framework that allows the incorporationof both approaches into a single strategy. We formulate and solve an optimization problem that aims to determine how the overlaynetwork should allocate a given budget between paying for additional overlay nodes and paying for transit permits to ASes.
Grid-Enabled Standards-based Data Management
Authors: Lana Abadie, Paolo Badino, Jean-Philippe Baud, James Casey, Akos Frohner, Gilbert Grosdidier, Sophie Lemaitre, Gavin Mccance, Remi Mollon, Krzysztof Nienartowicz, David Smith, Paolo Tedesco
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The world's largest scientific machine -- the Large Hadron Collider (LHC), situated outside Geneva, Switzerland -- will generate some 15PB of data at rates up to 1.5GB/s (in the case of the heavy-ion experiment, ALICE) to tape per year of operation. The processing of this data will be performed using a world-wide Grid, the (worldwide) LHC Computing Grid built on top of the Enabled Grid for E-sciencE and Open Science Grid infrastructures. The LHC Computing Grid, which has offered a service for over two years now, is based upon a tier model comprising some 150 sites in tens of countries. In this paper, we describe the data management middleware stack - one of the key services provided by data grids. We give an overview of the different services implemented, a disk-based storage system which can support encryption, tools to manage the storage system and access files, the LCG File Catalogue, and the File Transfer Service. We also review the relationship between these services.
High-resolution source localization algorithm based on the conjugate gradient
Authors: Hichem Semira, Hocine Belkacemi, Sylvie Marcos
Venue: EURASIP Journal on Advances in Signal Processing (2007)

This paper proposes a new algorithm for the direction of arrival (DOA) estimation of P radiating sources. Unlike the classical subspace-based methods, it does not resort to the eigendecomposition of the covariance matrix of the received data. Indeed, the proposed algorithm involves the building of the signal subspace from the residual vectors of the conjugate gradient (CG) method. This approach is based on the same recently developed procedure which uses a noneigenvector basis derived from the auxiliary vectors (AV). The AV basis calculation algorithm is replaced by the residual vectors of the CG algorithm. Then, successive orthogonal gradient vectors are derived to form a basis of the signal subspace. A comprehensive performance comparison of the proposed algorithm with the well-known MUSIC and ESPRIT algorithms and the auxiliary vectors (AV)-based algorithm was conducted. It shows clearly the high performance of the proposed CG-based method in terms of the resolution capability of closely spaced uncorrelated and correlated sources with a small number of snapshots and at low signal-to-noise ratio (SNR).
Modeling fairness and starvation in concurrent systems
Authors: Anup Kumar Bandyopadhyay
Venue: ACM SIGSOFT Software Engineering Notes (2007)

Standard temporal logic is augmented and a new temporal quantifier viz., never is defined. This augmented logic is integrated in Dijkstra's weakest precondition calculus. Definitions for fairness and starvation for concurrent systems in terms of weakest precondition are presented. According to the existing concept fairness for a transition rule asserts that if a rule remains continuously enabled (weak fairness) or repeatedly enabled (strong fairness), then it must be executed., where in the proposed definition fairness is related to the permission for execution where starvation relies upon actual execution. This definition is used to prove fairness of a given concurrent system. Through different examples it is shown that fairness is not the only prerequisite for starvation freedom. Available techniques use 'leads to' operator that forecasts system behavior where the proposed proof technique moves backward in time.
On the Use of Context-Dependent Modeling Units for HMM-Based Offline Handwriting Recognition
Authors: G. Fink, T. Plotz
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The use of context dependent modeling units in hand- writing recognition has been considered by many authors as promising substantial performance improvements in sys- tems based on Hidden-Markov models. Interestingly, in the literature only a few approaches limited to online recogni- tion are documented to make use of this technology. There- fore, we investigated whether context dependent model- ing also offers advantages for offline recognition systems. The moderate performance improvements we achieved on a challenging unconstrained handwriting recognition task suggest that context dependent modeling can not easily be exploited for offline recognition. In this paper we will present the principles behind context dependent modeling and discuss the reasons for its limited applicability in rec- ognizing offline handwriting data.
DOKMF: Distributed Ontology-Based Knowledge Management Framework
Authors: Guangming Wang, Lu Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper proposes a distributed ontology-based knowledge management framework-DOKMF. An autonomous organization unit is reified as a knowledge node, and virtual communities established according to interests are reified as knowledge communities with some semantic synergy. Global ontology provides a basic glossary of terms and relationships between terms in the domain. Local ontology organizes context-based local knowledge according to local systems. The mappings based on the context address issues of querying and collisions between different local ontologies bya multi-similarities strategy process. This distributed ontology-based design provides the members of a virtual community with more flexible, efficient, adaptable, semantic-based and intelligent knowledge management services.
Knowledge Integration in OpenWorlds: Utilizing the Mathematics of Hierarchical Structure
Authors: Cliff A. Joslyn, Karin M. Verspoor, Damian DG Gessler
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Semantic web services present a new challenge in distributed knowledge integration. Under the Simple Semantic Web Architecture and Protocol (SSWAP, http://sswap.info), web resources publish information about their data and services in terms of OWL ontologies. With semantic tagging, the output of one service can drive the input of another, presenting the alluring prospect of machines autonomously assessing the suitability of web resources for distributed workflows. Ontological reasoning under OWL greatly expands the potential for semantic web service interoperability by guaranteeing the compatibility of resources using such techniques as inferencing, typing, and class subsumption. Formal methods for managing such structures are urgently needed. Recent advances in the mathematics of hierarchies can formalize the construction of synthetic hierarchies from unstructured information, identifying mutual subsumption architectures. Here we examine the problem space and describe the promise of mathematical order theory (formal concept analysis and lattice metrics) for advancing knowledge integration in open worlds.
DARES: documents annotation and recombining system-application to the European law
Authors: Fady Farah, François Rousselot
Venue: Artificial Intelligence and Law (2007)

Accessing legislation via the Internet is more and more frequent. As a result, systems that allow consultation of law texts are becoming more and more powerful. This paper presents DARES, a generic system which can be adapted to any domain to handle documents production needs. It is based on an annotation engine which allows obtaining XML documents inputs as required by the system, and on an XML fragments recombining system. The latter operates using a fragment manipulation functions toolbox to generate new documents. To validate this system, we have tried to apply it to the domain of law through the consolidation problem.
Detecting and Blocking Malicious Traffic Caused by IRC Protocol Based Botnets
Authors: Zhenhua Chi, Zixiang Zhao
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

One of the most potentially dangerous security problems for computer networks is the botnet. Since botnets based on the IRC(Internet Chat Relay) protocol are relatively new, not enough research has been done on them. In this paper, we propose a method to detect the botmaster by starting from the victim and working backwards through the routers. The malicious traffic is blocked during the process of detecting the botmaster router by router.
Querying XML Data using PC Cluster System
Authors: Toshiyuki Amagasa, Kentarou Kido, Hiroyuki Kitagawa
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

This paper proposes a novel approach for querying large-scale XML data using PC cluster system. With the recent spread of the XML format, large-scale data coded in XML ranging from several hundreds of megabytes to several gigabytes has become common. However, XML databases are often innefficient in dealing with huge XML data. The problem is the complexity of the XML data model and query processing. To cope with this problem, we attempt to construct a parallel XML database on top of a PC cluster system. To this end, we discuss XML data partitioning to enable parallel processing of XML queries. We introduce a path-based partitioning for XML data. The obtained XML fragments are then allocated to cluster nodes. To obtain cost-efficient allocation of the fragments, we discuss cost functions for parallel XPath processing and an algorithm to compute pseudo-optimal allocation, which is based on the well-known genetic algorithm. Finally, we demonstrate effectiveness of the proposed scheme by a series of experiments.
Mirror substitutions and palindromic sequences
Authors: Bo Tan
Venue: Theoretical Computer Science (2007)

By introducing the notion of mirror substitution, we show that, given a substitutive sequence over two letters, it is palindromic (that is, it contains arbitrarily long palindromes) if and only if its language is mirror-invariant (that is, it is closed under the mirror image map). Then we solve a question of Hof, Knill and Simon in the 2-letter case, and also, by constructing a counterexample, we give a negative answer to the open problem 4 in the webpage: http://iml.univ-mrs.fr/~bernat/openquestions.html.
A simple shape characteristic of protein–protein recognition
Authors: George Nicola, Ilya A. Vakser
Venue: Bioinformatics (2007)

Motivation: Observation of co-crystallized protein–protein complexes and low-resolution protein–protein docking studies suggest the existence of a binding-related anisotropic shape characteristic of protein–protein complexes. Results: Our study systematically assessed the global shape of proteins in a non-redundant database of co-crystallized protein–protein complexes by measuring the distance of the surface residues to the protein's center of mass. The results show that on average the binding site residues are closer to the center of mass than the non-binding surface residues. Thus, the study directly detects an important and simple binding-related characteristic of protein shapes. The results provide an insight into one of the fundamental properties of protein structure and association. Contact: vakser@ku.edu
Circuit Switching: Unique Architecture and Applications
Authors: A. E. ,  Jr. Joel
Venue: Computer (1979)

Circuit switching systems predate computers. Partly for that reason, computer engineers may learn something from a look at their architecture.
People recognition by mobile robots
Authors: Grzegorz Cielniak, Tom Duckett
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

This paper addresses the problem of detecting and identifying persons with a mobile robot, by sensory fusion of thermal and colour vision information. In the proposed system, people are first detected with a thermal camera, using image analysis techniques to segment the persons in the thermal images. This information is then used to segment the corresponding regions of the colour images, using an affine transformation to solve the image correspondence between the two cameras. After segmentation, the region of the image containing a person is further divided into regions corresponding to the person's head, torso and legs. Temperature and colour features are then extracted from each region for input to a pattern recognition system. Three alternative classfication methods were investigated in experiments with a moving mobile robot and moving persons in an office environment. The best identification performance was obtained with a dynamic recognition method based on a Bayes classifier, which takes into account evidence accumulated in a sequence of images.
Processing sliding window multi-joins in continuous queries over data streams
Authors: Lukasz Golab, M Tamer Özsu
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We study sliding window multi-join processing in continuous queries over data streams. Several algorithms are reported for performing continuous, incremental joins, under the assumption that all the sliding windows fit in main memory. The algorithms include multiway incremental nested loop joins (NLJs) and multi-way incremental hash joins. We also propose join ordering heuristics to minimize the processing cost per unit time. We test a possible implementation of these algorithms and show that, as expected, hash joins are faster than NLJs for performing equi-joins, and that the overall processing cost is influenced by the strategies used to remove expired tuples from the sliding windows.
E-portfolio to assess professional competences in university virtual classrooms
Authors: E. Barberà, T. Guasch, A. Espasa
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

On line student assessment is one of the least known and most problematic issues of virtual learning. This is so because of its general organization and format in relation to specific contents, mainly in applied subjects because of their epistemological approaches. In this context, the renewal of assessment processes promoting new practices according to the competence-based trend is needed. In this proposal we present the development and implementation of an e-portfolio system in a university virtual classroom that represents several assessment methods of learning in virtual learning contexts taking into account their cognitive consequences for learning. Although the e-portfolio includes different types of assessment methods including those of automated correction, special emphasis is made on processes that assess positive progress of learning. E-portfolio helps and assesses learning quality according to their use in four different types of learning assessment: 1) initial assessment, 2) constructive and formative assessment, 3) final and summative assessment and 4) self-assessment. The organizational format of these types of assessment is represented in the student e-portfolio platform we built to demonstrate evolution and accomplishment on learning. Also its suitability is discussed as well as their advantages and disadvantages on a psycho-pedagogical level.