ppxscal/embedding_network huggingface dataset:
Weighted distances based on neighborhood sequences for point-lattices
Authors: Robin Strand
Venue: Discrete Applied Mathematics (2009)

A path-based distance is defined as the minimal cost-path between two points. One such distance function is the weighted distance based on a neighborhood sequence. It can be defined using any number of neighborhood relations and weights in conjunction with a neighborhood sequence. The neighborhood sequence restricts some steps in the path to a smaller neighborhood. We give formulas for computing the point-to-point distance and conditions for metricity for weighted distances based on neighborhood sequences with two neighborhood relations for the general case of point-lattices.
Fast approximation of trilateral filter for tone mapping using a signal processing approach
Authors: Jianbing Shen, Shiaofen Fang, Hanli Zhao, Xiaogang Jin, Hanqiu Sun
Venue: Signal Processing (2009)

In this paper, we present a novel fast approximation of the trilateral filter for high dynamic range (HDR) image tone mapping using a signal processing approach. Our fast trilateral filter-based tone-mapping algorithms are about 15-25 times faster than the existing one in Choudhury and Tumblin [The trilateral filter for high contrast images and meshes, in: Eurographics Symposium on Rendering '03, 2003, pp. 186-196]. The novel tone-mapping algorithm for HDR images is presented based on the fast approximation of the gradient bilateral filter and the down-sampling strategy of computing the titling angle image. We show the comparison results with the fast approximation of the trilateral filter using full-kernel, truncated-kernel, piecewise-kernel, separable-kernel, respectively. The proposed approach is suitable for fast HDR image tone-mapping, and the experimental results show satisfactory performancce.
Adaptive middleware supporting scalable performance for high-end network services
Authors: Byoung-Dai Lee, Jon B. Weissman, Young-Kwang Nam
Venue: Journal of Network and Computer Applications (2009)

Network service-based computation is a promising paradigm for both scientific and engineering, and enterprise computing. The network service allows users to focus on their application and obtain services when needed, simply by invoking the service across the network. In this paper, we show that an adaptive, general-purpose run-time infrastructure in support of effective resource management can be built for a wide range of high-end network services running in a single-site cluster and in a Grid. The primary components of the run-time infrastructure are: (1) dynamic performance prediction; (2) adaptive intra-site resource management; and (3) adaptive inter-site resource management. The novel aspect of our approach is that the run-time system is able to dynamically select the most appropriate performance predictor or resource management strategy over time. This capability not only improves the performance, but also makes the infrastructure reusable across different high-end services. To evaluate the effectiveness and applicability of our approach, we have transformed two different classes of high-end applications-data parallel and distributed applications-into network services using the infrastructure. The experimental results show that the network services running on the infrastructure significantly reduce the overall service times under dynamically varying circumstances.
The Obama Campaign: A Programmer's Perspective
Authors: Benjamin Boer
Venue: Queue (2009)

The Obama campaign has been praised for its innovative use of technology. What was the key to its success?
Human-robot interaction for 3D telemanipulated fracture reduction
Authors: Ralf Westphal, Simon Winkelbach, Thomas Goesling, Markus Oszwald, Tobias Huefner, Christian Krettek, Friedrich M. Wahl
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Today, femoral shaft fractures are usually stabilized by means of intramedullary nails. This video presents the development of a telemanipulator system, which, by supporting the fracture reduction process, aims at achieving reliable operation results with high reduction accuracies. First, we present a system using 2D X-ray images as base information for the surgeon to guide the reduction. We show the advantages but also the limitations of this approach, which finally led to the development of a telemanipulator system that is based on 3D imaging data instead.
A genetic algorithm estimation of the term structure of interest rates
Authors: Ricardo Gimeno, Juan M. Nave
Venue: Computational Statistics Data Analysis (2009)

The term structure of interest rates is a key instrument for financial research. It provides relevant information for pricing deterministic financial cash flows, it measures economic market expectations and it is extremely useful when assessing the effectiveness of monetary policy decisions. However, it is not directly observable and needs to be estimated by smoothing asset pricing data through statistical techniques. The most popular techniques adjust parsimonious functional forms based on bond yields to maturity. Unfortunately, these functions, which need to be optimised, are highly non-linear which make them very sensitive to the initial conditions. In this context, this paper proposes the use of genetic algorithms to find the values for the initial conditions and to reduce the risk of false convergence, showing that stable parameters are obtained without imposing arbitrary restrictions.
A simulation framework for service-oriented computing systems
Authors: Hessam Sarjoughian, Sungung Kim, Muthukumar Ramaswamy, Stephen Yau
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

An SOA-compliant DEVS (SOAD) simulation framework is proposed for modeling service-oriented computing systems. A set of novel abstract component models that conform to the SOA principles and are grounded in the DEVS formalism is developed. The approach supports construction of hierarchical composition of service models with feedback relationships. A SOAD Simulator (SOADS) is designed and implemented. An exemplar model of a basic service-oriented computing system is described. A representative experiment capturing throughput and timeliness QoS attributes for the exemplar model is devised, simulated, and described. The paper concludes with the concept of community-based development of the SOAD framework and tools.
Content-Based Tag Generation for the Grouping of Tags
Authors: K. O. Chow, K. Y. K. Fan, A. Y. K. Chan, G. T. L. Wong
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

A tagging system can encounter too few or too many tags. To solve these problems, we propose a content-based automatic generation of tags. Applied to an e-Learning 2.0 application, the proposal creates tags based on lecture slide contents, generating an adequate number of tags so as to allow the tagging system to start up effectively. It also lets student users to group tags. The tag grouping by relations yields more meaningful tag retrieval in the many tags case. This tag-based indexing of lecture slides provides better learning experience to students in studying lecture slides.
Multi-phase Urban Traffic Signal Real-time Control with Multi-objective Discrete Differential Evolution
Authors: Mingming Zhang, Shuguang Zhao, Jie Lv, Yuda Qian
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A real-time and on-line intelligent urban traffic signal control approach based on forecasting technology is proposed for the requirements of real-time traffic signal control. Considering the multiple performance indicators, the multi-phase multi-objective point-control model and line-control model are respectively constructed. By combining the characteristics of real-time urban traffic signal control, a multi-objective discrete differential evolution is introduced to solve the multi-objective optimization models. Meanwhile, a real-time traffic flow sequences generating program is designed to simulate the actual urban traffic flow which is subject to the Poisson distribution. Furthermore, a traffic signal on-line control and performance evaluation platform is developed. A set of simulations are conducted by this platform. The performance of the proposed approach is compared with that of F-B approach which is state-of-the-art. Experimental results show that the proposed approach can obtain the better traffic signal configuration and have a good real-time performance.
Research on Web Services-based Meat-production Track and Traceability System
Authors: Shougang Ren, Huanliang Xu, Guanghong Zhou
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The Web services-based meat track & traceability system is divided into three phases based on the flowing process of meat production: growing of livestock, butchering and processing of meat and marketing of finished product. Based on the contents and mode of information, it includes track and traceability within certain phase and that between phases. Tracking within a certain phase is to determine the business key points by analysis of meat production process and identify them by 1-d and 2-d mixed bar code and layer data identification method. While traceability is to embed the 1-d bar code of various business key points into the 2-d code to cover the whole production lifecycle backwardly. The track and traceability between phases is to realize the seamless connection and information sharing of physically-distributed and formally-isomerous meat product data based on the Web services technology, so that the user can operate logically on an integrated interface. On such base, an evolvable track and traceability system applicable to meat production is designed and realized.
Using visual and text features for direct marketing on multimedia messaging services domain
Authors: Sebastiano Battiato, Giovanni Maria Farinella, Giovanni Giuffrida, Catarina Sismeiro, Giuseppe Tribulato
Venue: Multimedia Tools and Applications (2009)

Traditionally, direct marketing companies have relied on pre-testing to select the best offers to send to their audience. Companies systematically dispatch the offers under consideration to a limited sample of potential buyers, rank them with respect to their performance and, based on this ranking, decide which offers to send to the wider population. Though this pre-testing process is simple and widely used, recently the industry has been under increased pressure to further optimize learning, in particular when facing severe time and learning space constraints. The main contribution of the present work is to demonstrate that direct marketing firms can exploit the information on visual content to optimize the learning phase. This paper proposes a two-phase learning strategy based on a cascade of regression methods that takes advantage of the visual and text features to improve and accelerate the learning process. Experiments in the domain of a commercial Multimedia Messaging Service (MMS) show the effectiveness of the proposed methods and a significant improvement over traditional learning techniques. The proposed approach can be used in any multimedia direct marketing domain in which offers comprise both a visual and text component.
Granular visibility queries on the GPU
Authors: Thomas Engelhardt, Carsten Dachsbacher
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Efficient visibility queries are key in many interactive rendering techniques, such as occlusion culling, level of detail determination, and perceptual rendering. The occlusion query mechanism natively supported by GPUs is carried out for batches of rendered geometry. In this paper, we present two novel ways of determining visibility by intelligently querying summed area tables and computing a variant of item buffers. This enables visibility queries of finer granularity, e.g., for sub-regions of objects and for instances created within a single draw call. Our method determines the visibility of a large number of objects simultaneously which can be used in geometry shaders to cull triangles, or to control the level of detail in geometry and pixel shaders under certain rendering scenarios. We demonstrate the benefits of our method with two different real-time rendering techniques.
Hierarchical Scheduling for Multiple Classes of Applications in Connection-Oriented Integrated-Service Networks
Authors: Shigang Chen, Klara Nahrstedt
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Multiple classes of conventional and multimedia applications are expected to be supported by the emerging connection-oriented integrated-service networks, where best-effort flows and quality-of-service (QoS) flows co-exist. We propose a novel two-level hierarchical scheduling algorithm, which provides an integrated, simple scheme to distribute the link bandwidth among a dynamic set of flows in the network, such that (1) every QoS flow always receives a bandwidth which guarantees the required quality of service and (2) after the requirements of the QoS flows are satisfied, the rest network bandwidth is fairly shared among all best-effort and soft-QoS flows. We extend our hierarchical scheduling algorithm to support both bursty and non-bursty flows. We also discuss the techniques which make the throughput of a QoS flow to be constantly lower bounded and/or upper bounded.
Real-time crowds: architecture, variety, and motion planning
Authors: Jonathan Maïm, Barbara Yersin, Daniel Thalmann
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

To simulate realistic virtual crowds in real time, three main requirements need satisfaction. First of all, quantity, i.e., the ability to simulate thousands of characters in real time. Secondly, quality, because each virtual human composing a crowd needs to look unique in its appearance and animation. Finally, realism in terms of crowd motion and navigation. In this tutorial, we explain how all objectives can be reached together. We first detail an efficient and versatile architecture able to simulate thousands of characters in real time. Then, state-of-the-art techniques to transform similar instances of a crowd into unique individuals are introduced. Finally, a hybrid motion planning approach, able to manage navigation and obstacle avoidance in real time, is presented. Overall we show that it is possible to combine these three aspects to simulate large, realistic, and visually appealing crowds in real time.
A Doctrine of Cognitive Informatics (CI)
Authors: Yingxu Wang, Witold Kinsner, James A. Anderson, Du Zhang, Yiyu Yao, Philip Sheu, Jeffrey Tsai, Witold Pedrycz, Jean-Claude Latombe, Lotfi A. Zadeh, Dilip Patel, Christine Chan
Venue: Fundamenta Informaticae (2009)

Cognitive informatics (CI) is the transdisciplinary enquiry of cognitive and information sciences that investigates into the internal information processing mechanisms and processes of the brain and natural intelligence, and their engineering applications via an interdisciplinary approach. CI develops a coherent set of fundamental theories and denotational mathematics, which form the foundation for most information and knowledge based science and engineering disciplines such as computer science, cognitive science, neuropsychology, systems science, cybernetics, software engineering, knowledge engineering, and computational intelligence. This paper reviews the central doctrine of CI and its applications. The theoretical framework of CI is described on the architecture of CI and its denotational mathematic means. A set of theories and formal models of CI is presented in order to explore the natural and computational intelligence. A wide range of applications of CI are described in the areas of cognitive computers, cognitive properties of knowledge, simulations of human cognitive behaviors, cognitive complexity of software, autonomous agent systems, and computational intelligence.
Solo instrumental music analysis using the source-filter model as a sound production model considering temporal dynamics
Authors: Mizuki Ihara, Shin-ichi Maeda, Shin Ishii
Venue: Neural Computing and Applications (2009)

A source-filter model, originally devised to represent a sound production process, has been widely used to estimate both of the source signal which includes pitch information and the synthesis filter which includes vowel information, as from sounds of a speech signal. We use this model to identify instruments by their instrumental sound signal. However, this model suffers from an indeterminacy problem. To resolve it, we employ three elements of the sound: loudness, pitch and timbre. Our assumption is that the source signal is represented by time-varying pitch and amplitude, and the synthesis filter by time-invariant line spectral frequency parameters. We construct a probabilistic model that represents our assumption with an extension of the source-filter model. For learning of model parameters, we employed an EM-like minimization algorithm of a cost function called the free energy. Reconstruction of the spectrum with the estimated source signal and synthesis filter, and instrument identification by using the model parameters of the estimated synthesis filter are performed to evaluate our approach, showing that this learning scheme could achieve simultaneous estimation of the source signal and the synthesis filter.
Algorithm computing the local b function by an approximate division algorithm in
Authors: Hiromasa Nakayama
Venue: Journal of Symbolic Computation (2009)

We give an approximate division algorithm in the ring of analytic differential operator . By using this approximate division algorithm and the Mora division algorithm for differential operator, we can compute the local b function.
Design of a Competency-Based Instrument for Measuring End-User e-Business Capability
Authors: Chui Young Yoon
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

The efficient development and management of end-user e-business capability affect user performance in an e-business environment. We designed an instrument for measuring an end-user's total e-business capability that includes measurement factors and items, a measurement system, process, and method. This instrument can be a foundation for academic research related to e-business competency and contribute to the development of the e-business competency of end-users in an e-business environment.
Proceedings of the 4th workshop on Domain-specific aspect languages
Venue: Aspect-oriented software development (2009)

It is our great pleasure to host the fourth edition of the Domain-Specific Aspect Languages workshop (DSAL09), as part of the eight International Conference on Aspect-Oriented Software Development (AOSD09). The tendency to raise the abstraction level in programming languages towards a particular domain is also a major driving force in the research domain of aspect-oriented programming languages. The DSAL workshop series aims to bring the research communities of domain-specific language engineering and domain-specific aspect design together. In the editions held at GPCE06/OOPSLA06 and AOSD07 we approached domain-specific aspect languages both from a design and a language implementation point of view. At AOSD08 we explicitly invited contributions of work on adding domain-specific extensions (DSXs) to general-purpose aspect languages (GPALs). We continue this trend for this edition as the focus on language embedding raises specific issues for language designers, such as proper symbiosis between, and composition of, DSXs. The workshop Call For Papers sought contributions related to domain-specific aspect languages, more particularly (but not limited to): design of DSALs and DSXs successful DSALs, DSXs and their applications issues in both design and implementation of DSALs and DSXs methodologies and tools suitable for creating DSALs and DSXs semantics and composition of DSALs and DSXs disciplined approaches for invasive metaprogramming error reporting in DSALs and debugging of DSALs approaches for composable language embeddings mechanisms for interaction detection and handling in DSALs theoretical foundations for DSALs analysis about the specificity spectrum in aspect languages key challenges for future work in the area This year we accepted 5 papers for presentation and publication, 3 short papers and 2 technical papers. We would like to thank all paper submitters for contributing to the work on domain-specific aspect languages, the authors of accepted papers for providing the discussion material for this year, and last but not least the program committee for their swift reviews.
Mining Weighted Negative Association Rules Based on Correlation from Infrequent Items
Authors: Yuanyuan Zhao, He Jiang, Runian Geng, Xiangjun Dong
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

The every item is set a weight because there is different importance between items. Negative association rules become a focus in the field of data mining. Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. The negative association rules often consist in the infrequent items. The negative rules mining is associated with weight, an algorithm is proposed to resolve the above problem in this paper. The experiment proves that the number of the negative association rules from the infrequent items is larger than those from the frequent.
Adaptive conceding strategies for automated trading agents in dynamic, open markets
Authors: Fenghui Ren, Minjie Zhang, Kwang Mong Sim
Venue: Decision Support Systems (2009)

One of the crucial issues of automated negotiation in multi-agent systems is how to reach an agreement when a negotiation environment becomes open and dynamic. Even though some strategies have been proposed by researchers, most of them can only work within a static negotiation environment. In this paper, we present a model for designing a strategy for agents that makes adjustable rates of concession by negotiating according to the changes of environments with uncertain and dynamic outside options. This proposal is based on the market-driven agents (MDAs) model, and is guided by four factors in order to determine the degree of concession. These factors are trading opportunity, trading competition, trading time and strategy, and eagerness. The contribution of this paper is extending the MDAs model to an open and dynamic negotiation environment by considering both the current and potential changes of the environment.