ppxscal/embedding_network huggingface dataset:
Corporate Portals from a Service-Oriented Perspective The CoFiPot Implementation
Authors: Vo Vo, Hong Tuan Kiet, Christof Weinhardt
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

The concepts underlying service oriented computing (SOC) and service oriented architecture (SOA) promise to offer companies the flexibility they need to prevail in today's fast changing business climate. According to the SOC paradigm, services are fundamental components of applications that can be modified easily by a simple recomposition of services. In theory, SOC and SOA shall facilitate re-use, agility and IT-business alignment. Portals are generally considered important drivers of SOA initiatives. As a common integration platform for information and service, they rely strongly on the services provided by an enterprise SOA. In this paper, we want extend the perspective on the role of the portal with regard to the SOA paradigm. We argue, that portal applications (i.e. portlets) not only consume services but also act as business-context-sensitive gateway services. To illustrate this concept, we discuss how to extend an existing portal server implementation to support portletgateway services and further we present a lightweight business-context sensitive workflow messaging system based on portlet-gateway services.
Movement around real and virtual cluttered environments
Authors: Simon Lessels, Roy A. Ruddle
Venue: Presence: Teleoperators and Virtual Environments (2005)

Two experiments investigated participants' ability to search for targets in a cluttered small-scale space. The first experiment was conducted in the real world with two field of view conditions (full vs. restricted), and participants found the task trivial to perform in both. The second experiment used the same search task but was conducted in a desktop virtual environment (VE), and investigated two movement interfaces and two visual scene conditions. Participants restricted to forward only movement performed the search task quicker and more efficiently (visiting fewer targets) than those who used an interface that allowed more flexible movement (forward, backward, left, right, and diagonal). Also, participants using a high fidelity visual scene performed the task significantly quicker and more efficiently than those who used a low fidelity scene. The performance differences among all the conditions decreased with practice, but the performance of the best VE group approached that of the real-world participants. These results indicate the importance of using high fidelity scenes in VEs, and suggest that the use of a simple control system is sufficient for maintaining one's spatial orientation during searching.
Faster Verification of RTL-Specified Systems via Decomposition and Constraint Extension
Authors: Stefan Andrei, Albert Mo Kim Cheng
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Embedded and real-time systems are increasingly common and complex, requiring formal specification and verification in order to guarantee their satisfaction of desirable safety and timing requirements. Real-Time Logic (RTL) has been used to capture both the specification of a real-time system and the desirable safety assertions with respect to this system specification. A verification procedure then determines whether the safety assertions hold with respect to the system specification. However, the satisfiability problem for RTL, as well as for other first-order logics, is undecidable. Consequently, efforts have been focused on identifying non-trivial classes of formulas sufficiently practical for describing industrial real-time systems for which the verification and debugging can be done via efficient heuristics. One such class of formulas is the so-called path RTL. The first contribution of this paper is to extend the existing path RTL class without sacrificing the time complexity of the traditional path RTL heuristic for verification. This implies that we can specify and verify real-time systems, which we were unable to do using the existing path RTL, in the extended path RTL. For real-time systems with large specifications, there is a lot of room for improvement in the algorithms used for verification and debugging. The second contribution of this paper is an efficient method to perform verification and debugging of real-time systems specifications using decomposition techniques. Our idea is to decompose the constraint graph, used in existing approaches, into independent subgraphs so that it is no longer necessary to analyze the entire specification at once, but rather its individual and smaller components. We have implemented this method in the Java-based DEVA-RTL tool and tested it on several industrial real-time systems.
Chiro-informatics: towards a semantic web health record and ontology for coordination of patient information between chiropractic and allopathic physicians
Authors: Maxine S. Cohen
Venue:  (2006)

The lack of coordination of clinical information communicated between chiropractic and allopathic physicians is detrimental to patients' overall health care. This lack of coordination and communication contributes significantly to the fragmentation of shared patient care among these medical providers. The goal of this research was to identify effective ways to improve coordination of patient information between chiropractic and allopathic physicians through secure methods of electronic communication. This research investigated applying digital pen-and-paper technology, Semantic Web technology standards, and biomedical ontologies to improve coordination of patient information. Specifically, the dissertation investigated whether (1) digital pen-and-paper technology was a viable approach to capture health data electronically; (2) the proposed agile software development methodology was appropriate for prototyping a secure Web-based Health Record (WHR); and (3) a Semantic Web ontology of an electronic health record for chiropractic medicine was feasible. This investigation also initiated awareness for a new informatics specialty coined Chiro-informatics&copy;---the application of computing to solve problems in chiropractic medicine. Volunteer patients from a chiropractic group who were also being treated by an orthopedist, neurologist, or internist were recruited for this investigation. Authentic health data was collected from these patients using digital pen-and-paper technology, and verified for accuracy using Mi-Forms software. The verified data was then transferred automatically into a relational database where ID Protect was executed to secure anonymity for the patients' identities. This authentic health data along with the anonymous identities provided the information base for prototyping the WHR. Next, the Extreme Programming (XP) agile software development methodology was followed to prototype the secure WHR successfully. XP use case stories recorded on CRC cards specified nine software requirements of this proof-of-concept: populating, logging in securely, logging out securely, authenticating, authorizing, viewing, updating, downloading, and printing. Ontologies constitute the backbone of the Semantic Web, which provides data with structure and meaning for computational processing. This research germinated chiro-ontology&copy;, a Semantic Web ontology of an electronic health record for chiropractic medicine. Constructing chiro-ontology is feasible by (1) deploying Semantic Web technology standards for interoperability; (2) leveraging reference ontologies for semantic consistency; and (3) integrating chiropractic expertise for spinal manipulation knowledge.
Online Case Discussions: Tensions in Activity Systems
Authors: Christian Voigt, Paula M. C. Swatman
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper we offer a view of case discussions in an online learning environment based on Activity Theory, which allows us to analyse the inherent contradictions in students' learning activities. We see Activity Theory as a first step towards structuring the complexity of students' experiences in today's higher education systems, so as to increase ICT's supportive role for higher-order learning activities. After identifying the tensions within particular activities we derive three means of supporting online case discussions: task scaffolds; collaboration scripts; and increasing students' awareness of technologybased alternatives.
Extending precolorings to circular colorings
Authors: Michael O. Albertson, Douglas B. West
Venue: Journal of Combinatorial Theory Series B (2006)

Fix positive integers k', d', k, d such that k'/d' > k/d ≥ 2. If P is a set of vertices in a (k,d)-colorable graph G, and any two vertices of P are separated by distance at least 2 ⌈kk'/(2(k'd-k'd))⌉, then every coloring of P with colors in Zk' extends to a (k', d')-coloring of G. If k'd - kd' = 1 and ⌊k'/d'⌋ = ⌊k/d⌋, then this distance threshold is nearly sharp. The proof of this includes showing that up to symmetry, in this case there is only one (k', d')-coloring of the canonical (k, d)-colorable graph Gk,d.
The Hierarchy of BGP Convergence on the Self-Organized Internet
Authors: Jinjing Zhao, Peidong Zhu, Xicheng Lu, Feng Zhao
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

This paper analyzes the relationship between BGP convergence and the power-law of the Internet. The inter-domain routing system is classified into three hierarchies based on the power-law and commercial relations of autonomous systems. The relation of network topology and three convergence parametersconvergence time T, affected ASs set Nc and affected paths factor ì is presented for all sorts of convergence events in different layers. The result shows that the power-law nature of network influences the BGP convergence greatly.
Prony analysis based parameter estimation of an NMR signal of blood plasma for cancer detection
Authors: P. K. Gale, J. W. Pierre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Researchers have investigated the correlation between statistical differences in the aliphatic region of NMR processed blood plasma and malignant cancer. Previous efforts used nonlinear curve-fitting algorithms to indirectly estimate the nine components of interest in the methyl and methylene peaks of this region. A different method is described in this paper for directly estimating the nine components. A preprocessing algorithm is used to remove all components outside the aliphatic region. Prony's method and Kumaresan and Tufts' modification are then run, using an order reduction algorithm to identify the compounds of interest. These methods are applied to an NMR plasma sample and the results are compared to the nonlinear curve-fitting algorithm, showing a close relationship.
Adaptive Feedback-Feedforward Control for a Class of Nonlinear Chemical Processes
Authors: Li Jia, Min-Sen Chiu
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

To circumvent the drawbacks in nonlinear controller designing of chemical processes, an adaptive feedbackfeedforward control scheme is proposed in this paper. A class of nonlinear processes with modest nonlinearities is approximated by a composite model consisting a linear ARX model and a fuzzy neural network-based linearization error model. In addition, the stable analysis is also discussed. Simulation results show that the feedforward control plays a major role in improving the control performance, and the proposed feedback-feedforward control possesses better performance.
Address-Space Randomization for Windows Systems
Authors: Lixin Li, James E. Just, R. Sekar
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Address-space randomization (ASR) is a promising solution to defend against memory corruption attacks that have contributed to about three-quarters of USCERT advisories in the past few years. Several techniques have been proposed for implementing ASR on Linux, but its application to Microsoft Windows, the largest monoculture on the Internet, has not received as much attention. We address this problem in this paper and describe a solution that provides about 15-bits of randomness in the locations of all (code or data) objects. Our randomization is applicable to all processes on a Windows box, including all core system services, as well as applications such as web browsers, office applications, and so on. Our solution has been deployed continuously for about a year on a desktop system used daily, and is robust enough for production use.
CSCL Scripting Patterns: Hierarchical Relationships and Applicability
Authors: Davinia Hernandez-Leo, Eloy D. Villasclaras-Fernandez, Juan I. Asensio-Perez, Yannis A. Dimitriadis, Symeon Retalis
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The use of patterns in e-learning is being recently proposed with different purposes and scopes. This paper provides a unifying view of several representative proposals in order to situate and introduce the types of patterns that can be used for generating collaboration scripts that are suitable of being computationally represented and interpreted by Learning Management Systems (LMSs). The paper also presents a hierarchical structure that relates these patterns according to their focus and granularity. The structure shows how the different types of patterns are complementary and should be considered in the process of creating a script. In addition to authoring tools and LMSs, there are other types of tools in which the application of patterns may be useful. This paper points out these tools locating them along the "life cycle" of the scripts.
Key management in mobile ad hoc networks
Authors: Jie Wu
Venue:  (2006)

In mobile ad hoc networks (MANETs), providing secure communications is a big challenge due to unreliable wireless media, host mobility and lack of infrastructure. Usually, cryptographic techniques are used for secure communications in wired networks. Symmetric and asymmetric cryptography have their advantages and disadvantages. In fact, any cryptographic means is ineffective if its key management is weak. Key management is also a central aspect for security in mobile ad hoc networks. In MANETs, the computational load and complexity for key management are strongly subject to restriction by the node's available resources and the dynamic nature of network topology. We proposed a secure and efficient key management framework (SEKM) for MANETs. SEKM builds a PKI by applying a secret sharing scheme and using an underlying multicast server groups. In SEKM, each server group creates a view of the certificate authority (CA) and provides certificate update service for all nodes, including the servers themselves. Motivated by the distributed key management service, we introduced k-Anycast concept and proposed three k-anycast routing schemes for MANETs. k-anycast is proposed to deliver a packet to any threshold k members of a set of hosts. Our goal is to reduce the routing control messages and network delay to reach any k servers. The first scheme is called controlled flooding. The second scheme, called component-based scheme I, is to form multiple components such that each component has at least k members. The third scheme, called component-based scheme II, in which the membership a component maintains is relaxed to be less than k. Collaborative and group-oriented applications in MANETs is an active research area. Group key management is a central building block in securing group communications in MANETs. However, group key management for large and dynamic groups in MANETs is a difficult problem. We propose a simple and efficient group key management scheme that we named SEGK for MANETs, which is based on n-party Diffie-Hellman (DH). The basic idea of our scheme is that a physical multicast tree is formed in MANETs for efficiency. To achieve fault tolerance, double multicast trees are constructed and maintained. A group coordinator computes and distributes intermediate keying materials to all members through multicast tree links. All group members take turns acting as group coordinator and distributing the workload of group rekeying during any change of group membership. Every group member computes the group key in a distributed manner.
Millipede: a rollerblade positioning system
Authors: Farid Benbadis, Jeremie Leguay, Vincent Borrel, Marcelo Amorim, Timur Friedman
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

Paris, Friday evening, 9:30 pm. Hundreds of skaters are hanging out at the bottom of the Montparnasse tower, waiting for the start of the Friday Roller Tour. A few minutes later, they will be up to 20,000 at the starting point. Together, for about three hours and over about thirty kilometres, they will glide up and down the streets of Paris on roller skates. Due to the crowd and to the participants' mobility, finding a friend is challenging. The main problem for friends participating in the tour is to find each other during the pauses, if they were separated after the start. Currently, in order to locate a friend, a participant should: (1) call his friend, using a cellphone, (2) describe the environment (street name and number, shops name, monuments, etc), and (3) according to the environment description, try to discover if the friend is forward or behind. In order to make it easier to find a friend, we propose a Bluetooth application to be embedded in cellphones. This application's ultimate goal is to provide users the ability to discover, not only their relative position in the tour, but also the positions of their participating friends. The application acts in two steps. First, it calculates the current relative position of the user (positioning), and then, through a communication protocol, sends this position to a user's friends (locating). In this demonstration, we do not consider the communication between skaters, but focus only on positioning.
A possibility theory-based approach to the handling of uncertain relations between temporal points: Research Articles
Authors: Didier Dubois, Allel HadjAli, Henri Prade
Venue: International Journal of Intelligent Systems (2007)

Uncertain relations between temporal points are represented by means of possibility distributions over the three basic relations precedes, equals, and follows. Operations for computing inverse relation, for composing relations, for combining relations coming from different sources and pertaining to the same temporal points, or for representing negative information are defined. An illustrative example of representation and reasoning with uncertain temporal relations is provided. This article shows how possibilistic temporal uncertainty can be handled in the setting of point algebra. Moreover, the article emphasizes the advantages of the possibilistic approach over a probabilistic approach previously proposed. This work does for the temporal point algebra what the authors previously did for the temporal interval algebra. &copy; 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 157&ndash;179, 2007.
Semi-supervised model-based document clustering: A comparative study
Authors: Shi Zhong
Venue: Machine Learning (2006)

Semi-supervised learning has become an attractive methodology for improving classification models and is often viewed as using unlabeled data to aid supervised learning. However, it can also be viewed as using labeled data to help clustering, namely, semi-supervised clustering. Viewing semi-supervised learning from a clustering angle is useful in practical situations when the set of labels available in labeled data are not complete, i.e., unlabeled data contain new classes that are not present in labeled data. This paper analyzes several multinomial model-based semi-supervised document clustering methods under a principled model-based clustering framework. The framework naturally leads to a deterministic annealing extension of existing semi-supervised clustering approaches. We compare three (slightly) different semi-supervised approaches for clustering documents: Seeded damnl, Constrained damnl, and Feedback-based damnl, where damnl stands for multinomial model-based deterministic annealing algorithm. The first two are extensions of the seeded k-means and constrained k-means algorithms studied by Basu et al. (2002); the last one is motivated by Cohn et al. (2003). Through empirical experiments on text datasets, we show that: (a) deterministic annealing can often significantly improve the performance of semi-supervised clustering; (b) the constrained approach is the best when available labels are complete whereas the feedback-based approach excels when available labels are incomplete.
Nonholonomic Motion Planning of Mobile Robot with Ameliorated Genetic Algorithm
Authors: JinFei Wu, DongXing Qin, HongPing Yu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The optimal motion planning problem of mobile robot system with nonholonomic constraints amounts to the optimal control problem of nonlinear system. The kinematic and dynamic equations of the mobile robot can be set up according mechanical and control theory. After stepping into the problem, some shortcomings in choosing the specific genetic operator for the current used Genetic Algorithm (abbreviated as GA) have turned up. In this paper, a new method of mobile robot path planning based on the Ameliorated Genetic Algorithm (abbreviated as AGA) is presented. Compared with GA, the ameliorated one can improve system's motion precision with specific crossover operator of AGA operations. The effectiveness of the optimal motion planning problem of mobile robot system is demonstrated by the numerical simulation. And AGA has also been proven to have good convergence, higher operative speed and improved accuracy.
Human Face Modeling and Recognition Through Multi-View High Resolution Stereopsis
Authors: Xin Chen, Timothy Faltemier, Patrick Flynn, Kevin Bowyer
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper presents a novel approach to face recognition that relies on 2D images to successfully reconstruct 3D shape of the human face. This approach ultimately outperforms 3D shape obtained from a commercial scanner. Additionally, our approach improves 2D recognition performance of 93.29% to 97.32%. Specifically, we employ multiple 2D views of a subject's face to reconstruct several 3D models through binocular stereopsis. We use the ICP (Iterative Closest Point) algorithm to match the 3D probe to the 3D gallery for each view, thereby forming a voting committee of multiple members to determine the final matching score. We achieve an 85.23% rank-one recognition rate on our data set consisting of 149 distinct subjects, superior to the performance of a commercial 3D scanner. This is noteworthy given that our approach does not require strict calibration as in the case of the commercial 3D scanner. Also significant is the demonstrated flexibility of this system to successfully perform 3D recognition on a database acquired originally for 2D face recognition.