ppxscal/embedding_network huggingface dataset:
Controlling FD and MVD Inferences in MLS
Authors: Yan Heping, Liu Bing, Yang Xiaoming, Wang Wei, Shi Baile, Yang Genxing
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In today's information society, privacy protection has become a very important concern. In this paper we research the inference problems due to functional dependencies (FD) and multi-valued dependencies (MVD) in multilevel secure database (MLS) with element classification instances. To deal with the secure problem brought by inference channels we present our FD and MVD based inference control algorithms working on the finest-grained data level which greatly improve the availability of data and minimize the information loss.
Route Based QoS and the Biased Early Drop Algorithm (BED)
Authors: Scott C. Evans, Marc R. Pearlman, Asavari Rothe, Martin Egan, Manny Leiva
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

DiffServ offers an attractive solution to Quality of Service (QoS) for Mobile Ad-Hoc Networks (MANET)s since the overhead of alternative flow based QoS metrics and signaling is not required. However, within prioritized classes and in the presence of dynamically forming bottlenecks, DiffServ can lead to brittle failure modes in which all flows are highly penalized and subsequently fail rather than maintaining some flows at required QoS levels for latency or packet loss. This problem is particularly difficult for UDP traffic, which does not respond to Random Early Detection (RED) like throttling mechanisms in the presence of congestion. This paper proposes an augmentation of DiffServ QoS over MANET that utilizes metrics available through routing protocols to prevent, and resolve congestion. This is done in a manner that promotes maintenance of some high priority UDP (for example voice over IP) flows in the presence of bottlenecks. The Biased Early Drop (BED) algorithm is introduced to maintain high continuity of UDP flows in the presence of congestion within the same class of service.
Compositional Syntax From Cultural Transmission
Authors: Henry Brighton
Venue: Artificial Life (2002)

A growing body of work demonstrates that syntactic structure can evolve in populations of genetically identical agents. Traditional explanations for the emergence of syntactic structure employ an argument based on genetic evolution: Syntactic structure is specified by an innate language acquisition device (LAD). Knowledge of language is complex, yet the data available to the language learner are sparse. This incongruous situation, termed the "poverty of the stimulus," is accounted for by placing much of the specification of language in the LAD. The assumption is that the characteristic structure of language is somehow coded genetically. The effect of language evolution on the cultural substrate, in the absence of genetic change, is not addressed by this explanation. We show that the poverty of the stimulus introduces a pressure for compositional language structure when we consider language evolution resulting from iterated observational learning. We use a mathematical model to map the space of parameters that result in compositional syntax. Our hypothesis is that compositional syntax cannot be explained by understanding the LAD alone: Compositionality is an emergent property of the dynamics resulting from sparse language exposure.
AR Karaoke: Acting in Your Favorite Scenes
Authors: Maribeth Gandy, Blair MacIntyre, Peter Presti, Steven Dow, Jay Bolter, Brandon Yarbrough, Nigel O'Rear
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

In this paper we present a concept for augmented reality entertainment, called AR Karaoke, where users perform their favorite dramatic scenes with virtual actors. AR Karaoke is the acting equivalent of traditional karaoke, where the goal is to facilitate an acting experience for the user that is entertaining for both the user and audience. Prototype implementations were created to evaluate various user interfaces and design approach reveal guidelines that are relevant to the design of mixed reality applications in the domains of gaming, performance, and entertainment.
Construction and Methods of Learning of Bayesian Networks
Authors: P. I. Bidyuk, A. N. Terent'Ev, A. S. Gasanov
Venue: Cybernetics and Systems Analysis (2005)

Methods of learning Bayesian networks from databases, basic concepts of Bayesian networks, basic methods of learning, methods of learning parameters, and the structures of a network and hidden parameters are considered. Basic definitions and key concepts with illustrative examples are presented.
Code breaking for automatic speech recognition
Authors: William J. Byrne
Venue:  (2005)

Code Breaking is a divide and conquer approach for sequential pattern recognition tasks where we identify weaknesses of an existing system and then use specialized decoders to strengthen the overall system. We study the technique in the context of Automatic Speech Recognition. Using the lattice cutting algorithm, we first analyze lattices generated by a state-of-the-art speech recognizes to spot possible errors in its first-pass hypothesis. We then train specialized decoders for each of these problems and apply them to refine the first-pass hypothesis. We study the use of Support Vector Machines (SVMs) as discriminative models over each of these problems. The estimation of a posterior distribution over hypothesis in these regions of acoustic confusion is posed as a logistic regression problem. GiniSVMs, a variant of SVMs, can be used as an approximation technique to estimate the parameters of the logistic regression problem. We first validate our approach on a small vocabulary recognition task, namely, alphadigits. We show that the use of GiniSVMs can substantially improve the performance of a well trained MMI-HMM system. We also find that it is possible to derive reliable confidence scores over the GiniSVM hypotheses and that these can be used to good effect in hypothesis combination. We will then analyze lattice cutting in terms of its ability to reliably identify, and provide good alternatives for incorrectly hypothesized words in the Czech MALACH domain, a large vocabulary task. We describe a procedure to train and apply SVMs to strengthen the first pass system, resulting in small but statistically significant recognition improvements. We conclude with a discussion of methods including clustering for obtaining further improvements on large vocabulary tasks.
Evaluating Collaborative Applications from a Knowledge Management Approach
Authors: Aurora Vizcaino, Mario Piattini, Manuel Martinez, Gabriela Aranda
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Different focuses exist to evaluate collaborative systems. Since knowledge is becoming the most important asset of enterprises, we propose evaluating collaborative tools by using a knowledge management approach. To do so, we analyse six aspects of the knowledge management process, which are: knowledge creation, knowledge accumulation, knowledge sharing, knowledge utilization, knowledge internalization and knowledge integration and then propose a model to evaluate each one.
Automatic test factoring for java
Authors: David Saff, Shay Artzi, Jeff H. Perkins, Michael D. Ernst
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Test factoring creates fast, focused unit tests from slow system-wide tests; each new unit test exercises only a subset of the functionality exercised by the system test. Augmenting a test suite with factored unit tests should catch errors earlier in a test run.One way to factor a test is to introduce mock objects. If a test exercises a component T, which interacts with another component E (the "environment"), the implementation of E can be replaced by a mock. The mock checks that T's calls to E are as expected, and it simulates E's behavior in response. We introduce an automatic technique for test factoring. Given a system test for T and E, and a record of T's and E's behavior when the system test is run, test factoring generates unit tests for T in which E is mocked. The factored tests can isolate bugs in T from bugs in E and, if E is slow or expensive, improve test performance or cost.Our implementation of automatic dynamic test factoring for the Java language reduces the running time of a system test suite by up to an order of magnitude.
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties
Authors: Victor Braberman, Nicolas Kicillof, Alfredo Olivero
Venue: IEEE Transactions on Software Engineering (2005)

A major obstacle in the technology-transfer agenda of behavioral analysis and design methods is the need for logics or automata to express properties for control-intensive systems. Interaction-modeling notations may offer a replacement or a complement, with a practitioner-appealing and lightweight flavor, due partly to the subspecification of intended behavior by means of scenarios. We propose a novel approach consisting of engineering a new formal notation of this sort based on a simple compact declarative semantics: VTS (Visual Timed event Scenarios). Scenarios represent event patterns, graphically depicting conditions over traces. They predicate general system events and provide features to describe complex properties not expressible with MSC-like notations. The underlying formalism supports partial orders and real-time constraints. The problem of checking whether a timed-automaton model has a matching trace is proven decidable. On top of this kernel, we introduce a notation to state properties over all system traces: conditional scenarios, allowing engineers to describe uniquely rich connections between antecedent and consequent portions of the scenario. An undecidability result is presented for the general case of the model-checking problem over dense-time domains, to later identify a decidable—yet practically relevant—subclass, where verification is solvable by generating antiscenarios expressed in the VTS{\hbox{-}}{\rm kernel} notation.
Channel Estimation by Using Short Training Sequences in CDMA Systems
Authors: Ahmet Rizaner, Hasan Amca, Kadri Hacıoğlu, Ali H. Ulusoy
Venue: Wireless Personal Communications: An International Journal (2005)

Multiuser detection techniques are known to be effective to counter the presence of multiuser interference in code division multiple access channels. Multiuser detectors can provide excellent performance only when the channel impulse responses of all the users are precisely known. Hence, channel estimation becomes a challenging issue in mobile communication systems. In this paper, we address the problem of efficient maximum likelihood mobile radio channel estimation at high channel efficiency that requires a short training sequence along with the known spreading sequence. The proposed system can be employed in both the uplink and downlink of a heavily loaded multiuser CDMA system. The extension of the approach with unknown users' delays are also proposed. We present results that show the success of this method in recovering the transmitted bits with a relatively small number of preamble bits.
A Study on Fast JCVM by Moving Object from EEPROM to RAM
Authors: Min-Sik Jin, Min-Soo Jung
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Java Card makes it possible to easily have several applications and programs written in Java. The one of the main issues of Java Card is about memory optimization to maximize the use of limited smart card memory. In this paper, we propose a new JCVM architecture. The key idea is to use RAM as much as possible by moving object from EEPROM to RAM. It makes the Java Card more efficient in terms of security and speed. Writing in RAM is much faster than writing in EEPROM. The additional advantage of our solution is also garbage collected whenever the card is reset.
Authentification par la m&eacute;fiance dans les syst&egrave;mes pervasifs
Authors: Rachid Saadi, Jean Marc Pierson, Lionel Brunie
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

We present in this paper a solution to the difficult problem of authentication in pervasive environments. The distrust model developed hereafter allows a particular site to accept inbound connections from foreign unknown users, and to bound their access to a certain level in its own organization.
Analysis of Secure Design Patterns: A Case Study in E-Commerce System
Authors: Jing Wang, Yeong-Tae Song, Lawrence Chung
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Retrofitting security requirement into an existing system tends to result in less wanted qualities. So, it is a preferred practice to design with security in mind right from the beginning of the development process. An NFR framework has been established to incorporate non-functional requirements (NFRs) [8] that are crucial to secure system design into the development process. In this paper, we propose a methodology that utilizes the NFR framework to come up with secure design by selecting security design patterns for the domain specific application such as E-Commerce system.
On indexing of 3D scenes using MPEG-7
Authors: Ioan Marius Bilasco, Jérôme Gensel, Marlène Villanova-Oliver, Hervé Martin
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The evolving desktop computer capacities and the emergence of the X3D standard offer a new boost to 3D domain. Giving sense to 3D content becomes a major issue specially for reusing such a content extracted from existing 3D scenes. In this paper, we address this issue by proposing a generic semantic annotation model for 3D called 3DSEAM (3D SEmantics Annotation Model). 3DSEAM aims at indexing 3D content considering visual, geometric and semantic aspects. 3DSEAM is instantiated using MPEG-7 extended with 3D specific locators. These locators link the visual, geometric and semantic features of a 3D content to the corresponding X3D fragment.
Review of "DECset-8000 System User's Guide, Vol #1, #2, by Vincent Manis, Peter van den Bosch"
Authors: Russ Abbott
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

When it comes to designing software for people not used to dealing with computers, manufacturers of hardware are frequently the worst offenders in producing complex, inconsistent and frustrating systems. The problem is that they tend to think of all people as potential programmers. Now, a programmer, though he may grumble, will put up with almost any inconvenience thrown in his way, but a typist is not a programmer, nor is a bank clerk, nor is a journalist. Yet these people, and others in every aspect of business and industry, are expected to deal, in increasing numbers, with software designed for programmers and other members of the computer culture. They too will adjust themselves, since it is their livelihood, but they will not grumble, because they too often do not realize that matters could be better. When "the computer" makes a mistake it will afford them a moment of bitter pleasure during coffee-breaks, but in general they will feel frustrated, inadequate and oppressed, and their working lives will be made just a little more unpleasant because of it.
Real-time analysis of aggregate network traffic for anomaly detection
Authors: Seong Soo Kim
Venue:  (2005)

The frequent and large-scale network attacks have led to an increased need for developing techniques for analyzing network traffic. If efficient analysis tools were available, it could become possible to detect the attacks, anomalies and to appropriately take action to contain the attacks before they have had time to propagate across the network. In this dissertation, we suggest a technique for traffic anomaly detection based on analyzing the correlation of destination IP addresses and distribution of image-based signal in postmortem and real-time, by passively monitoring packet headers of traffic. This address correlation data are transformed using discrete wavelet transform for effective detection of anomalies through statistical analysis. Results from trace-driven evaluation suggest that the proposed approach could provide an effective means of detecting anomalies close to the source. We present a multidimensional indicator using the correlation of port numbers as a means of detecting anomalies. We also present a network measurement approach that can simultaneously detect, identify and visualize attacks and anomalous traffic in real-time. We propose to represent samples of network packet header data as frames or images. With such a formulation, a series of samples can be seen as a sequence of frames or video. This enables techniques from image processing and video compression such as DCT to be applied to the packet header data to reveal interesting properties of traffic. We show that &ldquo;scene change analysis&rdquo; can reveal sudden changes in traffic behavior or anomalies. We show that &ldquo;motion prediction&rdquo; techniques can be employed to understand the patterns of some of the attacks. We show that it may be feasible to represent multiple pieces of data as different colors of an image enabling a uniform treatment of multidimensional packet header data. Measurement-based techniques for analyzing network traffic treat traffic volume and traffic header data as signals or images in order to make the analysis feasible. In this dissertation, we propose an approach based on the classical Neyman-Pearson Test employed in signal detection theory to evaluate these different strategies. We use both of analytical models and trace-driven experiments for comparing the performance of different strategies. Our evaluations on real traces reveal differences in the effectiveness of different traffic header data as potential signals for traffic analysis in terms of their detection rates and false alarm rates. Our results show that address distributions and number of flows are better signals than traffic volume for anomaly detection. Our results also show that sometimes statistical techniques can be more effective than the NP-test when the attack patterns change over time.
Towards a framework for source code instrumentation measurement validation
Authors: Seth Chaiken
Venue:  (2005)

Accurate benchmarking is an important and open research problem, made challenging because of difficulties encountered in accounting for monitoring overhead and validating measurements. By studying the performance measurement using probes inserted into the source code accessing the hardware performance counters, we develop a framework that addresses the overhead and validation problems. This framework is formulated within some existing frameworks for general software measurements. To validate a measurement we use multiple instrumentation systems to obtain measurements that can be cross checked. For each one of these systems we extend; apply and evaluate models and methodologies for overhead compensation and overall validation. The sources of errors and overhead include both the instrumentation itself as well as activities unrelated to the phenomenon under study. We validate our flow-graph based instrumentation and perturbation model on small cases using static instruction counting, basic cache theory, and interrupt vs. cycle frequencies. We validate on larger cases based on the precision in which the overall performance of a system can be estimated from its instrumented execution using the existing Linux system calls, shells and user mode hardware counter access instructions. Finally we extend, apply and evaluate for the practical FFT library (FFTW) this thesis' methodologies for overhead compensation and overall validation.
Lanczos pseudospectral method for initial-value problems in electrodynamics and its applications to ionic crystal gratings
Authors: Andrei G. Borisov, Sergei V. Shabanov
Venue: Journal of Computational Physics (2005)

Maxwell's equations are cast in the form of the Schrodinger equation. The Lanczos propagation method is used in combination with the fast Fourier pseudospectral method to solve the initial-value problem. As a result, a time-domain, unconditionally stable, and highly efficient numerical algorithm is obtained for propagation and scattering of broad-band electromagnetic pulses in dispersive and absorbptive media. As compared to conventional finite-difference time-domain methods, an important advantage of the proposed algorithm is a dynamical control of accuracy: Variable time steps or variable computational costs per time step with error control are possible. The method is illustrated with numerical simulations of extraordinary transmission and reflection in metal, dielectric, and ionic crystal gratings with rectangular and cylindrical geometry. The effects of polaritonic excitations on transmission (reflection) properties of ionic crystal gratings in the infra-red range are investigated in detail. In particular, it is shown that, in addition to structural (geometric) resonances, resonant polaritonic excitations can drastically change light transmission.
Reinforcement Learning-Hierarchical Neuro-Fuzzy Politree Model for Autonomous Agents - Evaluation in a Multi-Obstacle Environment
Authors: Karla Figueiredo, Luciana Campos, Marley Vellasco, Marco Pacheco
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

Reinforcement Learning-Hierarchical Neuro-Fuzzy Politree Model for Autonomous Agents - Evaluation in a Multi-Obstacle Environment
Massive High-Performance Global File Systems for Grid computing
Authors: Phil Andrews, Patricia Kovatch, Christopher Jordan
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In this paper we describe the evolution of Global File Systems from the concept of a few years ago, to a first demonstration using hardware Fibre Channel frame encoding into IP packets, to a native GFS, to a full prototype demonstration, and finally to a production implementation. The surprisingly excellent performance of the Global File Systems over standard TCP/IP Wide Area Networks has made them a viable candidate for the support of Grid Supercomputing. The implementation designs and performance results are documented within this paper. We also motivate and describe the authentication extensions we made to the IBM GPFS file system, in collaboration with IBM. In several ways Global File Systems are superior to the original approach of wholesale file movement between grid sites and we speculate as to future modes of operation.
Generalizing the Notion of Confidence
Authors: Michael Steinbach, Vipin Kumar
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we explore extending association analysis to non-traditional types of patterns and non-binary data by generalizing the notion of confidence. The key idea is to regard confidence as a measure of the extent to which the strength of one association pattern provides information about the strength of another. This approach provides a framework that encompasses the traditional concept of confidence as a special case and can be used as the basis for designing a variety of new confidence measures. Besides discussing such confidence measures, we provide examples that illustrate the potential usefulness of a generalized notion of confidence. In particular, we describe an approach to defining confidence for error tolerant itemsets that preserves the interpretation of confidence as a conditional probability and derive a confidence measure for continuous data that agrees with the standard confidence measure when applied to binary transaction data.