ppxscal/embedding_network huggingface dataset:
Fuzzy boundary layer tuning for sliding mode systems as applied to the control of a direct drive robot
Authors: Kemalettin Erbatur, Berk &#x00c7;all&#x0131;
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Chattering in the control signal is a significant problem in sliding mode control (SMC). The boundary layer approach is one of the many modifications proposed in the literature to avoid the chattering. In this approach, instead of the discontinuous SMC, a continuous feedback control law is employed in a boundary layer around the sliding surface. The thickness of the boundary layer is an important design parameter. This paper proposes a fuzzy online tuning method to adjust the boundary layer thickness for the best system performance without chattering. The method features the measurement of the chattering in the control signal. The paper validates the performance of the algorithm by experiments on a direct drive robot with a range of different payloads.
Finding the Hidden Pattern of Credit Card Holder's Churn: A Case of China
Authors: Guangli Nie, Guoxun Wang, Peng Zhang, Yingjie Tian, Yong Shi
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

In this paper, we propose a framework of the whole process of churn prediction of credit card holder. In order to make the knowledge extracted from data mining more executable, we take the execution of the model into account during the whole process from variable designing to model understanding. Using the Logistic regression, we build a model based on the data of more than 5000 credit card holders. The tests of model perform very well.
Nasal Region-Based 3D Face Recognition under Pose and Expression Variations
Authors: Hamdi Dibeklioğlu, Berk Gökberk, Lale Akarun
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

In this work, we propose a fully automatic pose and expression invariant part-based 3D face recognition system. The proposed system is based on pose correction and curvature-based nose segmentation. Since the nose is the most stable part of the face, it is largely invariant under expressions. For this reason, we have concentrated on locating the nose tip and segmenting the nose. Furthermore, the nose direction is utilized to correct pose variations. We try both one-to-all and Average Nose Model-based methodologies for registration. Our results show that the utilization of anatomically-cropped nose region increases the recognition accuracy up to 94.10 per cent for frontal facial expressions and 79.41 per cent for pose variations in the Bosphorus 2D/3D face database.
Interactions at the Enterprise Knowledge Management Layer
Authors: Saulius Gudas, Rasa Brundzaite
Venue: Proceeding of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006 (2007)

The paper deals with modeling of the enterprise knowledge management. The enterprise knowledge base together with explicitly modeled knowledge management activity is concerned as the major component of the knowledge-based enterprise. The Knowledge-Based Enterprise Model is developed for the analysis and design of knowledge management activity domain as well as for modeling its relationships with business domain and information technology domain. Knowledge management layer is identified within the model and further is decomposed and represented as formalized interactions --knowledge management controls.
Presenting DEViSE: Data Exchange for Visualizing Security Events
Authors: Huw Read, Konstantinos Xynos, Andrew Blyth
Venue: IEEE Computer Graphics and Applications (2009)

The Data Exchange for Visualizing Security Events (DEViSE) is an open-source architecture designed to enable data sharing between security visualization tools. The security visualization market currently lacks interoperability between different applications, which tend to be constrained to certain log formats. DEViSE is a middleware layer that manages these interactions so one visualization tool can transfer security-related information to another application. DEViSE uses XML for all communication purposes. This allows a much greater level of freedom for application integration. To demonstrate DEViSE, the authors have created several security visualization tools that adhere to different visualization paradigms.
Efficient uncertainty quantification with the polynomial chaos method for stiff systems
Authors: Haiyan Cheng, Adrian Sandu
Venue: Mathematics and Computers in Simulation (2009)

The polynomial chaos (PC) method has been widely adopted as a computationally feasible approach for uncertainty quantification (UQ). Most studies to date have focused on non-stiff systems. When stiff systems are considered, implicit numerical integration requires the solution of a non-linear system of equations at every time step. Using the Galerkin approach the size of the system state increases from n to Sxn, where S is the number of PC basis functions. Solving such systems with full linear algebra causes the computational cost to increase from O(n^3) to O(S^3n^3). The S^3-fold increase can make the computation prohibitive. This paper explores computationally efficient UQ techniques for stiff systems using the PC Galerkin, collocation, and collocation least-squares (LS) formulations. In the Galerkin approach, we propose a modification in the implicit time stepping process using an approximation of the Jacobian matrix to reduce the computational cost. The numerical results show a run time reduction with no negative impact on accuracy. In the stochastic collocation formulation, we propose a least-squares approach based on collocation at a low-discrepancy set of points. Numerical experiments illustrate that the collocation least-squares approach for UQ has similar accuracy with the Galerkin approach, is more efficient, and does not require any modification of the original code.
Generic Fair Non-Repudiation Protocols with Transparent Off-line TTP
Authors: Guilin Wang
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

A non-repudiation protocol is aimed for exchanging a digital message and an irrefutable receipt between two mistrusting parties over the Internet. Such a protocol is said fair, if at the end of any possible protocol execution, either both parties obtain their expected items or neither party does. In this paper, we first argue that it is really meaningful in practice to exploit generic fair non-repudiation protocols with transparent off-line TTP. Namely, in those protocols, each involved party could use any secure digital signature algorithm to produce non-repudiation evidences; and the issued evidences are the same regardless of whether the TTP is involved or not. Then, we present such a fair non-repudiation protocol to overcome the limitations and shortcomings in previous schemes. Technical discussions are provided to show that our protocol is both secure and very efficient. In addition, some extensions are also pointed out.
A unified approach for sensitivity design of PID controllers in the frequency domain
Authors: Tooran Emami, John M. Watkins
Venue: WSEAS Transactions on Systems and Control (2009)

In this paper a graphical technique is introduced for finding all continuous-time and discrete-time proportional integral derivative (PID) controllers that satisfy an H∞ sensitivity constraint of an arbitrary order transfer function with time delay. These problems can be solved by finding all achievable PID controllers that simultaneously stabilize the closed-loop characteristic polynomial and satisfy constraints defined by a set of related complex polynomials. A key advantage of this procedure is that it only depends on the frequency response of the system. The delta operator is used to describe the controllers, because it not only possesses numerical properties superior to the discrete-time shift operator, but also converges to the continuous-time controller as the sampling period approaches zero. A unified approach allows us to use the same procedure for discrete-time and continuous-time H∞ sensitivity design of PID controllers.
On the convergence and stability of data-driven link estimation and routing in sensor networks
Authors: Hongwei Zhang, Lifeng Sang, Anish Arora
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2009)

The wireless network community has become increasingly aware of the benefits of data-driven link estimation and routing as compared with beacon-based approaches, but the issue of Biased Link Sampling (BLS) estimation has not been well studied even though it affects routing convergence in the presence of network and environment dynamics. Focusing on traffic-induced dynamics, we examine the open, unexplored question of how serious the BLS issue is and how to effectively address it when the routing metric ETX is used. For a wide range of traffic patterns and network topologies and using both node-oriented and network-wide analysis and experimentation, we discover that the optimal routing structure remains quite stable even though the properties of individual links and routes vary significantly as traffic pattern changes. In cases where the optimal routing structure does change, data-driven link estimation and routing is either guaranteed to converge to the optimal structure or empirically shown to converge to a close-to-optimal structure. These findings provide the foundation for addressing the BLS issue in the presence of traffic-induced dynamics and suggest approaches other than existing ones. These findings also demonstrate that it is possible to maintain an optimal, stable routing structure despite the fact that the properties of individual links and paths vary in response to network dynamics.
Data-complexity of the two-variable fragment with counting quantifiers
Authors: Ian Pratt-Hartmann
Venue: Information and Computation (2009)

The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting quantifiers is NP-complete; the data-complexity of both query answering and finite query answering for the two-variable guarded fragment with counting quantifiers is co-NP-complete.
The Observer Algorithm for Visibility Approximation
Authors: Per-Magnus Olsson, Patrick Doherty
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

We present a novel algorithm for visibility approximation that is substantially faster than ray casting based algorithms. The algorithm does not require extensive preprocessing or specialized hardware as most other algorithms do. We test this algorithm in several settings: rural, mountainous and urban areas, with different view ranges and grid cell sizes. By changing the size of the grid cells that the algorithm uses, it is possible to tailor the algorithm between speed and accuracy.
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
Authors: Søren Holbech Nielsen, Simon Parsons
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments, but in a recent paper we adapted it to support such attacks, and proved that this adapted framework enjoyed the same formal properties as that of Dung. One problem posed by Dung's original framework, which was neglected for some time, is how to compute preferred extensions of the argumentation systems. However, in 2001, in a paper by Doutre and Mengin, a procedure was given for enumerating preferred extensions for these systems. In this paper we propose a method for enumerating preferred extensions of the potentially more complex systems, where joint attacks are allowed. The method is inspired by the one given by Doutre and Mengin.
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
Authors: Safa Yahi, Salem Benferhat
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

This paper sheds light on the lexicographic inference from stratified belief bases which is known to have desirable properties from theoretical, practical and psychological points of view. However, this inference is expensive from the computational complexity side. Indeed, it amounts to a $\Delta_2^p$-complete problem. In order to tackle this hardness, we propose in this work a new compilation of the lexicographic inference using the so-called Boolean cardinality constraints. This compilation enables a polynomial time lexicographic inference and offers the possibility to update the priority relation between the strata without any re-compilation. Moreover, it can be efficiently extended to deal with the lexicographical closure inference which takes an important place in default reasoning. Furthermore, unlike the existing compilation approaches of the lexicographic inference, ours can be efficiently parametrized by any target compilation language. In particular, it enables to take advantage of the well-known prime implicates language which has been quite influential in artificial intelligence and computer science in general.
A UML 2.0 profile to define security requirements for Data Warehouses
Authors: Juan Trujillo, Emilio Soler, Eduardo Fernández-Medina, Mario Piattini
Venue: Computer Standards Interfaces (2009)

Many Data Warehouses (DWs) fail to provide the appropriate information because the users' requirements are not correctly modeled. In addition, the security requirements are considered in the final implementation, and do not take the users' necessities into consideration. However, as DWs store confidential and sensitive information, it is crucial to take security measures into account from early DW design phases, and to enforce them. This paper proposes a profile which uses the Unified Modeling Language (UML) extensibility mechanisms. This profile allows us to define security requirements for DWs at the business level, taking into account the information requirements modeled with a previous profile. Our proposal is aligned with Model Driven Architecture (MDA), thus permitting the transformation of security requirements throughout the entire DW life cycle. Finally, in order to show the benefits of our profile, we develop a case study related to the management of a pharmacy consortium business.
iPlane Nano: path prediction for peer-to-peer applications
Authors: Harsha V. Madhyastha, Ethan Katz-Bassett, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Many peer-to-peer distributed applications can benefit from accurate predictions of Internet path performance. Existing approaches either 1) achieve high accuracy for sophisticated path properties, but adopt an unscalable centralized approach, or 2) are lightweight and decentralized, but work only for latency prediction. In this paper, we present the design and implementation of iPlane Nano, a library for delivering Internet path information to peer-to-peer applications. iPlane Nano is itself a peer-to-peer application, and scales to a large number of end hosts with little centralized infrastructure and with a low cost of participation. The key enabling idea underlying iPlane Nano is a compact model of Internet routing. Our model can accurately predict end-to-end PoP-level paths, latencies, and loss rates between arbitrary hosts on the Internet, with 70% of AS paths predicted exactly in our evaluation set. Yet our model can be stored in less than 7MB and updated with approximately 1MB/day. Our evaluation of iPlane Nano shows that it can provide significant performance improvements for large-scale applications. For example, iPlane Nano yields near-optimal download performance for both small and large files in a P2P content delivery system.
Promoting development through information technology innovation: the IT artifact, artfulness, and articulation
Authors: Stephen Corea
Venue: Information Technology for Development (2007)

In this theoretical article the author explores how information technology (IT) innovation can be harnessed to promote the socioeconomic growth of developing nations. Adopting a behavioral perspective, he proposes that effective IT-based societal development requires the learning of a key competency, termed as IT artfulness: the creative or ingenious transformation of work/social practices through the contextually appropriate use of IT tools. The elaboration of this perspective is based on the nature of IT artifacts, and the way meaningful action in IT-based practices is constituted through articulation, which refers to the process by which interpretive schemes shape behavior or perception. Harnessing IT as an effective spur to socioeconomic development is seen to require the modification of relevant interpretive schemes in society that permit: (a) the innovative potential of IT to be recognized. and (b) human and material resources to be skillfully managed to achieve desired changes and heightened welfare.
Multi criteria analyses for managing motorway company facilities: The decision support system SINERGIE
Authors: Jacky Montmain, Céline Sanchez, Marc Vinches
Venue: Advanced Engineering Informatics (2009)

Improvements to the decision-making process in the areas of preventive maintenance and facility repairs for a range of infrastructure include maintenance, upgrading and retrofitting operations. Depending on the available information concerning the condition of the facilities, specific types of projects can be programmed. Assigning a priority of action to a given project necessitates an evaluation process that introduces several criteria at various functional levels. This multi criteria (MC) evaluation is modelled as the aggregation of partial scores attributed to a project with regards to (w.r.t.) a given set of criteria. The scores are expressed over a finite scale which can cause some troubles when no attention is paid to the aggregation procedure. This paper deals with the consistency of the evaluation process, where scores are expressed as labels by experts (over finite discrete scales), whereas the aggregation model is supposed to deal with numerical values and cardinal scales. This is a curious but common apparent paradox in MC evaluation when engineering contexts are concerned. Adequate mathematical tools are provided to tackle the related problems. A robustness analysis of the evaluation process concludes the mathematical part of the paper. The mathematical choices regarding our information processing chain meet the ESCOTA motorway company requirements. Indeed, ESCOTA aims at the formalization and improvement of the decisional process for preventive maintenance of its assets in a MC framework. According to available pieces of knowledge on the infrastructure condition, projects are to be evaluated w.r.t. technical but also to conformity, security and financial criteria for planning purposes. ESCOTA's engineers are used to manipulate symbolic labels but might convert them into more or less arbitrary numerical values when necessary without the necessary care. The SINERGIE decision support system has been developed for ESCOTA to implement a logically sound information processing methodology. The SINERGIE man-machine interfaces illustrate the way by which the mathematical concepts described in this paper are used in terms of infrastructure management activities. The various information processing phases laid out in SINERGIE have been illustrated for road applications.
An implementation and semantics for transactional memory introspection in Haskell
Authors: Arnar Birgisson, Úlfar Erlingsson
Venue: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security (2009)

Transactional Memory Introspection (TMI) is a novel reference monitor architecture that provides complete mediation, freedom from time of check to time of use bugs and improved failure handling for authorization. TMI builds on and integrates with implementations of the Software Transactional Memory (STM) architecture [Harris and Fraser 2003]. In this paper we present a formal definition of TMI and a concrete implementation over the Haskell STM. We find that this specification and reference implementation establishes clear semantics for the TMI architecture. In particular, they help identify and resolve ambiguities that apply to implementations such in our prior work [Birgisson et al. 2008].
The Coming Robot Revolution: Expectations and Fears About Emerging Intelligent, Humanlike Machines, 1st edition
Authors: Yoseph Bar-Cohen, David Hanson
Venue:  (2009)

This book discusses the emergence of humanlike robots into our everyday world. It covers the trends, possibilities, and concerns we will all feel with their emergence. Robots will walk, talk, and look ever more like people, and with the speed at which new technologies develop, this may happen very soon. Robots will be in homes, in space, in workplaces, in hospitals--everywhere. Their capabilities will soon surpass what has been usually considered science fiction. In what directions will the technology be taking us, and how will the presence of these robots challenge our identity? This book explores the fascinating implications of robot technology while alerting of its possibly disturbing flipside.
A fault tolerant, area efficient architecture for Shor's factoring algorithm
Authors: Mark G. Whitney, Nemanja Isailovic, Yatish Patel, John Kubiatowicz
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

We optimize the area and latency of Shor's factoring while simultaneously improving fault tolerance through: (1) balancing the use of ancilla generators, (2) aggressive optimization of error correction, and (3) tuning the core adder circuits. Our custom CAD flow produces detailed layouts of the physical components and utilizes simulation to analyze circuits in terms of area, latency, and success probability. We introduce a metric, called ADCR, which is the probabilistic equivalent of the classic Area-Delay product. Our error correction optimization can reduce ADCR by order of magnitude or more. Contrary to conventional wisdom, we show that the area of an optimized quantum circuit is not dominated exclusively by error correction. Further, our adder evaluation shows that quantum carry-lookahead adders (QCLA) beat ripple-carry adders in ADCR, despite being larger and more complex. We conclude with what we believe is one of most accurate estimates of the area and latency required for 1024-bit Shor's factorization: 7659 mm2 for the smallest circuit and 6 x 108 seconds for the fastest circuit.
Characterization of SNDR degradation in nonlinear wireless transmitters
Authors: Rui Estanqueiro Santos, Nuno Borges Carvalho, Kevin Gard
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

This article presents a measurement strategy and a characterization bench for the evaluation of Signal to Noise and Distortion Ratio (SNDR) in nonlinear wireless systems when in presence of memory effects. This measurement proposal will be combined with a closed analysis of the nonlinear mechanisms appearing in communication systems presenting memory. The analysis of this memory mechanism, when the system is excited by complex modulated signals with different statistics, will be a useful tool for design engineers to evaluate the degradation of SNDR in nonlinear wireless systems. Finally, the proposed measurement approach will be applied to a CDMA communication system, by evaluating carefully the SNDR of that system. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.