ppxscal/embedding_network huggingface dataset:
Counting Functions for the k-Error Linear Complexity of 2n-Periodic Binary Sequences
Authors: Ramakanth Kavuluru, Andrew Klapper
Venue: Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14-15, Revised Selected Papers (2009)

Linear complexity is an important measure of the cryptographic strength of key streams used in stream ciphers. The linear complexity of a sequence can decrease drastically when a few symbols are changed. Hence there has been considerable interest in the k-error linear complexity of sequences which measures this instability in linear complexity. For 2 n -periodic sequences it is known that minimum number of changes needed per period to lower the linear complexity is the same for sequences with fixed linear complexity. In this paper we derive an expression to enumerate all possible values for the k-error linear complexity of 2 n -periodic binary sequences with fixed linear complexity L, when k equals the minimum number of changes needed to lower the linear complexity below L. For some of these values we derive the expression for the corresponding number of 2 n -periodic binary sequences with fixed linear complexity and k-error linear complexity when k equals the minimum number of changes needed to lower the linear complexity. These results are of importance to compute some statistical properties concerning the stability of linear complexity of 2 n -periodic binary sequences.
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Authors: Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, Hui Xiong
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses a query to this sensor database, the query will be disseminated across the database. During this process, each sensor generates data that match the query from its covered area and then returns the data to the original sensor. In order to achieve an energy-efficient implementation, it will be useful to select a minimally sufficient subset of sensors to keep active at any given time. Thus, how to find a subset efficiently is an important problem for sensor database system. We define this problem as sensor database coverage (SDC) problem.In this paper, we reduce the SDC problem to connected set cover problem, then present two approximation algorithms to select a minimum connected set cover for a given sensor database. Moreover, to guarantee robustness and accuracy, we require a fault-tolerant sensor database, which means that each target in a query region will be covered by at least m sensors, and the selected sensors will form a k-connected subgraph. We name this problem as (k,m)-SDC problem and design another approximation algorithm. These three algorithms are the first approximation algorithms with guaranteed approximation ratios to SDC problem. We also provide simulations to evaluate the performance of our algorithms. We compare the results with algorithms in [17]. The comparison proves the efficiency of our approximations. Thus, our algorithms will become a new efficient approach to solve coverage problem in sensor database systems.
Modeling Human Actors in an Intelligent Automated Warehouse
Authors: Davy Preuveneers, Yolande Berbers
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

Warehouse automation has progressed at a rapid pace over the last decade. While the tendency has been to implement fully automated solutions, most warehouses today exist as a mixture of manually operated and fully automated material handling sections. In such a hybrid warehouse, men and machines move around goods in between sections in order to retrieve, transport and stack goods according to their nature and quantity. The biggest challenge in hybrid warehouses is to optimize the alignment of manual and automatic processes in order to improve the flow of materials between storage areas and distribution centers. Integrating individuals as human actors in an automation solution is not straightforward due to unpredictable human behavior. In this paper, we will investigate how we can model the characteristics of human actors within an automation solution and how software systems can unify human actors with automated business processes to coordinate both as first class entities for logistics activities within a hybrid warehouse.
Design of an Experimental System for Digital Circuit Fault Diagnosis Based on Support Vector Machine
Authors: Duan Xiusheng, Shan Ganlin, Zhang Qilong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

In order to combine the theory and practice of support vector machine (SVM) in the field of fault diagnosis,a novel universal experimental system for digital circuits’ fault diagnosis is designed for the application study of SVM. The circuit is simulated in FPGA and its input and output pins are assigned to the DO and DI channels automatically by matrix switch. The faults and test points can be set easily. The algorithms of SVM and test vector generation etc. can be carried out in different software modules. The overall design and experimentation are discussed in detail. A practical example is given also. The experimental system is very convenient for the study of SVM and the efficiency is improved observably.
Large Deviation on Random Sums for a Double Type-insurance Risk Model
Authors: XiaoLin Zhan, Li Yu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

A double-type-insurance risk model with heavy tails has been defined and studied. A further investigation into the large deviation on random sums under the distribution of dominated variation (D class) is presented in this paper.
Development of an adaptive response surface method for optimization of computation-intensive models
Authors: G. Steenackers, F. Presezniak, P. Guillaume
Venue: Computers and Industrial Engineering (2009)

In general, optimization techniques involve numerous repeated objective function evaluations. As a consequence, optimization times can become very large depending on the complexity of the model to be optimized. This manuscript describes the development of an adaptive response surface method for optimization of computation-intensive models, capable of reducing optimization times. The response model to be optimized is not built from a pre-defined number of design experiments but is adapted and refined during the optimization routine. Different approximation models are applicable in combination with the developed optimization technique. The proposed optimization technique is evaluated on a standard test problem as well as a finite element model design optimization with multiple parameters.
Operational Brain Dynamics: Data Fusion Technology for Neurophysiological, Behavioral, and Scenario Context Information in Operational Environments
Authors: Don M. Tucker, Phan Luu
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Classical laboratory studies of human performance have always required some form of data integration, such as the synchronization of stimulus display, behavioral accuracy, and reaction time. Studies of performance in operational environments have typically been limited in the precision of behavioral observations. As improved digital informatics have expanded the laboratory data acquisition from a few bytes to terabytes, there has been a similar expansion in both the opportunities and the challenges for data fusion.
Logical generative models for probabilistic reasoning about existence, roles and identity
Authors: David Poole
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description exists, the probability that some description refers to an object you know about or to a new object, or the probability that an object fulfils some role. Many interesting queries reduce to reasoning about the role of objects. Being able to talk about the existence of parts and sub-parts and the relationships between these parts, allows for probability distributions over complex descriptions. Rather than trying to define a new language, this paper shows how the integration of multiple objects, ontologies and roles can be achieved cleanly. This solves two main problems: reasoning about existence and identity while preserving the clarity principle that specifies that probabilities must be over well defined propositions, and the correspondence problem that means that we don't need to search over all possible correspondences between objects said to exist and things in the world.
FICO: web person disambiguation via weighted similarity of entity contexts
Authors: Paul Kalmar, Matthias Blume
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

Entity disambiguation resolves the many-to-many correspondence between mentions of entities in text and unique real-world entities. Fair Isaac's entity disambiguation uses language-independent entity context to agglomeratively resolve mentions with similar names to unique entities. This paper describes Fair Isaac's automatic entity disambiguation capability and assesses its performance on the SemEval 2007 Web People Search task.
Empower Mobile Workspaces by Wireless Networks and Wearable Computing
Authors: Michael Lawo, Otthein Herzog, Michael Boronowski, Peter Knackfuß
Venue: Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces (2009)

The concept of Wearable Computing can be used to support work processes of mobile workers e.g. in a factory environment or outdoors. The basis is a wireless network for an ubiquituous remote access to information. In the paper we explain the potential of Wearable Computing and focus on the technological challenges. During the last five years (2004 till 2009) the EC funded the worldwide largest project on Wearable Computing: wearIT@work (www.wearitatwork.com). The project did not focus on new technologies. However, with existing technologies new applications were developed. For new user groups of mobile workers a new quality of support had to be achieved. The paper reports at the end of the project on the main findings and lessons learned: An open hardware platform, an open software framework and for seven different application domains solutions were developed.
ProActive Caching - A Framework for Performance Optimized Access Control Evaluations
Authors: Mathias Kohler, Robert Fies
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Users expect that systems react instantly. This is specifically the case for user-centric workflows running in multi-layered enterprise system landscapes which demand fine-grained access control mechanisms and support for dynamic security policies. Thus, efficient evaluation of security policies becomes an important factor for the overall system performance. Caching approaches may help to address this issue.In previous work we introduced ProActive Caching as an approach that consists of two phases:first, in an offline phase, we automatically determine a workflow-specificheuristic for pre-computing and caching access decisions during a process execution.Second, in an online phase, we use the determined heuristic for thecache management. Hence, ProActive Caching provides a framework which is able topre-compute access decisions based on an offline analysis of the system. In this paper we present a demonstrator for this framework. It comprises atool for generating the workflow-specific heuristics, as well as a ProActive Caching enabled business process system which uses the generated heuristics forpre-computing access decisions during process execution. An additional performance monitor shows the performance increase of the system.
An agent model for the influence of culture on bargaining
Authors: Gert Jan Hofstede, Catholijn M. Jonker, Tim Verwaart
Venue: Proceedings of the 1st International Working Conference on Human Factors and Computational Models in Negotiation (2008)

Cross-cultural negotiation poses special challenges. In this paper an agent-based simulation model is presented that tackles these challenges. The model represents a trade network for a good with a hidden quality attribute. Agents have culture scripts that are based on Hofstede's dimensions of culture. They have visible group membership and status attributes that are used by their hidden cultural rules of behaviour. They bargain according to the ABMP bargaining model that has a utility function consisting of expected gain, quality, and risk. The paper presents the model and shows results of test runs. These test runs have face validity when compared with real negotiations. Formal tests of correspondence between the model and the trade game on which is it based have yet to be conducted. Extensions will make it a useful tool for training traders who engage in cross-cultural bargaining. The present version is helping to explain the behaviours of actors in international trade networks. It proves that Hofstede's dimensions can be used to generate agents that are believable negotiators.
An integrated robotic system for spatial understanding and situated interaction in indoor environments
Authors: Hendrik Zender, Patric Jensfelt, Óscar Martíinez Mozos, Geert-Jan M. Kruijff, Wolfram Burgard
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

A major challenge in robotics and artificial intelligence lies in creating robots that are to cooperate with people in human-populated environments, e.g. for domestic assistance or elderly care. Such robots need skills that allow them to interact with the world and the humans living and working therein. In this paper we investigate the question of spatial understanding of human-made environments. The functionalities of our system comprise perception of the world, natural language, learning, and reasoning. For this purpose we integrate state-of-the-art components from different disciplines in AI, robotics and cognitive systems into a mobile robot system. The work focuses on the description of the principles we used for the integration, including cross-modal integration, ontology-based mediation, and multiple levels of abstraction of perception. Finally, we present experiments with the integrated "CoSy Explorer" system and list some of the major lessons that were learned from its design, implementation, and evaluation.
Automatic Analysis of Fair Exchange Protocols in TLA
Authors: Nan Liu, Wei Xu, Yue-fei Zhu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Fair exchange protocols have been studied intensively in recent years. But a lot of methods are still performed manually. In this paper an automatic method is proposed for analyzing fair exchange protocols. In this method we formalize security properties of fairness and non-repudiation in TLA (temporal logic of action) and define common predicates to make the analysis automatic. An "end" rule is introduced to solve the different type of channels. Protocol of fair Zhou-Gollmann has been analyzed in our own implemented tool and an attack trace can be found.
Genetic Algorithm Rule Definition for Denial of Services Network Intrusion Detection
Authors: Yong Wang, Dawu Gu, Xiuxia Tian, Jing Li
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Many previous Genetic Algorithm methods can get much better example results in KDD cup 99 dataset. In the real intrusion detection system, the software needs update the rule even everyday. In this paper, we expand previous work and present a fitness function, propose an efficient rule generator for denial of services of network intrusion detection. We use more chromosomes with relevant features and more rule generator. As such, the rules generated by our algorithm are suitable to continuously changing misuse detection. In order to verify our approach, we tested our proposal with KDD Cup99 dataset, The experimental results show that the proposed approach is an efficient way in network intrusion detection.
A Small and Efficienct Hardware Implementation of the KASUMI
Authors: Ren Fang, Yan Ying-jian, Fu Xiao-bing
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

KASUMI is a block cipher with the Feistel network. This paper proposes a small and efficiency hardware implementation for the KASUMI block cipher, which is the core of the 3GPP confidentiality algorithm f8, and the 3GPP integrity algorithm f9. In designing the hardware, we focused on optimizing the implementation of FO/FI functions, which are the main components of KASUMI. We propose three methods for this optimization: using a loop-structure in the implementation to reducing the number of the FO/FI function, implementing S7 and S9-boxes in the combinational logic and optimization of extended key’s generation.
Designing a mobile task based UI for tourists
Authors: Lieve Laporte, Peter Eyckerman, Bieke Zaman
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Substantial research effort has been devoted to the design of mobile tourist guides. Although a lot of these guides already provide some naturalness and intelligence in the interaction with users, their user interfaces are mostly object-based. In this article we will argue that, due to the users' limited attention capacity and the great variety of tasks they have to perform on their trips, more emphasis should be put on the integration of tasks within the users' context of activity. Based on the preliminary results of a qualitative user & task analysis, we suggest concrete guidelines and a task hierarchy for a mobile tourist guide UI.
A Framework of Web-GIS for PCCP Risk Management System
Authors: Chunting Yang, Yang Liu, Jing Yu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

PCCP is usually used throughout many water and wastewater utilities as critical mains with high flow rates, sudden failures can have significant negative consequences. The world has experienced a number of failures of Prestressing Concrete Cylinder Pipe (PCCP) lines and as a result during the past ten years, much attention has been focused on reliably assessing the condition of PCCP mains. In this paper the framework of Web-GIS for PCCP risk management with wireless sensor network is proposed. Acoustic monitoring and comprehensive dynamic risk management modeling are important subsystem. It provides an assessment of remaining time to failure for each pipe segment. This strategy can provide the opportunity to identify problematic pipe sections and repair the pipe prior to failure, and also can assess the presence and extent of deterioration in these large-diameter water and wastewater pipelines.
A New Modified Accurate Genetic Algorithm for Multivariable Systems
Authors: Abdorreza Alavi Gharabagh, Ali Bakhshi, Smaiil Shojaee
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The A major problem in using mutation is how to choose the Probability of mutation. The uncertain nature of this parameter is a disadvantage in general GA methods. There is a critical unknown value for Pmute. Choosing Pmute above the critical value lead to high and also constant accuracy and the number of iterations increase, while smaller Pmute values result low accuracy and fewer iterations. There are few values for this parameter that guarantee answer accuracy with low iteration. In order to soften this problem we propose the modified mutation method. The proposed method has two major advantages in compare with simple mutation; first Pmute in this method is replaced with two new parameters (PStart and DeRate) which alleviate the problem of Pmute tuning. Second the answer accuracy in this algorithm is high but not constant similar to simple mutation methods. The maximum value of five multivariable sample functions is computed using both general and the proposed methods. Two important parameters, convergence rate and answer accuracy, are considered as factors to compare these methods. Results confirm effectiveness and robustness of the proposed method against general method.
Gasoline Blending Scheduling Based on Uncertainty
Authors: Xiaoqiang Zhao, Ying Wang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Blending is an important unit operation in process industry. Gasoline blending scheduling is nonlinear optimization problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization (PSO) algorithm is developed for nonlinear optimization problems with both continuous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results illustrate that the PSO algorithm is valid and effective for the gasoline blending scheduling problem under uncertainty.
The use of online bulletin boards by females in the Gulf Cooperation Council Countries
Authors: Ahmad A. Sharif, Ali A. Al-Kandari
Venue: Telematics and Informatics (2010)

This paper reports the outcomes of a study that investigated the responses of 380 females from the Gulf Cooperation Council Countries (GCCCs) to a questionnaire asking them to give their reasons for using online bulletin boards (OBBs). The study also examined the influence of OBBs on these females' attitudes to equal gender roles in social and familial settings. Principal components analysis indicated four factors among their reasons: manipulation, belonging, reciprocal exchange/expression, and autonomy. Regression tests revealed that nationality and the reciprocal exchange/expression reason were positively correlated with the endorsement of equal social gender roles, while manipulation and belonging reasons were negatively correlated with it. In addition, belonging and autonomy were negatively correlated with predicted endorsing equal familial gender roles. The study highlights the fact that, because females used the OBBs for reinforcement, attitudes are unlikely to be changed by their use. Finally, the paper concludes by inviting researchers to probe the influence of OBBs, drawing a distinction between affective and cognitive needs, as they may play different roles in predicting the impacts of OBBs.