ppxscal/embedding_network huggingface dataset:
Increasing Security of Mobile Devices by Decreasing User Effort in Verification
Authors: Elena Vildjiounaite, Satu-Marja Makela, Mikko Lindholm, Vesa Kyllonen, Heikki Ailisto
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Reliable user verification is important for security of computers and personal devices; however, most of well-performing verification methods require explicit user effort. As a consequence, an access is granted for a long time after the only successful verification, which allows replacing the authorized user to the advantage of an impostor, as it is often the case with mobile phones. This work proposes a method of frequent user verification, based on cascading of unobtrusive biometrics with more reliable biometrics, provided explicitly, in such a way that explicit effort is required only if unobtrusive verification fails. Experiments with voice, gait and fingerprint data have shown that in most of noise conditions cascade was able to satisfy security requirements of False Accept Rate 1% and to achieve overall False Reject Rate 3% or less, while requiring explicit effort in 10 - 60% of cases.
Atomic functions: Generalization to the multivariable case and promising applications
Authors: V. M. Kolodyazhny, V. A. Rvachov
Venue: Cybernetics and Systems Analysis (2007)

Main trends in the theory of atomic functions are outlined. These functions have been studied for more than 35 years and gave rise to new research areas in mathematical analysis, approximation theory, numerical methods, etc. Atomic functions are infinitely differentiable solutions with compact support to special functional-differential equations.
Hierarchical Node Clustering Approach for Energy Savings in WSNs
Authors: Siho Cha, Minho Jo, Jong-Eon Lee, Dae-Young Kim, Seokjoong Kang, Kuk-Hyun Cho, Nobok Lee, Younghyun Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

This paper proposes an energy efficient clustering algorithm for self-organizing and self-managing WSNs, called SNOWCLUSTER. It introduces region node selection as well as cluster head election based on the residual battery capacity of nodes to reduce the costs of managing sensor nodes and of the communication among them. SNOWCLUSTER clusters periodically to select cluster heads that are richer in residual energy level, compared to the other nodes to achieve load balancing and extend the lifetime of every individual sensor nodes. After the cluster heads are selected, SNOWCLUSTER selects the region nodes in the cluster heads based on the energy level of them and chooses gateway nodes between clusters based on their location information. The effectiveness of the proposed SNOWCLUSTER algorithm is validated through actual implementation and simulation using ns-2. The simulation results reveal that the proposed framework allows smaller energy consumption for network management and longer network lifetime than the existing schemes such as LEACH and LEACH-C for practical size networks.
Cooperative Particle Swarm Optimization for Steel Making Scheduling
Authors: Gao Huimin, Zeng Jianchao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

0-1 integer programming model of steel making scheduling was presented. Boolean algebra was applied to restrict the search space of Particle Swarm Optimization to 0-1 space. As for the difficulty of constraint problem of 0-1 integer programming, a Cooperative Particle Swarm Optimization(CPSO) algorithm was proposed, which embody two particle swarms, one's goal is to minimize the objective function, the other is to meet the constraint condition. Two particle swarms cooperate to solve the 0-1 integer programming problem. The CPSO algorithm has been applied to solve the steel making scheduling problem successfully.
Proposal for Improvement of GRASP Metaheuristic and Genetic Algorithm Using the Q-Learning Algorithm
Authors: Francisco Chagas de Lima, Jorge D. de Melo, Adriao Duarte D. Neto
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Currently many non-tractable considered problems have been solved satisfactorily through methods of approximate optimization called metaheuristic. These methods use non- deterministic approaches that find good solutions which, however, do not guarantee the determination of the global optimum. The success of a metaheuristic is conditioned its capacity to adequately alternate between exploration and exploitation of the solutions space. A way to guide such algorithms during the searching for better solutions is supplying them with more knowledge of the environment. This work proposes the use of a technique of Reinforce- ment Learning - Q-Learning Algorithm - for the construc- tive phase of GRASP metaheuristic and also as generator of the initial population for the Genetic Algorithm. The pro- posed methods will be applied to the symmetrical traveling salesman problem.
The Grid Resource BrokerWorkflow Engine
Authors: M. Cafaro, I. Epicoco, M. Mirto, D. Lezzi, G. Aloisio
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Increasingly, complex scientific applications are struc- tured in terms of workflows. These applications are usu- ally computationally and/or data intensive and thus are well suited for execution in grid environments. Distributed, ge- ographically spread computing and storage resources are made available to scientists belonging to Virtual Organiza- tions sharing resources across multiple administrative do- mains through established service-level agreements. Grids provide an unprecedented opportunity for distributed work- flow execution; indeed, many applications are well beyond the capabilities of a single computer, and partitioning the overall computation on different components whose execu- tion may benefit from runs on different architectures could provide better performances. In this paper we describe the design and implementation of the Grid Resource Bro- ker (GRB) Workflow engine.
An Immune Algorithm Based Node Scheduling Scheme of Minimum Power Consumption and No Collision for Wireless Sensor Networks
Authors: Weilian Xue, Zhongxian Chi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The wireless sensor network and artificial immune system are both self-managed distributed systems. This paper aims at finding a better solution to the global optimization problem of power consumption of the sensor network. First, this paper sums up the node scheduling scheme of minimum power consumption and no collision for wireless sensor network into the flexible scheduling problem. Then regard one data transmission at a certain moment as an antigen, and potential routes as antibody, and the power consumption by the node sequence as the fitness, respectively. Finally, the proposed algorithm eliminates the disabled nodes using the immune stabilization to reconstruct the network topology structure and builds the vaccine library by the secondary reaction of artificial immune. The simulation results show that the proposed algorithm can not only avoid the collision among sensor nodes when forwarding data packets, but also solve the global optimization problem of power consumption with fast convergence speed.
Design of novel two-layered fuzzy logic controller for plants with time-varying dead-zone and saturation characteristics
Authors: Seok-Yong Oh, Dong-Jo Park
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

A novel two-layered fuzzy logic controller (FLC) is designed for plants with unknown and/or time-varying dead-zone and saturation characteristics in their actuators. A dead-zone inverse to compensate for the dead-zone in the actuator is implemented by an inner-layered fuzzy logic controller. Automatically adjusted control resolution plays a key role as a fuzzy dead-zone inverse. An outer-layered controller compensates for the saturation using the integral anti-windup circuit, once the dead-zone is compensated by the inner-layered fuzzy logic controller. The developed fuzzy logic controller is applied to the plants with unknown dead-zone and saturation characteristics for ensuring their effectiveness even though the dead-zone characteristics are time-varying.
Community, consensus, coercion, control: cs*w or how policy mediates mass participation
Authors: Travis Kriplean, Ivan Beschastnikh, David W. McDonald, Scott A. Golder
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

When large groups cooperate, issues of conflict and control surface because of differences in perspective. Managing such diverse views is a persistent problem in cooperative group work. The Wikipedian community has responded with an evolving body of policies that provide shared principles, processes, and strategies for collaboration. We employ a grounded approach to study a sample of active talk pages and examine how policies are employed as contributors work towards consensus. Although policies help build a stronger community, we find that ambiguities in policies give rise to power plays. This lens demonstrates that support for mass collaboration must take into account policy and power.
Integrating user and group preferences for top-k search from distributed web resources
Authors: Alan Eckhardt, Jaroslav Pokorny, Peter Vojtas
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We discuss models of user and group preferences in social networks and the Semantic web. We construct a model for user and group preference querying over RDF data as well as for ordering of answers by aggregation of particular attribute ranking. We have implemented our methods and heuristics into the Tokaf middleware framework prototype. We describe also experiments with Tokaf.
Learning Locality Discriminating Indexing for Text Categorization
Authors: Jiani Hu, Weihong Deng, Jun Guo, Weiran Xu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper introduces a locality discriminating indexing (LDI) algorithm for text categorization. The LDI algorithm offers a manifold way of discriminant analysis. Based on the hypothesis that samples from different classes reside in class-specific manifold structures, the algorithm depicts the manifold structures by a nearest-native graph and a invader graphs. And a new locality discriminant criterion is pro- posed, which best preserves the within-class local struc- tures while suppresses the between-class overlap. Using the notion of the Laplacian of the graphs, the LDI algo- rithm finds the optimal linear transformation by solving the generalized eigenvalue problem. The feasibility of the LDI algorithm has been successfully tested in text categorization using 20NG and Reuters-21578 databases. Experiment re- sults show LDI is an effective technique for document mod- eling and representations for classification.
Some vector optimization problems in Banach spaces with generalized convexity
Authors: Guolin Yu, Sanyang Liu
Venue: Computers Mathematics with Applications (2007)

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. New classes of generalized type-I functions are introduced for functions between Banach spaces. Based upon these generalized type-I functions, we obtain a few sufficient optimality conditions and prove some results on duality.
Fast communication: Cepstral domain interpretations of line spectral frequencies
Authors: Hong Kook Kim, Seung Ho Choi
Venue: Signal Processing (2008)

In this paper, we derive a relationship between a linear prediction (LP) polynomial and its corresponding line spectral frequencies (LSFs) in cepstral domain. We first obtain the cepstral representations of the symmetric and the antisymmetric polynomials constructed from the LP polynomial. The sum of these cepstra corresponds to the pseudo-cepstrum [H.K. Kim, S.H. Choi, H.S. Lee, On approximating line spectral frequencies to LPC cepstral coefficients, IEEE Trans. Acoust. Speech Audio Process. 8(2) (2000) 195-199]. Finally, LSFs can be computed by matching these two cepstra. Additionally, we derive the recursive relations between LSFs and the LPC coefficients, as well as between LSFs and LPC cepstral coefficients.
Forming neural networks through efficient and adaptive coevolution
Authors: David E. Moriarty, Risto Miikkulainen
Venue: Evolutionary Computation (1997)

This article demonstrates the advantages of a cooperative, coevolutionary search in difficult control problems. The symbiotic adaptive neuroevolution (SANE) system coevolves a population of neurons that cooperate to form a functioning neural network. In this process, neurons assume different but overlapping roles, resulting in a robust encoding of control behavior. SANE is shown to be more efficient and more adaptive and to maintain higher levels of diversity than the more common network-based population approaches. Further empirical studies illustrate the emergent neuron specializations and the different roles the neurons assume in the population.
Survey of Improving K-Nearest-Neighbor for Classification
Authors: Liangxiao Jiang, Zhihua Cai, Dianhong Wang, Siwei Jiang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

KNN ( k-nearest-neighbor) has been widely used as an effective classification model. In this paper, we summa- rize three main shortcomings confronting KNN and single out three main methods for overcoming its three shortcom- ings. Keeping to these methods, we try our best to survey some improved algorithms and experimentally tested their effectiveness. Besides, we discuss some directions for fu- ture study on KNN.
Switched seesaw control for the stabilization of underactuated vehicles
Authors: A. Pedro Aguiar, João P. Hespanha, António M. Pascoal
Venue: Automatica (Journal of IFAC) (2007)

This paper addresses the stabilization of a class of nonlinear systems in the presence of disturbances, using switching controllers. To this effect we introduce two new classes of switched systems and provide conditions under which they are input-to-state practically stable (ISpS). By exploiting these results, a methodology for control systems design-called switched seesaw control-is obtained that allows for the development of nonlinear control laws yielding input-to-state stability. The range of applicability and the efficacy of the methodology proposed are illustrated via two nontrivial design examples. Namely, stabilization of the extended nonholonomic double integrator (ENDI) and stabilization of an underactuated autonomous underwater vehicle (AUV) in the presence of input disturbances and measurement noise.
Toward a Theory of Problem Solving Based on Resource Bounded Computation and Process Algebras
Authors: Eugene Eberbach
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In 1995 Russell and Norvig presented a unified approach to AI as the area based on bounded rational agents using utilities to direct search for problem solving under bounded resources. This paper extends this work further in the direc- tion of the computational theory targeting intractable and undecidable problems and based on resource bounded com- putation and process algebras.
Solving the one-dimensional bin packing problem with a weight annealing heuristic
Authors: Kok-Hua Loh, Bruce Golden, Edward Wasil
Venue: Computers and Operations Research (2008)

In this paper, we develop a new procedure that uses the concept of weight annealing to solve the one-dimensional bin packing problem. Our procedure is straightforward and easy to follow. We apply it to 1587 instances taken from benchmark problem sets and compare our results to those found in the literature. We find that our procedure produces very high-quality solutions very quickly and generates several new optimal solutions.
Searching for extensible Korobov rules
Authors: Hardeep S. Gill, Christiane Lemieux
Venue: Journal of Complexity (2007)

Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209-215; F.J. Hickernell, H.S. Hong, P. L'Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117-1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286-300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L'Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117-1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of ''good'' extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L'Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117-1138].
Particle Swarm Algorithm for Weighted Rectangle Placement
Authors: Yi-Chun Xu, Ren-Bin Xiao, Martyn Amos
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper we present a new algorithm for a layout optimization problem: this concerns the placement of rect- angular, weighted objects inside a circular container, the two objectives being to minimize imbalance of mass and to minimize the radius of the container. This problem carries real practical significance in industrial applications (such as the design of satellites), as well as being of significant theoretical interest. Previous work has dealt almost exclu- sively with purely circular objects, but here we deal with the much more realistic case where objects are rectangular. We present a particle swarm-based solution and compare it with the best published algorithm for this problem. Exper- imental results show that our approach out-performs this existing method in terms of both solution quality and execu- tion time.
Speech Emotion Recognition in E-learning System Based on Affective Computing
Authors: Wu Li, Yanhui Zhang, Yingzi Fu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Aiming at emotion deficiency in present E-learning system, a lot of negative effects were analyzed and corresponding countermeasures were proposed In this paper we combined affective computing with the traditional E-learning system. The model of E-learning system based on affective computing was constructed by using speech emotion, which took speech feature as input data. Our simulation experiment results show that neural networks is effective in emotion recognition, and we achieved a recognition rate of approximately 50% when testing eight emotions. Other key techniques of realizing the system such as tracking the change of emotion state and adjusting teaching strategies were also introduced in addition.
POLYPHONET: An advanced social network extraction system from the Web
Authors: Yutaka Matsuo, Junichiro Mori, Masahiro Hamasaki, Takuichi Nishimura, Hideaki Takeda, Koiti Hasida, Mitsuru Ishizuka
Venue: Web Semantics: Science, Services and Agents on the World Wide Web (2007)

Social networks play important roles in the Semantic Web: knowledge management, information retrieval, ubiquitous computing, and so on. We propose a social network extraction system called POLYPHONET, which employs several advanced techniques to extract relations of persons, to detect groups of persons, and to obtain keywords for a person. Search engines, especially Google, are used to measure co-occurrence of information and obtain Web documents. Several studies have used search engines to extract social networks from the Web, but our research advances the following points: first, we reduce the related methods into simple pseudocodes using Google so that we can build up integrated systems. Second, we develop several new algorithms for social network mining such as those to classify relations into categories, to make extraction scalable, and to obtain and utilize person-to-word relations. Third, every module is implemented in POLYPHONET, which has been used at four academic conferences, each with more than 500 participants. We overview that system. Finally, a novel architecture called Iterative Social Network Mining is proposed. It utilizes simple modules using Google and is characterized by scalability and relate-identify processes: identification of each entity and extraction of relations are repeated to obtain a more precise social network.
Creating Explicit Communication in SoC Models Using Interactive Re-Coding
Authors: Pramod Chandraiah, Junyu Peng, Rainer Domer
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Communication exploration has become a critical step during SoC design. Researchers in the CAD community have proposed fast and efficient techniques for comprehensive design space exploration to expedite this critical design step. Although these advances have been helpful in reducing the design time significantly, the overall design time of the system is still a bottleneck. All these techniques assume the availability of an initial SoC input model with explicit communication, whose quality significantly impacts the effectiveness of the communication exploration techniques. Today, these initial models need to be manually written by engineers, which is tedious, error-prone and time consuming. In fact, our studies on industrial-size examples have shown that about 50% of the communication exploration time is spent on coding and re-coding of the initial specification model. In this paper, we propose an efficient interactive approach to explicit communication creation by automating some of the common coding tasks in specification models for communication exploration. Our results show significant savings in designer time. *This work was supported in part by Nicholas Endowment through the Henry T. Nicholas III Research Fellowship.