ppxscal/embedding_network huggingface dataset:
High Dimensional Multi-objective Grey Optimization of Planetary Gears Type AA with Hybrid Discrete Variables
Authors: Youxin Luo, Degang Liao
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

The Optimal design of planetary gears is a problem with high dimensional multi-objective and with complicated calculations & constraints et al. A general method for high dimensional multi-objective optimal design is presented based on degree of grey incidence with hybrid discrete variables. Using grey degree of improved absolute incidence, multi-objective optimization design can be convened to single objective optimization. The method could reasonably deal with value adopting problems of hybrid discrete variables in optimization design. A chaos emigration operator is introduced for carrying out improvement on the fundamental genetic algorithm, and the grey compound genetic algorithmic program GSCHGA for the multi-objective optimization of hybrid discrete variables is developed. The high dimensional multi-objective optimal design example of planetary gears type AA design shows that this algorithm has no special requirements on the characteristics of optimal designing problems, it has a fairly good universal adaptability and a reliable operation of program with a strong ability of overall convergence.
Uniform design over general input domains with applications to target region estimation in computer experiments
Authors: S. C. Chuang, Y. C. Hung
Venue: Computational Statistics Data Analysis (2010)

The power of uniform design (UD) has received great attention in the area of computer experiments over the last two decades. However, when conducting a typical computer experiment, one finds many non-rectangular types of input domains on which traditional UD methods cannot be adequately applied. In this study, we propose a new UD method that is suitable for any type of design area. For practical implementation, we develop an efficient algorithm to construct a so-called nearly uniform design (NUD) and show that it approximates very well the UD solution for small sizes of experiment. By utilizing the proposed UD method, we also develop a methodology for estimating the target region of computer experiments. The methodology is sequential and aims to (i) provide adaptive models that predict well the output measures related to the experimental target; and (ii) minimize the number of experimental trials. Finally, we illustrate the developed methodology on various examples and show that, given the same experimental budget, it outperforms other approaches in estimating the prespecified target region of computer experiments.
Complexity: A Guided Tour
Authors: Melanie Mitchell
Venue:  (2009)

What enables individually simple insects like ants to act with such precision and purpose as a group? How do trillions of individual neurons produce something as extraordinarily complex as consciousness? What is it that guides self-organizing structures like the immune system, the World Wide Web, the global economy, and the human genome? These are just a few of the fascinating and elusive questions that the science of complexity seeks to answer. In this remarkably accessible and companionable book, leading complex systems scientist Melanie Mitchell provides an intimate, detailed tour of the sciences of complexity, a broad set of efforts that seek to explain how large-scale complex, organized, and adaptive behavior can emerge from simple interactions among myriad individuals. Comprehending such systems requires a wholly new approach, one that goes beyond traditional scientific reductionism and that re-maps long-standing disciplinary boundaries. Based on her work at the Santa Fe Institute and drawing on its interdisciplinary strategies, Mitchell brings clarity to the workings of complexity across a broad range of biological, technological, and social phenomena, seeking out the general principles or laws that apply to all of them. She explores as well the relationship between complexity and evolution, artificial intelligence, computation, genetics, information processing, and many other fields. Richly illustrated and vividly written, Complexity: A Guided Tour offers a comprehensive and eminently comprehensible overview of the ideas underlying complex systems science, the current research at the forefront of this field, and the prospects for the field's contribution to solving some of the most important scientific questions of our time.
Digital Photographer's New Guide to Photoshop Plug-Ins
Authors: Jim Zuckerman, Scott Stulberg
Venue:  (2009)

Photoshop users who havent been working with plug-ins havent been taking full advantage of the programs creative and technical potential, from advanced digital art and photo effects to support for varied file types. But finding the right ones online could be time-consuminguntil now. For this handy reference, Jim Zuckerman has done the legwork, describing and test driving many plug-ins for a variety of functions, as well as recommending the very best options currently available on the market. New Photoshop owners, experienced digital artists, and pro photographers will all find recommendation to make their tasks in Photoshop quicker, easier, and more fun.
Tree Paths: A New Model for Steering Behaviors
Authors: Rafael Araújo Rodrigues, Alessandro Lima Bicho, Marcelo Paravisi, Cláudio Rosito Jung, Léo Pini Magalhães, Soraia Raupp Musse
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

This paper describes a model for generating steering behaviors of groups of characters based on the biologically-motivated space colonization algorithm. This algorithm has been used in the past for generating leaf venation patterns and tree structures, simulating the competition for space between growing veins or branches. Adapted to character animation, this model is responsible for the motion control of characters providing robust and realistic group behaviors by adjusting just a few parameters. The main contributions are related with the robustness, flexibility and simplicity to control groups of characters.
Adaptation patterns in systems for scripted collaboration
Authors: Anastasios Karakostas, Stavros Demetriadis
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This work presents a prototype method (DeACS) for identifying useful adaptation patterns to be embedded in systems for adaptive collaboration scripting. Collaboration scripts are didactic scenarios that guide and support the collaborative learning activity while adaptive collaboration scripting is the idea that computer-supported collaboration scripts can be adapted during run time, to provide learning experiences tailored to individual and group characteristics. An adaptation pattern is described as a well-defined adaptation process that can be initiated by the system when specific conditions are identified during script implementation. In order to model the proposed method twelve postgraduate students were engaged in a pyramid-type collaboration script and the analysis of the learning experience provided the basis for identifying a number of possible adaptation patterns. The paper discusses also next steps for advancing the design and evaluation of adaptation patterns in systems for scripted collaboration.
The K-CMA Algorithm for Solving Multi-modal Function Optimization Problems
Authors: Li Meiyi, Wu Qiong, You Wei
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Multi-modal function optimization must be solved when people meet with complex reality problems. With resort to the prominent search performance of CMA-ES and clustering theory, a new algorithm--K-CMA algorithm was presented. By searching local peaks and global peaks of four multi-modal functions, it can be seen from the results that this algorithm has a better result in convergence of algorithm and success rate.
A new approach to the periodicity lemma on strings with holes
Authors: W. F. Smyth, Shu Wang
Venue: Theoretical Computer Science (2009)

We first give an elementary proof of the periodicity lemma for strings containing one hole (variously called a ''wild card'', a ''don't-care'' or an ''indeterminate letter'' in the literature). The proof is modelled on Euclid's algorithm for the greatest common divisor and is simpler than the original proof given in [J. Berstel, L. Boasson, Partial words and a theorem of Fine and Wilf, Theoret. Comput. Sci. 218 (1999) 135-141]. We then study the two-hole case, where our result agrees with the one given in [F. Blanchet-Sadri, Robert A. Hegstrom, Partial words and a theorem of Fine and Wilf revisited, Theoret. Comput. Sci. 270 (1-2) (2002) 401-419] but is more easily proved and enables us to identify a maximum-length prefix or suffix of the string to which the periodicity lemma does apply. Finally, we extend our result to three or more holes using elementary methods, and state a version of the periodicity lemma that applies to all strings with or without holes. We describe an algorithm that, given the locations of the holes in a string, computes maximum-length substrings to which the periodicity lemma applies, in time proportional to the number of holes. Our approach is quite different from that used by Blanchet-Sadri and Hegstrom, and also simpler.
Preserving Privacy in Time Series Data Classification by Discretization
Authors: Ye Zhu, Yongjian Fu, Huirong Fu
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

In this paper, we propose discretization-based schemes to preserve privacy in time series data mining. Traditional research on preserving privacy in data mining focuses on time-invariant privacy issues. With the emergence of time series data mining, traditional snapshot-based privacy issues need to be extended to be multi-dimensional with the addition of time dimension. In this paper, we defined three threat models based on trust relationship between the data miner and data providers. We propose three different schemes for these three threat models. The proposed schemes are extensively evaluated against public-available time series data sets [1]. Our experiments show that proposed schemes can preserve privacy with cost of reduction in mining accuracy. For most data sets, proposed schemes can achieve low privacy leakage with slight reduction in classification accuracy. We also studied effect of parameters of proposed schemes in this paper.
Analysis on Market Characteristics and Competition Strategy of Online Games in China
Authors: Xiaobo You, Shan Zou, Junjie Zhong
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The market of online game is specified with network externalities, we analyze the market characteristics of it in China from the view of network economic; furthermore, we put forward the predominant strategy as well as the strategies to influence expectation of consumer, to increase number of users and to lock-in. The proposition of these strategies and the corresponding analyses are of practical significance to promote the online game industry in China.
Python: the tutorial
Authors: Michael P. Rogers
Venue: Journal of Computing Sciences in Colleges (2009)

Over the years, programming languages have grown more powerful, but correspondingly more complex; and while that complexity is fine and appropriate for professional programmers, it hinders and discourages beginning Computer Science students.
Influence on Rainfall Run-Off Due to Urbanization in Wuhan City of China
Authors: Liu Di, Qin Chaoqian
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

By analyzing the impacts on the runoff of rain flood by the change of land utilization types, this paper gained the results on the dramatic change in the substrate surface during the urbanization process in Wuhan: Because of the urbanization of Wuhan city, the staunch ground is increasing, the rainfall of the city zone is increasing, and it increasing the runoff coefficient, shortening the influx time, increasing the peak discharge, bringing forward the flood peak. Then the paper targeted the concrete situation of flood and waterlogs disasters in Wuhan and pointed out the measures on reduction of rain flood disaster.
Contrast Enhancing Colour to Grey
Authors: Ali Alsam
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

A spatial algorithm to convert colour images to greyscale is presented. The method is very fast and results in increased local and global contrast. At each image pixel, three weights are calculated. These are defined as the difference between the blurred luminance image and the colour channels: red, green and blue. The higher the difference the more weight is given to that channel in the conversion. The method is multi-resolution and allows the user to enhance contrast at different scales. Results based on three colour images show that the method results in higher contrast than luminance and two spatial methods: Socolinsky and Wolff [1,2] and Alsam and Drew [3].
Encephalic NMR Tumor Diversification by Textural Interpretation
Authors: Danilo Avola, Luigi Cinque
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

The novel technologies used in different application domains allow to obtain digital images with a high complex informative content. These meaningful information are expressed by textural skin that covers the objects represented inside the images. The textural information can be exploited to interpret the semantic meaning of the images themselves. This paper provides a mathematical characterization, based on texture analysis, of the craniopharyngioma pathology distinguishing it from other kinds of primary cerebral tumors. By this characterization a prototype has been developed, which has primarily allowed to identify potential abnormal masses inside the cerebral tissue and subsequently to possibly classify them as craniopharyngiomas.
Inside-Out OLSR Scalability Analysis
Authors: David Palma, Marilia Curado
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

The ideal network size for the Optimized Link-State Routing Protocol (OLSR) was determined taking into account several parameters, providing concrete and innovative foundations for future clustering solutions much required for Large Scale MANETs. An extensive simulation study was performed on small scale wireless networks, using the OPNET Modeler Wireless Suite, considering the OLSR protocol routing scalability. The obtained results revealed a good performance for up to 70 nodes with moderate node mobility and with no more than 16 traffic flows.
Assessment of Groundwater Vulnerability to Contamination Using Capture Zone Delineation in Shenzhen City, China
Authors: Chiha Aida, Aiguo Zhou, Jianwei Zhou, ShaoGang Dong
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

As a result of the large risk associated with the contamination of aquifers, it becomes imperative to protect groundwater supply areas. One of the practical methods that is projected for the protection of aquifers is to zone a boundary around current production in order to control hazardous industrial practices close to the wells supply. Nanping Highway is proposed to be constructed over a mineral groundwater source area in Shenzhen city Guangdong Province in southern China. Using concrete pouring of Portland cement as a main component in Highway road structure does not interfere as a part of pollutants, so it has no impact on groundwater quality by its composition. However, rainwater run-off is often heavily contaminated by vehicles wear, brake wear, lubricants spillage and/or tyre debris which might discharge on both sides of the road and causes groundwater contamination. In this study two particle tracking simulations were performed using MODFLOW and MODPATH to analyze the long term effect of contamination from the base of the highway road. Model results show the vulnerability of the pumping wells to pollution. However because MODPATH program doesn’t take dispersive and chemical reactions processes during the flow of contaminant, this results indicate the worst scenario, so the contamination may be not significant to cause serious problem.
A camera-based tangible controller for cellular phones
Authors: Haruhisa Kato, Tsuneo Kato
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

This paper proposes a novel easy-to-use camera-based tangible controller for cellular phone applications. It realizes continuous analog input by tracking a marker at the top end of a controller device attached to the embedded camera. In contrast to the conventional keypad which enables limited operability to four discrete directions, the proposed controller brings not only an unconstrained continuous input to arbitrary directions but also continuous input for depth and for a rotation angle. In order to evaluate operability, we conducted a user experiment of time trial for path tracing, and the results showed that the subjects completed the task with the proposed controller in 27.9% less than with the conventional keypad input.
Performing Bayesian inference by weighted model counting
Authors: Tian Sang, Paul Bearne, Henry Kautz
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Over the past decade general satisfiability testing algorithms have proven to be surprisingly effective at solving a wide variety of constraint satisfaction problem, such as planning and scheduling (Kautz and Selman 2003). Solving such NP-complete tasks by "compilation to SAT" has turned out to be an approach that is of both practical and theoretical interest. Recently, (Sang et al. 2004) have shown that state of the art SAT algorithms can be efficiently extended to the harder task of counting the number of models (satisfying assignments) of a formula, by employing a technique called component caching. This paper begins to investigate the question of whether "compilation to model-counting" could be a practical technique for solving real-world #P-complete problems, in particular Bayesian inference. We describe an efficient translation from Bayesian networks to weighted model counting, extend the best model-counting algorithms to weighted model counting, develop an efficient method for computing all marginals in a single counting pass, and evaluate the approach on computationally challenging reasoning problems.
Implementing reliable event streams in large systems via distributed data flows and recursive delegation
Authors: Krzysztof Ostrowski, Ken Birman, Danny Dolev, Chuck Sakoda
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Strong reliability properties, such as state machine replication and virtual synchrony, are hard to implement in a scalable manner. They are typically expressed in terms of global membership views. However, global membership is non-scalable. We propose a new way of modeling protocols that does not rely on global membership. Our approach is based on the concept of a distributed data flow, a set of events distributed in space and time. We model protocols as networks of such flows, constructed through recursive delegation. The resulting system uses multiple small membership services instead of a single global service while still supporting stronger properties. This paper focuses on the theoretical model and its base properties; in particular, on the concept of monotonic aggregation. We present a high-level architecture overview and initial performance results.
The Application and Research of Noise Data Acquisition with Wireless Network
Authors: Sen Bai, Xiang Li, ZuDian Qin, Li Zhu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The paper applied the data acquisition technology based on wireless network to noise automatic monitoring, combined with the hot issue of remote data transmission, explored and researched the noise data acquisition technique in the environment acoustic GIS management system of Wuhan. And it designed and realized the encapsulation format of the sending data, stored the data into the database of remote Server by using GPRS to connect the Internet, and then implemented the real-time display of the noise data with programming. The paper provides a new method for environmental planning, monitoring, decision support and scientific evaluation, and it has very important reference value for environmental monitoring.
Cost-Effective Heuristics for Grid Workflow Scheduling Based on Segment Leveling
Authors: Hao Long, Di Rui-Hua, Huang Ming-He
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Grid technology is popular in science and business computing environment, with workflow the flexibility and applicability of the grid system can be greatly enhanced. Cost-effective scheduling of grid workflow applications represented by DAG(Directed Acyclic Graph)is an essential and complex problem. In general such problem is NP-hard. In this paper, a novel heuristics, DSL(Deadline Segment Leveling) is proposed. Considering its parallel and synchronization properties, the grid workflow application is divided into segments, and each segment is partitioned into groups further using a segment leveling method. The floating time is prorated to each group to enlarge group duration. In term of control dependencies between tasks, time interval for each task is determined. Experimental results shows DSL can achieve considerable performance improvement than MCP(Minimal Critical Path) and other leveling-based heuristics.
Multiple agent event detection and representation in videos
Authors: Asaad Hakeem, Mubarak Shah
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

We propose a novel method to detect events involving multiple agents in a video and to learn their structure in terms of temporally related chain of sub-events. The proposed method has three significant contributions over existing frameworks. First, in order to learn the event structure from training videos. we present the concept of a video event graph, which is composed of temporally related sub-events. Using the video event graph, we automatically encode the event dependency graph. The event dependency graph is the learnt event model that depicts the frequency of occurrence of conditionally dependent sub-events. Second. we pose the problem of event detection in novel videos as clustering the maximally correlated sub-events, and use normalized cuts to determine these clusters. The pIincipal assumption made in this work is that the events are composed of highly correlated chain of sub-events. that have high weights (association) within the cluster and relatively low weights (disassociation) between clusters. These weights (between sub-events) are the likelihood estimates obtained from the event models. Last, we recognize the importance of representing the variations in the temporal order of sub-events. occurring in an event, and encode the probabilities directly into our representation. We show results of our learning, detection, and representation of events for videos in the meeting, surveillance, and railroad monitoring domains.