ppxscal/embedding_network huggingface dataset:
Protocol Verification in a Software Component-Based Approach
Authors: Inès Mouakher, Jeanine Souquières, Francis Alexandre
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

In a component-based software system, components are black boxes communicating through their interfaces, possibly using adapters. The verification of interoperability between the different components is a crucial issue to guarantee the trustworthy of the system as well as its correct realization. We present a systematic approach based on UML, the B method and its support tools to verify the correctness of component assembly at the protocol level.
On improving trapezoidal and triangular approximations of fuzzy numbers
Authors: Chi-Tsuen Yeh
Venue: International Journal of Approximate Reasoning (2008)

Recently, various researchers have proved that the approximations of fuzzy numbers may fail to be fuzzy numbers, such as the trapezoidal approximations of fuzzy numbers. In this paper, we show by an example that the weighted triangular approximation of fuzzy numbers, proposed by Zeng and Li, may lead to the same result. For filling the gap, improvements of trapezoidal and triangular approximations are proposed. The formulas for computing the two improved approximations are provided. Some properties of the two improved approximations are also proved.
Security of the redefined Liaw's broadcasting cryptosystem
Authors: Wen-Tao Zhu, Chuan-Kun Wu
Venue: Computers Mathematics with Applications (2008)

Liaw proposed a broadcasting cryptosystem [H.T. Liaw, Broadcasting cryptosystem in computer networks, Computers & Mathematics with Applications 37 (Mar. 1999) 85-87] which claims to involve fewer broadcasting messages, and has attracted quite some research efforts on iterative analysis and improvement [H.M. Sun, Security of broadcasting cryptosystem in computer networks, Electronics Letters 35 (Nov. 1999) 2108-2109; Y.M. Tseng, J.K. Jan, Cryptanalysis of Liaw's broadcasting cryptosystem, Computers & Mathematics with Applications 41 (Jun. 2001) 1575-1578; J.M. Masque, A. Peinado, Cryptanalysis of improved Liaw's broadcasting cryptosystem, Journal of Information Science and Engineering 22 (Mar. 2006) 391-399]. We show that the redefined Liaw's broadcasting cryptosystem recently presented in [J.M. Masque, A. Peinado, Cryptanalysis of improved Liaw's broadcasting cryptosystem, Journal of Information Science and Engineering 22 (Mar. 2006) 391-399] is still insecure in that an unauthorized user is able to obtain the shared secret, which is only intended for certain privileged users.
An open financial services architecture based on the use of intelligent mobile devices
Authors: Apostolos Kousaridas, George Parissis, Theodore Apostolopoulos
Venue: Electronic Commerce Research and Applications (2008)

The scope of this paper is to explore, analyze and develop a universal architecture that supports mobile payments and mobile banking, taking into consideration the third and the emerging fourth generation communication technologies. Interaction and cooperation between payment and banking systems, integration of existing technologies and exploitation of intelligent procedures provide the prospect to develop an open financial services architecture (OFSA), which satisfies requirements of all involved entities. A unified scenario is designed and a prototype is implemented to demonstrate the feasibility of the proposed architecture.
Twists, turns, cascades, deque conjecture, and scanning theorem
Authors: R. Sundar
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

Nearly tight upper and lower bounds on the maximum number of various rotational operations that can be performed on a binary tree are proved. One of the lower bound results refutes D.E. Sleator's turn conjecture for binary trees (see R.E. Tarjan, SIAM J. Alg. Disc. Meth., vol.2, p.306-318, 1985). The upper bound results are used to derive an inverse Ackerman bound for Tarjan's deque conjecture on the performance of the splay tree. Two new proofs of Tarjan's scanning theorem are provided. One proof generalizes the theorem, whereas the other is a simple, potential-based proof.
Framework for Analysis of Transmission Rate Scheduling for Wireless CDMA Data Networks
Authors: Ashraf S. Hasan Mahmoud
Venue: Wireless Personal Communications: An International Journal (2008)

The optimal utilization of network resources and the capacity to fulfill quality of service requirements are key requirements for 3rd G networks operations. Several burst admission and transmission rate scheduling algorithms are proposed in the literature. In this study, we develop an analytical framework for the downlink transmission rate scheduling problem for CDMA networks employing discrete service bit rates. The framework uses the average downlink transmit power as the system state and develops a K-dimensional Markov chain representing all possible states in the system. In addition, the transition probabilities due to arrivals of burst requests are made a function of the power utilization and the average power required to support the new burst taking into account the path loss model. The study assumes a transmission rate assignment scheme where the maximum possible system bit rate is assigned given the current system state and the subscriber's eligibility profile for particular system service rates. The analytical model provides performance metrics such as system throughput, average power utilization, average number of simultaneous transmissions, burst request blocking probability, and mean burst service time. While the developed model is applicable for a general CDMA based network with arbitrary discrete system service bit rates, the model is evaluated for the example of a cdma2000 1xRTT network. A comparison between simulation and analytic results to assess the accuracy of the model is provided.
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Authors: Yijian Bai, Carlo Zaniolo
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approaches on optimizing memory consumption or response time (i.e., latency) usually produce very different algorithms. In this paper, we extend the popular chart-partitioning procedure, which was previously used for memory optimization on simple operator paths, to minimize latency as well as memory on complex query-graphs with tuple-sharing forks. Furthermore, we test the performance of algorithms that only assume knowledge of the average behavior of tuples and operators, against a theoretical one that assumes detailed knowledge on the behavior of individual tuples. These experiments show that the practical algorithms closely approximate the performance of the optimal ones.
Client side personalization of smart environments
Authors: Ibrahim Armac, Daniel Evers
Venue: Proceedings of the 1st international workshop on Software architectures and mobility (2008)

In this paper we will describe our approach for supporting users by personalizing the multiple environments they visit in their daily lives. In our approach, user preferences are stored on a handheld device which can assist the user in selecting, installing and parameterizing personal services in the environments.
Numerical Simulation of Wave Propagation, Part I: Sequential Computing
Authors: Muhammad Sahimi, S. Mehdi Vaez Allaei
Venue: Computing in Science and Engineering (2008)

Wave propagation is a phenomenon of fundamental importance to a wide variety of problems involving disordered media; numerical simulation is the only practical way of studying it.
Maintaining optimal communication chains in robotic sensor networks using mobility control
Authors: Cory Dixon, Eric W. Frew
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Electronic chaining is the formation, and maintenance, of a linked communication chain that maximizes the end-to-end throughput using a cooperative team of mobile robotic relays. For this paper, an optimal communication chain is defined using the signal-to-noise ratio (SNR) of the communication links along the chain. By using the SNR of the individual communication channels, instead of relative position, an optimal communication chain of robotic relays is formed that is able to respond to changes in, and unexpected features of, the RF environment that is simply not possible with position based chaining solutions. Since the operating environment is generally not known a priori to deployment of a robotic sensor network, an adaptive model-free extremum seeking (ES) algorithm is presented to control the motion of 2D nonholonomic vehicles acting as communication relays. Even without specific knowledge of the SNR field, the ES algorithm is able to drive the team of vehicles to optimal locations with only local measures of the SNR. A specific application using unmanned aircraft is simulated to highlight the fact that the performance of the ES chaining algorithm is limited due to the performance constraints and capabilities of the individual vehicles within the chain.
Proceedings of the 3rd international workshop on Applications and advances of problem frames
Venue: International Conference on Software Engineering (2008)

It is our great pleasure to welcome you to the Third International Workshop on Applications and Advances of Problem Frames - IWAAPF'08. Problem Frames are, this year, fourteen years old. It all started with an idea in the Jackson's 1994 paper "Software Development Method" that appeared in "A Classical Mind: Essays in Honour of C A R Hoare." There were, at that time, no diagrams but the idea was sweet. (Diagrams came later in "Problem Complexity" published in the proceedings of Third IEEE International Conference on Engineering of Complex Systems (ICECCS'97) in 1997.) As a measure of the popularity, google-scholaring "Problem Frames" returns 741 hits. Right at the top is Jackson's 2001 eponymous book "Problem frames: analyzing and structuring software development problems". This year, we add another 14 excellent papers to that count, one for each year, with our workshop. Those papers come from authors located in six countries. Some describe work completed, some work in progress and some work yet to be done. There are variants of Problem Frames, ontologies for Problem Frames, and the continuing work on taking Problem Frames closer to the solution space and more traditional software engineering techniques. Moreover, the workshop boasts a keynote presentation from Professor John Knight, Virginia, that places Problem Frames squarely as a useful engineering technique in the real-world.
Spectral collocation solution of a generalized Hirota-Satsuma coupled KdV equation
Authors: M. T. Darvishi, F. Khani, S. Kheybari
Venue: International Journal of Computer Mathematics (2007)

In this paper the solution of a generalized Hirota-Satsuma Korteweg-de Vires (KdV) equation using a pseudospectral method is presented. To reduce roundoff error we use some preconditionings. Firstly, we discretize the equation in space to obtain a system of time-dependent ordinary differential equations. Secondly, we solve the obtained system of ordinary differential equations using the fourth-order Runge-Kutta method. The method works very well because the absolute errors are very small.
Randomized Bit Encoding for Stronger Backward Channel Protection in RFID Systems
Authors: Tong-Lee Lim, Tieyan Li, Sze-Ling Yeo
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

In this paper, we introduce a randomized bit encoding scheme that can strengthen the privacy protection on RFID tags.This scheme is used together with the backward channel protection method proposed by Choi and Roh in \cite{choi}, which serves to protect the unique identifier of an RFID tag from disclosure to close-range eavesdroppers.Choi and Roh's method faces the `same-bit' problem, in which some bits of the unique identifier could be disclosed, thereby revealing critical information. Our proposed scheme alleviates the `same-bit' problem to a negligible level. Furthermore, we propose an enhanced system model that can protect the unique tag identifier from disclosure not only against eavesdroppers, but against unauthorized interrogators as well. A metric based on entropy was defined and used to measure the amount of protection offered by the scheme. A method to construct an optimal randomized $n$-bit encoding scheme was also described. In addition, theoretical analysis and simulations were conducted, which show that the proposed encoding scheme provides significant improvement (achieving almost twice the entropy) over no encoding.
Observation of Ni silicide formations and field emission properties of Ni silicide nanowires
Authors: Joondong Kim, Eung-Sug Lee, Chang-Soo Han, Youngjin Kang, Dojin Kim, Wayne A. Anderson
Venue: Microelectronic Engineering (2008)

The Ni silicide nanowires were grown by physical vapor deposition. The morphological changes of silicide formation were observed on a gradient Ni film thickness, which visualized the critical thickness is 60-80nm to grow nanowires. The field emission measurement provided uniform characteristics and high field enhancement factors were obtained to be 3180 and 3002 from the Ni silicide nanowires grown on a Si substrate and a tungsten plate, respectively. By using a conductive tungsten plate, the emission current was enhanced to be 172.5@mA/cm^2 comparing to 76.5@mA/cm^2 from a Si substrate at 5V/@mm.
Incorporating string transformations in record matching
Authors: Arvind Arasu, Surajit Chaudhuri, Kris Ganjam, Raghav Kaushik
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and more general forms of string transformations such as abbreviations. We expand the problem of record matching to take such user-defined string transformations as input. These transformations coupled with an underlying similarity function are used to define the similarity between two strings. We demonstrate the effectiveness of this approach via a fuzzy match operation that is used to lookup an input record against a table of records, where we have an additional table of transformations as input. We demonstrate an improvement in record matching quality and efficient retrieval based on our index structure that is cognizant of transformations.
Condition for global convergence of a homotopy method for variational inequality problems on unbounded sets
Authors: Qing Xu, Bo Yu, Guochen Feng, Chuangyin Dang
Venue: Optimization Methods Software (2007)

A condition for global convergence of a homotopy method for a variational inequality problem (VIP) on an unbounded set is introduced. The condition is derived from a concept of a solution at infinity to VIP. By an argument of the existence of a homotopy path, we show that VIP has a solution if it has no solution at infinity. It is proved that if any of several well-known conditions given in the literature holds, there is no solution at infinity. Furthermore, a globally convergent homotopy method is developed to compute a solution to VIP. Several numerical examples illustrate how to follow the homotopy path starting at an arbitrary point in the unbounded set.
A case study of compiler driven I/O minimization
Authors: W. Zhang, T. Beaubouef, J. Feng, E. Leiss
Venue: Journal of Computing Sciences in Colleges (2008)

Most scientific programs have large input and output data sets that require out-of-core programming or the use of virtual memory management (VMM). Often, VMM is not an effective approach because it often results in substantial performance reduction. In contrast, compiler driven I/O management allows a program's data sets to be retrieved explicitly in parts. In this paper a modified Comanche (Compiler Managed Cache) system is presented.
Grid computing at the undergraduate level: can we do it?
Authors: Jens Ma he, Amy Apon, Thomas Feilhauer, Barry Wilkinson
Venue: ACM SIGCSE Bulletin (2008)

In 2003, MIT Technology Review listed Grid computing as one of 'Ten Emerging Technologies That Will Change the World' [5]. Five years later, is Grid computing ready for the undergraduate classroom? In this panel, a group of educators share their experiences in teaching Grid computing over the past several years and in various settings, and discuss how the subject materials should be developed for the future. Key points under discussion include the place in the undergraduate curriculum, the role of programming exercises, bottom-up versus top-down approaches, and the necessary Grid computing platform. This panel will be of interest to those who teach the subject, and those who wish to introduce Grid computing into their programs. It will also interest those who do not want to offer a full Grid computing course but may wish to introduce Grid computing into existing distributed systems, networking, or parallel programming courses.
Initiator-Domain-Based SLA Negotiation for Inter-domain QoS-Service Provisioning
Authors: Cao Yuanming, Wang Wendong, Gong Xiangyang, Que Xirong
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

The problem of providing Quality of Service (QoS) applications across multi-domain through Service Level Agreement (SLA) negotiation is addressed in this paper. Nowadays, the IP network which can only provide best effort services can not fulfil customers' QoS requirements, and SLA contract signed between service provider and service consumer is proposed to support QoS-based service offering. Service Provider (SP) separated from Network Provider (NP) acts as an independent entity in service provisioning, and needs to negotiate SLA with NP to attain network resource, which enables SP to provide QoS guaranteed services for customers. But in the current Internet, network domains are owned by different network operators and SP and customers may locate in different domains, which makes the SLA negotiation more complicated in QoS-Service provisioning. The initiator-domain-based SLA negotiation system is proposed to meet the negotiation problem. An implemented prototype is used to validate the architecture.
Image enhancement - An emergent pattern formation approach via decentralised multi-agent systems
Authors: Jeff Jones, Mohammed Saeed
Venue: Multiagent and Grid Systems (2007)

A multi-agent framework inspired by natural and physical systems is presented for data discovery and image enhancement. The input image is represented as a topographic landscape upon which a large population of independent simple, reactive, mobile agents resides. The local landscape configuration presents stimuli to each agent, influencing agent behaviour and resulting in changes in agent orientation and movement. Individual agents deposit a trail as they move and leave specific marks in response to stimuli above a certain threshold. The parallel interactions of the agent population and the image landscape result in emergent patterns of trails and marks being generated, corresponding to global (population level) perception of the original image. The emergent patterns exhibit image feature extraction and represent an indirect processing of the input image. External environmental pressures may be applied to the emergent patterns to further amplify the feature extraction. The framework represents a decentralised approach to image enhancement which is extensible. Different types of agent may be developed to perform different image processing functions, or other problems whose definition and solution may be represented as spatial patterns. Results including binary image processing, greyscale enhancement, colour image processing and related spatial processing problems are presented.
Microsoft Exchange 2007 Outlook Web Access Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions and shortcuts for how to use Microsoft Exchange 2007 Outlook Web Access (Premium Client). Topics include: Mail: Displaying the Inbox, Creating and Sending a Message, Showing BCC, Drafting a Message, Sending a Message with High or Low Importance, Requesting a Read or Delivery Receipt, Checking Spelling, Checking for New Messages, Reading Messages, Replying to a Message, Forwarding a Message, Single Line and Multiple Line View, Creating an E-Mail Signature, Sorting Messages, Creating a Folder, Moving or Copying Messages, Turning on/off an AutoReply when Out of the Office, and Opening Another User's Mailbox. Calendar: Displaying the Calendar, Viewing the Calendar, Creating & Editing Appointments, Scheduling Meetings, Responding to Meeting Requests, and Making an Appointment Recur. Contacts: Displaying Contacts, Creating and Editing Contacts, and Sending a Mail Message to a Contact. Tasks: Displaying Tasks, Creating a Task, Marking a Task or Flagged Item Complete, Changing Tasks Viewed, and Sorting Tasks. Common Procedures: Using Flags, Deleting an Item, Emptying the Deleted Items Folder, Using Categories, Searching for an Item, and Logging Off. Also includes a list of keyboard shortcuts. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Large-scale simulation using parallel computing toolkit and server message block
Authors: Panjit Musik, Krisanadej Jaroensutasinee
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This research presents a parallel simulation technique for large-scale or complex problems. Simulation of large scale problems is almost impossible to run on a single personal computer and cannot be solved in a reasonable time. Parallelization of problems is achieved by using horizontal domain decomposition while each decomposed domain is computed on each processor of personal computers, PC Cluster. We developed a PC Cluster, namely Walailak University Cluster of 16 Slave processors Pentium 4 (WAC16P4 Cluster). A software of Parallel Computing Toolkit and the Server Message Block Protocol are applied with a new parallel computing technique, which can communicate with adjacent slave processors via the Server Message Block protocol. A WAC16P4 Cluster is an efficient parallel computing facility. This WAC16P4 Cluster is tested by running large-scale water flow simulation by Lattice Boltzmann Method to achieve faster speed. The results are comparable to a small-scale simulation of previous work and the speedup is linearly proportional to the number of processors.
On composition ideals of multilinear mappings and homogeneous polynomials
Authors: Geraldo Botelho, Daniel Pellegrino, Pilar Rueda
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

Given an operator ideal I, we study the multi-ideal I ο L and the polynomial ideal I ο P). The connection with the linearizations of these mappings on projective symmetric tensor products is investigated in detail. Applications to the ideals of strictly singular and absolutely summing linear operators are obtained.