ppxscal/embedding_network huggingface dataset:
Formulas on the lattice of fuzzy subalgebras in universal algebra
Authors: Takashi Kuraoka
Venue: Fuzzy Sets and Systems (2007)

We study what first-order sentences give the equivalence in the meaning that holding on the lattice of subuniverses implies holding on that of fuzzy subalgebras, and vice versa. We introduce the notions of transferable form and strict-transferable form of open formulas, and show that universal sentences whose matrixes are of the former type and existential sentences whose matrixes are of the latter type give the equivalence for every abstract algebra. After that, we study the case when sentences are general. For the purpose, we examine Skolem normal forms of given sentences.
Modelling and analysing the functional behaviour of TCP&#x2019;s connection management procedures
Authors: Jonathan Billington, Bing Han
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2007)

The transmission control protocol (TCP) is the most widely used transport protocol in the Internet. It provides a reliable data transfer service to many applications. In this paper, Coloured Petri Nets are used to model TCP&#x2019;s connection management procedures. The model is created to verify TCP&#x2019;s functional correctness (e.g. the absence of deadlocks and livelocks). We discuss different modelling approaches to motivate the approach taken. The paper defines the termination property of TCP&#x2019;s connection management procedures, including the notions of desired and acceptable terminal states. Finally, we analyse TCP&#x2019;s connection management procedures operating over re-ordering non-lossy and lossy channels. This is done incrementally and considers 11 different configurations. The analysis provides some insights into TCP&#x2019;s behaviour where in certain circumstances the protocol fails to establish or terminate successfully.
Heuristic ranking of java program edits for fault localization
Authors: Xiaoxia Ren, Barbara G. Ryder
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

In modern software development, regression tests are used to confirm the fundamental functionalities of an edited program and to assure the code quality. Difficulties occur when testing reveals unexpected behaviors, which indicate potential defects introduced by the edit. However, the changes that caused the failure(s) are not always easy to find. We propose a heuristic that ranks method changes that might have affected a failed test, indicating the likelihood that they may have contributed to a test failure. Our heuristic is based on the calling structure of the failed test (e.g., the number of ancestors and descendents of a method in the test's call graph, whether the caller or callee was changed, etc.). We evaluated the effectiveness of the heuristic in 14 pairs of edited versions in the Eclipse jdt core plug-in, using the test suite from its compiler tests plug-in. Our results indicate that when a failure is caused by a single method change, our heuristic ranked the failure-inducing change as number 1 or number 2 of all the method changes in 67% of the delegate tests (i.e., representatives of all failing tests). Even when the failure is caused by some combination of the changes, rather than a single change, our heuristic still helps.
Blind and semiblind optimum demodulation in multiuser communications
Authors: J. Miguez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper addresses the problem of blind and semiblind channel estimation and detection in multiuser communications. The proposed receivers are optimum in the sense that they make full use of the available statistical information to compute the maximum likelihood (ML) estimate of the multiuser channel using the expectation maximization (EM) algorithm and perform ML detection of the transmitted symbols. Computer simulations show that both proposed demodulators attain optimum performance in code division multiple access (CDMA) time dispersive channels. The semiblind approach, in addition, is highly robust to the local misconvergence problems of the EM algorithm.
Capturing atomic interactions with a graphical framework in computational protein design
Authors: Jack Snoeyink
Venue:  (2006)

A protein's amino acid sequence determines both its chemical and its physical structures, and together these two structures determine its function. Protein designers seek new amino acid sequences with chemical and physical structures capable of performing some function. The vast size of sequence space frustrates efforts to find useful sequences. Protein designers model proteins on computers and search through amino acid sequence space computationally. They represent the three-dimensional structures for the sequences they examine, specifying the location of each atom, and evaluate the stability of these structures. Good structures are tightly packed but are free of collisions. Designers seek a sequence with a stable structure that meets the geometric and chemical requirements to function as desired; they frame their search as an optimization problem. In this dissertation, I present a graphical model of the central optimization problem in protein design, the side-chain-placement problem. This model allows the formulation of a dynamic programming solution, thus connecting side-chain placement with the class of NP-complete problems for which certain instances admit polynomial time solutions. Moreover, the graphical model suggests a natural data structure for storing the energies used in design. With this data structure, I have created an extensible framework for the representation of energies during side-chain-placement optimization and have incorporated this framework into the Rosetta molecular modeling program. I present one extension that incorporates a new degree of structural variability into the optimization process. I present another extension that includes a non-pairwise decomposable energy function, the first of its kind in protein design, laying the ground-work to capture aspects of protein stability that could not previously be incorporated into the optimization of side-chain placement.
Random Routing of Tasks in Hypercube Architectures
Authors: Arif Ghafoor
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

We propose a general technique to study the perfor mance of random routing in a hypercube system. The proposed method is a based on association schemes in stead of using representation theory.
Stochastic Model for Power Grid Dynamics
Authors: Marian Anghel, Kenneth A. Werley, Adilson E. Motter
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We introduce a stochastic model that describes the quasistatic dynamics of an electric transmission network under perturbations introduced by random load fluctuations, random removing of system components from service, random repair times for the failed components, and random response times to implement optimal system corrections for removing line overloads in a damaged or stressed transmission network. We use a linear approximation to the network flow equations and apply linear programming techniques that optimize the dispatching of generators and loads in order to eliminate the network overloads associated with a damaged system. We also provide a simple model for the operator's response to various contingency events that is not always optimal due to either failure of the state estimation system or due to the incorrect subjective assessment of the severity associated with these events. This further allows us to use a game theoretic framework for casting the optimization of the operator's response into the choice of the optimal strategy which minimizes the operating cost. We use a simple strategy space which is the degree of tolerance to line overloads and which is an automatic control (optimization) parameter that can be adjusted to trade off automatic load shed without propagating cascades versus reduced load shed and an increased risk of propagating cascades. The tolerance parameter is chosen to describes a smooth transition from a risk averse to a risk taken strategy. We present numerical results comparing the responses of two power grid systems to optimization approaches with different factors of risk and select the best blackout controlling parameter.
Lower Bounds and Nonuniform Time Discretization for Approximation of Stochastic Heat Equations
Authors: Thomas Muller-Gronbach, Klaus Ritter
Venue: Foundations of Computational Mathematics (2007)

We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[d. The error of an algorithm is defined in L2-sense. We derive lower bounds for the error of every algorithm that uses a total of N evaluations of one-dimensional components of the driving Wiener process W. For equations with additive noise we derive matching upper bounds and we construct asymptotically optimal algorithms. The error bounds depend on N and d, and on the decay of eigenvalues of the covariance of W in the case of nuclear noise. In the latter case the use of nonuniform time discretizations is crucial.
An efficient propagation delay estimator for DS-CDMA signals
Authors: Dunmin Zheng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we present an efficient algorithm for estimating the propagation delay of a known training sequence in an asynchronous direct-sequence code division multiple access (DS-CDMA) system. The algorithm is a large sample maximum likelihood (LSML) estimator that is derived by modeling the known training sequence as the desired signal and all other signals including the interfering signals and thermal noise as unknown colored Gaussian noise that are uncorrelated with the desired signal. LSML is asymptotically statistically efficient as the length of the training sequence goes to infinity. We shall show that LSML is robust against the near-far problem. The performance of the LSML estimator is compared with that of the MUSIC estimator via numerical examples and is shown to be better than that of the latter method in the sense of having lower root-mean-squared errors, lower computational complexity, and tolerating more users.
The Use of Attack and Protection Trees to Analyze Security for an Online Banking System
Authors: Kenneth Edge, Richard Raines, Michael Grimaila, Rusty Baldwin, Robert Bennington, Christopher Reuter
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Online banking has become increasingly important to the profitability of financial institutions as well as adding convenience for their customers. As the number of customers using online banking increases, online banking systems are becoming more desirable targets for criminals to attack. To maintain their customers' trust and confidence in the security of their online bank accounts, financial institutions must identify how attackers compromise accounts and develop methods to protect them. Attack trees and protection trees are a cost effective way to do this. Attack trees highlight the weaknesses in a system and protection trees provide a methodical means of mitigating these weaknesses. In this paper, a notional online banking system is analyzed and protection solutions are proposed for varying budgets.
Using Computer Simulation in Operating Room Management: Impacts on Process Engineering and Performance
Authors: Andre Baumgart, Anja Zoeller, Christof Denz, Hans-Joachim Bender, Armin Heinzl, Essameddin Badreddin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Operating rooms are regarded as the most costly hospital facilities. Due to rising costs and decreasing reimbursements, it is necessary to optimize the efficiency of the operating room suite. In this context several strategies have been proposed that optimize patient throughput by redesigning perioperative processes. The successful deployment of effective practices for continuous process improvements in operating rooms will require that operating room management sets targets and monitors improvements throughout all phases of process engineering. Simulation can be used to study the effects of process improvements through novel facilities, technologies and/or strategies. In this paper, we propose a conceptual framework to use computer simulations in different stages of business process management (BPM) lifecycle for operating room management. Additionally, we conduct simulation studies in different stages of the BPM lifecycle. The results of our studies provide evidence that simulation can provide effective decision support to drive performance in operating rooms in several phases of the BPM lifecycle.
Hierarchical microcontext technology and graph environment PYTHAGORAS
Authors: V. V. Prokhorov
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The research is devoted to a micro context approach to computer technology education and to engineering of languages and software. The main idea for education is to study at first not a large multiparadigm language (such as Pascal or Logo), but the set of orthogonal microlanguages. Then to decompose any development task into micro contexts; each of them can best be supported with its specific micro sub language and to input and to interpret such multilevel specification in composite media. This has to include a set of independent components; each serves a specific kind of work with a specific primitive microlanguage (editing, compiling, interpreting, etc.). We propose always preparing a large language when studying a hierarchy of micro sub languages. The approach is assisted by the PYTHAGORAS media. Characteristic features of the PYTHAGORAS are microlanguage technology support, and an inclination to a "game style" based work. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Approximate Labeling via Graph Cuts Based on Linear Programming
Authors: Nikos Komodakis Georgios Tziritas
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems.
Why most open source development projects do not succeed?
Authors: Evangelos Katsamakas, Nicholas Georgantzas
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Evidence suggests that only a small percentage of open source development (OSSD) projects are active, have significant participation, or have delivered operational software. We develop a system dynamics based simulation model to analyze the dynamics of open source project participation process and software development process. We show that the complex interaction between participation and development processes affects crucially success or failure.
Performance analysis of the mutual information function for nonlinear and linear signal processing
Authors: H.-P. Bernhard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Nonlinear signal processing is now well established both in theory and applications. Nevertheless, very few tools are available for the analysis of nonlinear systems. We introduce the mutual information function (MIF) as a nonlinear correlation function and describe the practicalities of estimating it from data. Even if an estimator is consistent, it is of great interest to check what the bias and variance are with a finite sample. We discuss these questions, as well as the computational efficiency, for two estimators. Both algorithms are of complexity Nlog/sub 2/N, where N is the sample length, but they use different methods to find the histogram for the estimation of the mutual information. An efficient implementation makes it possible to apply the algorithm on real time signal processing problems where the linear correlation analysis breaks down. Examples involving linear and nonlinear channels are discussed.
On the Equivalence of Automaton-Based Representations of Time Granularities
Authors: Ugo Dal Lago, Angelo Montanari, Gabriele Puppis
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

A time granularity can be viewed as the partitioning of a temporal domain in groups of elements, where each group is perceived as an indivisible unit. In this paper we explore an automaton-based approach to the management of time granularity that compactly represents time granularities as single-string automata with counters, that is, Büchi automata, extended with counters, that accept a single infinite word. We focus our attention on the equivalence problem for the class of restricted labeled single-string automata (RLA for short). The equivalence problem for RLA is the problem of establishing whether two given RLA represent the same time granularity. The main contribution of the paper is the reduction of the (non-)equivalence problem for RLA to the satisfiability problem for linear diophantine equations with bounds on variables. Since the latter problem has been shown to be NP-complete, we have that theRLA equivalence problem is in co-NP.
Using Students as Subjects in Experiments--A Quantitative Analysis of the Influence of Experimentation on Students' Learning Proces
Authors: Miroslaw Staron
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

The purpose of this study is to evaluate whether using students as subjects in software engineering experiments improves their learning process. In this paper we describe experiences with experimenting with students from several experiments. We show how these experiments were related to the courses and how we used them as an auxiliary tool for teaching. We perform a survey among the students who participated in the experiments and we analyze the final grades from the courses with and without experiments. The results show that the percentage of the high-passes increased after introducing experiments by 41%, 91% of students found the experiments to be useful in other courses, a vast majority of students perceived experiments as a good way of applying their knowledge in practice and as a good way of getting acquainted with empirical methods in software engineering (which was not the subject of the course). The implications of our research are that including carefully designed experiments into courses improve students' learning process and increase their motivation. The novelty of the paper is the perspective of students' learning perspective rather than researchers' benefits. The results help the teachers to take advantage of experiments to increase the students' learning.
Almost sure identifiability of multidimensional harmonic retrieval
Authors: Tao Jiang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Two-dimensional (2-D) and more generally multidimensional harmonic retrieval is of interest in a variety of applications. The associated identifiability problem is key in understanding the fundamental limitations of parametric high-resolution methods. In the 2-D case, existing identifiability results indicate that, assuming sampling at Nyquist or above, the number of resolvable exponentials is proportional to I+J, where I is the number of (equispaced) samples along one dimension, and J likewise for the other dimension. We prove that the number of resolvable exponentials is roughly IJ/4, almost surely. This is not far from the equations-versus-unknowns bound of IJ/3. We then generalize the result to the N-D case for any N>2, showing that, under quite general conditions, the number of resolvable exponentials is, proportional to the total sample size, hence grows exponentially with the number of dimensions.
A Virtual Cybermarketing System Using Web3D and JSR-184
Authors: Tao Zhang, Jun-feng Yao, Xian-yong Yang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper analyses the importance of establishing a three-dimensional Cybermarketing System and the method how to establish the virtual environment using Web3D and JSR-184.And this paper also reports some issues involved in the construction of the system. User can take a virtual tour of the gymnasium, browse the correlative products which are three-dimensional and buy tickets freely. The match sponsors can show its products and strengthen their selling. This paper also accomplishes the improved display technology and devises a special collision detection algorithm.
Flows with Bounded Waiting Time in Networked and Distributed Systems
Authors: A. Rajabi, F. Hormozdiari, A. Khonsari
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Many real world situations involve queueing systems in which customers renege (leave the queue after entering) according to a given distribution. We consider a system with a single deterministic server and FCFS scheduling discipline. Customer interarrival times are distributed exponentially. Each arriving customer is limited to a deterministically distributed patience time after which it must depart the system, and is considered lost. We present an insightful model to calculate the average number of customers in a reneging system using a related queueing system in which customers balk (refuse to join the queue) with a probability. Then, we derive expressions to calculate the probabilities of the number of customers in a balking system. Using these probabilities, we provide useful results such as calculation of jitter and average degree of multiplexing. Simulation experiments under different working conditions verify the validity of the proposed equations.