ppxscal/embedding_network huggingface dataset:
An Environment of Modeling Business Centric Monitoring and Control Applications
Authors: Mari Abe, Teruo Koyanagi, Jun-Jang (JJ) Jeng, Lianjun An
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

To succeed in today's business environment, an enterprise needs agility. Business performance monitoring and control systems have become critical in enabling enterprises to manage their business performance. In prior efforts, we have adopted model-driven development for manufacturing monitoring and control applications. This paper presents a business level modeling environment, coined as BPM authoring tool, for the environment of modeling, analyzing and developing the monitoring and control systems.
Measuring teachers' algebraic reasoning: development and preliminary validation of a video assessment task
Authors: Alan J. Hackbarth, Sharon J. Derry, Margaret J. Wilsman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

As members of the STAAR (Supporting the Transition from Arithmetic to Algebraic Thinking) IERI research team, we designed and empirically tested measures of middle school mathematics teachers' knowledge and skill in areas that have been identified by research, and established by standards, as key aspects of teaching that impact student learning. We begin by reviewing literature related to our theoretical framework. Next we describe the assessment items completed by teachers participating in the research project, describe the development process of the research team's scoring rubric, and report results from principal component analyses of responses. We found preliminary evidence that the assessment does measure important facets of pedagogical content knowledge and teachers' reflection-in-action when they are engaged in the authentic task of evaluating student performance on a mathematical task.
Mining Better Technical Trading Strategies with Genetic Algorithms
Authors: Jiarui Ni, Chengqi Zhang
Venue: Proceedings of the International Workshop on on Integrating AI and Data Mining (2006)

Technical analysis is one of the two main schools of thought in the analysis of security prices. It is widely believed and applied by many professional and amateur traders. However, it is often criticized for lacking scientific rigour or worse, for lacking any basis whatsoever. We propose to explore the feasibility and/or limitation of technical analysis by the optimization of technical trading strategies over historical stock data with genetic algorithms. This paper presents the optimization problem in detail and discusses the potential problems to be tackled during the optimization. Preliminary experiments show that it can identify the limitations quickly.
Online topological ordering
Authors: Irit Katriel, Hans L. Bodlaender
Venue: ACM Transactions on Algorithms (TALG) (2006)

It is shown that the problem of maintaining the topological order of the nodes of a directed acyclic graph while inserting m edges can be solved in O(min&lcub;m3/2logn, m3/2 &plus; n2logn&rcub;) time, an improvement over the best known result of O(mn). In addition, we analyze the complexity of the same algorithm with respect to the treewidth k of the underlying undirected graph. We show that the algorithm runs in time O(mklog2n) for general k and that it can be implemented to run in O(nlog n) time on trees, which is optimal. The algorithm also detects cycles in the input.
A new range query algorithm for universal B-trees
Authors: Tomáš Skopal, Michal Krátký, Jaroslav Pokorný, Václav Snášel
Venue: Information Systems (2006)

In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation.
JAMIOLAS: Supporting Japanese Mimicry and Onomatopoeia Learning with Sensors
Authors: Hiroaki Ogata, Chengjiu Yin, Yoneo Yano
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

This paper proposes a computer supported ubiquitous learning environment for language learning. Especially, this paper describes contextaware language-learning support system for learning Japanese mimicry and onomatopoeia (MIO) words, which is called JAMIOLAS (Japanese Mimicry and Onomatopoeia Learning Assisting System). This system provides learner the appropriate MIO expressions deriving the learner's situation and sensor data. Phidgets is used as sensors in order to get realworld data from the physical world, e.g., temperature, humidity, etc. This paper describes the implementation, the interface and usage scenario of JAMIOLAS.
Adding Usability Testing to an Agile Project
Authors: Gerard Meszaros, Janice Aston
Venue: Proceedings of the conference on AGILE 2006 (2006)

Usability testing based on paper prototypes and early versions of the software were added to the agile development process for the second application release resulting in a significant reduction of usability related rework. The paper prototype became a tangible representation of the project vision that was used in many ways that contributed to the resounding success of the project.
Interaction and Cognitive Engagement in the Community of Practice: The Contradiction of Terms?
Authors: Lina Markauskaite, Louise Sutherland, Peter Reimann
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Interaction and cognitive engagement in online discussions of weekly readings in an online community of practice are investigated. Interaction features and content of students' initial postings and subsequent replies are explored using methods of discourse analysis. It was found that students' engage differently with individual vs. collaborative knowledge building.
A Flexible Content Adaptation System Using a Rule-Based Approach
Authors: Jiang He Tong Gao Wei Hao I-Ling Yen Farokh Bastani
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Content adaptation is an important technique for mobile devices. Existing content adaptation systems have been developed with specific adaptation goals. In this paper, we present an extensible content adaptation system, Xadaptor. We take a rule-based approach to facilitate extensible, systematic, and adaptive content adaptation. It integrates adaptation mechanisms for various content types and organizes them into the rule base. Rules are invoked based on the individual client information. We classify HTML page objects into structure, content, and pointer objects. Existing content adaptation techniques mainly focus on content objects and do not consider adaptation for structure and pointer objects. In Xadaptor, novel adaptation techniques for the structure object HTML table have been developed. We use fuzzy logic to model the adaptation quality and guide the adaptation decision. To demonstrate the feasibility of our approach, we have implemented a prototype system. Experimental studies show that Xadaptor is capable of on-the-fly content adaptation and is easily extensible.
Mesostructure from Specularity
Authors: Tongbo Chen, Michael Goesele, Hans-Peter Seidel
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We describe a simple and robust method for surface mesostructure acquisition. Our method builds on the observation that specular reflection is a reliable visual cue for surface mesostructure perception. In contrast to most photometric stereo methods, which take specularities as outliers and discard them, we propose a progressive acquisition system that captures a dense specularity field as the only information for mesostructure reconstruction. Our method can efficiently recover surfaces with fine-scale geometric details from complex real-world objects with a wide variety of reflection properties, including translucent, low albedo, and highly specular objects. We show results for a variety of objects including human skin, dried apricot, orange, jelly candy, black leather and dark chocolate.
Managing social influences through argumentation-based negotiation
Authors: Nishan C. Karunatillake, Nicholas R. Jennings, Iyad Rahwan, Sarvapali D. Ramchurn
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Social influences play an important part in the actions that an individual agent may perform within a multi-agent society. However, the incomplete knowledge and the diverse and conflicting influences present within such societies, may stop an agent from abiding by all its social influences. This may, in turn, lead to conflicts that the agents need to identify, manage, and resolve in order for the society to behave in a coherent manner. To this end, we present an empirical study of an argumentation-based negotiation (ABN) approach that allows the agents to detect such conflicts, and then manage and resolve them through the use of argumentative dialogues. To test our theory, we map our ABN model to a multi-agent task allocation scenario. Our results show that using an argumentation approach allows agents to both efficiently and effectively manage their social influences even under high degrees of incompleteness. Finally, we show that allowing agents to argue and resolve such conflicts early in the negotiation encounter increases their efficiency in managing social influences.
Dynamic Visualization and Navigation of Semantic Virtual Environments
Authors: Katja Einsfeld, S. Agne, M. Deller, A. Ebert, B. Klein, C. Reuschling
Venue: Proceedings of the conference on Information Visualization (2006)

Although Information Visualization claims to provide the means to induce mental models of any kind of data, the visualization of semantic information is still an open field of research. Existing approaches either concentrate on the visualization of documents without additional metadata or produce unintuitive expert graphics. This paper seeks to fill this gap by presenting a semantic information visualization system with a dynamic 3D interface and intuitive metaphors. The application called DocuWorld visualizes documents, document meta-data, and semantic relations between documents. The general visualization and navigation metaphor called ThoughtWizard Metaphor allows user- and context-sensitive adaption of visualization modes and visualization environments.
Liberating the Subgradient Optimality Conditions from Constraint Qualifications
Authors: V. Jeyakumar, Z. Y. Wu, G. M. Lee, N. Dinh
Venue: Journal of Global Optimization (2006)

In convex optimization the significance of constraint qualifications is evidenced by the simple duality theory, and the elegant subgradient optimality conditions which completely characterize a minimizer. However, the constraint qualifications do not always hold even for finite dimensional optimization problems and frequently fail for infinite dimensional problems. In the present work we take a broader view of the subgradient optimality conditions by allowing them to depend on a sequence of ¿-subgradients at a minimizer and then by letting them to hold in the limit. Liberating the optimality conditions in this way permits us to obtain a complete characterization of optimality without a constraint qualification. As an easy consequence of these results we obtain optimality conditions for conic convex optimization problems without a constraint qualification. We derive these conditions by applying a powerful combination of conjugate analysis and ¿-subdifferential calculus. Numerical examples are discussed to illustrate the significance of the sequential conditions.
On two classes of partial stability problems
Authors: V. I. Vorotnikov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

For nonlinear nonautonomous systems of ordinary differential equations, we consider two basic classes of partial stability problems: (i) problems of stability with respect to part variables of the zero equilibrium position (Lyapunov - Rumyantsev partial stability problems); and (ii) problems of stability of partial equilibrium positions. The corresponding definitions of stability are unified so that the solvability conditions for these two classes of problems are identical in the context of the Lyapunov function method. We present a number of such common stability conditions. Also we consider problem of stability with respect to part variables of partial equilibrium positions. The results are illustrated by examples.
Service Level Negotiation in Autonomous Systems Management
Authors: Nader MBAREK, Francine KRIEF
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

We propose a framework for service level negotiation in autonomous systems management. The negotiation process occurs between high-level autonomic managers to guarantee an end-to-end service level for specific application traSJ?c jlows. In the proposed framework, we provide autonomous systems with a new interaction opportunity thanks to the negotiation with their peers. To be in conformance with self-aware management systems, the proposed negotiation protocol called SLNP is used in a Web services environment.
Metasynthetic Decision Support System for Water Resource Management
Authors: Yongjin Zhang, Yiming Su, Wei Zhou, Jiancang Xie
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Developing Water Resource Management Decision Support System is generally complex task. The most important gap between theories and practice has not been processed. In this paper, the authors propose Water Resource Management DSS based on Metasynthetic Wisdom (WRM-MDSS), which is based on the understanding of that the DSS of water resource management is an Open Complex Giant System and Knowledge Visualization. With the applying of metasynthetic wisdom theory, WRM-MDSS is built as a technology way to implement the theory of metasynthetic wisdom.
Testing for Dual Brain Processing Routes in Reading: A Direct Contrast of Chinese Character and Pinyin Reading Using fMRI
Authors: Yiping Chen, Shimin Fu, Susan D. Iversen, Steve M. Smith, Paul M. Matthews
Venue: Journal of Cognitive Neuroscience (2002)

Chinese offers a unique tool for testing the effects of word form on language processing during reading. The processes of letter-mediated grapheme-to-phoneme translation and phonemic assembly (assembled phonology) critical for reading and spelling in any alphabetic orthography are largely absent when reading nonalphabetic Chinese characters. In contrast, script-to-sound translation based on the script as a whole (addressed phonology) is absent when reading the Chinese alphabetic sound symbols known as pinyin, for which the script-to-sound translation is based exclusively on assembled phonology. The present study aims to contrast patterns of brain activity associated with the different cognitive mechanisms needed for reading the two scripts. fMRI was used with a block design involving a phonological and lexical task in which subjects were asked to decide whether visually presented, paired Chinese characters or pinyin "sounded like" a word. Results demonstrate that reading Chinese characters and pinyin activate a common brain network including the inferior frontal, middle, and inferior temporal gyri, the inferior and superior parietal lobules, and the extrastriate areas. However, some regions show relatively greater activation for either pinyin or Chinese reading. Reading pinyin led to a greater activation in the inferior parietal cortex bilaterally, the precuneus, and the anterior middle temporal gyrus. In contrast, activation in the left fusiform gyrus, the bilateral cuneus, the posterior middle temporal, the right inferior frontal gyrus, and the bilateral superior frontal gyrus were greater for nonalphabetic Chinese reading. We conclude that both alphabetic and nonalphabetic scripts activate a common brain network for reading. Overall, there are no differences in terms of hemispheric specialization between alphabetic and nonalphabetic scripts. However, differences in language surface form appear to determine relative activation in other regions. Some of these regions (e.g., the inferior parietal cortex for pinyin and fusiform gyrus for Chinese characters) are candidate regions for specialized processes associated with reading via predominantly assembled (pinyin) or addressed (Chinese character) procedures.
Software Multiplication Using Gaussian Normal Bases
Authors: Ricardo Dahab Darrel Hankerson Fei Hu
Venue: IEEE Transactions on Computers (2006)

Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields {\hbox{\rlap{I}\kern 2.0pt{\hbox{F}}}}_{2^m}. In this paper, we present new software algorithms for efficient multiplication over {\hbox{\rlap{I}\kern 2.0pt{\hbox{F}}}}_{2^m} that use a Gaussian normal basis representation. Two approaches are presented, direct normal basis multiplication and a method that exploits a mapping to a ring where fast polynomial-based techniques can be employed. Our analysis, including experimental results on an Intel Pentium family processor, shows that the new algorithms are faster and can use memory more efficiently than previous methods. Despite significant improvements, we conclude that the penalty in multiplication is still sufficiently large to discourage the use of normal bases in software implementations of elliptic curve systems.
Perceptual weighting filter for robust speech modification
Authors: Joon-Hyuk Chang
Venue: Signal Processing (2006)

In this paper, an improved preprocessor for low-bit-rate speech coding employing the perceptual weighting filter is proposed. Speech modification in the proposed approach is performed according to a criterion which makes a compromise between the modification and perceptual weighted quantization errors. For this, the perceptual weighting filter is expressed in terms of a transform domain matrix. The proposed approach is effective in enhancing the speech signal at coder-decoder (CODEC) output through a number of listening tests.
An Adaptive System for Improved Identification and Removal of Noise from Single Trial EEG/MEG via Model Order Estimation in ICA
Authors: Carl S. Leichter
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

An adaptive model order estimation method for Independent Component Analysis (ICA) in EEG/MEG data is presented. This technique seeks to extract the minimum number of components necessary for effective Blind Source Separation (BSS). Experimental results using synthesized noisy MEG data demonstrate the utility of this technique. Model order estimation is used in the extraction of baseline noise components which will serve as templates for subsequent identification and removal of noise. These templates are used to remove noise from a data set containing a somatosensory evoked response (SSR) potential; model order estimation was also used to decompose the SSR data set.
Improving Awareness in Mobile CSCW
Authors: Constantinos Papadopoulos
Venue: IEEE Transactions on Mobile Computing (2006)

The diffusion of mobile devices in the working landscape is promoting collaboration across time and space. Following through this development, we investigate opportunities for improving awareness in mobile environments with a view to enable collaboration under power constraints and transitory network disconnections. We elaborate in particular on synchronous CSCW and expose with it significant details of group awareness, while we contribute a protocol for awareness support over large areas that strikes a balance between energy consumption and notification time. To avoid user disruption, this protocol notifies awareness information in a multicast fashion, while the bandwidth is allocated dynamically among notifications and data requests, thus minimizing the time needed by each one of them and ensuring the isochronous delivery of information to all clients. The efficiency and scalability of our protocol are evaluated with simulation experiments, whereby we compare various notification schemes and finally choose one that changes dynamically over time.
Design and Implementation of Chronological Web Server for Web-Based Applications
Authors: Shann-Chiuen Wu, Tzao-Lin Lee
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

This paper designs and implements a chronological web server based on Apache HTTP Server to provide a platform for chronological web application development. This platform is inspired by versioning file system and temporal database but support totally different functions. Chronological web server with script-capability is a platform on which a web programmer can easily develop web applications that support reference timeline setting and chronological caching. Not only static files, this platform stores all versions of script embedded pages and provides script parsing and interpreting. Once a user sets up his reference timeline, he will be capable of going through back-tothe- past experience. Furthermore, we can also configure our web application to distinguish users from different timelines so that various operating styles and authorization rules for different timelines can be implemented effortlessly.
A relation between choosability and uniquely list colorability
Authors: Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad
Venue: Journal of Combinatorial Theory Series B (2006)

Let G be a graph with n vertices and m edges and assume that f:V(G) → N is a function with Σv∈V(G) f(v) = m + n. We show that, if we can assign to any vertex v of G a list Lv of size f(v) such that G has a unique vertex coloring with these lists, then G is f-choosable. This implies that, if Σv∈V(G) f(v) > m + n, then there is no list assignment L such that |Lv| = f(v) for any v ∈ V(G) and G is uniquely L-colorable. Finally, we prove that if G is a connected non-regular multigraph with a list assignment L of edges such that for each edge e = uv, |Le| = max {d(u),d(v)}, then G is not uniquely L-colorable and we conjecture that this result holds for any graph.
Oracles for bounded-length shortest paths in planar graphs
Authors: Lukasz Kowalik, Maciej Kurowski
Venue: ACM Transactions on Algorithms (TALG) (2006)

We present a new approach for answering short path queries in planar graphs. For any fixed constant k and a given unweighted planar graph G &equals; (V, E), one can build in O(&verbar;V&verbar;) time a data structure, which allows to check in O(1) time whether two given vertices are at distance at most k in G and if so a shortest path between them is returned. Graph G can be undirected as well as directed.Our data structure works in fully dynamic environment. It can be updated in O(1) time after removing an edge or a vertex while updating after an edge insertion takes polylogarithmic amortized time. Besides deleting elements one can also disable ones for some time. It is motivated by a practical situation where nodes or links of a network may be temporarily out of service.Our results can be easily generalized to other wide classes of graphs---for instance we can take any minor-closed family of graphs.