ppxscal/embedding_network huggingface dataset:
Hierarchical Management of Service Accountability in Service Oriented Architectures
Authors: Yue Zhang, Kwei-Jay Lin
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Service-Oriented Architecture (SOA) provides a powerful and flexible paradigm to compose dynamic service processes using individual atomic services. However, these service processes can become vastly complex, involving many service partners, thereby giving rise to difficulties in terms of runtime problem detection and determination. In this research, we propose hierarchical service accountability management, an efficient and effective mechanism to detect service delivery failures and pinpoint the service(s) responsible for failures. We design the hierarchical system architecture of the accountability management model that leverages Bayesian Network reasoning engine to identify the most likely problematic services in a process and selectively inspect those services. Hierarchical accountability management benefits SOA in terms of significant monitoring and diagnosis resource saving and fast recovery during the run-time execution of service processes.
A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments
Authors: Joachim Zottl, Wilfried N. Gansterer, Helmut Hlavacs
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

A novel management layer architecture for mobile grid environments and ad-hoc networks is presented. We address a key challenge in dynamic mobile environments with a high degree of fluctuation in the hardware infrastructure: how to store information persistently and at the same time efficiently. Most currently available approaches are based on replication strategies. These strategies achieve persistency even in highly dynamic environments, but have to pay a high price in terms of redundancy. Our proposed architecture is based on the adaptation of fault-tolerant data distribution strategies utilizing erasure codes, such as RAID or Reed- Solomon, and thus combines persistency with high storage efficiency.
A Trust Based Information Dissemination Model for Evaluating the Effect of Deceptive Data
Authors: Yi Hu, Zhichun Xiao, Brajendra Panda
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This research studies the problem of evaluating the effect of deceptive data based on the Information Flow Network and the Web of Trust. We present an Information Dissemination Model that illustrates the prerequisite for dissemination of information based on the subject and object trusts. To evaluate the effects of deceptive data accurately, we offer a quantitative model that is utilized to calculate to what extent the subjects in the information flow network are affected. The algorithm for evaluating the spread of deceptive data is provided and the time complexity of the algorithm is also analyzed.
Dynamic behaviors of a delay differential equation model of plankton allelopathy
Authors: Fengde Chen, Zhong Li, Xiaoxing Chen, Jitka Laitochová
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we consider a modified delay differential equation model of the growth of n-species of plankton having competitive and allelopathic effects on each other. We first obtain the sufficient conditions which guarantee the permanence of the system. As a corollary, for periodic case, we obtain a set of delay-dependent condition which ensures the existence of at least one positive periodic solution of the system. After that, by means of a suitable Lyapunov functional, sufficient conditions are derived for the global attractivity of the system. For the two-dimensional case, under some suitable assumptions, we prove that one of the components will be driven to extinction while the other will stabilize at a certain solution of a logistic equation. Examples show the feasibility of the main results.
Multiobjective optimization of current waveforms for switched reluctance motors by genetic algorithm
Authors: Jian-Xin Xu, Qing Zheng
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper a genetic algorithm (GA) is employed to determine the desired current waveforms for switched reluctance motors (SRM) through generating appropriate reference phase torques for a given desired torque using the torque sharing function (TSF). The objective is to yield smoother phase current waveforms in general, and achieve minimum phase current variations in particular. This problem is formulated into a multiobjective optimization task with certain constraints. Due to the highly nonlinear relationship between the SRM torque and current, this optimization task is an NP-hard problem. To deal with the difficulty, the problem is further coded so that a GA can be applied to facilitate the search of global minimum. Simulation results verify the effectiveness of the proposed method.
Robust detection in asynchronous CDMA multipath fading channels
Authors: Yong-Suk Moon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This paper presents a robust detection approach in the presence of transmission delay estimation errors in asynchronous CDMA frequency selective Rayleigh fading channels. The transmission delays in asynchronous channels need to be estimated in practice and are subject to estimation errors, which may cause severe performance degradation for most detectors assuming perfect synchronization. As the fundamental framework of the robust detector, an asynchronous subspace detection scheme based on oblique projection is introduced and examined in comparison with the conventional RAKE receiver and the multipath decorrelator. The performance degradation of the subspace detector due to delay estimation errors is also investigated. The robust detector shows reliable performance even when the errors are much larger than those of delay estimation algorithms like MUSIC, and it is not affected by the near-far problem.
A New Parallel Sorting Algorithm based on Odd-Even Mergesort
Authors: Ezequiel Herruzo, Guillermo Ruiz, J. Ignacio Benavides, Oscar Plata
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

This paper describes a new parallel sorting algorithm, derived from the odd-even mergesort algorithm, named "partition and concurrent merging (PCM). The proposed algorithm is based on a divideand- conquer strategy. First, the data sequence to be sorted is decomposed in several pieces that are sorted in parallel using Quicksort. After that, all pieces are merged using a recursive procedure to obtain the final sorted sequence. In each iteration of this procedure pairs of sequence pieces are selected and sorted concurrently. The paper analyzes the computational complexity of the new algorithm and compares it with that of other well-known parallel sorting algorithms. We implemented the PCM algorithm on a SGI Origin2000 multiprocessor using OpenMP, sorting different benchmark sets of data sequences. Experimental results are compared with those of the Quicksort sequential algorithm and parallel implementations of other sorting algorithms, obtaining that our proposal outperforms the other solutions.
Solving the symbolic regression problem with tree-adjunct grammar guided genetic programming: the comparative results
Authors: N. X. Hoai, R. I. McKay, D. Essam, R. Chau
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper, we show some experimental results of tree-adjunct grammar-guided genetic programming (TAG3P) on the symbolic regression problem, a benchmark problem in genetic programming. We compare the results with genetic programming (GP) and grammar-guided genetic programming (GGGP). The results show that TAG3P significantly outperforms GP and GGGP on the target functions attempted in terms of the probability of success. Moreover, TAG3P still performed well when the structural complexity of the target function was scaled up.
Toward Assessing Data Quality of Ontology Matching on the Web
Authors: Olga Vorochek, Yevgen Biletskiy
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Nowadays the Semantic Web is a leading web technology, which enables semantic interoperability between structurally and semantically heterogeneous web sources and web users. Ontologies are a key of semantic interoperability and the main vehicle of the development of the Semantic Web. One of the most challenging and important tasks of ontology engineering is integration of ontologies because with the purpose to built a common ontology for all web sources and consumers in a domain. The present paper describes an approach of assessing data quality of ontology matching that allows evaluating correctness of mapping concepts and relationships from one ontological fragment to another. The purpose of correct mapping is to find identical and synonymous concepts and relationships in ontologies facilitating their integration to a common ontology, which serves as a base for attaining interoperability.
A Semantic and Time Related Recommendation-Feedback Trust Model
Authors: Zhang Lin, Xu Feng, Wang Yuan, Lv Jian
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Decentralized networks have gained widespread attentions recently. Trust management is a new method fit for the characteristics of the decentralized networks. This paper proposes a recommendation-feedback trust model which is based on the semantic similarities of the roles and is time related. In this model, we propose an algorithm which could collect as much information as possible in a given time, and access control decisions could be made with the information. Recommenders' reputation is updated according to the correctness of the recommendation. Semantic and time are used to process the information.
An empirical study of the robustness of Windows NT applications using random testing
Authors: Justin E. Forrester, Barton P. Miller
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

We report on the third in a series of studies on the reliability of application programs in the face of random input. In 1990 and 1995, we studied the reliability of UNIX application programs, both command line and X-Window based (GUI). In this study, we apply our testing techniques to applications running on the Windows NT operating system. Our testing is simple black-box random input testing; by any measure, it is a crude technique, but it seems to be effective at locating bugs in real programs. We tested over 30 GUI-based applications by subjecting them to two kinds of random input: (1) streams of valid keyboard and mouse events and (2) streams of random Win32 messages. We have built a tool that helps automate the testing of Windows NT applications. With a few simple parameters, any application can be tested. Using our random testing techniques, our previous UNIX-based studies showed that we could crash a wide variety of command-line and X-window based applications on several UNIX platforms. The test results are similar for NT-based applications. When subjected to random valid input that could be produced by using the mouse and keyboard, we crashed 21% of applications that we tested and hung an additional 24% of applications. When subjected to raw random Win32 messages, we crashed or hung all the applications that we tested. We report which applications failed under which tests, and provide some analysis of the failures.
The Un-Structured Student
Authors: Colin Myers, Paul Douglas
Venue: Proceedings of the 24th British National Conference on Databases (2007)

SQL (Structured Query Language) is intended to liberate users from the complex syntax, complex semantics and complex memory management that would be required of a procedural approach to relational database manipulation, and so allow users to concentrate on problem-solving. However, students still have problems with language features, program concepts and the legacy of their prior learning. This paper aims to assist lecturers teaching SQL.We present typical student mistakes, attempt to explain why these mistakes arise, and propose possible remedies.
Effective research experience of electrical engineering technology students
Authors: S. A. Chickamenahalli
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper describes a project in which undergraduate engineering technology students, engineering graduate students and a technical high school minority student experienced the research environment and worked together towards the success of a project in power electronics. Various aspects of the student research experience including teamwork, responsibility distribution, discussions, co-ordination and strategies for the development of the project are outlined. Specific initiatives undertaken at Wayne State University (USA) to increase undergraduate research are mentioned. Impact of the project and its influence on research and education and future challenges are highlighted.
Voice Quality Guaranteed Service over Best-Effort IP Network for Pervasive Environments
Authors: Jinsul Kim, Hyun-Woo Lee, Won Ryu, Byung Sun Lee
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Pervasive computing with voice application service must be providing unprecedented levels of technology in order to adapt the continually changed computing resources in ubiquitous environment. A number of conditions differ from the speech signal over IP network with heterogeneous devices while voice traffic is transported by packet-based in ubiquitous environment. In this paper, voice signals in packet loss and noise is controlled for the guaranteed Quality of Service (QoS) on the IP network which are responsible for digitizing, encoding, decoding, and playing out the speech signal. We implement the algorithms of Packet Loss Concealment (PLC) and noise reduction, which is called PEA (Pervasive Environment Adaptation)-PLC, PEA-noise reduction together, for providing high quality voice-based pervasive computing services. The proposed PEA-PLC algorithms are applied as post-processing after decoding on devices, and then PEA-noise reduction method is applied as pre-processing before speech coding. The proposed PEA-algorithms for packet loss and noise are applied in G.729A codec optimally using Mobile- SoftPhone and a 1-port gateway PSTN phone system. The performances of the proposed methods are evaluated by the PESQ measurement in various packet loss and noisy conditions.
Greedy Receivers in IEEE 802.11 Hotspots
Authors: Mi Kyung Han, Brian Overstreet, Lili Qiu
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

As wireless hotspot business becomes a tremendous financial success, users of these networks have increasing motives to misbehave in order to obtain more bandwidth at the expense of other users. Such misbehaviors threaten the performance and availability of hotspot networks, and have recently attracted increasing research attention. However the existing work so far focuses on sender-side misbehavior. Motivated by the observation that many hotspot users receive more traffic than they send, we study greedy receivers in this paper. We identify a range of greedy receiver misbehaviors, and quantify their damage using both simulation and testbed experiments. Our results show that even though greedy receivers do not directly control data transmission, they can still result in very serious damage, including completely shutting off the competing traffic. To address the issues, we further develop techniques to detect and mitigate greedy receiver misbehavior, and demonstrate their effectiveness.
Automatic audio morphing
Authors: M. Slaney
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes techniques to automatically morph from one sound to another. Audio morphing is accomplished by representing the sound in a multi-dimensional space that is warped or modified to produce a desired result. The multi-dimensional space encodes the spectral shape and pitch on orthogonal axes. After matching components of the sound, a morph smoothly interpolates the amplitudes to describe a new sound in the same perceptual space. Finally, the representation is inverted to produce a sound. This paper describes representations for morphing, techniques for matching, and algorithms for interpolating and morphing each sound component. Spectrographic images of a complete morph are shown at the end.
Causality-based Abstraction of Multiplicity in Security Protocols
Authors: Michael Backes, Agostino Cortesi, Matteo Maffei
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

This paper presents a novel technique for analyzing security protocols based on an abstraction of the program semantics. This technique is based on a novel structure called causal graph which captures the causality among program events within a finite graph. A core property of causal graphs is that they abstract away from the multiplicity of protocol sessions, hence constituting a concise tool for reasoning about an even infinite number of concurrent protocol sessions; deciding security only requires a traversal of the causal graph, thus yielding a decidable, and typically very efficient, approach for security protocol analysis. Additionally, causal graphs allow for dealing with different security properties such as secrecy and authenticity in a uniform manner. Both the construction of the causal graph from a given protocol description and the analysis have been fully automated and tested on several example protocols from the literature.
A Directional Texture Descriptor via 2D Walking Ant Histogram
Authors: Serkan Kiranyaz, Miguel Ferreira, Moncef Gabbouj
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

A novel texture descriptor, which can be extracted from the major object edges automatically and used for the content-based retrieval in multimedia databases, is presented. The proposed method is adopted from the 2D Walking Ant Histogram, which is in fact a generic shape descriptor recently developed for general purpose multimedia databases. 2D WAH shape descriptor is motivated from the imaginary scenario of a walking ant with a limited line of sight over the boundary of a particular object; eventually each sub-segment is traversed and the process keeps describing a certain line of sight, whether it is a continuous branch or a corner, using individual 2D histograms. In this paper we tuned this approach as an efficient texture descriptor, which achieves a superior performance especially for directional textures. Integrating the whole process as feature extraction module into MUVIS framework allows us to test the mutual performance of the proposed texture descriptor in the context of multimedia indexing and retrieval.
A Web Service-Enabled Distributed Workflow System for Scientific Data Processing
Authors: Rajesh Kalyanam, Lan Zhao, Taezoon Park, Sebastien Goasguen
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

This paper presents the design and implementation of a distributed data-driven workflow system on top of the TeraGrid infrastructure. The workflow system is based on a data management architecture that provides easy access to scientific data collections via the TeraGrid network. The workflow system allows researchers to construct scientific workflows for data discovery, access, transformation, and analysis. The system leverages JOpera, an open-source workflow engine and visual composer, as well as a set of web service-based data and computation modules. To demonstrate its effectiveness, we create an end-to-end climate simulation data analysis workflow that connects the data management architecture to TeraGrid computation resources. We also develop a workflow monitoring service to keep track of distributed workflow execution..
Measuring client-perceived response times on the WWW
Authors: Ramakrishnan Rajamony, Mootaz Elnozahy
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

The response time of a WWW service often plays an important role in its success or demise. From a user's perspective, the response time is the time elapsed from when a request is initiated at a client to the time that the response is fully loaded by the client. This paper presents a framework for accurately measuring the client-perceived response time in a WWW service. Our framework provides feedback to the service provider and eliminates the uncertainties that are common in existing methods. This feedback can be used to determine whether performance expectations are met, and whether additional resources (e.g. more powerful server or better network connection) are needed. The framework can also be used when a consolidator provides Web hosting service, in which case the framework provides quantitative measures to verify the consolidator's compliance to a specified Service Level Agreement. Our approach assumes the existing infrastructure of the Internet with its current technologies and protocols. No modification is necessary to existing browsers or servers, and we accommodate intermediate proxies that cache documents. The only requirement is to instrument the documents to be measured, which can be done automatically using a tool we provide.
The pricing of options for securities markets with delayed response
Authors: Yuriy Kazmerchuk, Anatoliy Swishchuk, Jianhong Wu
Venue: Mathematics and Computers in Simulation (2007)

The analogue of Black-Scholes formula for vanilla call option price in conditions of (B,S)-securities market with delayed response is derived. A special case of continuous-time version of GARCH is considered. The results are compared with the results of Black and Scholes.
An Inter-peer Trustworthiness Based on Access Control in Peer-to-Peer Overlay Networks
Authors: Yoshio Nakajima, Kenichi Watanabe, Valbona Barolli, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

We discuss a fully distributed peer-to-peer(P2P) overlay network where each peer is autonomous and accesses to objects distributed in peers by taking advantage of acquaintances. An acquaintance peer of a peer p is a peer about whose service the peer p knows and with which the peer p can directly communicate. The satisfiability is de- fined to how satisfiable a requesting peer is for each access request by newly taking into account the authorization. The trustworthiness of each acquaintance is calculated by aggregating the satisfiability obtained through each interaction with the acquaintance. If acquaintance information is changed, the change is propagated to peers through acquaintances. Due to the limited size of memory, the peer throws away information of less trustworthy acquaintances to make space to store new acquaintance information. The trustworthiness of acquaintance of each peer is propagated in a peer-by-peer way while some acquaintance information is recorded in a peer. We discuss how to calculate the trustworthiness, satisfiability, and exchange the acquaintance information then with acquaintances. We evaluate how the trustworthiness of acquaintance is changing through interactions among peers and the hit ratio can be improved for a detection request.