ppxscal/embedding_network huggingface dataset:
A Modeling Framework for Service-Oriented Architecture
Authors: Tao Zhang, Shi Ying, Sheng Cao, Xiangyang Jia
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

As a new type of software architecture, Service- Oriented Architecture (SOA) provides a blueprint to solve software reuse and enterprise system integration issues. With the emergence and the rapid development of Web Services technologies, SOA has been paid an increasing attention and gained a wide application. For the purpose of supporting service-oriented system development, SOA should be described at a high level of abstraction regardless of techniques involved in the application employment. In the context of the Supply- Chain Management System (SCMS), this paper puts forward a modeling framework for SOA, which regards service component as a first-class modeling entity. In virtue of the meta-modeling techniques, the meta-model of the SCMS is given to promise the interoperation between different systems. Furthermore, architecture specification in SCMS is given and we refine the model to manifest the practicability of our approach.
Cell Phones in the L2 Classroom: Thumbs up to SMS
Authors: Robert C. Meurant
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Virtual learning communities are radically redefining the traditional SLA classroom, where computer-mediated language learning is becoming significant, with increased use being made of wireless networked mobile computers to facilitate internetbased language learning. Meanwhile, cell phones are becoming ubiquitous, with students presuming their right to personal use during class, frustrating teachers who regard this as disruptive. This review considers their intentional use in class, to provide ubiquitous computer-mediated SLA. Research reviewed provides a general orientation and conceptual framework, and identifies their relevance to task-based learning, potential for distributed practice, and suitability for encouraging classroom interactivity. An important application to cell phone usage in the L2 classroom is capturing SMS into a database that is displayed on a message board. Teachers can use computers to send SMS to students, with particular advantages for administrative purposes. The challenge is to ensure permitting cell phone use in class does not open a Pandora's box.
Increasing broadcast reliability in vehicular ad hoc networks
Authors: Nathan Balon, Jinhua Guo
Venue: Proceedings of the 3rd international workshop on Vehicular ad hoc networks (2006)

Broadcast transmissions are the predominate form of network traffic in a VANET. However, since there is no MAC-layer recovery on broadcast frames within an 802.11-based VANET, the reception rates of broadcast messages can become very low, especially under saturated conditions. In this paper, we present an adaptive broadcast protocol that improves the reception rates of broadcast messages. We rely on the observation that a node in a VANET is able to detect network congestion by simply analyzing the sequence numbers of packets it has recently received. Based on the percentage of packets that are successfully received in the last few seconds, a node is able to dynamically adjust the contention window size and thus improve performance.
System dyanmics approach for error and change management in concurrent design and construction
Authors: SangHyun Lee, Feniosky Peña-Mora
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Errors and changes, particularly in concurrent design and construction, require a careful approach to their management, since they can generate unanticipated impacts on construction performance, which is often related to softer aspects of management (e.g., fatigue). Focusing on this issue, this paper explores the use of system dynamics in identifying multiple feedback processes and softer aspects of managing errors and changes. Applying the developed model into the design-build highway project in Massachusetts, this paper concludes that the system dynamics approach can be an effective tool in the understanding of complex and dynamic construction processes and in supporting the decision making process of making appropriate policies to improve construction performance.
Revisiting Content-Based Publish/Subscribe
Authors: Costin Raiciu, David S. Rosenblum, Mark Handley
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Publish-subscribe is a powerful paradigm for distributed communication based on decoupled producers and consumers of information. Its event-driven nature makes it very appealing for large-scale data dissemination infrastructures. Various architectures were proposed in recent years that provide very diverse features. However, there are few well-defined metrics in the publish-subscribe area that would allow their evaluation and comparison. In this paper, we provide a broad overview of relevant quality-of-service metrics and describe their specific meaning in the context of distributed and decentralized publish-subscribe systems. Our goal is to provide a common base for future evaluations of emerging systems and for the design of qualityof- service aware publish-subscribe infrastructures.
Security framework for supervisory control and data acquisition (scada)
Authors: Duminda Wijesekera, Francesco Parisi-Presicce
Venue:  (2006)

Supervisory Control and Data Acquisition (SCADA) allows a utility operator to monitor and control local or remote instruments such as motors, valves, pumps, relays, and others. Traditionally, network and security community in the utilities have focused virtually most of their attention on the "enterprise network", generally ignoring the other part of the network associated with the supervisory control and data acquisition system believing that the SCADA systems reside physically on a separate, standalone network. In addition, the utilities adopted and deployed more open technologies and SCADA systems are becoming increasingly reliant on public communication systems and connected to other networks. Governments and industry organizations have recognized that the SCADA systems are becoming more vulnerable and a potential target of attack from sophisticated terrorists, malicious attacks, cyber assaults, inside assaults, and others who want to disrupt the critical infrastructure. Accordingly, the SCADA decision makers started to give more attention to SCADA and to take corrective actions to tighten up their security components and protect their assets from such attacks by the use of new security measures. In this dissertation I recommend a new Distributed Network Protocol Version 3 Security (DNPSec) framework to enable confidentiality, integrity, and authenticity placed directly in the DNP3. Such a framework requires some modifications in the data structure of the DNP3 Data Link layer. My main goal is to address the threats related to confidentiality, integrity, and authenticity in the DNP3 as part of SCADA architecture, with a minimum performance impact on the communication link; and without requiring modification to the much more expensive Master Station and Substation devices and the applications supporting them. Also, and as part of this dissertation, I develop a proof of concept for the DNPSec framework by conducting simulation studies to measure the performance impact by adding DNPSec functionality on the communication links and end nodes. One other recommendation in my dissertation is to enable authorization services by the usage of the Role-Based Access Control (RBAC) model to define the users' security roles, permissions, authorization, and role hierarchy as one measure to access the SCADA system. Achieving the desired level of authorization and access control will involve integrating the security system with SCADA operations and building role based access control capabilities in the application level.
Measuring length of business cycles across countries using a new non-stationary unit-root cyclical approach: Research Articles
Authors: L. A. Gil-Alana
Venue: Applied Stochastic Models in Business and Industry (2006)

This article examines the length of the cycles in the gross domestic product (GDP) real per capita series of 15 countries by means of new statistical techniques based on unit root cycles. We propose tests for unit root cycles at each of the frequencies of the process. Using this approach, we are able to approximate the number of periods per cycle. The results show that the cycles have a periodicity of approximately six years when the disturbances are white noise. However, if we permit autocorrelation, they may also occur at smaller intervals of time. Copyright &copy; 2006 John Wiley & Sons, Ltd.
A Support Tool for XML Schema Matching and Its Implementation
Authors: Toshiaki Okawara, Jun'ichi Tanaka, Atsuyuki Morishima, Shigeo Sugimoto
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We are developing a software tool to support schema matching for data transformations. Schema matching is the process of finding relationships between components of two given database schemas. The tool is unique in that it first extracts conceptual schemas from the two database schemas and allows the user to use the extracted conceptual schemas as clues to perform schema matching. This paper overviews the tool and explains its implementation.
An Improved Query Plan in Data Stream
Authors: Lin Jinxian, Zheng Zhanping
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Analyzing the performances and correlations of the query operations in data stream, we propose a core algorithm called CSOQP, which can strongly improve the stream query plan.
Pointwise convergence of Fourier regularization for smoothing data
Authors: Daniela De Canditiis, Italia De Feis
Venue: Journal of Computational and Applied Mathematics (2006)

The classical smoothing data problem is analyzed in a Sobolev space under the assumption of white noise. A Fourier series method based on regularization endowed with generalized cross validation is considered to approximate the unknown function. This approximation is globally optimal, i.e., the mean integrated squared error reaches the optimal rate in the minimax sense. In this paper the pointwise convergence property is studied. Specifically, it is proved that the smoothed solution is locally convergent but not locally optimal. Examples of functions for which the approximation is subefficient are given. It is shown that optimality and superefficiency are possible when restricting to more regular subspaces of the Sobolev space.
A Multi-agent Based Method for Reconstructing Buckets in Encrypted Databases
Authors: Yi Tang, Jun Yun, Quan Zhou
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Outsourcing databases to third parties demonstrates a trend for many enterprise users. A bucket-based storage method is proposed for this emerging scenario. However, the introduction of buckets brings out challenges in balancing query efficiency and data secrecy. By measuring the query efficiency on false hits and the data secrecy on entropy amounts, an optimization problem is formalized to find a set of buckets on a tradeoff between efficiency and secrecy. We propose a multi-agent based method to find an approximate solution to this problem. In our solving, each agent manages a bucket and always tries to decrease the number of false hits by moving out a managed element on local evaluations. These local behaviors are aggregated as a global trend to find a set of buckets with fewer false hits. We validate this method by conducting simulated experiments on range queries.
Maximum likelihood identification of multiscale stochastic models using the wavelet transform and the EM algorithm
Authors: V. V. Digalakis, K. C. Chou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors address the problem of estimating the parameters of a class of multiscale stochastic processes that can be modeled by state-space dynamic systems driven by white noise in scale rather than in time. They present a maximum likelihood identification method for estimating the parameters of the multiscale stochastic models given data which are based on the wavelet transform and the expectation-maximization algorithm. Numerical examples are provided for identifying the parameters of the state-space models based on synthesized data to demonstrate the accuracy and the efficiency of the algorithm. In the examples the effects of performing system identification are illustrated based on data at both multiple and single scales. The single-scale case can be viewed as the standard problem of fitting model parameters to data, where here the model is not standard.
Toward a Topological Characterization of Asynchronous Complexity
Authors: Gunnar Hoest, Nir Shavit
Venue: SIAM Journal on Computing (2006)

This paper introduces the use of topological models and methods, formerly used to analyze computability, as tools for the quantification and classification of asynchronous complexity. We present the first asynchronous complexity theorem, applied to decision tasks in the iterated immediate snapshot (IIS) model of Borowsky and Gafni. We do so by introducing a novel form of topological tool called the nonuniform chromatic subdivision. Building on the framework of Herlihy and Shavit&apos;s topological computability model, our theorem states that the time complexity of any asynchronous algorithm is directly proportional to the level of nonuniform chromatic subdivisions necessary to allow a simplicial map from a task&apos;s input complex to its output complex. To show the power of our theorem, we use it to derive a new tight bound on the time to achieve n process approximate agreement in the IIS model: $\bigl\lceil \log_d \frac{\max\_input - \min\_input}{\epsilon} \bigr\rceil$, where d = 3 for two processes and d = 2 for three or more. This closes an intriguing gap between the known upper and lower bounds implied by the work of Aspnes and Herlihy. More than the new bounds themselves, the importance of our asynchronous complexity theorem is that the algorithms and lower bounds it allows us to derive are intuitive and simple, with topological proofs that require no mention of concurrency at all.
The component structure of a self-adapting numerical software system
Authors: Victor Eijkhout, Erika Fuentes, Thomas Eidson, Jack Dongarra
Venue: International Journal of Parallel Programming (2005)

Self-Adapting Numerical Software (SANS) systems aim to automate some of the laborious human decision making involved in adapting numerical algorithms to problem data, network conditions, and computational platform. In this paper we describe the structure of a SANS system that tackles automatic algorithm choice, based on dynamic inspection of the problem data. We describe the various components of such a system, and their interfaces.
SPECT Image data compression using optimal sampling schedule
Authors: Zhijuan Guo
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

In this paper, a time-domain image data compression approach is proposed which can be used to reduce the number of image frames required in tracer dynamic studies with single photon emission computed tomography (SPECT). This image data compression approach is based on an optimal sampling schedule (OSS) design technique which incorporates the characteristics of SPECT measurement and uses a new cost function and the D-optimal criterion. It can be used in obtaining measurements by a process of accumulation over a sequence of sampling intervals. A case study of the estimation of the binding potential (BP) using the tracer Iododexetimide(IDEX) and the three-parameter simplified reference tissue model is presented. Experimental results illustrate the proposed approach can not only greatly reduce the storage space and processing time but also maintain the precision of the parameter estimation.
Autonomous Mobile Programs
Authors: Xiao Yan Deng, Phil Trinder, Greg Michaelson
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

To manage load on large and dynamic networks we propose Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute in the network. Unusually this form of autonomous mobility affects only where the program executes and not what it does. We present a generic AMP cost model, together with a validated instantiation and comparative performance results for two AMPs. Experiments on a homogeneous network show that collections of AMPs quickly obtain and maintain optimal or near-optimal balance. The advantages of our decentralised approach are scalability to very large and dynamic networks, improved balance, and guaranteed maximum overhead. The disadvantages are higher overheads and the necessity of both a cost model and explicit mobility control.
A study of the CT scan area of a healthcare provider
Authors: Sreekanth Ramakrishnan, Kaustubh Nagarkar, Monice DeGennaro, Krishnaswami Srihari, Andrea K. Courtney, Frank Emick
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Ancillary departments, which include radiology services, are among the important factors that affect the efficiency of patient care in a hospital. This paper presents results from a collaborative research effort with a healthcare provider that is in the process of implementing a digital image archiving system within its radiology services. The objective of this study was to identify the changes to the existing workflow at the CT Scan area with the implementation of the digitized archiving system to maximize patient throughput and minimize report generation time. Process mapping was used to identify the initial flow of operations. A simulation model was then built to evaluate the different what-if scenarios that were expected to 'optimize' the aforementioned response variables. Several key suggestions were also presented and validated using simulation. These include increasing the number of reading radiologists, re-allocation of CT Scan machine resources and the addition of a patient holding area.
Real time scheduling with a budget: parametric-search is better than binary search
Authors: Asaf Levin
Venue: Information Processing Letters (2006)

We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a feasible subset S of the jobs on a single machine such that the total weight of S is maximized, and the total cost of S is within a given budget. Using Megiddo's parametric method we improve an earlier algorithm that is based on applying binary search.
Structured Markov chains solver: software tools
Authors: D. A. Bini, B. Meini, S. Steffé, B. Van Houdt
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

The package SMC-Solver for solving structured Markov chains is presented. It contains the most advanced algorithms for solving QBD, M/G/1 and G/M/1 problems. The package is provided in two versions: a Matlab toolbox and a Fortran 95 version with a user-friendly graphical interface.
A New Information Exchange Model Based on the Multi-agent
Authors: Xing-kai Yang, Yan-zhang Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The integration of E-government information resources becomes more and more hot issue today. This paper presents a new information exchange multi-agent model. In this model each data exchange node serves as a basic organization which can send and receive information automatically and store the information. Multi-agents cooperate to realize the exchange and the integration of the information. Finally, we put this model into city of Dalian enterprise basic data sharing testing project, and analyze this model performance.
Training Deformable Models for Localization
Authors: Deva Ramanan, Cristian Sminchisescu
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We present a new method for training deformable models. Assume that we have training images where part locations have been labeled. Typically, one fits a model by maximizing the likelihood of the part labels. Alternatively, one could fit a model such that, when the model is run on the training images, it finds the parts. We do this by maximizing the conditional likelihood of the training data. We formulate model-learning as parameter estimation in a conditional random field (CRF). Initializing parameters with their maximum likelihood estimates, we reach the global optimum by gradient ascent. We present a learning algorithm that searches exhaustively over all part locations in an image without relying on feature detectors. This provides millions of examples of training data, and seems to avoid over-fitting issues known with CRFs. Results for part localization are relatively scarce in the community. We present results on three established datasets; Caltech motorbikes [8], USC people [19], and Weizmann horses [3]. In the Caltech set we significantly outperform the state-of-the-art [6]. For the challenging people dataset, we present results that are comparable to [19], but are obtained using a significantly more generic model (devoid of a face or skin detector). Our model is general enough to find other articulated objects; we use it to recover poses of horses in the challenging Weizmann database.
The Application of Successive Quadratic Programming Algorithm to Multiuser Detection in CDMA
Authors: Xuewen Mu, Sanyang Liu, Hongwei Liu
Venue: Wireless Personal Communications: An International Journal (2006)

In this paper, based on the semidefinite programming relaxation of the CDMA maximum likelihood (ML) multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, we obtain the suboptimal solution of multiuser detection problem. Comparing with the reported interior point methods based on semidefinite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.
Design and Implementation of High Performance SMART for HD Video On Demand
Authors: Yuhyeon Bak, Kapdong Kim, Youngju Lee, Songwoo Sok, Changsoo Kim, Hagyoung Kim, Myung-Joon Kim, Kyongsok Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The SMART(Server for Multimedia Applications for Residence communiTy) system is a special-purpose server developed by ETRI (Electronics and Telecommunications Research Institute) which is designed for efficient streaming service over high speed networks. The server has maximum four 2-Gbps network cards and each of those network cards have some disks which store multimedia contents and can be accessed only through the specific network card. In this paper, we are proposing an efficient system including hardware and software in terms of the design concept and system architecture for the multimedia streaming service. We also present the implementation result for the system and performance comparison with other systems. Performance of our system is better than other systems. Specially, our system can do streaming service to more users and CPU overhead is less than other systems.