ppxscal/embedding_network huggingface dataset:
Adaptive Hybrid Differential Evolution Algorithm and Its Application in Fuzzy Clustering
Authors: Youlin Lu, Jianzhong Zhou, Hui Qin, Chaoshun Li, Yinghai Li
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

To improve the globe searching ability of differential evolution algorithm (DE), an adaptive hybrid differential evolution algorithm (AHDE) is proposed. The cross operator of the proposed algorithm is adjusted according to the computation process to enhance the globe convergence ability of the algorithm. Simulated annealing (SA) is adopted for its strong local search ability to overcome the premature convergence of DE. The test results of Several Benchmark functions show that AHDE can avoid premature effectively and its globe convergence ability is better than that of DE. A new fuzzy clustering method combined AHDE with Fuzzy C-Mean algorithm (FCM) is presented and experiment results show that the clustering method presented can avoid the limitation of converging to the local optimal point of FCM and the clustering results obtained are more rational than those from FCM.
Ten design lessons from the literature on child development and children's use of technology
Authors: Heléne Gelderblom, Paula Kotzé
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

The existing knowledge base on child development offers a wealth of information that can be useful for the design of children's technology. Furthermore, academic journals and conference proceedings provide us with a constant stream of new research papers on child-computer interaction and interaction design for children. It will require some effort from designers to gather and digest the scattered research results and theoretical knowledge applicable to their products. We conducted an extended research project whereby the existing knowledge relating to the design of technology for children aged five to eight have been gathered and presented in a way that makes it accessible and useful to designers in practice. This paper provides and extract from that research, focusing on ten useful lessons learnt from existing literature.
The social hyperlink
Authors: Lada A. Adamic
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Online, hyperlinks connect not just related information, but people who relate to one another. In this talk I will discuss the many dimensions and uses of the social hyperlink across a variety of online communities. Sometimes it is the information that brings the people together, as they are seeking answers to questions, or seeking to answer questions. In online question and answer forums, hyperlinks record a fleeting social interaction, an information exchange. In other instances, for example, in virtual worlds, social hyperlinks may be conduits for social influence, direct transfer of information, or even the sharing of virtual goods. Occasionally, an online tie is established in order to navigate the real world, or more specifically, find a real couch to sleep on. This of course takes a good deal of trust - trust that is expressed in hyperlinks.
Zeno: eventually consistent Byzantine-fault tolerance
Authors: Atul Singh, Pedro Fonseca, Petr Kuznetsov, Rodrigo Rodrigues, Petros Maniatis
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Many distributed services are hosted at large, shared, geographically diverse data centers, and they use replication to achieve high availability despite the unreachability of an entire data center. Recent events show that non-crash faults occur in these services and may lead to long outages. While Byzantine-Fault Tolerance (BFT) could be used to withstand these faults, current BFT protocols can become unavailable if a small fraction of their replicas are unreachable. This is because existing BFT protocols favor strong safety guarantees (consistency) over liveness (availability). This paper presents a novel BFT state machine replication protocol called Zeno that trades consistency for higher availability. In particular, Zeno replaces strong consistency (linearizability) with a weaker guarantee (eventual consistency): clients can temporarily miss each other's updates but when the network is stable the states from the individual partitions are merged by having the replicas agree on a total order for all requests. We have built a prototype of Zeno and our evaluation using micro-benchmarks shows that Zeno provides better availability than traditional BFT protocols.
Final Cut Pro 6: Visual QuickPro Guide
Authors: Lisa Brenneis
Venue:  (2007)

Newly updated for Final Cut Pro 6, this Visual QuickPro Guide is hands-down one of the most sought out books on Apples non-linear editing system. An undisputed master of the digital video medium, Lisa Brenneis once again demystifies the complexities of the program with her straightforward approach that uses tasked-based, step-by-step instructions and loads of visuals and time-saving tips. Busy professionals and newcomers alike will appreciate that they can quickly find and learn tasks specific to their needs, benefiting from the award-winning Visual QuickPro style. Topics covered include essential editing tasks and media-management strategies, transitions, effects and filters, rendering options, and much much more. This is a must-have reference for anyone wanting to learn to use Final Cut Pro, whether they are new to the program or are upgrading.
Improving Legal Document Summarization Using Graphical Models
Authors: M. Saravanan, B. Ravindran, S. Raman
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

In this paper, we propose a novel idea for applying probabilistic graphical models for automatic text summarization task related to a legal domain. Identification of rhetorical roles present in the sentences of a legal document is the important text mining process involved in this task. A Conditional Random Field (CRF) is applied to segment a given legal document into seven labeled components and each label represents the appropriate rhetorical roles. Feature sets with varying characteristics are employed in order to provide significant improvements in CRFs performance. Our system is then enriched by the application of a term distribution model with structured domain knowledge to extract key sentences related to rhetorical categories. The final structured summary has been observed to be closest to 80% accuracy level to the ideal summary generated by experts in the area.
On representing coalitional games with externalities
Authors: Tomasz P. Michalak, Talal Rahwan, Jacek Sroka, Andrew Dowell, Michael J. Wooldridge, Peter J. McBurney, Nicholas R. Jennings
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

We consider the issue of representing coalitional games in multi-agent systems with externalities (i.e., in systems where the performance of one coalition may be affected by other co-existing coalitions). In addition to the conventional partition function game representation (PFG), we propose a number of new representations based on a new notion of externalities. In contrast to conventional game theory, our new concept is not related to the process by which the coalitions are formed, but rather to the effect that each coalition may have on the entire system and vice versa. We show that the new representations are fully expressive and, for many classes of games, more concise than the conventional PFG. Building upon these new representations, we propose a number of approaches to solve the coalition structure generation problem in systems with externalities. We show that, if externalities are characterised by various degrees of regularity, the new representations allow us to adapt coalition structure generation algorithms that were originally designed for domains with no externalities, so that they can be used when externalities are present. Finally, building upon Rahwan et al. [16] and Michalak et al. [9], we present a unified method to solve the coalition structure generation problem in any system, with or without externalities, provided sufficient information is available.
Intelligent communication in the Netherlands: Accommodation of large-scale, mass-market 4G applications
Authors: Patrick Strating, Rene van Buuren
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper describes the recent history of the communication technology innovations in the Netherlands, it describes the establishments and spearheads of the research community in the Freeband program (www.freeband.nl) and expresses the lines and ambitions for future developments and research. Distinguishing feature of Freeband is the collaborative development between industry and academia leading to clear focus and excellence in applications, context awareness and high-speed technologies. We argue that joint R&D programs with public private cooperation can work if they build on a shared vision. As such they can lead to centers of excellence international positioning and a strong knowledge base. We also argue that a focus shift is at hand from defining only research in technological areas to defining research for problems that arise in practical deployments and up scaling from lab environments.
Analysis of Time Series Novelty Detection Strategies for Synthetic and Real Data
Authors: André Paoliello Modenesi, Antônio Pádua Braga
Venue: Neural Processing Letters (2009)

Novelty detection is inspired by animal behavior and can be applied to a variety of practical situations. By automatically bringing attention to anomalous events, without the need of previously defining those events, it can perform certain tasks that would otherwise require human scrutiny. This paper reviews some approaches to the problem when applied to the time series analysis problem.
A Case-Based Methodology for Feature Weighting Algorithm Recommendation
Authors: Héctor Núòez, Miquel Sànchez-Marrè
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

The underlying idea of the methodology proposed in this paper is to provide a new methodology that could select the most appropriate feature weighting algorithm for a given database. The main idea is to implement a case-based system, where cases are formed by description of databases and feature weighting techniques optimising their generalisation accuracy. This methodology recommends the best techniques to be used in a new unknown database or domain.
Distance-Regular Graph with c 2 >&#x00a0;1 and a 1 =&#x00a0;0&#x00a0;<&#x00a0;a 2
Authors: Akira Hiraki
Venue: Graphs and Combinatorics (2009)

Let &#x0393; be a distance-regular graph of diameter d &#x2265;&#x00a0;3 with c 2 >&#x00a0;1. Let m be an integer with 1 &#x2264;&#x00a0;m &#x2264;&#x00a0;d&#x00a0;&#x2212;&#x00a0;1. We consider the following conditions: (SC)m : For any pair of vertices at distance m there exists a strongly closed subgraph of diameter m containing them. (BB)m : Let (x, y, z) be a triple of vertices with &#x2202;&#x0393;(x, y) = 1 and &#x2202;&#x0393;(x, z) =&#x00a0;&#x2202;&#x0393;(y, z) =&#x00a0;m. Then B(x, z) =&#x00a0;B(y, z). (CA)m : Let (x, y, z) be a triple of vertices with $$\partial_{\Gamma}(x,y)=2, \: \partial_{\Gamma} (x,z) = \partial_{\Gamma}(y,z) = m$$and |C(z, x) &#x2229; C(z, y)| &#x2265;&#x00a0;2. Then C(x, z) &#x222a; A(x, z) =&#x00a0;C(y, z) &#x222a; A(y, z). In [12] we have shown that the condition (SC)m holds if and only if both of the conditions (BB)i and (CA)i hold for i =&#x00a0;1,...,m. In this paper we show that if a 1&#x00a0;=&#x00a0;0&#x00a0;<&#x00a0;a 2 and the condition (BB)i holds for i =&#x00a0;1,...,m, then the condition (CA)i holds for i&#x00a0;=&#x00a0;1,...,m. In particular, the condition (SC)m holds. Applying this result we prove that a distance-regular graph with classical parameters (d, b, &#x03b1;, &#x03b2;) such that c 2&#x00a0;>&#x00a0;1 and a 1&#x00a0;=&#x00a0;0&#x00a0;<&#x00a0;a 2 satisfies the condition (SC)i for i&#x00a0;=&#x00a0;1,...,d&#x00a0;&#x2212;&#x00a0;1. In particular, either (b, &#x03b1;, &#x03b2;)&#x00a0;=&#x00a0;(&#x2212;&#x00a0;2,&#x00a0;&#x2212;3,&#x00a0;&#x2212;1&#x00a0;&#x2212;&#x00a0;(&#x2212;2)d ) or $$(b,\alpha,\beta)= \left(-3,-2,-\frac{1+(-3)^{d}}{2} \right)$$holds.
Electronic Portfolio: The Pedagogy behind the Technology in Science Projects
Authors: Guat-Kheng Chua, Guat-Beng Chua
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

The electronic portfolio (eportfolio) can be used as an integrative technology tool to capture the learning processes and reflections of pupils. This paper shares the pedagogical steps taken to implement eportfolio for pupils and to guide pupils in their journey of developing science project learning eportfolio in a secondary two (14 year--old) class over 5 months. Processes were put in place to enable pupils to engage in reflections in the context of investigative experiments on science process skills, to monitor their own understanding, to evaluate their own progress, to plan for improvement, and to reflect on peers' work. The paper highlights five pedagogical processes taken to scaffold the pupils in their eportfolio journey and how these steps can benefit the pupils and teachers. The processes were: (1) Understanding pedagogical needs; (2) Reflection on Learning; (3) Peer Review on Oral Presentation; (4) How to write reflections; and (5) Reflecting on Peer Feedback. In celebration of their work, pupils created their eportfolio and store in a web-server space to be presented to audience.
Linear Image Reconstruction by Sobolev Norms on the Bounded Domain
Authors: Bart J. Janssen, Remco Duits
Venue: International Journal of Computer Vision (2009)

The reconstruction problem is usually formulated as a variational problem in which one searches for that image that minimizes a so called prior (image model) while insisting on certain image features to be preserved. When the prior can be described by a norm induced by some inner product on a Hilbert space, the exact solution to the variational problem can be found by orthogonal projection. In previous work we considered the image as compactly supported in $\mathbb{L}_{2}(\mathbb{R}^{2})$ and we used Sobolev norms on the unbounded domain including a smoothing parameter ¿>0 to tune the smoothness of the reconstructed image. Due to the assumption of compact support of the original image, components of the reconstructed image near the image boundary are too much penalized. Therefore, in this work we minimize Sobolev norms only on the actual image domain, yielding much better reconstructions (especially for ¿¿0). As an example we apply our method to the reconstruction of singular points that are present in the scale space representation of an image.
Querying Trust in RDF Data with tSPARQL
Authors: Olaf Hartig
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

Today a large amount of RDF data is published on the Web. However, the openness of the Web and the ease to combine RDF data from different sources creates new challenges. The Web of data is missing a uniform way to assess and to query the trustworthiness of information. In this paper we present tSPARQL, a trust-aware extension to SPARQL. Two additional keywords enable users to describe trust requirements and to query the trustworthiness of RDF data. Hence, tSPARQL allows adding trust to RDF-based applications in an easy manner. As the foundation we propose a trust model that associates RDF statements with trust values and we extend the SPARQL semantics to access these trust values in tSPARQL. Furthermore, we discuss opportunities to optimize the execution of tSPARQL queries.
Japanese dependency parsing using sequential labeling for semi-spoken language
Authors: Kenji Imamura, Genichiro Kikui, Norihito Yasuda
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

The amount of documents directly published by end users is increasing along with the growth of Web 2.0. Such documents often contain spoken-style expressions, which are difficult to analyze using conventional parsers. This paper presents dependency parsing whose goal is to analyze Japanese semi-spoken expressions. One characteristic of our method is that it can parse self-dependent (independent) segments using sequential labeling.
Phase change and electrical characteristics of Ge-Se-Te alloys
Authors: Eui-Bok Lee, Byeong-Kwon Ju, Yong-Tae Kim
Venue: Microelectronic Engineering (2009)

Effects of Se contents in Ge-Se-Te ternary systems are investigated using edge contact type phase change random access memory cell structures. Increasing the Se content from 6 to 35at% crystallization temperature and Ovonic switching threshold voltage are increased due to the large grain growth of hexagonal microstructure in the Ge-Se-Te alloys.
Applying Preferences to Dialogue Graphs
Authors: Sanjay Modgil, Henry Prakken
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

An abstract framework for formalising persuasion dialogues has recently been proposed. The framework provides for a range of speech acts, and protocols of varying levels of flexibility. However, the framework assumes the availability of preference information relevant to determining whether arguments moved in a dialogue defeat each other. However, preference information may only become available after the dialogue has terminated. Hence, in this paper, we describe dialogues conducted under the assumption of an attack relation that does not account for preferences. We then describe how the resultant dialogue graph can be pruned by a preference relation in order to determine whether the winner of the dialogue is still the winner given the newly available preference information. We also describe a class of protocols that account for subsequent pruning by a preference relation, and show that under a restriction on the pruning, if the player defending the dialogue's main topic is winning the dialogue, then (s)he remains the winner irrespective of the preference relation applied.
An adaptive SPH method for strong shocks
Authors: Leonardo Di G. Sigalotti, Hender López, Leonardo Trujillo
Venue: Journal of Computational Physics (2009)

We propose an alternative SPH scheme to usual SPH Godunov-type methods for simulating supersonic compressible flows with sharp discontinuities. The method relies on an adaptive density kernel estimation (ADKE) algorithm, which allows the width of the kernel interpolant to vary locally in space and time so that the minimum necessary smoothing is applied in regions of low density. We have performed a von Neumann stability analysis of the SPH equations for an ideal gas and derived the corresponding dispersion relation in terms of the local width of the kernel. Solution of the dispersion relation in the short wavelength limit shows that stability is achieved for a wide range of the ADKE parameters. Application of the method to high Mach number shocks confirms the predictions of the linear analysis. Examples of the resolving power of the method are given for a set of difficult problems, involving the collision of two strong shocks, the strong shock-tube test, and the interaction of two blast waves.
Foundations of Directed Mutation
Authors: Stefan Berlik, Bernd Reusch
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

Directed mutation abandons the so-called random mutation hypothesis postulating mutations to occur at random, regardless of fitness consequences to the resulting offspring. By introducing skewness into the mutation operators, bigger portions of offspring can be created in the area of higher fitness with respect to the elder and thus promising directions of the evolution path can be favored. The aim of this work is to present the foundations of directed mutation as well as different operators in one single place. Their characteristics will be presented and their advantages and disadvantages are discussed. Furthermore, an application scenario will be presented that shows how evolutionary algorithm and directed mutation can be applied in engineering design. In addition, some experimental results solving a real world optimization task in this scenario are provided. Finally some first, preliminary results of a multivariate skew distribution as mutation operator in a covariance matrix adaptation algorithm will be presented.
Monetary mechanism to propagate macroeconomics policies
Authors: Stefan Alexandru Ionescu, Andreea Raluca Voicu, Alexandru Ionescu
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

As concerns the process to traverse the macroeconomics analysis reasoning of the budgetary earnings and expenses, there shall be crossed the phases whose target consists in defining and understanding the "the balanced production" term. The issue of the consequences generated by the increase of the real quantity of money on the interest rate from the transmission mechanism point of view is by means of the monetary policy management mechanism that the National Bank shall control the money stock as an independent variable, and, consequently, shall also control the interest rate and the available income as associate variables. The multiplier modelling process can make it possible to render evident a possible interaction between the central bank and the other banks as concerns the money offer. This interaction implies an adjustment mechanism that consists in re-defining the monetary base, in reformulating the multiplier, and in studying the money - credit relationship.
An informational approach to the global optimization of expensive-to-evaluate functions
Authors: Julien Villemonteix, Emmanuel Vazquez, Eric Walter
Venue: Journal of Global Optimization (2009)

In many global optimization problems motivated by engineering applications, the number of function evaluations is severely limited by time or cost. To ensure that each evaluation contributes to the localization of good candidates for the role of global minimizer, a sequential choice of evaluation points is usually carried out. In particular, when Kriging is used to interpolate past evaluations, the uncertainty associated with the lack of information on the function can be expressed and used to compute a number of criteria accounting for the interest of an additional evaluation at any given point. This paper introduces minimizers entropy as a new Kriging-based criterion for the sequential choice of points at which the function should be evaluated. Based on stepwise uncertainty reduction, it accounts for the informational gain on the minimizer expected from a new evaluation. The criterion is approximated using conditional simulations of the Gaussian process model behind Kriging, and then inserted into an algorithm similar in spirit to the Efficient Global Optimization (EGO) algorithm. An empirical comparison is carried out between our criterion and expected improvement, one of the reference criteria in the literature. Experimental results indicate major evaluation savings over EGO. Finally, the method, which we call IAGO (for Informational Approach to Global Optimization), is extended to robust optimization problems, where both the factors to be tuned and the function evaluations are corrupted by noise.