ppxscal/embedding_network huggingface dataset:
Inferences on Kernel Density Estimates by Solving Nonlinear Systems
Authors: Stefania Bellavia, Stefano Lodi, Benedetta Morini
Venue: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (2006)

Kernel density estimators are a popular family of nonparametric estimators with applications to exploratory statistics and data mining. Since kernel estimators must be constructed from the data, if the data are sensitive, only indirect representations of the estimate, such as graphs or tabulations, can be stored or transmitted. However, even such representations might contain enough information to allow for data reconstruction, yielding an inference problem for kernel estimates. The inference problem for kernel estimators can be described by a system of nonlinear equations that arises naturally from the kernel estimate of a multivariate dataset. The solution to the system is the set of data from which the kernel estimate was computed and, in practice a good approximation to the solution is not available. A serious threat to data privacy is posed by publicly available solvers for nonlinear systems. This paper investigates the numerical solution of the nonlinear systems arising from the kernel estimate of a multivariate dataset and shows that this task is challenging. In fact, the Jacobian matrix of the system is numerically singular and a large number of solvers for nonlinear equations fails as they have to solve linear systems whose coefficient matrix is given by the Jacobian. Further, up to date solvers for optimization problems that do not suffer from this drawback may fail to solve the nonlinear system. To show this fact, we tested a subspace trustregion method, a BFGS method and a gradient projection method on both a synthetic and a real dataset. These methods are able to find a solution to the optimization problem even starting far from it. However, the experimental results on both the synthetic and the real dataset show that, if the initial guess is not very close to the solution, all three meth- yielding an inference problem for kernel estimates. Consider for instance an investment bank database. Different customers have invested their savings in two funds in different amounts. If a bi-dimensional kernel estimate is graphically displayed as a three-dimensional graph, then it might be possible to derive a set of (x, y, z) triplets describing the input/output relationship of the estimate at given points on the plane. In the presentation of results, usually the parameters of the estimate are communicated, therefore the analytical form of the estimate is entirely known (except the data points). This knowledge could be exploited to recover the data points by attempting to solve a system of equations having the data points as variables. Then, the dataset could be compared to information leaked from other sources in order to assign the reconstructed points to individual customers.
Choreography of web services based on natural language storybooks
Authors: Kurt Englmeier, Javier Pereira, Josiane Mothe
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

Universally available services, which communicate in a standardized way, can provide a new generation of middleware. Harnessing the advantages of this promising middleware technology, however, means to be capable to understand and to handle its design language which emerges from standards like SOAP, WSDL, BPEL, etc. These languages are necessary for finding, composing and orchestrating web services. If at all, only IT experts are familiar with these languages.The key actors, the domain experts of business processes, however, are not IT experts, and thus do not become the main designers. WS-Talk is a research project that encourages the co-existence of Natural Language and Web service technology. It reinforces the role of domain experts in designing business processes without having to resort to their IT colleagues. In our approach business process experts write storybooks in their own language. Their instructions are matched with semantics that represent application logic that, in turn, supports the automatic composition of software components. The WS-Talk products currently support organizations in managing their own and individual information, i.e. to set up their own enterprise search engine.
Upper Bounding Estimation for Robustness to the Parameter Uncertainty with Trigonometric Function in Trajectory Control of Robot Arms
Authors: Recep Burkan
Venue: Journal of Intelligent and Robotic Systems (2006)

In this paper, a new robust control law is considered for controlling robot manipulators subjected to uncertainties. The control law is derived as a result of analytical solution from the Lyapunov function, thus stability of the uncertain system is guaranteed. Apart from previous studies, uncertainty bound and adaptation gain matrix are updated in time with the estimation law to control the system properly and uncertainty bound is determined using a trigonometric function of robot kinematics, inertia parameters and tracking error while adaptation gain matrix is determined using a trigonometric function of robot kinematics and tracking error. Application to a two-link robotic manipulator is presented and numerical simulations are included.
Simulating customer ownership patterns for technology goods in the mature market phase
Authors: Chris Robson
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This presentation shows how we have applied System Dynamics modeling tools and techniques to the problem of marketing mature technology products. There is a large body of work dating back to the early 50s on how technology products are initially adopted, but many companies are now struggling with products that are well into the maturity phase -- their customer base has saturated and sales come from replacement and competitive shift. We will present how simulating the installed base using SD techniques has helped our F500 clients understand the effects of upgrades, loyalty, ownership patterns and installed-base marketing as they try to capture the maximum value from their customers in this difficult market phase.
The Role of the Instructors as a Determinant of Students' Satisfaction in University Online Education
Authors: Sean Eom
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This study examines the role of the Instructor as a determinant of students' satisfaction in the context of university online course. A total of 397 valid unduplicated responses from the students who have completed at least one online course at a university in the Midwestern United States were used to fit the structural equation model using LISREL 8.7. All of the antecedent constructs hypothesized to affect user satisfaction except one (instructor care and responsiveness) are not significant suggesting that instructor knowledge, instructor facilitation/ stimulation, and instructor feedback did not affect the perceived satisfaction of students who take Web-based courses. Therefore, the construct measuring instructors' individual attention to students and responsiveness to students concerns is the most influential factor to significantly increase the satisfaction of students taking online classes. The findings suggest that personal care for each student is the critical element that can activate students' metacognition. Metacognitive feedback directs the learner's attention to learning outcomes and therefore may lead to a high level of students' satisfaction.
An integrated approach to individual and collaborative learning in a web-based learning environment
Authors: Sadhana Puntambekar
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

In this paper we will discuss the design of a web based interactive learning environment. We will focus on the cognitive and collaborative tools that we are developing for students learning at a distance. We have adopted a constructivist, problem based approach for our design. An essential element of making this approach work is to integrate the individual and collaborative learning as well as the affordances and scaffolding provided by the different tools. We will discuss the design principles, the tools and the framework for integrating individual and collaborative learning.
A Comparison on Histogram Based Image Matching Methods
Authors: Wenjing Jia, Huaifeng Zhang, Xiangjian He, Qiang Wu
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

Using colour histogram as a stable representation over change in view has been widely used for object recognition. In this paper, three newly proposed histogram-based meth- ods are compared with other three popular methods, includ- ing conventional histogram intersection (HI) method, Wong and Cheung's merged palette histogram matching (MPHM) method, and Gevers' colour ratio gradient (CRG) method. These methods are tested on vehicle number plate images for number plate classification. Experimental results dis- close that, the CRG method is the best choice in terms of speed, and the GWHI method can give the best classifi- cation results. Overall, the CECH method produces the best performance when both speed and classification per- formance are concerned.
Semantic Composition of Scientific Workflows Based on the Petri Nets Formalism
Authors: Tomasz Gubala, Daniel Herezlak, Marian Bubak, Maciej Malawski
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The idea of an application described through its workflow is becoming popular in the Grid community as a natural method of functional decomposition of an application. It shows all the important dependencies as a set of connections of data flow and/or control flow. As scientific workflows grow in size and complexity, a tool to assist end users is becoming necessary. In this paper we describe the formal basis, design and implementation of such a tool -- an assistant which analyzes user requirements regarding application results and works with information registries that provide information on resources available in the Grid. The Workflow Composition Tool (WCT) provides the functionality of automatic workflow construction based on the process of semantic service discovery and matchmaking. It uses a well-designed construction algorithm together with specific heuristics in order to provide useful solutions for application users.
Attribute-Based Access Control with Hidden Policies and Hidden Credentials
Authors: Keith Frikken, Mikhail Atallah, Jiangtao Li
Venue: IEEE Transactions on Computers (2006)

In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather than the identity) of the requester, via digital credentials: Access is granted if Alice's credentials satisfy Bob's access policy. The literature contains many scenarios in which it is desirable to carry out such trust negotiations in a privacy-preserving manner, i.e., so as minimize the disclosure of credentials and/or of access policies. Elegant solutions were proposed for achieving various degrees of privacy-preservation through minimal disclosure. In this paper, we present protocols that protect both sensitive credentials and sensitive policies. That is, Alice gets the resource only if she satisfies the policy, Bob does not learn anything about Alice's credentials (not even whether Alice got access), and Alice learns neither Bob's policy structure nor which credentials caused her to gain access. Our protocols are efficient in terms of communication and in rounds of interaction.
Discrimination of Liver Diseases from CT Images Based on Gabor Filters
Authors: Chien-Cheng Lee, Sz-Han Chen, Hong-Ming Tsai, Pau-Choo Chung, Yu-Chun Chiang
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In this paper, a liver disease diagnosis based on Gabor filters is proposed. Three kinds of liver diseases are identified: cyst, hepatoma and cavernous hemangioma. The diagnosis scheme includes two steps: features extraction and classification. The features derived from Gabor filters are obtained from the ROIs among the normal and abnormal CT images. In the classification step the SVM classifier is used to discriminate the different liver disease types. Finally the receiver operating characteristic curve is employed to evaluate the performance of the diagnosis system. The effectiveness of the proposed method is demonstrated through experimental results on CT images including 76 liver cysts, 30 hepatomas, and 40 cavernous hemangiomas. From the results, we can observe that the discrimination rate of cyst is higher than the other diseases, and the classification accuracy decreases slightly between cavernous hemangiomas and hepatomas. However, a normal region can be discriminated from all of these diseases entirely.
Mediating Group Dynamics through Tabletop Interface Design
Authors: Meredith Ringel Morris, Anthony Cassanego, Andreas Paepcke, Terry Winograd, Ann Marie Piper, Anqi Huang
Venue: IEEE Computer Graphics and Applications (2006)

A Stanford University research group explores how design alternatives for tabletop interfaces can impact group dynamics to promote effective teamwork. They built and evaluated a series of novel prototypes that explore Multi-User Coordination Policies and cooperative gesturing, encouraging equitable participation in educational tasks and supporting social skills development for special-needs populations.
Scaffolding the Comprehension of Complex Systems with Explanation
Authors: Weiqin Chen, Laila Frotjord
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The often counter-intuitive behavior of dynamic systems requires profound training and experience to predict. Simulations can provide a practice arena in which users can experiment with different policies, and thus learn why certain behavior arises. However, common tools for creating such simulations provide no explanation of the exhibited behavior, and it is up to the user to reason about causes and effects. Without insight into the system dynamics field, such an analysis can be highly challenging to perform. This paper looks into how an explanation of system dynamic models can be dynamically generated in order to scaffold the users' comprehension of the system. The objective of the generated explanation is to enhance the users' understanding of the particular dynamic system, but also to stimulate their dynamical thinking in general.
Searching with Unilateral Neglect
Authors: Marina Pavlovskaya, Haim Ring, Zeev Groswasser, Shaul Hochstein
Venue: Journal of Cognitive Neuroscience (2002)

We address two longstanding conflicts in the visual search and unilateral neglect literature by studying feature and conjunction search performance of neglect patients using laterally presented search arrays. The first issue relates to whether feature search is performed independently of attention, or rather requires "spread attention." If feature search is "preattentive," it should survive neglect. However, we find neglect effects for both feature and conjunction search, suggesting that feature search, too, has an attentional requirement. The second controversy refers to the space- or object-based nature of neglect following unilateral right-hemisphere parietal lobe damage. If neglect were a purely spatial phenomenon, then we would expect no detriment in performance in the right (nonneglect) field, and diminished performance for the whole left (neglect) field. On the other hand, if neglect were purely object-based, we would expect diminished performance on the left side of the search array, irrespective of its location in the visual field. We now demonstrate a combination of strong object-based and space-based neglect effects for conjunction search with laterally placed element arrays, suggesting that these two mechanisms work in tandem.
Elements of physical oscillation and control theory
Authors: S. L. Chechurin, L. S. Chechurin
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

Parametric oscillation conditions for periodically time-variant system and stability failure of periodic motion of nonlinear dynamic system are derived within the mono-frequency approximation. Graphical illustration and physically based explanation for oscillation conditions are given. Conditions for two-frequency combined oscillation of sum and difference resonance phenomenon and high frequency synchronization are obtained. A problem of nonlinear system robust control avoiding one-frequency parametric resonances is set up.
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Authors: Hannes Frey, Ivan Stojmenovic
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this article is to clarify that this is not the truth in general. We show that specifically in relative neighborhood and Gabriel graphs recovery from a greedy routing failure is always possible without changing between any adjacent faces. Guaranteed delivery then follows from guaranteed recovery while traversing the very first face. In arbitrary graphs, however, a proper face selection mechanism is of importance since recovery from a greedy routing failure may require visiting a sequence of faces before greedy routing can be restarted again. A prominent approach is to visit a sequence of faces which are intersected by the line connecting the source and destination node. Whenever encountering an edge which is intersecting with this line, the critical part is to decide if face traversal has to change to the next adjacent one or not. Failures may occur from incorporating face routing procedures that force to change the traversed face at each intersection. Recently observed routing failures which were produced by the GPSR protocol in arbitrary planar graphs result from incorporating such a face routing variant. They cannot be constructed by the well known GFG algorithm which does not force changing the face anytime. Beside methods which visit the faces intersected by the source destination line, we discuss face routing variants which simply restart face routing whenever the next face has to be explored. We give the first complete and formal proofs that several proposed face routing, and combined greedyface routing schemes do guarantee delivery in specific graph classes or even any arbitrary planar graphs. We also discuss the reasons why other methods may fail to deliver a message or even end up in a loop.
Bases for certain cohomology representations of the symmetric group
Authors: Anthony Henderson
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around the coordinate hyperplanes and trivial monodromy around all other hyperplanes. In the case where the local system is equivariant for the symmetric group, we write the cohomology groups as direct sums of inductions of one-dimensional characters of subgroups. This relies on an equivariant description of the Orlik-Solomon algebras of full monomial reflection groups (wreath products of the symmetric group with a cyclic group). The combinatorial models involved are certain representations of these wreath products which possess bases indexed by labelled trees.
Flexible self-adjustment of task deployment in dynamic environments
Authors: Richard John Anthony
Venue: Multiagent and Grid Systems (2006)

This paper presents an investigation into dynamic self-adjustment of task deployment and other aspects of self-management, through the embedding of multiple policies.Non-dedicated loosely-coupled computing environments, such as clusters and grids are increasingly popular platforms for parallel processing. These abundant systems are highly dynamic environments in which many sources of variability affect the run-time efficiency of tasks. The dynamism is exacerbated by the incorporation of mobile devices and wireless communication.This paper proposes an adaptive strategy for the flexible run-time deployment of tasks; to continuously maintain efficiency despite the environmental variability. The strategy centres on policy-based scheduling which is informed by contextual and environmental inputs such as variance in the round-trip communication time between a client and its workers and the effective processing performance of each worker.A self-management framework has been implemented for evaluation purposes. The framework integrates several policy-controlled, adaptive services with the application code, enabling the run-time behaviour to be adapted to contextual and environmental conditions. Using this framework, an exemplar self-managing parallel application is implemented and used to investigate the extent of the benefits of the strategy.
On Loan-to-Value Ratios of Inventory Financing with Doubly Stochastic Poisson Default Processes
Authors: Yixue Li, Yu Xu, Gengzhong Feng, Wenqiang Dai
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

To determine appropriate loan-to-value ratios of inventory collateral can make bank mitigate credit risk of inventory financing effectively. Based on reduced-form approaches, this paper assumes that the default of the enterprise is exogenous and follows a doubly stochastic poisson process, and then provides a model on the determination of loan-to-value ratios for banks. In this model, some factors, such as risk appetite of banks, expected rate of return and price volatility of collateral, frequency of marking to market and maturity time of loan, are considered synthetically, so banks may determine appropriate loan-to-value ratios of particular inventory financing operation to keep the level of taken risk consistent.
On the Importance of Being Contextual
Authors: Paolo Lombardi, Bertrand Zavidovique, Michael Talbert
Venue: Computer (2006)

Multimodal awareness is the key to improved unmanned vehicle control performance across a broad spectrum of future mission spaces.
An Intelligent Multi-hop Routing for Wireless Sensor Networks
Authors: Obidul Islam, Sajid Hussain
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

With the advancement of micro-sensor and radio technology, wireless sensor networks are deployed in various applications. In a continuous monitoring application, sensors gather information and transmit the sensed data to base station in a periodic manner. In each data gathering round, a node generates a data packet and transmits the packet to base station, or any other node; the data packets received from neighbouring nodes can be aggregated. The lifetime of such sensor system is the time until base station receives data from all sensors in the network. We propose a Genetic Algorithm (GA) based multi-hop routing for a homogeneous network to maximize the network lifetime. Given the location of the sensor nodes and base station, our algorithm generates a sequence of routing paths that maximizes the system lifetime.