ppxscal/embedding_network huggingface dataset:
An Examination of Qubit Neural Network in Controlling an Inverted Pendulum
Authors: Noriaki Kouda, Nobuyuki Matsui, Haruhiko Nishimura, Ferdinand Peper
Venue: Neural Processing Letters (2005)

The Qubit neuron model is a new non-standard computing scheme that has been found by simulations to have efficient processing abilities. In this paper we investigate the usefulness of the model for a non linear kinetic control application of an inverted pendulum on a cart. Simulations show that a neural network based on Qubit neurons would swing up and stabilize the pendulum, yet it also requires a shorter range over which the cart moves as compared to a conventional neural network model.
Self-Adaptive Component-based transaction Commit Management
Authors: Patricia Serrano-Alvarado, Romain Rouvoy, Philippe Merle
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

Traditionally, when implementing a transaction service, a protocol is chosen and it remains the same during the system execution. Nevertheless, the dynamic nature of nowadays application contexts (e.g., mobile, ad-hoc, peer-to-peer) and behaviour variations (semantic-related aspects) motivates the needs for application adaptation. Next generation of system applications should be adaptive or even better self-adaptive. This paper proposes (1) a component-based architecture of standard 2PC-based protocols and (2) a self-Adaptive Component-based cOmmit Management, named ACOM. Self-adaptation is obtained by behaviour awareness and component-based reconfiguration. This allows ACOM to select the most appropriate protocol according to the context. We show that using ACOM performs better than using only one commit protocol in a variable system and that the reconfiguration cost can be negligible.
Priority Pricing in Utility Fair Networks
Authors: Tobias Harks, Tobias Poschwatta
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

This paper deals with a new pricing approach in utility fair networks, where the user¿s application is associated with a utility function. We allow users to have concave as well as non-concave utility functions. Bandwidth is allocated such that utility values of applications are shared fairly. In this work, we derive a fairness measure for utility functions that takes their specific shape into account. Based on this fairness measure, we present a simple pricing mechanism: the user announces his utility function and the network charges in accordance with the fairness measure. Then, we apply our pricing mechanism to a content provider¿s network. In our model, customers want to scale their utilities to achieve their goals (e.g. file download, multimedia streaming) in a cost optimal way. In this regard, we formulate a download problem with predefined deadline as an optimal control problem and account for dynamic changes of the state of congestion by using (online) model predictive control techniques. Finally, we develop online control strategies and implement them in a User Agent (UA) that automatically scales the utilities.
A novel framework for SVM-based image retrieval on large databases
Authors: Lei Wang, Xuchun Li, Ping Xue, Kap Luk Chan
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, a novel framework is proposed to deliver a fast, robust, and generally applicable SVM-based image retrieval for large databases. A quick test scheme is developed, and on-line kernel learning is employed to realize it after analyzing the relationship between them. Then an upper bound on maximum test scope is derived to speed up testing further. Also, the general applicability is well maintained because this framework does not need a kernel function and index structure to be pre-defined. Taking the advantages of this framework, more sophisticated SVM can be used to improve retrieval performance while keeping short response time. Experimental results on large image databases verify the effectiveness and efficiency of the proposed framework.
Events and Sightings
Authors: Chigusa Kita
Venue: IEEE Annals of the History of Computing (2005)

This department article features stories about the following: RAMAC named IEEE Milestone, Japan Prize goes to Makoto Nagao, When Computers Were Human, Cray-Cyber.org, a history paper reviewed in IEEE Spectrum, History of Computing exhibit at the National Science Museum, computer speed claims, and history-themed student Web design contest.
A Hidden Markov Model Based Segmentation and Recognition Algorithm for Chinese Handwritten Address Character Strings
Authors: Qiang Fu, X. Q. Ding, C. S. Liu, Yan Jiang
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

An efficient method of Chinese handwritten address character string segmentation and recognition is presented. First, an address string image is presegmented into several radicals using stroke extraction and stroke mergence. Next, the radical series obtained by pre-segmentation merge into different character image series according to different merging paths. After that, the optimal merging path is selected using recognition and semantic information. The recognition information is given by the character classifier. The semantic information is obtained from address database which contains 180,000 address items. Finally, the optimal recognition results of the character image series which are combined by radical series according to the optimal merging paths are obtained. In experiments on 897 mail images, the proposed method achieves correct rate of 85 percent while the error rate is 15 percent.
Eliciting User Requirements for Ambient Intelligent Systems: A Case Study
Authors: Ana Ivanovic, Aga Matysiak, Klaas Sikkel, Roel Wieringa
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Ambient Intelligent (AmI) systems are electronic environments that are responsive and sensitive to the presence of people [1]. Eliciting requirements for AmI systems, like for any novel technology, is hard because of high uncertainties, such as:
Functional Topology Classification of Biological Computing Networks
Authors: Pablo Blinder, Itay Baruchi, Vladislav Volman, Herbert Levine, Danny Baranes, Eshel Ben Jacob
Venue: Natural Computing: an international journal (2005)

Current analyses of complex biological networks focus either on their global statistical connectivity properties (e.g. topological path lengths and nodes connectivity ranks) or the statistics of specific local connectivity circuits (motifs). Here we present a different approach --- Functional Topology, to enable identification of hidden topological and geometrical fingerprints of biological computing networks that afford their functioning --- the form-function fingerprints. To do so we represent the network structure in terms of three matrices: 1. Topological connectivity matrix --- each row (i) is the shortest topological path lengths of node i with all other nodes; 2. Topological correlation matrix --- the element (i,j) is the correlation between the topological connectivity of nodes (i) and (j); and 3. Weighted graph matrix --- in this case the links represent the conductance between nodes that can be simply one over the geometrical length, the synaptic strengths in case of neural networks or other quantity that represents the strengths of the connections. Various methods (e.g. clustering algorithms, random matrix theory, eigenvalues spectrum etc.), can be used to analyze these matrices, here we use the newly developed functional holography approach which is based on clustering of the matrices following their collective normalization. We illustrate the approach by analyzing networks of different topological and geometrical properties: 1. Artificial networks, including --- random, regular 4-fold and 5-fold lattice and a tree-like structure; 2. Cultured neural networks: A single network and a network composed of three linked sub-networks; and 3. Model neural network composed of two overlapping sub-networks. Using these special networks, we demonstrate the method's ability to reveal functional topology features of the networks.
AMNESIA: analysis and monitoring for NEutralizing SQL-injection attacks
Authors: William G. J. Halfond, Alessandro Orso
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

The use of web applications has become increasingly popular in our routine activities, such as reading the news, paying bills, and shopping on-line. As the availability of these services grows, we are witnessing an increase in the number and sophistication of attacks that target them. In particular, SQL injection, a class of code-injection attacks in which specially crafted input strings result in illegal queries to a database, has become one of the most serious threats to web applications. In this paper we present and evaluate a new technique for detecting and preventing SQL injection attacks. Our technique uses a model-based approach to detect illegal queries before they are executed on the database. In its static part, the technique uses program analysis to automatically build a model of the legitimate queries that could be generated by the application. In its dynamic part, the technique uses runtime monitoring to inspect the dynamically-generated queries and check them against the statically-built model. We developed a tool, AMNESIA, that implements our technique and used the tool to evaluate the technique on seven web applications. In the evaluation we targeted the subject applications with a large number of both legitimate and malicious inputs and measured how many attacks our technique detected and prevented. The results of the study show that our technique was able to stop all of the attempted attacks without generating any false positives.
Modeling Software Characteristics and Their Correlations in A Specific Domain by Comparing Existing Similar Systems
Authors: Akira Osada, Daigo Ozawa, Haruhiko Kaiya, Kenji Kaijiri
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Software in a specific domain has several characteristics and each characteristic should be fixed when the software requirements are specified. In addition, these characteristics sometimes correlate with each other. However, we sometimes forget to specify several characteristics and/or to take their correlations into account during requirements elicitation. In this paper, we propose a meta-model for representing such characteristics and their correlations, and also propose a method to build a model for a specific domain by using documents about existing software systems. By using our model for a domain, a requirements specifi- cation for a system in the domain could be complete and unambiguous because requirements analysts can check the characteristics that should be decided. The specification could be also correct and consistent because the analysts can know side effects of a requirement change by using correlation among the characteristics. We have applied our methods to a case study for confirming the usefulness of such model and the methods.
Interacting with the ubiquitous computer: towards embedding interaction
Authors: Albrecht Schmidt, Matthias Kranz, Paul Holleis
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Computing and communication technology is widely used and integrated in devices, environments, and everyday objects. Even with major advances in technology the vision of ubiquitous computing - from a user perspective - is not yet achieved. In this paper we look at new forms of interaction that will help to interact with the ubiquitous computer. In particular we introduce the concept of embedded interaction, and implicit use. The focus of the research is on embedding information into people's environments. Currently massive amounts of information are available. However, delivering it to the user in a way that is pleasant and not annoying is still a challenge. Observing mobile phone information push services, it appears that endless information is available; however, much of the information is interesting only in a very specific context of use. We investigate how information can be provided to users - exactly when and where it is needed. Our approach is based on a variety of information displays unobtrusively embedded into the user's everyday environment. We place the information displays in context. In contrast to the traditional approach on context-awareness where a context is recognized and then the appropriate information is delivered, we look at providing information already in context. It is up to the user to make use of the provided information or not.
Error bounds for correlation clustering
Authors: Thorsten Joachims, John Hopcroft
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering recovers the correct partition in a planted partition model (Condon & Karp, 2001; McSherry, 2001). Using these bounds, we analyze how the accuracy of correlation clustering scales with the number of clusters and the sparsity of the graph. We also propose a statistical test that analyzes the significance of the clustering found by correlation clustering.
Correctness Verification of synchronization based workflow model
Authors: Cai Jian, Zhao Wen, Zhang Shikun, Wang Lifu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Work flow management systems facilitate the everyday operation of business processes by taking care of the logistic control of work. In contrast to traditional information systems, they attempt to support frequent changes of the workjlows at hand. Therefore, the need for analysis methods to verifi the correctness of workjlows is becoming more prominent. In this paper, we present a method for correctness verification of synchronization based workjlow model. Moreover, the method can give a counterexample when an error exists in model, this will help to improve the model.
Real Time Concurrency Control for Data Intensive Applications
Authors: Christy P. M. Lau, Victor C. S. Lee
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Recently, a new class of data-intensive applications has received wide attention. In these applications, monitoring functions can be performed by executing pre-registered transactions periodically using data from external sources in the form of continuous data streams and producing updates as temporal data in the database. For this type of continuous transactions, the data access pattern has to be declared before submission. To keep the database fresh, these transactions must be processed in a timely fashion. However, it is also desirable to execute other one-time transactions that may use these temporal data within their deadlines. Traditional DBMS are not designed to support such applications. The theme of this work is to propose new concurrency control protocols to process these types of transactions with competing requirements. The challenge of this work is to balance database freshness and transaction performance. Although there is a number of similar previous works in the literature, they did not consider the presence of continuous transactions and therefore the issue of data dependency between these two types of transactions is not addressed. The simulation results show that our protocols can significantly improve the performance of one-time transactions while keeping the database fresh.
A unified framework for semantic shot representation of sports video
Authors: Xiaofeng Tong, Qingshan Liu, Lingyu Duan, Hanqing Lu, Changsheng Xu, Qi Tian
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

The development of mid-level shot description helps to bridge the gap between low-level feature and high-level semantics in video indexing and analysis. In this paper, we present a unified framework for semantic shot representation in field-ball sports genres, in which a video shot is characterized via three essential properties, namely, camera shot size, subject in a scene and video production technology. The three properties clearly represent the primary factors of a shot, and provide a unified viewpoint of semantic shot definition. Based on this framework, we design an effective architecture for semantic shot management comprising three main components as: 1) flexible shot clustering and retrieval by adjusting the weights of three properties according to different requirements; 2) semantics based video temporal segmentation for further event recognition; and 3) comprehensive sports video semantics analysis. Extensive experiments on soccer, basketball and tennis demonstrate the effectiveness and validity of this framework.
On Integrated Location and Service Management for Minimizing Network Cost in Personal Communication Systems
Authors: Ing-Ray Chen
Venue: IEEE Transactions on Mobile Computing (2006)

We investigate the notion of per-user integrated location and service management in personal communication service (PCS) networks by which a per-user service proxy is created to serve as a gateway between the mobile user and all client-server applications engaged by the mobile user. The service proxy is always colocated with the mobile user's location database such that whenever the MU's location database moves during a location handoff, a service handoff also ensues to colocate the service proxy with the location database. This allows the proxy to know the location of the mobile user all the time to reduce the network communication cost for service delivery. We investigate four integrated location and service management schemes. Our results show that the centralized scheme performs the best when the mobile user's SMR (service to mobility ratio) is low and CMR (call to mobility ratio) is high, while the fully distributed scheme performs the best when both SMR and CMR are high. In all other conditions, the dynamic anchor scheme is the best except when the service context transfer cost is high, under which the static anchor scheme performs the best. Through analytical and simulation results, we demonstrate that different users with vastly different mobility and service patterns should adopt different integrated location and service management methods to optimize system performance. Further, the best integrated scheme always performs better than the best decoupled scheme that considers location and service managements separately and management schemes that do not use any service proxy.
Research on the Analysis and Measurement for Testing Results of Web Applications
Authors: Lei Xu, Baowen Xu, Yanxiang He, Hanwu Chen, Qiaoming Zhu
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Reasonable analysis and corrective measurement for the testing results of Web applications can effectively judge the effect and efficiency of the testing. Therefore, based on the previous work, we propose a new method for testing results analysis and comparison, which uses the semantic label and XML description technique to realize the information separation between data and display in the Web pages, so as to directly compare the testing results and the expected results. Furthermore, combined with the realities, we determine the metric indexes of Web application testing, so as to provide the criterions and guidelines for the evaluations of the Web applications and their testing processes. And we introduce the feedback control mechanism into the development and evolvement of Web applications, so as to further improve the system quality.
Mathematical sketching: a new approach to creating and exploring dynamic illustrations
Authors: Andries Van Dam
Venue:  (2005)

Diagrams and illustrations are frequently used to help explain mathematical concepts. Students often create them with pencil and paper as an intuitive aid in visualizing relationships among variables, constants, and functions, and use them as a guide in writing the appropriate mathematics to solve the problem. However, such static diagrams generally assist only in the initial formulation of the required mathematics, not in &ldquo;debugging&rdquo; or problem analysis. This can be a severe limitation, even for simple problems with a natural mapping to the temporal dimension or problems with complex spatial relationships. To overcome these limitations we present mathematical sketching , a novel, pen-based, gestural interaction paradigm for mathematics problem solving. Mathematical sketching derives from the familiar pencil-and-paper process of drawing supporting diagrams to facilitate the formulation of mathematical expressions; however, with mathematical sketching, users can also leverage their physical intuition by watching their hand-drawn diagrams animate in response to continuous or discrete parameter changes in their written formulas. Diagram animation is driven by implicit associations that are inferred, either automatically or with gestural guidance, from mathematical expressions, diagram labels and drawing elements. We describe the critical components of mathematical sketching as developed in the context of a prototype application called Mathpad2. We discuss the important issues of the mathematical sketching paradigm such as the development of a fluid gestural user interface, recognition of mathematical expressions, support for computational tools such as graphing, solving equations, and evaluating expressions, and the preparation and translation of mathematical sketches into animated illustrations. Additionally, we present an evaluation of MathPad2 and show that it is a powerful, easy-to-use tool for creating dynamic illustrations and mathematical visualizations.
Integrated Mobility Management Methods for Mobile IP and SIP in IP based Wireless Data Networks
Authors: Hyejeong Lee, Jee-Young Song, Sun-Ho Lee, Sungwon Lee, Dong-Ho Cho
Venue: Wireless Personal Communications: An International Journal (2005)

With developments in voice over IP (VoIP), IP-based wireless data networks and their application services have received increased attention. While multimedia applications of mobile nodes are served by Session Initiation Protocol (SIP) as a signaling protocol, the mobility of mobile nodes may be supported via Mobile IP protocol. For a mobile node that uses both Mobile IP and SIP, there is a severe redundant registration overhead because the mobile node has to make location registration separately to a home agent for Mobile IP and to a home registrar for SIP, respectively. Therefore, we propose two new schemes that integrate mobility management functionality in Mobile IP and SIP. We show performance comparisons among the previous method, which makes separate registration for Mobile IP and SIP without integration, and our two integrated methods. Numerical results show that the proposed methods efficiently reduce the amount of signaling messages and delay time related to the idle handoff and the active handoff.