ppxscal/embedding_network huggingface dataset:
RIM: framework and tool support for adaptive graphical user interface for mobile applications
Authors: Øyvind Ryan, Haakon Bryhni, Ole Smørdal
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This demonstration shows how one can build advanced web applications by embedding user interaction elements inside the graphical application using the RIM framework for image processing. This framework was developed for high-performance image processing applications, in particular web map applications. The framework is described further at the conference poster stand, and in upcoming publications. MobileHCI06 participants can try out the application for themselves at the conference.
A flexible framework for representing personality in agents
Authors: André M. C. Campos, Emanuel B. Santos, Anne M. P. Canuto, Rodrigo G. Soares, João Carlos Alchieri
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Aiming to represent individuals in a very realistic way, several works have attempted to introduce personality characteristics into artificial agents, usually based on theories of human personality. However, different theories require different structures in the agent architecture, reflecting on the way they influence agent behavior. This paper presents a flexible framework to generalize the influence of personality traits on the behavior of the agents. The framework provides an easy way to test and compare different personality models. In order to validate the framework, a simulation of working environment was developed and three personality theories (Big Five, Jung and Millon) were tested.
Emergence of attention within a neural population
Authors: Nicolas P. Rougier, Julien Vitay
Venue: Neural Networks (2006)

We present a dynamic model of attention based on the Continuum Neural Field Theory that explains attention as being an emergent property of a neural population. This model is experimentally proved to be very robust and able to track one static or moving target in the presence of very strong noise or in the presence of a lot of distractors, even more salient than the target. This attentional property is not restricted to the visual case and can be considered as a generic attentional process of any spatio-temporal continuous input.
Volumetric Model Reconstruction from Unrestricted Camera Views Based on the Photo-consistency of 3D Voxel Mask
Authors: K. K. Chiang, K. L. Chan
Venue: Machine Vision and Applications (2006)

This project aims to develop a three-dimensional (3D) model reconstruction system using images acquired from a mobile camera. It consists of four major steps: camera calibration, volumetric model reconstruction, surface modeling and texture mapping. A novel online scale factor estimation is developed to enhance the accuracy of the coplanar camera calibration. For the volumetric modeling, the voting-based shape-from-silhouette first generates a coarse model, which is then refined by the photo-consistency check using the novel 3D voxel mask. Our scheme can handle concave surface in a sophisticated way. Finally, the surface model is formed with the original images mapped. 3D models of some test objects are presented.
Certificates Verification Based on Trust Matrix in PKI
Authors: Wen Zhao, San-ping Tang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The PKI (Public Key Infrastructure) has different structures such as the tree mode, the cross-belief mode, and the hybrid mode etc. How to find out a trust path to verify the authenticity of a certificate is very important in PKI. In this paper, we have proposed a new method of verifying certificates, which is based on trust matrix to construct trust path in PKI without considering the structure of PKI. Compared with the traditional method, this method has lower computation complexity when verifying certificates and guarantees its security at the same time.
Service Oriented Architectures without Openness - A Contradiction of Terms. Reflection on the Norwegian Situation.
Authors: Tore Hoel
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Interoperability of eGovernment services is high on the agenda of the European Union. A look at the situation in Norway in the domain of learning, education and training shows that development of services are hindered by a poor understanding of the need for open and transparent processes. This paper looks into the conversational frameworks that are needed to implement the European and national goals on service oriented architectures in the educational sector. The case of the UK Australian e-Framework for Education and Research is studied to understand more of the conceptual work that underpins this kind of activities.
Grammatical Gender and Number Agreement in Spanish: An ERP Comparison
Authors: Horacio Barber, Manuel Carreiras
Venue: Journal of Cognitive Neuroscience (2005)

The role of grammatical gender and number representations in syntactic processes during reading in Spanish was studied using the event-related potentials (ERPs) technique. The electroencephalogram was recorded with a dense array of 128 electrodes while Spanish speakers read word pairs (Experiment 1) or sentences (Experiment 2) in which gender or number agreement relationships were manipulated. Disagreement in word pairs formed by a noun and an adjective (e.g., faro&ndash;alto [lighthouse&ndash;high]) produced an N400-type effect, while word pairs formed by an article and a noun (e.g., el&ndash;piano [ the-piano]) showed an additional left anterior negativity effect (LAN). Agreement violations with the same words inserted in sentences (e.g., El piano estaba viejo y desafinado [them-spiano m-swas old m-sand off-key]) resulted in a pattern of LAN&ndash;P600. This effect was found both when the violation occurred in the middle of the sentence (at the adjective), as well as when this happened at the beginning of the sentence (at the noun), but the last segment of the P600 effect was greater for the middle sentence position, which could indicate differences in the complexity of reanalysis processes. Differences between grammatical gender and number disagreement were found in late measures. In the word pairs experiment, P3 peak latency varied across conditions, being later for gender than for number disagreement. Similarly, in the sentence experiment, the last segment of the P600 effect was greater for gender than for number violations. These event-related potentials (ERPs) effects lend support to the idea that reanalysis or repair processes after grammatical disagreement detection could involve more steps in the case of gender disagreement, as grammatical gender is a feature of the lexical representation in contrast to number, which is considered a morphological feature that combines with the stem of the word.
Prediction of Timing Constraint Violation for Real-Time Embedded Systems with Known Transient Hardware Failure Distribution Model
Authors: Yue Yu, Shangping Ren, Ophir Frieder
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

We apply interval-based timing constraint satisfaction probability results to predict timing constraint violations in real-time embedded system with a known hardware transient failure model. A previous study indicated that hardware transient failures follow a Poisson distribution with an average failure arrival rate ë. Under this model, the distribution of time intervals between successive failures follows an exponential distribution with the same parameter ë. Our goal is to use the statistical transient failure models to calculate the earliest time at which we can predict, with a determined level of confidence, that a given timing constraint may be violated. This earlier prediction provides time-critical systems with valuable time before the deadline is reached to adapt themselves, and hence, to minimize possible negative impacts caused by timing constraint violations.
Web reporting with MySQL, CSS and Perl
Authors: Paul Barry
Venue: Linux Journal (2006)

Some nifty features in MySQL make Web reporting a breeze.
Reviews
Authors: Andrew Hodges, James W. Cortada
Venue: IEEE Annals of the History of Computing (2006)

The Reviews department features book reviews of A.M. Turing's The Essential Turing (edited byB. Jack Copeland) and Steven T. Usdin's Engineering Communism: How Two Americans Spied for Stalin andFounded the Soviet Silicon Valley.
Battery-aware routing for streaming data transmissions in wireless sensor networks
Authors: Chi Ma, Yuanyuan Yang
Venue: Mobile Networks and Applications (2006)

Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions. Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput. As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless networks as well.
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
Authors: Francois Fouss, Luh Yen, Alain Pirotte, Marco Saerens
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the von Neumann kernel, the regularized Laplacian kernel, the commute time kernel, and finally the Markov diffusion kernel and the cross-entropy diffusion matrix -- both introduced in this paper -- on a collaborative recommendation task involving a database. The database is viewed as a graph where elements are represented as nodes and relations as links between nodes. From this graph, seven kernels are computed, leading to a set of meaningful proximity measures between nodes, allowing to answer questions about the structure of the graph under investigation; in particular, recommend items to users. Crossvalidation results indicate that a simple nearest-neighbours rule based on the similarity measure provided by the regularized Laplacian, the Markov diffusion and the commute time kernels performs best. We therefore recommend the use of the commute time kernel for computing similarities between elements of a database, for two reasons: (1) it has a nice appealing interpretation in terms of random walks and (2) no parameter needs to be adjusted.
The delivery option in mortgage backed security valuation simulations
Authors: Scott Gregory Chastain, Jian Chen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A delivery option exists in mortgage-backed security market, which has not been considered in existing mortgage pricing simulation literature. We explain the delivery option in the "To Be Announced" trade. We discuss how the presence of the delivery option effects the use of the standard pricing simulation technique. This technique uses a risk neutral interest rate simulation with a prepayment option model to recover a price which is an expectation over the possible rate outcomes. The simulation technique uses Monte Carlo integration with a suitable selected pseudo or quasi-random sequence. To recover market prices a spread term called the "Option Adjusted Spread" is required. We see that multiple simulations are required to explore the full structure of the delivery option but suggest how to use one simulation to approximate pricing even when the delivery option is present.
Modeling and enacting business processes via commitment protocols among agents
Authors: Munindar P. Singh
Venue:  (2005)

Multiagent systems involve a rich variety of interactions among agents-situated computations that are autonomous in their behavior and heterogeneous in structure. These interactions can be realized unambiguously if they are governed by published protocols, since agents diverse in their structure and behavior can interact as long as they respect the protocols. However, traditional protocol specifications are unduly rigid for application in open settings involving autonomous entities. They represent protocols simply as an ordering of steps and stifle the participants' autonomy due to a lack of flexibility during enactment. Commitments among agents, which are akin to contractual obligations among businesses, are a powerful abstraction for modeling flexible protocols. Commitment-based design enables a more faithful model of the openness of the business world. However, modeling business interactions requires a rich variety of interaction protocols that can capture the needs of different applications. Whereas general (business) protocols might most flexibly characterize the interactions of their participants, protocols often must be refined based on the environment in which they are to be deployed, so as to yield improvements along various properties such as performance and risk outlay, when applied to real-world tasks such as in e-business. We introduce a formal semantics and an operational characterization for commitment-based protocols wherein traditional software engineering notions such as refinement and aggregation are extended to apply to protocols. We also develop a principled approach for the design of such protocols in addition to methodologies for modeling and handling exceptions in them. We demonstrate, with appropriate examples, the benefits of this approach over traditional ones when applied to business process modeling and enactment. Our chief contributions are (1) A theoretical basis for describing protocol refinement using subsumption hierarchies and an algebra for composing protocols using existing ones. (2) A methodology for modeling and handling exceptions in commitment protocols that incorporates the preferences of the protocol designer and policies of the participants and enables specification of exceptions independent of the protocol specification. (3) Two methodologies for designing commitment protocols, one by enhancing an existing agent-oriented software engineering methodology, and another by deriving protocols from agent conversations. Our work draws from and contributes to agent communication, business process modeling and enactment, service-oriented computing, and software engineering.
An Improved Trust Model in P2P
Authors: Xiaohui Ren, Kenli Li, Renfa Li, Lei Yang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Based on the Bayesian network trust model, an improved trust model is proposed in this paper. It includes two parts: one is the improved searching resource peers algorithm, which can reduce the redundancy packages received by peers and enhance the reliability of system; the other is the improved trust computing and updating method, which applies logarithm for evaluation and the number of services to compute and update the trust, so that it can prevent malicious peers from attacking normal peers efficiently, meanwhile restrain malicious peers from increasing their trust respectively by collusion in its clique. The sketch maps of trust value illustrate that the new model controls the behavior of malicious peer in P2P more efficiently.
An Adaptive Algorithm Selection Framework for Reduction Parallelization
Authors: Hao Yu, Lawrence Rauchwerger
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Irregular and dynamic memory reference patterns can cause performance variations for low level algorithms in general and for parallel algorithms in particular. In this paper, we present an adaptive algorithm selection framework which can collect and interpret the characteristics of a particular instance of parallel reduction algorithms and select the best performing one from an existing library. The framework consists of the following components: 1) an offline systematic process for characterizing the input sensitivity of parallel reduction algorithms and a method for building corresponding predictive performance models, 2) an online input characterization and algorithm selection module, and 3) a small library of parallel reduction algorithms, which represent the algorithmic choices made available at runtime. We also present one possible integration of this framework in a restructuring compiler. We validate our design experimentally and show that our framework 1) selects the most appropriate algorithms in 85 percent of the cases studied, 2) overall, delivers 98 percent of the optimal performance, 3) adaptively selects the best algorithms for dynamic phases of a running program (resulting in performance improvements otherwise not possible), and 4) adapts to the underlying machine architectures (evaluated on IBM Regatta and HP V-Class systems).
Research on Association Rules Based Group Ranking Model with Fuzzy Preference Relation Structure
Authors: Xinqiao Yu, Bo Meng, Fei Yan
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In this paper, we propose a method that takes full advantage of the characteristic that association rules can reflect the logic relationships between items in the frequent itemsets for ranking the numbered alternatives. In group ranking, the decision data are usually pairwise comparisons based on fuzzy preference relations. The concordance and discordance factors are pivotal to the quality of the solutions. And fuzzy preference relations usually can not hold the consensus in the real situation. In our method, all the preference information that is obtained by abstracting association rules from the frequent itemsets of pairwise comparisons is considered as contribution to the consistent measures of the solutions, which shows the majority rule of the collective based on statistic and makes the solutions obtained more objectively true. An example is given to show the availability, which is compared with the result of the method using the ordered weighted averaging (OWA) operator.
Reliable Routing in Wireless Ad Hoc Networks: The Virtual Routing Protocol
Authors: Luiz Carlos Albini, Antonio Caruso, Stefano Chessa, Piero Maestrini
Venue: Journal of Network and Systems Management (2006)

A novel routing protocol for wireless, mobile ad hoc networks is presented. This protocol incorporates features that enhance routing reliability, defined as the ability to provide almost 100% packet delivery rate. The protocol is based on a virtual structure, unrelated to the physical network topology, where mobile nodes are connected by virtual links and are responsible for keeping physical routes to their neighbors in the virtual structure. Routes between pairs of mobiles are set up by using information to translate virtual paths discovered in the virtual structure. Route discovery and maintenance phases of the protocol are based on unicast messages travelling across virtual paths, with sporadic use of flooding protocol. Most flooding is executed in the background using low priority messages. The routing protocol has been evaluated and compared with the Dynamic Source Routing protocol and with the Zone Routing Protocol by means of simulation.
A Geodesic Active Contour Framework for Finding Glass
Authors: Kenton McHenry, Jean Ponce
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

This paper addresses the problem of finding objects made of glass (or other transparent materials) in images. Since the appearance of glass objects depends for the most part on what lies behind them, we propose to use binary criteria ("are these two regions made of the same material?") rather than unary ones ("is this glass?") to guide the segmentation process. Concretely, we combine two complementary measures of affinity between regions made of the same material and discrepancy between regions made of different ones into a single objective function, and use the geodesic active contour framework to minimize this function over pixel labels. The proposed approach has been implemented, and qualitative and quantitative experimental results are presented.
Software Engineering Expert System for Global Development
Authors: Dick B. Simmons, Norman K. Ma
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Software project control and software process improvement both depend on the ability to measure software development status. This paper introduces the Software Engineering Expert System (SEES) tool where the software professional can gather metrics from CASE tool databases to reconstruct all activities in a software project from project initiation to project termination. SEES is Internet based and can be applied to help manage globally distributed projects.
Improved Fuzzy Neural Network Control for a Pneumatic System Based on Extended Kalman Filter
Authors: Qiang Song, Fang Liu, Raymond D. Findlay
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)

Although pneumatic systems are used in many applications such as robotics and manufacturing field, accurate control for such systems is difficult to be achieved due to their inherent nonlinear dynamics. This paper presents the favored results of fuzzy neural network (FNN) control for a pneumatic system based on extended Kalman filer (EKF). To optimally design a FNN controller for the pneumatic system, back-propagation (BP) algorithm is used to update the parameters of membership functions on-line. The partial derivative of the plant output with respect to the input, which is required by the learning process of FNN, is approximately estimated with a feed-forward neural network trained by recursive EKF. With the designed FNN controller for the pneumatic system, precise steady-state response and good dynamic tracking are obtained, which demonstrate that the nonlinear dynamics of the pneumatic system are efficiently overcome.