ppxscal/embedding_network huggingface dataset:
A Method for Realizing Software Architecture Design
Authors: Yujian Fu, Zhijiang Dong, Xudong He
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

A software architecture design provides a high-level abstraction of system topology, functionality, and/or behavior; which provides the basis for early system understanding and analysis as well as the foundation for subsequent detailed design and implementation. However, research on software architecture in the past decade primarily focused on architecture description languages and their analysis techniques and less progress was made on automatically realizing software architecture designs. In this paper, we present a method for automatically generating an implementation from a software architectural description. The implementation not only captures the functionality of the given architecture description, but also contains additional monitoring code for ensuring desirable behavior properties through run-time verification. Our method takes a software description written in SAM, a software architecture model integrating dual formal methods Petri nets and temporal logic, and generates Java code. More specifically, the structure of a SAM architecture description produces Arch- Java code the behavior models of components/connectors represented in Petri nets lead to plain Java code, and the property specifications defined in temporal logic generates AspectJ code; the above code segments are then integrated into Java code.
Error Correcting Codes from Modified Butson-Hadamard Matrices
Authors: Moonho Lee, Xueqin Jiang, GiYeon Hwang, Subash Shree Pokhrel
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

These codes are close to the Plotkin bound and have easy construction and decoding procedure.
Six Thousand Words about Multi-Perspective Personal Document Management
Authors: Andreas R. Dengel
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Individual user needs are subjective, perspective, and context-dependent at the same time. In this paper, I will pre-sent an adaptive multi-perspective user interface which learns the individual preferences when working with documents, i.e. the way a user categorizes documents and clusters them within direc-tories. The system is built on dynamic conceptualizations of docu-ments and folders based on term correlations providing the basis for an integrated and associative management of office docu-ments, emails and bookmarks. Users get assistance in classifica-tion and retrieval by offering a wide range of techniques which may be combined in any way. The system records successful query processes for reuse and further allows users to publish respective expert profiles learned by the system.
Compression of side information
Authors: J. Cardinal
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We consider the problem of data compression with side information at the decoder and propose novel algorithms for quantization of the side information. These methods build quantizers that minimize the rate at which the source can be encoded with a constraint on the entropy of the quantized side information. We study relationships between our methods and those of context quantization used for image and video coding, and agglomerative information bottleneck in document classification. Our algorithms are shown to perform well on simple experiments and are applicable to a wide range of distributed multimedia compression problems.
On optimal communication cost for gathering correlated data through wireless sensor networks
Authors: Junning Liu, Micah Adler, Don Towsley, Chun Zhang
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g.overall energy) used for data collection, previous works have focused on specific coding schemes, such as Slepian-Wolf Code or Explicit Entropy Code. However, the minimum communication cost under arbitrary coding/routing schemes has not yet been characterized. In this paper, we consider the problem of minimizing the total communication cost of a wireless sensor network with a single sink. We prove that the minimum communication cost can be achieved using Slepian-Wolf Code and Commodity Flow Routing when the link communication cost is a convex function of link data rate. Furthermore, we find it useful to introduce a new metric distance entropy, a generalization of entropy, to characterize the data collection limit of networked sources. When the energy consumption is proportional to the link data rate (e.g.normally in 802.11), we show that distance entropy provides a lower bound of the communication cost and can be achieved by using a specific rate SWC and shortest path routing. Theoretically, achieving optimality may require global knowledge of the data correlation structure, which may not be available in practice. Therefore, we propose a simple, hierarchical scheme that primarily exploits data correlation between local neighboring nodes. We show that for several correlation structures and topologies, the communication cost achieved by this scheme is within a constant factor of the distance entropy, i.e., it is asymptotically optimal. Finally, we simulate our algorithm using radar reffectivity data as well as traces from Gaussian Markov Fields (GMF). As the network size goes large, for the radar data, we find our algorithm saves two thirds of the communication cost compared to a non-coding approach; as for the GMF data, our algorithm converges to a constant factor (1 .5_1.8) the distance entropy.
Comparing skill-based routing call center simulations using C programming and arena models
Authors: Rodney B. Wallace, Robert M. Saltzman
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes the modeling of a skill-based routing call center using two distinct simulation programming methods: the C language and the Arena software package. After reviewing the features of this type of call center, we describe the salient components of each method in modeling the call center. The paper concludes with a comparison of the pros and cons of using each simulation programming approach in this context.
A unified framework for the scale covariant affine, hyperbolic, and power class quadratic time-frequency representations using generalized time shifts
Authors: A. Papandreou, F. Hlawatsch, G. F. Boudreauz-Bartels
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We propose a framework that unifies and extends the affine, hyperbolic, and power classes of quadratic time-frequency representations (QTFRs). These QTFR classes satisfy the scale covariance property, important in multiresolution analysis, and a generalized time-shift covariance property, important in the analysis of signals propagating through dispersive systems. We provide a general class formulation in terms of 2-D kernels, a generalized signal expansion, a list of desirable QTFR properties with kernel constraints, and a "central QTFR" generalizing the Wigner distribution and the Altes-Marinovich Q-distribution. We also propose two generalized time-shift covariant (not, in general, scale covariant) QTFR classes by applying a generalized warping to Cohen's (1966) class and to the affine class.
Formal Evaluation of an Instructional ODL Tool
Authors: Athanasis Karoulis, Ioannis Stamelos, Lefteris Angelis
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper presents the application and evaluation by means of a controlled experiment of an instructional tool during an Open and Distance Learning (ODL) course. The core issue of investigation is whether this instructional aid can support, guide and scaffold the distant student in his/her study. For this purpose, a controlled experiment was conducted with the participation of 191 undergraduate students. Descriptive statistics as well as a variety of statistical methods have been applied to the collected data, in order to test the research hypotheses. The results have shown a statistical significant difference in performance for the student group that used the tool. Finally, concerns about the application of the tool in a broader context and further research on the area are also presented.
State Space Segmentation for Acquisition of Agent Behavior
Authors: Hiroaki Ueda, Takeshi Naraki, Yo Nasu, Kenichi Takahashi, Tetsuhiro Miyahara
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

We propose a new method to categorize continuous numeric percepts for Q-learning, where percept vectors are classified into categories and Q-learning uses categories as states to acquire rules for agent behavior. In the proposed method, categories are represented by hyper-spheres. A percept vector is classified into a category that covers the vector and is the nearest from it. For efficient reinforcement learning, category merging is provided with the method, where the number of parameters to control category merging in the method is fewer than that in modified fuzzy ART. The proposed method is combined with Q-learning and it is compared with Q-learning with original and modified fuzzy ART. Experimental results show that our method learns good rules for agent behavior more effi- ciently than Q-learning with modified fuzzy ART.
Computer-human interaction issues when integrating qualitative spatial reasoning into geographic information systems
Authors: Carl P. L. Schultz, Hans W. Guesgen, Robert Amor
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

To allow the immense volume of spatial data currently available to be used effectively, people need intelligent query tools that are simple and intuitive. Standard query tools have a number of serious usability limitations, as they often rely solely on numerical approaches when dealing with spatial information. The qualitative reasoning community has addressed this issue, by providing powerful formalisms based on the way that humans deal with spatial information, however, integrating these methods into numerical systems raises a number of new Computer-Human Interaction (CHI) problems. This paper addresses three key CHI challenges when combining qualitative and numerical methods: (1) managing the subjective, ambiguous nature of qualitative terms, (2) providing a powerful, yet simple query system, and (3) effectively visualising a complex, fuzzy qualitative query solution. A qualitative GIS called TreeSap is presented, which demonstrates that, with the use of CHI principles, query tools can be both powerful and accessible to non-expert users.
On the choice of coupling in a system of coupled maps: structure implies features
Authors: I. Tyukin, C. van Leeuwen
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

The conditions of stable synchrony for asymmetrically coupled maps (CM) were analyzed. Utilizing Axlamar's lemma we derived sufficient conditions for partial pair-wise synchronization. These results allow us to derive the conditions for cluster-to-node and cluster-to-cluster synchronization. We distinguish four particular types of synchronization patterns and analyze their properties. These properties are sensitivity to disturbances and ability of the system to act as either associative memory or classifier. We identify the restrictions on the coupling parameters that determine in which of these models the system operates.
LENUS - The Hospital Content Management System
Authors: Dirk Krechel, Markus Hartbauer, Kerstin Maximini
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Optimizing the administrative processes in modem hospitals is a challenging field in medical informatics. In this paper we present LENUS an enterprise content management system specialized on medical and administrative processes in hospitals. Its is an integrated system that supports tasks like management of electronic patient files, inbound management and clinical pathways. By providing HL7 and DICOM inte$aces it can easily be integrated into existing PACS and HIS environments.
Applying a Weighting Matrix to the Hierarchical Neural Network Model for Handwritten Thai Character Recognition
Authors: Arit Thammano, Patcharawadee Poolsamran
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper proposes a new neural network approach to the off-line handwritten Thai character recognition. This new neural network is a hierarchical neural network; it employs the concept of a weighting matrix in measuring the similarity between the incoming input pattern and the reference patterns. The experiments have been conducted to recognize both slipshod and proper handwritten characters. The results demonstrate a very promising performance of the proposed approach.
Voronoi Random Fields
Authors: Takaharu Yaguchi
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

We propose a random field regarded as a generalization of Voronoi diagrams for the case where the positions of generators are distributed probabilistically. Our approach is a kind of stochastic approaches to Voronoi diagrams; however our definition is different from usual random Voronoi diagrams such as Poisson Voronoi diagrams. As numerical examples, first we discuss the case where the positions of generators are mutually independent and their marginal distributions are uniform distributions on disks. Second, we discuss the case where the distributions are given in the form of digital pictures.
Interaction Signatures and Action Templates in the ODP Computational Viewpoint
Authors: Oussama Reda, Bouabid El Ouahidi, Daniel Bourget
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

In this work we raise two small issues that we came across when aiming to formalize both Interaction Signatures and Action Templates within the ODP computational viewpoint. We discuss these two concepts and present a way to formalize them by introducing a new term to formal descriptions of Interaction Signatures. In the same spirit as other works, our aim is to address issues concerning how concepts of the ODP computational viewpoint are currently defined as we present some solutions to their formalisation. If required, our work aim to serve as a step to help improve or change the current process of formalizing the ODP computational viewpoint concepts using the UML language.
Testing During Refactoring: Adding Aspects to Legacy Systems
Authors: Michael Mortensen, Sudipto Ghosh, James M. Bieman
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Moving program code that implements cross-cutting concerns into aspects can improve the maintainability of legacy systems. This kind of refactoring, called aspectualization, can also introduce faults into a system. A test driven approach can identify these faults during the refactoring process so that they can be removed. We perform systematic testing as we aspectualize commercial VLSI CAD applications. The process of refactoring these applications revealed the kinds of faults that can arise during aspectualization, and helped us to develop techniques to reduce their occurrences.
An algebraic query model for effective and efficient retrieval of XML fragments
Authors: Sujeet Pradhan
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Finding a suitable fragment of interest in a nonschematic XML document with a simple keyword search is a complex task. To deal with this problem, this paper proposes a theoretical framework with a focus on an algebraic query model having a novel query semantics. Based on this semantics, XML fragments that look meaningful to a keyword-based query are effectively retrieved by the operations defined in the model. In contrast to earlier work, our model supports filters for restricting the size of a query result, which otherwise may contain a large number of potentially irrelevant fragments. We introduce a class of filters having a special property that enables significant reduction in query processing cost. Many practically useful filters fall in this class and hence, the proposed model can be efficiently applied to real-world XML documents. Several other issues regarding algebraic manipulation of the operations defined in our query model are also formally discussed.
Silver Bullet Speaks with Ed Felten
Authors: Gary McGraw
Venue: IEEE Security and Privacy (2006)

Featured here is an excerpt adapted from the full interview between Felten and Silver Bullet host Gary McGraw. Their conversation ranged widely, from Felten's technology predictions and his thoughts on public policy and law all the way to raising kids.
Real-Time Modelling of Distributed Component-Based Applications
Authors: Patricia Lopez, Julio L. Medina, Jose M. Drake
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

This paper presents a modular modelling methodology to formulate the timing behaviour of real-time distributed component-based applications. It allows to build real-time models of the platform resources and software components, which are reusable and independent of the applications that use them. The proposed methodology satisfies the completeness, opacity and composability properties, required to ensure that the complete real-time model of an application, able to predict its temporal behaviour by schedulability analysis or simulation, may be assembled by composition of the real-time models of its constituent parts. These real-time models present a dual descriptor/instance based nature. A class of component, independent of any application, is modelled as a parameterized class-type descriptor, which describes its inherent temporal behaviour and includes references to the real-time models of other hardware/software modules that it requires. An instance of the component in a concrete application context is modelled by an instance-type model, which is generated by assigning concrete values to the parameters and unsolved references of its corresponding descriptor. Instances are formed and combined by automatic tools to build complete analysis models for each specific real-time situation.
Implicit Blends with an Individual Blending Range Control on Every Primitive's Subsequent Blend
Authors: Pi-Chung Hsu
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

In implicit surfaces, implicit blends are important because they can be used to construct a complex surface from primitive surfaces. Among existing blends, blends with a blending range control are applied very wide because they can deform blended primitives locally after blending. However, this kind of blends usually behaves like a pure union blend Min(f1,...,fk) on non-blending regions. Hence, when they are used as a new primitive in other blends, their primitives always have similar subsequent blending surfaces with the primitives in their subsequent blends. To solve this problem, this paper proposes new implicit blends that can provide parameters to individually adjust their primitives' subsequent blending surfaces, without deforming the original blending surfaces. The proposed blends can provide parameters m_1,...,m_k, to enable their primitives f1,...,fk, to behave like Min (f_1/m_1,...,f_k/m_k) on non-blending regions and its original blending surface does not change whatever positive values m_1,...,m_k, are set. As a result, in sequential blends, the subsequent blending surfaces of f_1,...,f_k, can be adjusted respectively by varying parameters m_1,..,m_k. Furthermore, this paper also proposes a generalized method that can transform some of existing blends into a new blend with the ability stated above.
Assessment of employees' perceptions of service quality and satisfaction with e-business
Authors: Jung-Yu Lai
Venue: International Journal of Human-Computer Studies (2006)

In a competitive environment of frequent and rapid change, electronic business (e-business), whose supply, production, and logistics and distribution networks are enabled digitally, is increasingly dependent on electronic interconnections that are innovative in their functionality. Conceivably, its ability to deliver functions and services is closely associated with and helpful for the completion of employees' tasks and jobs, leading to service quality being critically important for both the employees and e-business (EB). On the other hand, since EB utilizes enterprise applications, user satisfaction, as a surrogate measure of information system (IS) or information technology (IT) effectiveness/success is also important for enterprise applications success. Thus, this research attempts to extrapolate the results of marketing research concerning customers' perceptions of service quality and IS/IT research as to employees' perceptions of service quality with EB. First, we revise the SERVQUAL instrument to fit the new context of EB and measure employees' perceived service quality with EB. Based on a survey of 161 respondents practicing mostly in seven international electronic businesses in Taiwan, a 13-item EB-SERVQUAL instrument is proposed. This can be used to improve and diagnose the service quality of EB. Second, we examine user satisfaction with enterprise applications and its causal link in relation to service quality with EB. The instrument and our findings in this paper will be valuable to researchers and practitioners interested in designing, implementing, and managing EB.
TRex - The Refactoring and Metrics Tool for TTCN-3 Test Specifications
Authors: Paul Baker, Dominic Evans, Jens Grabowski, Helmut Neukirchen, Benjamin Zeiss
Venue: Proceedings of the Testing: Academic & Industrial Conference on Practice And Research Techniques (2006)

Comprehensive testing of modern communication systems often requires large and complex test suites which then have to be maintained throughout the system life-cycle. Industrial experience, with those written in the standardised Testing and Test Control Notation (TTCN-3), has shown that this maintenance is a non-trivial task and its burden could be reduced if appropriate tool support existed. To this aim, Motorola has collaborated with the University of G¨ottingen to develop TRex, a TTCN-3 development environment published under the Eclipse Public License, which notably provides suitable metrics and refactorings to enable the assessment and automatic restructuring of test suites. In this paper we present the TRex tool, which will make it far easier to construct and maintain TTCN-3 tests that are concise and optimally balanced with respect to readability, usability, and maintainability.
Coherence analysis of multichannel time series applying conditioned multivariate autoregressive spectra
Authors: H. Vaataja, R. Suoranta, S. Rantala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Coherence analysis enables the studying of linear dependencies between multichannel time series. In the case of a multivariate autoregressive (MAR) spectrum the conventional coherence analysis can be applied. However, since we are able to decompose the MAR spectrum, there is a possibility to gain more information through coherence analysis based on conditioned spectra than with conventional methods. The authors formulate the coherence analysis based on the conditioned MAR spectra (reduced and noise conditioned spectra) by giving related definitions for partial and multiple coherences.