ppxscal/embedding_network huggingface dataset:
Verifying Distributed Protocols using MSC-Assertions, Run-time Monitoring, and Automatic Test Generation
Authors: Doron Drusinsky, Man-Tak Shing
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

This paper addresses the need for formal specification and runtime verification of system-level requirements of distributed reactive systems. It describes a formalism for specifying global system behaviors in terms of Message Sequence Chart assertions and a technique for the evaluation of the likelihood of success of a distributed protocol under non-trivial communication conditions via discrete event simulation and runtime execution monitoring. We constructed a proof-of-concept prototype for the leader-election algorithm within a 4-node ring network. The prototype consists of the following components: (i) an OMNeT++ model of the network using non-trivial communication conditions, (ii) C++ code for the network agents, (iii) a system-level assertion stipulating the formal requirement for a correct, timebound, leader election, (iv) simulation of the formal assertion, (v) automatic scenario generation, and (vi) run-time monitoring of the formal assertion and stochastic-based estimation of the likelihood of success of this assertion under the specified communication conditions.
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings
Authors: Rudolf Freund, Marion Oswald
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We investigate tissue P systems with (non-restricted, symmetric) versions of mate and drip operations and prove that such systems are computationally complete with the minimal number of two cells when working on strings. Moreover, we consider the variant of scattered context tissue P systems with mate and drip operations and show a similar computational completeness result with using at most four cells during any computation. In all cases, the corresponding results for (mem)brane systems are established, too.
Content-based methods for the management of digital music
Authors: D. Pye
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

The literature on content-based music retrieval has largely finessed acoustic issues by using MIDI format music. This paper however considers content-based classification and retrieval of a typical (MPEG layer III) digital music archive. Two statistical techniques are investigated and appraised. Gaussian mixture modelling performs well with an accuracy of 92% on a music classification task. A tree-based vector quantization scheme offers marginally worse performance in a faster, scalable framework. Good results are also reported for music retrieval-by-similarity using the same techniques. Mel-frequency cepstral coefficients parameterize the audio well, though are slow to compute from the compressed domain. A new parameterization (MP3CEP), based on a partial decompression of MPEG layer III audio, is therefore proposed to facilitate music processing at user-interactive speeds. Overall, the techniques described provide useful tools in the management of a typical digital music library.
Digital-ticket-controlled digital ticket circulation
Authors: Ko Fujimura, Hiroshi Kuno, Masayuki Terada, Kazuo Matsuyama, Yasunao Mizuno, Jun Sekine
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

This paper presents a new digital-ticket circulating scheme and trust management scheme for a digital ticket. A digital ticket is a digital medium that guarantees certain rights of the owner and it includes software licenses, resource access tickets, event tickets, and plane tickets. The circulation of digital tickets comprises three types of principal transactions: issuance, transfer, and redemption. Depending on the application, various conditions must be satisfied to execute these transactions, e.g., only qualified shops can issue the tickets and only a certain agent can transfer the tickets. This paper introduces circulation control tickets, which are required to issue, transfer, redeem a ticket, and proposes specifying the required control ticket types in the ticket to be circulated itself using the Generalized Ticket Definition Language. The ticket circulating system issues, transfers, or redeems a ticket only if the control tickets are owned by the participants of the transaction. The circulation control tickets themselves can be any type of digital ticket, e.g., a driver's license or a membership certificate to certain group, and these tickets can be recursively circulated in the ticket circulating system. This scheme provides the ticket circulating system with both the flexibility needed to match the business scheme of interest and application independence. This paper also proposes a ticket-type-based trust management scheme that enables users to mechanically verify the trust of a ticket by the presented ticket type verification procedure.
Integrated scoring for spelling error correction, abbreviation expansion and case restoration in dirty text
Authors: Wilson Wong, Wei Liu, Mohammed Bennamoun
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

An increasing number of language and speech applications are gearing towards the use of texts from online sources as input. Despite such rise, not much work can be found in the aspect of integrated approaches for cleaning dirty texts from online sources. This paper presents a mechanism of Integrated Scoring for Spelling error correction, Abbreviation expansion and Case restoration (ISSAC). The idea of ISSAC was first conceived as part of the text preprocessing phase in an ontology engineering project. Evaluations of ISSAC using 400 chat records reveal an improved accuracy of 96.5% over the existing 74.4% based on the use of Aspell only.
Object tracking based on temporal and spatial information
Authors: F. Moscheni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper addresses the problem of segmenting an image sequence in terms of multiple moving objects and tracking them through time and presents an object tracking algorithm. The objects are characterized through their temporal and spatial features so as to identify them and carry out the tracking procedure. The proposed tracking algorithm helps to detect the objects present in the current frame by supplying previous spatio-temporal information to the spatio-temporal segmentation procedure. In addition, the proposed algorithm tackles the correspondence problem. This is achieved through the use of a multiple hypotheses framework, the latter tests being based on both temporal and spatial characterizations of the objects.
Combining association measures for collocation extraction
Authors: Pavel Pecina, Pavel Schlesinger
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We introduce the possibility of combining lexical association measures and present empirical results of several methods employed in automatic collocation extraction. First, we present a comprehensive summary overview of association measures and their performance on manually annotated data evaluated by precision-recall graphs and mean average precision. Second, we describe several classification methods for combining association measures, followed by their evaluation and comparison with individual measures. Finally, we propose a feature selection algorithm significantly reducing the number of combined measures with only a small performance degradation.
Frequency estimation via sparse zero crossings
Authors: B. M. Sadler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We consider estimation of the frequency of a single sinusoid in Gaussian noise at high SNR using zero crossing times with (perhaps very many) missing observations. A period estimator is developed based on a modified Euclidean algorithm (MEA). The MEA is a computationally simple method for estimating the greatest common divisor (GCD) of a noisy contaminated data set. The approach is motivated by the fact that in the noise-free case the GCD of a set of the first differences of the zero crossing times is, with high probability, the half-period of the sinusoid. Simulation results demonstrate period estimation with 75% of the zero crossing times missing, and the data set contaminated with outliers.
An efficient on-the-fly cycle collection
Authors: Harel Paz, David F. Bacon, Elliot K. Kolodner, Erez Petrank, V. T. Rajan
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2007)

A reference-counting garbage collector cannot reclaim unreachable cyclic structures of objects. Therefore, reference-counting collectors either use a backup tracing collector infrequently, or employ a cycle collector to reclaim cyclic structures. We propose a new concurrent cycle collector, one that runs concurrently with the program threads, imposing negligible pauses (of around 1ms) on a multiprocessor. Our new collector combines a state-of-the-art cycle collector [Bacon and Rajan 2001] with sliding-views collectors [Levanoni and Petrank 2001, 2006; Azatchi et al. 2003]. The use of sliding views for cycle collection yields two advantages. First, it drastically reduces the number of cycle candidates, which in turn drastically reduces the work required to record and trace these candidates. Consequentially, a large improvement in cycle collection efficiency is achieved. Second, it eliminates the theoretical termination problem that appeared in the earlier concurrent cycle collector. There, a rare race may delay the reclamation of an unreachable cyclic structure forever. The sliding-views cycle collector guarantees reclamation of all unreachable cyclic structures. The proposed collector was implemented on the Jikes RVM and we provide measurements including a comparison between the use of backup tracing and the use of cycle collection with reference counting. To the best of our knowledge, such a comparison has not been reported before.
Fine grained kernel logging with KLogger: experience and insights
Authors: Yoav Etsion, Dan Tsafrir, Scott Kirkpatrick, Dror G. Feitelson
Venue: ACM SIGOPS Operating Systems Review (2007)

Understanding the detailed behavior of an operating system is crucial for making informed design decisions. But such an understanding is very hard to achieve, due to the increasing complexity of such systems and the fact that they are implemented and maintained by large and diverse groups of developers. Tools like KLogger --- presented in this paper --- can help by enabling fine-grained logging of system events and the sharing of a logging infrastructure between multiple developers and researchers, facilitating a methodology where design evaluation can be an integral part of kernel development. We demonstrate the need for such methodology by a host of case studies, using KLogger to better understand various subsystems in the Linux kernel, and pinpointing overheads and problems therein.
Development of an engineering strength of material concept inventory assessment instrument
Authors: J. Richardson
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This paper discusses development of an instrument for assessing undergraduate student understanding of fundamental strength of materials concepts. The instrument was modeled after the Force Concept Inventory (FCI) by David Hestenes and others. Like the FCI, the strength of materials concept inventory is brief requires no computation and should be repeatable across broad student populations. The initial version of the instrument was tested on strength of materials students at the University of Alabama, Texas A&M University and other institutions.
Service learning: engineering, construction science, and the experiential curriculum
Authors: J. W. Martin
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Service Learning is a form of experiential learning that utilizes the context of a community service project to practice academic skills. In recent years Service learning has been included in many academic disciplines throughout the United States. Incorporating a hands-on component into the curriculums of construction science is challenging for the instructor. Most often these service-learning activities are accompanied by lessons in the classroom creating a pedagogical synergy not found in singular teaching/learning activities in the traditional classroom setting. A difficulty arises when professors want to develop service-learning projects for courses in structures. This paper examines the current status of service learning in the Construction Science curriculum and proposes a service-learning project for Construction Science students at Texas A&M University. Interest in Service Learning has occurred at the university.
A Soldier-Robot Ad Hoc Network
Authors: Brian B. Luu, Barry J. O'Brien, David G. Baran, Rommie L. Hardy
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

The mobility and convenience of wireless LANs have resulted in a proliferation of IEEE 802.11 a/b/g devices. However, their capabilities depend on a network infrastructure which military operations cannot reliably obtain in a battlefield environment. The U.S. Army Research Laboratory (ARL) has researched mobile ad hoc networks (MANET) which do not depend on an infrastructure but possess ad hoc routing capabilities that allow mobile nodes to self-configure and adapt to changes in network topology in order to sustain connectivity. This paper presents and discusses an implementation of a soldier-robot ad hoc network to support reconnaissance, surveillance and target acquisition (RSTA) capabilities. The realization of this wireless MANET was achieved by using commercial off-the-shelf (COTS) wireless network hardware and open-source software. We will describe the seamless integration of MANET capability into a soldier system used to remotely control a small unmanned ground vehicle (SUGV). We will explain the use of MANET technology in extending the operational range of the robot in both line-of-sight and non-light-of-sight environments, such as in buildings, using intermediate MANET nodes.
Realistic propagation simulation of urban mesh networks
Authors: Vinay Sridhara, Stephan Bohacek
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

Simulation plays an important role in the verification of mobile wireless networking protocols. Recently, several cities have either begun deploying or are completing plans to deploy large-scale urban mesh networks (LUMNets). On the other hand, the networking research community has little expertise in simulating such networks. While the protocols are simulated reasonably realistically, the propagation of wireless transmissions and the mobility of nodes are not. Today, simulations typically model propagation with either the free-space model or a ''two-ray'' model that includes a ground reflection. Such models are only valid in open space where there are no hills and no buildings. Since wireless signals at the frequencies used for mobile wireless networking are partly reflected off of buildings and partly is transmitted into the building, the presence of buildings greatly influences propagation. Consequently, the open-space propagation models are inaccurate in outdoor urban areas. Indoors, the open-space models are not even applicable. This paper presents guidelines for simulating propagation in such urban settings. Extensive background discussion on propagation is also included. The techniques for propagation are validated against propagation measurements. The techniques discussed are implemented in a suite of tools that are compatible with protocol simulators and are freely available for use.
Wavelets in real-time rendering
Authors: Amar Mukherjee
Venue:  (2006)

Interactively simulating visual appearance of natural objects under natural illumination is a fundamental problem in computer graphics. 3D computer games, geometry modeling, training and simulation, electronic commerce, visualization, lighting design, digital libraries, geographical information systems, economic and medical image processing are typical candidate applications. Recent advances in graphics hardware have enabled real-time rasterization of complex scenes under artificial lighting environment. Meanwhile, pre-computation based soft shadow algorithms are proven effective under low-frequency lighting environment. Under the most practical yet popular all-frequency natural lighting environment, however, real-time rendering of dynamic scenes still remains a challenging problem. In this dissertation, we propose a systematic approach to render dynamic glossy objects under the general all-frequency lighting environment. In our framework, lighting integration is reduced to two rather basic mathematical operations, efficiently computing multi-function product and product integral. The main contribution of our work is a novel mathematical representation and analysis of multi-function product and product integral in the wavelet domain. We show that, multi-function product integral in the primal is equivalent to summation of the product of basis coefficients and integral coefficients . In the dissertation, we give a novel Generalized Haar Integral Coefficient Theorem. We also present a set of efficient algorithms to compute multi-function product and product integral. In the dissertation, we demonstrate practical applications of these algorithms in the interactive rendering of dynamic glossy objects under distant time-variant all-frequency environment lighting with arbitrary view conditions. At each vertex, the shading integral is formulated as the product integral of multiple operand functions. By approximating operand functions in the wavelet domain, we demonstrate rendering dynamic glossy scenes interactively, which is orders of magnitude faster than previous work. As an important enhancement to the popular Pre-computation Based Radiance Transfer (PRT) approach, we present a novel Just-in-time Radiance Transfer (JRT) technique, and demonstrate its application in real-time realistic rendering of dynamic all-frequency shadows under general lighting environment. Our work is a significant step towards real-time rendering of arbitrary scenes under general lighting environment. It is also of great importance to general numerical analysis and signal processing.
Design of high performance fuzzy controllers using flexible parameterized membership functions and intelligent genetic algorithms
Authors: Shinn-Ying Ho, Tai-Kang Chen, Shinn-Jang Ho
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper proposes a method for designing high performance fuzzy controllers with a compact rule system. The method is mainly derived from flexible parameterized membership functions (FPMFs) and a novel intelligent genetic algorithm (IGA). Each FPMF consists of flexible trapezoidal fuzzy sets and the fuzzy set is encoded by five parameters. Furthermore, the membership functions and fuzzy rules are simultaneously determined by effectively incorporating all the system parameters into chromosomes. Therefore, the optimal design of fuzzy controllers is formulated as a large parameter optimization problem, which can be effectively solved by IGA. The proposed method is demonstrated by two well-known problems, truck backing and cart centering problems. It is shown empirically that the performance of the proposed method is superior to those of existing methods in terms of the numbers of time steps and fuzzy rules.
Project Catalyst: promoting systemic change in engineering education
Authors: B. Hoyt
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Project Catalyst is an NSF-funded initiative to promote systemic change in engineering education by integrating instructional design techniques, transforming the classroom into a cooperative learning environment, and incorporating the use of information technology in the teaching/learning process. A conceptual framework is described to aid in shifting and supporting student's and instructor's activities in a transition from a traditional mode to a collaborative mode of instruction. In the first year of Project Catalyst, a core group of engineering faculty has begun implementing this focused shift by introducing a greater emphasis on team building, teamwork, cooperative learning, problem-based learning, and information technology. This paper discusses our enhanced instructional model and the supplementary skills modules that we will develop and use to implement this model. It concludes with the future work for the remaining two years of the NSF-funded project.
Integral evaluation in semiconductor device modelling using simulated annealing with Bose&ndash;Einstein statistics: Research Articles
Authors: E. A. B. Cole
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

Fermi integrals arise in the mathematical and numerical modelling of microwave semiconductor devices. In particular, associated Fermi integrals involving two arguments arise in the modelling of HEMTs, in which quantum wells form at the material interfaces. The numerical evaluation of these associated integrals is time consuming. In this paper, these associated integrals are replaced by simpler functions which depend on a small number of optimal parameters. These parameters are found by optimizing a suitable cost function using a genetic algorithm with simulated annealing. A new method is introduced whereby the transition probabilities of the simulated annealing process are based on the Bose&ndash;Einstein distribution function, rather than on the more usual Maxwell&ndash;Boltzmann statistics or Tsallis statistics. Results are presented for the simulation of a four-layer HEMT, and show the effect of the approximation for the associated Fermi integrals. A comparison is made of the convergence properties of the three different statistics used in the simulated annealing process. Copyright &copy; 2007 John Wiley & Sons, Ltd.
An architecture for virtual organization (VO)-based effective peering of content delivery networks
Authors: Al-Mukaddim Khan Pathan, James Andrew Broberg, Kris Bubendorfer, Kyong Hoon Kim, Rajkumar Buyya
Venue: Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks (2007)

The proprietary nature of existing Content Delivery Networks (CDNs) means they are closed and do not naturally cooperate, resulting in "islands" of CDNs. Finding ways for distinct CDNs to coordinate and cooperate with other CDNs is necessary to achieve better overall service, as perceived by end-users, at lower cost. In this paper, we present an architecture to support peering arrangements among CDN providers, based on a Virtual Organization (VO) model. Our approach promotes peering among providers, reduces expenditure, while upholding user perceived performance. This is achieved through proper policy management of negotiated Service Level Agreements (SLAs) among peers. In addition, scalability and resource sharing among CDNs is improved through effective peering, thus evolving past the current landscape where "islands" of CDNs exist. We also show analytically that significant performance improvement can be achieved through the peering of CDNs.