ppxscal/embedding_network huggingface dataset:
Research on Flexible Control on Dynamic Business Process in E-Government
Authors: Ye Xin, Niu Guangxin, Dai Zailin
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

There are abundant dynamic business processes in the field of e-government. How to achieve the flexible control of the dynamic business processes has been becoming an important research topic. Based on the analysis of the current research, an improved role network model (RNM) is presented firstly. Then, an RNM based flexible control approach of the dynamic business processes is proposed. Finally, based on the improved RNM, a modelling tool and the working procedure of the business process control engine are presented. The proposed method has been applied in some practical e-government projects. The results show that the proposed approach can embodies the stochastic and dynamic coordination of roles and has a wide application prospects.
Behavioural Reactive Agents for Video Game Opponents with Personalities
Authors: Carlos Delgado-Mata, Jesús Ibáñez-Martínez
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Nowadays, the video gaming experience is shifting from merely realistic to believable. The behaviour of the computer driven player and non-playing characters is often poor when compared to their visual appearance. In this sense, there has been a recent interest in improving the video gaming experience with novel Artificial Intelligence (AI) techniques. This paper presents a robotics inspired behavioural AI to simulate characters' personalities in a commercial video game.
A Quantum Information-Theoretic Proof of the Relation between Horn's Problem and the Littlewood-Richardson Coefficients
Authors: Matthias Christandl
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Horn's problem asks for the conditions on sets of integers μ, ¿ and ¿ that ensure the existence of Hermitian operators A, B and A + B with spectra μ, ¿ and ¿, respectively. It has been shown that this problem is equivalent to deciding whether U ¿ ¿ U μ ¿ U ¿ for irreducible representations of with highest weights μ, ¿ and ¿. In this paper we present a quantum information-theoretic proof of the relation between the two problems that is asymptotic in one direction. This result has previously been obtained by Klyachko using geometric invariant theory [1]. The work presented in this paper does not, however, touch upon the non-asymptotic equivalence between the two problems, a result that rests on the recently proven saturation conjecture for [2].
Kernels for Chemical Compounds in Biological Screening
Authors: Karol Kozak, Marta Kozak, Katarzyna Stapor
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Kernel methods are a class of algorithms for pattern analysis with a number of convenient features. This paper proposes extension of the kernel method for biological screening data including chemical compounds. Our investigation of extending kernel aims to combine properties of graphical structure and molecule descriptors. The use of such kernels allows comparison of compounds, not only on graphs but also on important molecular descriptors. Our experimental evaluation of eight different classification problems shows that a proposed special kernel, which takes into account chemical molecule structure and molecule descriptors, statistically improves significantly the classification performance.
On the Differentiable Structure of Meyer Wavelets
Authors: Carlo Cattani, Luis M. Sánchez Ruiz
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper the differential (first order) properties of Meyer wavelets are investigated.
Efficient Method of Detecting Globally Blurry or Sharp Images
Authors: Elena Tsomko, Hyoung Joong Kim
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

In this paper we present a simple and efficient methodfor detecting the blurriness in the pictures. Recently, many digital cameras are equipped with auto-focusing functions to help the users take well-focused pictures. However, digital images can be degraded by limited contrast, inappropriate exposure, imperfection of auto-focusing or motion compensating devices, limited knowledge of amateur photographers, and so on. In order to detect blurry images for deleting them or making them go through an enhancement process automatically, a reliable measure of image degradation is needed. This paper presents a blurriness/sharpness detection algorithm based on the prediction-error variance, and demonstrates its feasibility by using extensive experiments. This method is fast, easy to implement and accurate. Regardless of the detection accuracy, the proposed method in this paper is not demanding on computation time.
Evaluating Flexibility in Embedded Automotive Product Lines Using Real Options
Authors: Håkan Gustavsson, Jakob Axelsson
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Embedded automotive architectures and software need to support a large number of vehicle product lines over many years of production. This leads to a complexity and many uncertain factors when developing such systems and a need for support in the design process. An evaluation method using Real Options provides the opportunity to analyze the cost of designing for flexibility to cope with a future growth of a product line, based on the estimated value of the future functionality. In this paper Real Options is applied on a case within the automotive industry. To improve the usability an evaluation process is defined to aid engineers. This process provides a way of valuing system designs and enables the engineer to think about the future in a systematic manor. The value of a flexible design can thereby be quantified and the proposed process shows how it can be accepted by practitioners.
A novel extended local-binary-pattern operator for texture analysis
Authors: Hui Zhou, Runsheng Wang, Cheng Wang
Venue: Information Sciences: an International Journal (2008)

The local-binary-pattern (LBP) operator has been proved to be a theoretically simple yet very effective multiresolution statistical texture descriptor in terms of the characteristics of the local structure, and has been applied in many areas. However, the extension to the LBP operator based on ''uniform'' patterns still has some shortcomings: it discards some important texture information and is sensitive to noise. A novel extended LBP operator for texture analysis is proposed in this paper. The new LBP operator classifies and combines the ''nonuniform'' local patterns based on analyzing their structure and occurrence probability. The new operator fully uses the texture information contained in the ''nonuniform'' local patterns, which is discarded by the classical LBP operators, and then becomes more robust against noise. Three experiments on the Brodatz texture database show the performance improvement of this novel extended LBP operator.
Query Processing in Sensor Networks
Authors: Johannes Gehrke, Samuel Madden
Venue: IEEE Pervasive Computing (2004)

Smart sensors are small, low-cost, wireless computing devices that sense information such as light and humidity at extremely high resolutions. Smart-sensor technology has enabled a broad range of ubiquitous computing applications, such as agricultural, industrial, and environmental monitoring. Because sensors collect and transmit information while managing limited power and radio bandwidth, traditional approaches for deploying these applications requires months of design and engineering time. A smart sensor query-processing architecture using database technology can, however, facilitate deployment of sensor networks greatly reducing programming effort and time-to-deployment for many such applications. The authors describe the design and implementation of an architecture to support the building of data-collection applications using sensors. Users specify the data of interest through simple, declarative queries, just as in a database system, and the infrastructure efficiently collects and processes the data within the sensor network.
Surface-Based Vector Analysis Using Heat Equation Interpolation: A New Approach to Quantify Local Hippocampal Volume Changes
Authors: Hosung Kim, Pierre Besson, Olivier Colliot, Andrea Bernasconi, Neda Bernasconi
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Analysis of surface-based displacement vectors using spherical harmonic description (SPHARM) localizes shape changes accurately. However, it does not allow differentiating volume variations from shifting and/or bending. We propose a new approach to quantify local volume changes by computing the surface-based Jacobian determinant. This measurement is computed on the displacement vector fields estimated by a heat equation interpolation on the displacement vectors produced by SPHARM. Data simulation showed that the surface-based Jacobian determinant enables accurate quantification of local volume changes without interference of shifting/bending. In patients with temporal lobe epilepsy and left hippocampal atrophy, SPHARM detected widespread inward deformation related to atrophy in the hippocampal head and body, and showed areas of mirrored inward/outward deformations mostly at the level of the hippocampal tail. In these areas, the surface-based Jacobian determinant showed atrophy. Our method facilitates the interpretation of SPHARM because it allows decomposing volume changes and shifting/bending. Furthermore, it provides a better delineation of the extent of hippocampal atrophy.
A New Chinese Text Feature Selection Method in Centroid-Based Classifier
Authors: Yijun Gu, Rong Wang, Jianhua Wang, Jiangde Yu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Feature selection method based on text study is a mainstream method currently, whose research key lies in finding out one suitable feature assessment method, which can reduce the numbers of the words to be processed as less as possible in the situation of not decreasing classification precision, to improve the speed and the efficiency of classification. A new feature assessment method Entropy Ratio is proposed in this paper on the base of researching the classical feature assessment methods in the existing literature. This method not only considered feature classification ability, but also the feature generalization ability. It is a new and better choice to apply the centroid-based classifier to improve the effect of classification. Experimental results show that the effect obtained by using this method to select features is obviously superior to the one obtained by other methods, especially when the feature selected is less.
Structured data represented in Ruby syntax
Authors: Kazuaki Maeda
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

This paper describes Ribbon, which is a new representation written in a text-based data format using Ruby syntax. The design principle of Ribbon is good readability and simplicity to represent structured data. An important feature of Ribbon is that the representation is executable. Once Ribbon related definitions are loaded into a Ruby interpreter, the representation can be executed corresponding to the definitions. It is useful for Java programs to read/write Java objects on persistent storage, or to walk through the structured data. A program generator was developed to create Ruby and Java programs from the Ribbon definitions. In the author's experience, the productivity was improved to design and implement programs which manipulate structured data.
Using Coq to Prove Properties of the Cache Level of a Functional Video-on-Demand Server
Authors: J. Santiago Jorge, Victor M. Gulias, Laura M. Castro
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

In this paper we describe our experiences applying formal software verification in a real-world distributed Video-on-Demand server. As the application of formal methods to large systems is extremely difficult, relevant properties of a particular subsystem have been identified and then verified separately. Conclusions on the whole system can be drawn later. The development consists of two parts: first, the definition of the algorithm in the coq proof assistant; second, codification of the theorems with the help of some new tactics derived from the abstraction of verification patterns common to different proofs.
Adaptive Navigation Support for Open Corpus Hypermedia Systems
Authors: Peter Brusilovsky
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Open corpus adaptive hypermedia could be considered one of the major challenges of the adaptive hypermedia community since it can dramatically extend the range of applicability of adaptive hypermedia systems. An open corpus adaptive hypermedia system can be defined in as an "adaptive hypermedia system which operates on an open corpus of documents, e.g., a set of documents that is not known at design time and, moreover, can constantly change and expand" [6]. For the last five years open corpus adaptive hypermedia has been one of the priorities of our research group at the University of Pittsburgh. The goal of this presentation is to discuss the problems of open corpus adaptive hypermedia, review major approaches for developing adaptive navigation support for open corpus AHS system, and report our experience with some of these approaches.
Reliability Analysis on Vertical Bearing Capacity of Bored Pile Determined by CPT Test
Authors: Chun-Feng Zhao, Chao Xu, Chun-Mao Jiao
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Based on the random field theory and reliability theory, the statistical methods used in the research on the probabilistic features of parameters,P s ,f i ,P sb had been studied. In addition, the problems with the correlation distance, pile cross section dimensions and the range of pile tip resistance, which would be used in the reliability analysis, were discussed in this paper. The reliability analyses were made on seventeen (17) construction sites based on forty-six (46) CPT test curves in Shanghai area, China. The reliability indices were obtained and the probabilistic characteristics of reliability indices were derived accordingly.The study shows that: (1) generally, the reliability index of large pile in diameter is greater than that of small pile for either prefabricated pile or cast-in-place pile, and the coefficient of variation of reliability index of prefabricated pile is less than that of cast-in-place pile; and (2) For bored piles, the variation coefficient of reliability index is less for big pile in diameter (or dimensions) than that for small pile in diameter (or dimensions). ...
Impaired Haptic Size Perception Following Cortical Stroke: A Case Study
Authors: Alan M. Wing, Andrew S. Wimperis
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Accurate encoding of object size is important for the control of grasp aperture and object manipulation. When an object is grasped between index finger and thumb, size perception may be based on kinaesthetic input, indicating digit separation, and tactile input from the digit pads, signalling the moment of contact with the object. We present a case study of stroke patient JB with tactile extinction who underestimated the size of contralesional objects in simultaneous bimanual grasping and, with the passage of time, when objects were held in a contralesional unimanual grasp. We propose that extinction of tactile input from the contralesional finger pads signalling the moment of contact with grasped objects resulted in the contralesional digits being perceived to be closer together than those of the ipsilesional hand. In contrast, when objects were held in a contralesional unimanual grasp, fading tactile afferent input from the finger pads, in combination with a stable motor output and sense of effort resulted in fading perception of object size.
A Decentralized Middleware for Groupware Applications
Authors: Pablo Gotthelf, Alejandro Zunino, Marcelo Campo
Venue: Proceedings of the 13th international workshop on Groupware: Design, Implementation, and Use (2007)

Many advances have been done to allow groups of people to work together and collaborate in the Internet. Most of these advances rely on a single server or other centralized communication topologies. However, pure decentralized approaches can bring many benefits to groupware applications, such as scalability, robustness, availability and easy deployment. In this paper, a decentralized middleware for groupware applications is presented, which enables people to join and cooperate in groups in a robust and easy deployable way, without relying on a central server or requiring any other special infrastructure. Two applications, one for synchronous groupware and other for asynchronous collaboration are shown as examples of successful experiences. This groupware middleware is based on a binary tree as overlay structure, which implements all groupware communication functionality, including membership management and packet forwarding, at application level, making it suitable for the Internet. Comparisons with other approaches in aspects such as throughput, protocol overhead, resource utilization and group bandwidth, shows that this middleware is a scalable and robust communication scheme to synchronous or asynchronous groups in the Internet.
Unlinkable Communication
Authors: Volker Fusenig, Eugen Staab, Uli Sorger, Thomas Engel
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

In this paper we present a protocol for unlinkable communication, i.e. where an attacker cannot map the sender and receiver node of a communication. Existing anonymity protocols either do not guarantee unlinkability (e.g. Tor and Mix networks), or produce huge overhead -- the dining cryptographers network causes quadratic number of messages. Our protocol needs only a linear number of messages while it still guarantees unlinkability. We introduce a measure of unlinkability and show that our protocol offers the highest possible degree of unlinkability. We show how to use the protocol in practice by adapting it to internet and ad hoc communication.
CMP Cache Architecture and the OpenMP Performance
Authors: Jie Tao, Kim D. Hoàng, Wolfgang Karl
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

Chip-multiprocessor (CMP) is regarded as the next generation of microprocessor architectures. For programming such machines OpenMP, a standard shared memory model, is a challenging candidate. A question arises: How to design the CMP hardware for high performance of OpenMP applications?This work explores the answer with cache architecture as a case study. Based on a simulator, we investigate how cache organization and reconfigurability influence the parallel execution of an OpenMP program. The achieved results can direct both architecture developers to determine hardware design and the programmers to generate efficient codes.
On the Generalization of the m-Class RDP Neural Network
Authors: David A. Elizondo, Juan M. Ortiz-De-Lazcano-Lobato, Ralph Birkenhead
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The Recursive Deterministic Perceptron (RDP) feed-forward multilayer neural network is a generalisation of the single layer perceptron topology. This model is capable of solving any two-class classification problem as opposed to the single layer perceptron which can only solve classification problems dealing with linearly separable sets. For all classification problems, the construction of an RDP is done automatically and convergence is always guaranteed. A generalization of the 2-class Recursive Deterministic Perceptron (RDP) exists. This generalization allows to always separate, in a deterministic way, m-classes. It is based on a new notion of linear separability and it falls naturally from the 2 valued RDP. The methods for building 2-class RDP neural networks have been extensively tested. However, no testing has been done before on the m-class RDP method. For the first time, a study on the performance of the m-class method is presented. This study will allow the highlighting of the main advantages and disadvantages of this method by comparing the results obtained while building m-class RDP neural networks with other more classical methods such as Backpropagation and Cascade Correlation. The networks were trained and tested using the following standard benchmark classification datasets: IRIS, SOYBEAN, and Wisconsin Breast Cancer.
An Interactive Tool for the Management and Visualization of Mass-Spectrometry Proteomics Data
Authors: Mario Cannataro, Giovanni Cuda, Marco Gaspari, Pierangelo Veltri
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The paper presents a software platform for the management and visualization of mass spectrometry proteomics data. MALDI-TOF and LC-MS spectra can be visualized by considering different parameters or by focusing on portions of spectra. Spectra can also be converted using the XML-based mzData standard for storing or for transmission over the network.
Action and Agency in Norm-Governed Multi-agent Systems
Authors: Marek Sergot
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

There is growing interest in the idea that, in some cases, interactions among multiple, independently acting agents in a multi-agent system can be regulated and managed by norms (or `social laws') which, if respected, allow the agents to co-exist in a shared environment. We present a formal (modal-logical) language for describing and analysing such systems. We distinguish between system norms, which express a system designer's view of what system behaviours are deemed to be legal, permitted, desirable, and so on, and agent-specific norms which constrain and guide an individual agent's behaviours and which are supposed to be incorporated, in one way or another, in the agent's implementation. The language provides constructs for expressing properties of states and transitions in a transition system, and modalities of the kind found in logics of action/agency for expressing that an agent brings it about that, or is responsible for, its being the case that A. The novel feature is that an agent, or group of agents, brings it about that a transition has a certain property rather than bringing it about that a certain state of affairs obtains, as is usually the case. The aim of the paper is to motivate the technical development and illustrate the use of the formal language by means of a simple example in which there there are both physical and normative constraints on agents' behaviours. We discuss some relationships between system norms and agent-specific norms, and identify several different categories of non-compliant behaviour that can be expressed and analysed using the formal language. The final part of the paper presents some transcripts of output from a model-checker for the language.