ppxscal/embedding_network huggingface dataset:
A Platform for CSCL Practice and Dissemination
Authors: Jacques Lonchamp
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

CSCL practice and dissemination are problematic due to the lack of technical and pedagogical expertise, concrete training, and support for teachers. This paper describes a technological approach for making CSCL practice and adoption easier. A powerful workflowenabled CSCW web platform hosts virtual communities for designing, executing and tutoring CSCL sessions, analyzing their results, and debating all technical and pedagogical issues. The paper defines the platform requirements and describes a prototype of J2EE-based implementation through a typical usage scenario.
An efficient algorithm to find a jointly optimal time-frequency segmentation using time-varying filter banks
Authors: C. Herley, Zixiang Xiong, K. Ramchandran, M. T. Orchard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We examine the question of how to choose a time-varying filter bank representation for a signal which is optimal with respect to an additive cost function. We present in detail an efficient algorithm for the Haar filter set which finds the optimal basis, given the constraint that the time and frequency segmentations are binary. Extension to multiple dimensions is simple, and the use of arbitrary filter sets is also possible. We verify that the algorithm indeed produces a lower cost representation than any of the wavelet packet representations for compression of images using a simple rate-distortion cost.
Service Specification by Composition of Collaborations--An Example
Authors: Frank Alexander Kraemer, Peter Herrmann
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

We outline a specification style for reactive services that focuses on UML 2.0 collaborations and activities as reusable specification building blocks. In contrast to traditional component-based approaches, a collaboration directly describes the interactions between the components as well as the internal behavior necessary for a component to take part in it. To compose services from such reusable collaborations, we use events identified as input and output pins on the activities that are connected together. While our approach is formally settled in temporal logic, in this paper we focus on an example specification from the viewpoint of a service engineer.
BacSr1-cTiO3 perovskite solid solutions: Thermodynamics from ab initio electronic structure calculations
Authors: S. Piskunov, S. Dorfman, D. Fuks, E. A. Kotomin
Venue: Microelectronic Engineering (2005)

We suggest theoretical prediction for Ba"cSr"1"-"cTiO"3 perovskite solid solutions (BST) combining ab initio DFT/B3PW calculations and alloy thermodynamics. This approach is based on calculations of a series of ordered super-structures in Ba-Sr simple cubic sublattice immersed in the rest TiO"3 matrix. Although these structures are unstable with respect to the decomposition, the results of total energy calculations allow us to extract the necessary energy parameters and to calculate the phase diagram for the solid solutions (alloys). A novel approach applied to the BST system enables to predict that at T>400 K Ba and Sr atom distribution is random. But below this temperature at small c Ba atoms aggregate into nanoclusters, thus leading to the formation of Ba-rich complexes of ''almost pure'' BaTiO"3 (BTO) in mostly SrTiO"3 (STO) matrix. At large c the formation of analogous SrTiO"3 complexes in BaTiO"3 is predicted.
Towards a Model for Broadcasting Secure Mobile Processes
Authors: Victor Moraru, Traian Muntean, Emilian Gutuleac
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

In many parallel and distributed applications broadcasting represents a natural way of communication between processes/objects/actors. In addition mobility is often mandatory, as for instance, for the development of ad-hoc networks applications. The fusion of these two concepts into one unique and coherent model of concurrency, represents a great interest for the development of such classes of applications together with appropriate programming models and languages. An original model that combines mobility and selective broadcasting has been developed by Ene and Muntean: the bð-calculus. The "Mobile Ambients" by Gordon and Cardelli, represents also, among others, an interesting framework for mobility and ubiquity of applications. The goal of this paper is to propose a model for Broadcasting Secure Systems that we consider to be more appropriate for ad-hoc networks and ubiquitous applications, reinforcing the mobility and security aspects.
Routing optimization security in mobile IPv6
Authors: Kui Ren, Wenjing Lou, Kai Zeng, Feng Bao, Jianying Zhou, Robert H. Deng
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

Route Optimization (RO) in Mobile IPv6 (MIPv6) provides a mobile node (MN) the opportunity to eliminate the inefficient triangle routing with its corresponding node (CN) and therefore, greatly improves the network performance. However. in doing so. MIPv6 introduces several security vulnerabilities, and among them a major concern is the authentication and authorization of Binding Updates (BUs) during the RO process. Unauthenticated or malicious BUs open the door for many types of attacks. As every IPv6 node is expected to support MIPv6. mechanisms to secure BU will have a significant impact on the next generation Internet. In this paper, based on an in-depth analysis of the security weaknesses existing in previously proposed protocols, a light-weight BU protocol with high security strength is proposed, which makes use of public key certificate-based strong authentication technique. Another important contribution of the paper is the introduction of a novel and scalable 3-layer trust management framework, which takes advantage of IPv6 address format and home link's jurisdiction over the addresses it assigns, and thereby solves the difficult certificate issuing and management problem presented in the previous public key certificate-based solutions via trust delegation. The proposed protocol is highly efficient in term of both computation and communication costs on both MN and CN sides. An extended protocol is also proposed to explicitly support Hierarchical MIPv6 (HMIPv6).
Analysing Countermeasures Against Privacy-Invasive Software
Authors: Martin Boldt, Bengt Carlsson
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

User privacy is widely affected by the occurrence of privacy-invasive software (PIS) on the Internet. Various forms of countermeasures try to mitigate the negative effects caused by PIS. We use a computer forensic tool to evaluate an anti-spyware tool, with respect to found PIS over a four years period. Within the anti-spyware tool PIS was slowly identified, caused classification problems, and formely classified PIS were sometimes excluded. Background information on both PIS and countermeasure techniques are also presented, followed by discussions on legal disputes between developers of PIS and vendors of countermeasures.
Agent-Based Pattern Mining of Discredited Activities in Public Services
Authors: Chunsheng Li, Yatian Gao
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Along with the applications of computer and database techniques, a large even huge amount of data has been produced and collected in the field of public service. Many valuable regulations hide in the raw data. It is necessary that new technique is studied to help the manager make proper decision. We propose a data mining model which is based on multi-agent technique to mine the discredit activities in the water sale public service. The Multilayer feed-forward neural network (MFNN) trained by the improved back-propagation (BP) algorithm and decision tree algorithm have been employed in the model. Five agents have been developed to mine the discredit patterns and evaluate the users' credit according to the model. A case study of Daqing Oilfield water supplying payment system has been implemented for verifying this model.
SAXually Explicit Images: Finding Unusual Shapes
Authors: Li Wei, Eamonn Keogh, Xiaopeng Xi
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Over the past three decades, there has been a great deal of research on shape analysis, focusing mostly on shape indexing, clustering, and classification. In this work, we introduce the new problem of finding shape discords, the most unusual shapes in a collection. We motivate the problem by considering the utility of shape discords in diverse domains including zoology, anthropology, and medicine. While the brute force search algorithm has quadratic time complexity, we avoid this by using locality-sensitive hashing to estimate similarity between shapes which enables us to reorder the search more efficiently. An extensive experimental evaluation demonstrates that our approach can speed up computation by three to four orders of magnitude.
Use of AI in Query Optimization of Relational Databases
Authors: Amit Goyal, Laurentiu Vasiliu, Brahmananda Sapkota
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Exponential growth in number of possible strategies with the increase in number of relations in a query has been identified as a major problem in the field of query optimization of relational databases. Present database systems use exhaustive search to find the best possible strategy. But as the size of a query grows, exhaustive search method itself becomes quite expensive. Other AI algorithms like A* algorithm, Simulated Annealing etc. have been suggested as a solution. However, all these algorithms fail to produce the best strategy; necessarily required for query execution. We did some modifications to the A* algorithm to produce a randomized form of the algorithm and compared it with the original A* algorithm and exhaustive search. The comparison results have shown improved A* algorithm to be almost equivalent in output quality along with a colossal decrease in search space in comparison to exhaustive search method.
Neighborhood Aided Implicit Active Contours
Authors: Huafeng Liu, Yunmei Chen, Wufan Chen
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We have developed a geometric deformable model that employs neighborhood influence to achieve robust segmentation for noisy and broken edges. The fundamental power of this strategy rests with the explicitly combination of regional inter-point constraints, image forces, and a priori boundary information for each geometric contour point within its adaptively determined local influence domain. This formulation thus naturally unifies the essences of the geometric and parametric snakes through automatic local scale selection, and exhibits their respective fundamental strengths of allowing stable boundary detection when the edge information is weak and possibly discontinuous, while maintaining the abilities to handle topological changes during front evolution. In particular, this paper presents an implementation of the method through local integration of the level set function and the image/prior-driven evolution forces, where the resulting partial differential equation is solved numerically using standard finite difference method. Experimental results on synthetic and real images demonstrate its superior performance.
An Extended Extremal Optimisation Model for Parallel Architectures
Authors: Marcus Randall, Andrew Lewis
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by random mutation over time. In combinatorial optimisation, the genes correspond to solution components. Using a generalised model of a parallel architecture, the EO model can readily be extended to a number of individuals using evolutionary population dynamics and concepts of self-organising criticality. These solutions are treated in a manner consistent with the EO model. That is, poorly performing solutions can be replaced by random ones. The performance of standard EO and the new system shows that it is capable of finding near optimal solutions efficiently to most of the test problems.
Dual-Plane Watermarking for Color Pictures Immune to Rotation, Scale, Translation, and Random Bending
Authors: Masanori Dainaka, Shinta Nakayama, Isao Echizen, Hiroshi Yoshiura
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

An extended watermarking method for still pictures is described that can embed watermarks immune to not only rotation, scaling, and translation but also to random geometric distortion and any of their combinations. It requires no searches for treating random distortion. The search for rotation and scaling is combinatorial but is independent of the search for translation. That is, the angle and size of the target picture can be restored without restoring the picture's origin. Furthermore, the translation search is divided into horizontal and vertical searches that can be carried out independently. The number of searches is thus drastically reduced, making the processing speed high enough for practical application. Experimental evaluation demonstrated that the proposed method can embed watermarks immune to all four types of transformation. Although it was designed for still pictures, it can easily be extended to motion pictures.
Study and development of the circuits of setting-time measurers with parameters approaching the possible maximum
Authors: R. R. Babayan, D. E. Polonnikov
Venue: Automation and Remote Control (2006)

New structures of the setting-time measurers were considered and proposed. For a given resolution and spectral density of the input noise, the minimum reachable setting time was estimated theoretically.
Web applications and dynamic reconfiguration in UNIX servers
Authors: J. Jann, P. Pattnaik, N. Dubey, R. S. Burugula
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

In recent years, several large UNIX SMP Servers have added support for dynamic resource management through partitioning and dynamic resource reconfiguration. In this paper we study the ability of Dynamic Reconfiguration (DR) to accommodate fluctuating workloads and changes in operational priorities for a commercial web application. We use a WebSphere HTTP server, a WebSphere Application Server, and a DB2 Database for the application. This combination represents a popular platform for commercial computing deployments, and supports a number of common web-based application scenarios. In our study, we treat this application as a black box to provide a realistic measurement of the efficacy of the DR technology in UNIX Servers. We also use nonparametric estimation techniques to obtain an ab initio and unbiased study of the jitters in our experimental data. Our main conclusions are: (1) Resource allocations for the application (even for a complex and function-rich middleware system such as WebSphere) can be efficiently managed by DR, without the need for explicit accommodation of the DR features by the application, and (2) To obtain efficient resource utilization, the resource management system has to empirically monitor the throughput obtained from the application, rather than rely primarily on long time-scale estimations.
Multiscale simulations for suspensions of rod-like molecules
Authors: Christiane Helzel, Felix Otto
Venue: Journal of Computational Physics (2006)

We study the Doi model for suspensions of rod-like molecules. The Doi model couples a microscopic Fokker-Planck type equation (Smoluchowski equation) to the macroscopic Stokes equation. The Smoluchowski equation describes the evolution of the distribution of the rod orientations; it comes as a drift diffusion equation on the sphere at every point in physical space.For sufficiently high macroscopic shear rates (high Deborah numbers), the solution of the coupled system develops internal layers in the macroscopic strain rate (the spurt phenomenon).In the high Deborah numbers regime, the drift term in the Smoluchowski equation is dominant. We thus introduce a finite-volume type discretization of the microscopic Smoluchowski equation which is motivated by transport-dominated PDEs.We carry out direct numerical simulations of the spurt phenomenon both in the dilute and concentrated regimes. Below the isotropic-nematic transition, the solution structure is identical to the one described by purely macroscopic models (JSO model). For higher concentrations, we observe the formation of microstructure coming from a position-dependent tumbling rate. We also investigate the 2-d stability of the spurted solution.
Analysis of the QR-RLS algorithm for colored-input signals
Authors: P. S. R. Diniz, M. G. Siqueira
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The recursive least squares (RLS) algorithms for FIR adaptive filtering are particularly attractive due to their fast convergence, especially for correlated input signals. A detailed analysis of the QR-RLS algorithm in finite and infinite precision implementations is presented, emphasizing the case where the input signal samples are correlated. The expressions for the mean square values of all internal variables in a steady state are first derived. These expressions are the key used to determine the dynamic range of the internal signals, and to derive the analytical expressions for the mean square values of the deviations in the output variables of the algorithm in finite wordlength implementations. Previous works address this problem considering the input signal a white noise, a situation not so often encountered in practice. The accuracy of all analytical results are verified through a number of computer simulations.
A Basis for Constructing and Evaluating Design Concepts
Authors: Remco Dijkman
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

In this paper we argue that design concepts should represent relevant design patterns and implementation (middleware) constructs in a problem domain precisely and concisely. We claim that this follows logically fiom the role that design concepts play in the design process. Subsequently, we show the problems that arise if existing patterns and implementation constructs are not observed when developing design concepts. We focus our argument on concepts for interaction design and on the Reference Model for Open Distributed Processing.
News Briefs
Authors: Brent Kesler, Heather Drinan
Venue: IEEE Security and Privacy (2006)

Security and privacy news from around the world.
Adaptive resource management for dynamic distributed real-time applications
Authors: Eui-Nam Huh, Lonnie R. Welch
Venue: The Journal of Supercomputing (2006)

The dynamic distributed real-time applications run on clusters with varying execution time, so re-allocation of resources is critical to meet the applications's deadline. In this paper we present two adaptive recourse management techniques for dynamic real-time applications by employing the prediction of responses of real-time tasks that operate in time sharing environment and run-time analysis of scheduling policies. Prediction of response time for resource reallocation is accomplished by historical profiling of applications' resource usage to estimate resource requirements on the target machine and a probabilistic approach is applied for calculating the queuing delay that a process will experience on distributed hosts. Results show that as compared to statistical and worst-case approaches, our technique uses system resource more efficiently.
Mixed Reality Cooking Support System Using Content-Free Recipe Selection
Authors: Younes Fadil, Satoru Mega, Arata Horie, Kuniaki Uehara
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Using multimedia techniques in systems that provide assistance to users has become a common interest in recent research. To achieve a supreme level of interactivity in these systems, taking into account users' states as well as users' preferences is extremely important. However, most actual systems do not consider users' preferences when providing assistance to users. We design a system that selects a desirable recipe for a user to cook based on preference, then guide him through the cooking. The recipe selection relies on people's common interpretation of cooking recipes. We store users' feedback (interpretations) in the form of collaborative filtering, and this feedback is used to identify properties of other recipes. Furthermore, users can learn more flexibly and effectively by controlling their process using a parallel transition model for cooking. Using a parallel transition model, users will be able to perform parallel actions in any order they want and the system will advise them according to the action taken.
On Random Testing of Image Processing Applications
Authors: Johannes Mayer, Ralph Guderlei
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Testing image processing applications is a non-trivial task. Complex inputs have to be generated and complex test results have to be evaluated. In the present paper, models for random generation of images are proposed and compared. The study for their comparison uses mutants of one particular implementation of an image processing operator, namely an implementation of the Euclidean distance transform. Metamorphic relations, necessary properties, and special values are furthermore identified for this distance transform to enable automatic evaluation of test results. These criteria are also compared using mutation analysis. Based on the results, general hints are given on how to choose random models and automatically evaluate test results for testing in the field of image processing.
The extended H/sub /spl infin// filter-a robust EKF
Authors: G. A. Einicke, L. B. White
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

The use of the extended Kalman filter (EKF) is heavily entrenched in non-linear signal processing applications. However linearisation errors inherent in the specification of an EKF can severely degrade its performance. The paper presents a new approach to the robustification of the EKF by application of robust linear design methods based on the H/sub /spl infin// norm minimisation criterion. The results of simulations are presented to demonstrate an advantage for the demodulation of frequency and phase modulated signals.