ppxscal/embedding_network huggingface dataset:
A Critique of k-Anonymity and Some of Its Enhancements
Authors: Josep Domingo-Ferrer, Vicenç Torra
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

k-Anonymity is a privacy property requiring that all combinations of key attributes in a database be repeated at least for k records. It has been shown that k-anonymity alone does not always ensure privacy. A number of sophistications of k-anonymity have been proposed, like p-sensitive k-anonymity, l-diversity and t-closeness. This paper explores the shortcomings of those properties, none of which turns out to be completely convincing.
Performance analysis of PN-code acquisition in a DS/CDMA smart antenna system
Authors: Yusuk Yun, Seungheon Hyeon, Seungwon Choi
Venue: Digital Signal Processing (2008)

This paper presents a performance analysis of PN-code acquisition in a smart antenna system operating in Rayleigh fading channels with various degrees of angular spread in the arrival direction of the received signal. It was determined that the performance enhancement provided by the smart antenna system is upper- and lower-bounded by the degrees of statistical independence between channel responses associated with each of the antenna elements. The performance of PN-code acquisition in a smart antenna system is then determined in accordance with the degree of angular spread in the range determined by the upper and lower bounds. The theoretical analysis for deriving the bounds shown in this paper is verified through extensive computer simulations with various angular spreads encountered in the Rayleigh fading channel.
Multi-Class EEG Classification for Brain Computer Interface based on CSP
Authors: Tang Yan, Tang Jingtian, Gong Andong
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The algorithm is presented, which is an extension ofthe Common Spatial Patterns(CSP) to multi-class case,in order to implement a suitable Brain-ComputerInterface(BCI) system. An extension of the CSP algorithm to multiclass paradigms is introduced withan elaborate description. We use computer simulationto prove the algorithm right. After a short descriptionof this algorithm, we will apply it in data set IIIa ofBCI Competition III to prove the algorithm feasibility.The result illustrates the performance and validity ofthe algorithm. It not only improves the information transfer rate, but also assures the certain accuracy ofthe system.
A local directional ghost cell approach for incompressible viscous flow problems with irregular boundaries
Authors: Petter A. Berthelsen, Odd M. Faltinsen
Venue: Journal of Computational Physics (2008)

An immersed boundary method for the incompressible Navier-Stokes equations in irregular domains is developed using a local ghost cell approach. This method extends the solution smoothly across the boundary in the same direction as the discretization it will be used for. The ghost cell value is determined locally for each irregular grid cell, making it possible to treat both sharp corners and thin plates accurately. The time stepping is done explicitly using a second order Runge-Kutta method. The spatial derivatives are approximated by finite difference methods on a staggered, Cartesian grid with local grid refinements near the immersed boundary. The WENO scheme is used to treat the convective terms, while all other terms are discretized with central schemes. It is demonstrated that the spatial accuracy of the present numerical method is second order. Further, the method is tested and validated for a number of problems including uniform flow past a circular cylinder, impulsively started flow past a circular cylinder and a flat plate, and planar oscillatory flow past a circular cylinder and objects with sharp corners, such as a facing square and a chamfered plate.
E-government structure for e-protocol, e-application submission and internal organizational and operational support
Authors: A. S. Drigas, L. Koukianakis, S. Domoxoudis
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

E-Government idea includes fast and improved citizen service from a quantitative and qualitative point of view, as well as the restructuring and reengineering of the providing organization and its services, through the increased usage and exploitation of the capabilities of the information and communication technologies and especially through the facilities and services of the Internet. The escalation of the e-government services begins from the easy dissemination and easy access from the citizen to the governmental information and passes through the electronic transactions between the citizen and the public organization and reaches to the electronic delivery of the requested document by the public organization to the citizen. An obvious prerequisite, in order to support the above "layers" of the e-government services is the development of an electronic infrastructure which is able to support e-protocol, e-applications/e-petitions and internal organizational function of the public organization. In addressing the above content, this manuscript presents an e-government structure which supports and provides the above described "layers" of the e-government services. This e-government structure has been developed by Net Media Lab of N.C.S.R. "Demokritos" for a Hellenic Public Organization, in order, the latter, to provide public information dissemination, accept electronic document submission and handle them via e-protocol, and support all the operations via the appropriate electronic structure which supports easy communication among the organization's departments as well as robust and user-friendly document management, storage, search, retrieval, handling and delivery.
A note on the security of code memo
Authors: Ruben Wolf, Markus Schneider
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Today, secret codes such as passwords and PINs are the most prevalent means for user authentication. Because of the constantly growing number of required secret codes, computer users are increasingly overtaxed. This leads to many problems in daily use, e.g., costs due to forgotten passwords in enterprises and security problems through bad password practice. Storing secret codes on mobile phones seems to be some kind of panacea to have secret codes always available since mobile phones are today's permanent companions. Code Memo is a software that is used on mobile phones to store secret codes in a safe way; it is provided as firmware on Sony Ericsson mobile phones. We assume that the intention of the Code Memo designers was to provide an ideal cipher system according to Shannon's classification, i.e., it leaves an adversary with uncertainty w.r.t. the correct decryption key. In this paper we show how to break Code Memo. For our attack, we have identified feedback channels in Code Memo that can be exploited for distinguishing correct master passwords from incorrect ones, and thereby, sieving candidates of master passwords. This weakness allows attackers in a realistic setting to identify the correct master password, and thus, to obtain all the stored passwords and PINs.
Multispectral images fusion by a joint multidirectional and multiresolution representation
Authors: M. Lillo-Saavedra, C. Gonzalo
Venue: International Journal of Remote Sensing (2007)

This paper proposes a new fusion method that permits an adequate selection of information extracted from source images to obtain fused images with good spatial and spectral quality simultaneously. This method is based on a joint multiresolution multidirectional representation of the source images using a single directional spatial frequency low pass filter bank of low computational complexity, defined in the Fourier domain. The source images correspond to those captured by the IKONOS satellite (panchromatic and multispectral). The results obtained indicate that the proposed method provides, in a simple manner, objective control over the trade-off between high spatial and spectral quality of the fused images.
Research and Application of Information Granulation Based on Extension Method
Authors: Minghui Wang, Yongquan Yu, Bi Zeng
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Granular computing is an emerging conceptual and computing paradigm of information processing. Just as a great umbrella, it may be regarded as a label of theories, methodologies, techniques, and tools that make use of information granules. Extension set theory is a new computational method of knowledge resolution and the significance of attribute. Extension method can be used to describe the thinking process associated with both quantitative change and qualitative change. In this paper, we integrate granular computing with extension method. We utilize the extension method to solve some problems for communicating between information granular worlds. The communication procedures between information granular worlds based on extension method can be established, which is valuable and easy to implement in computer.
Personal Identification Using Facial Blemishes
Authors: Andreas Psyllos, David Al-Dabass
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

The paper develops a model for the biologically inspired process of identifying faces from relative distances between blemishes using pre-stored knowledge in a database. A facial picture is loaded into the program and the operator selects facial blemishes by clicking on them and uses an extra list to select the size and color of the facial blemish. The 2-D location, size and colour are recorded to uniquely identify the individual. For scars and other facial blemishes that are not of standard size and shape, such as skin dots or freckles, the operator marks the area as other points are marked. Results show the success of the method.
The virtual wall approach to limit cycle avoidance for unmanned ground vehicles
Authors: Camilo Ordonez, Emmanuel G. Collins,  Jr., Majura F. Selekwa, Damion D. Dunlap
Venue: Robotics and Autonomous Systems (2008)

Robot Navigation in unknown and very cluttered environments constitutes one of the key challenges in unmanned ground vehicle (UGV) applications. Navigational limit cycles can occur when navigating (UGVs) using behavior-based or other reactive algorithms. Limit cycles occur when the robot is navigating towards the goal but enters an enclosure that has its opening in a direction opposite to the goal. The robot then becomes effectively trapped in the enclosure. This paper presents a solution named the Virtual Wall Approach (VWA) to the limit cycle problem for robot navigation in very cluttered environments. This algorithm is composed of three stages: detection, retraction, and avoidance. The detection stage uses spatial memory to identify the limit cycle. Once the limit cycle has been identified, a labeling operator is applied to a local map of the obstacle field to identify the obstacle or group of obstacles that are causing the deadlock enclosure. The retraction stage defines a waypoint for the robot outside the deadlock area. When the robot crosses the boundary of the deadlock enclosure, a virtual wall is placed near the endpoints of the enclosure to designate this area as off-limits. Finally, the robot activates a virtual sensor so that it can proceed to its original goal, avoiding the virtual wall and obstacles found on its way. Simulations, experiments, and analysis of the VWA implemented on top of a preference-based fuzzy behavior system demonstrate the effectiveness of the proposed method.
Design of a systolic-pipelined architecture for real-time enhancement of color video stream based on an illuminance-reflectance model
Authors: Hau T. Ngo, Vijayan K. Asari, Ming Z. Zhang, Li Tao
Venue: Integration, the VLSI Journal (2008)

A high performance digital architecture for the implementation of a nonlinear image enhancement technique is proposed in this paper. The image enhancement is based on an illuminance-reflectance model which improves the visual quality of digital images and video captured under insufficient or non-uniform lighting conditions. The algorithm shows robust performance with appropriate dynamic range compression, good contrast, accurate and consistent color rendition. The algorithm contains a large number of complex computations and thus it requires specialized hardware implementation for real-time applications. Systolic, pipelined and parallel design techniques are utilized effectively in the proposed FPGA-based architectural design to achieve real-time performance. Approximation techniques are used in the hardware algorithmic design to achieve high throughput. The video enhancement system is implemented using Xilinx's multimedia development board that contains a VirtexII-X2000 FPGA and it is capable of processing approximately 63 Mega-pixels (Mpixels) per second.
A sliding mode observer for sensorless induction motor speed regulation
Authors: Claudio Aurora, Antonella Ferrara
Venue: International Journal of Systems Science (2007)

A novel sliding mode observer for current-based sensorless speed control of induction motors is presented in this article. The control objective is to guarantee asymptotic tracking of prespecified references for speed and rotor flux magnitude, without sensors measuring the mechanical speed and the flux, and assuming to have some kind of uncertainties on the value of the rotor resistance. To this end, the proposed observer is designed by coupling a second-order sliding mode observer of the stator current with a nonlinear flux and speed observer, adaptive with respect to the rotor resistance. Estimation of unknown inputs is based on a different and original approach with respect to the widely used equivalent control-based techniques. As for the control aspects, in the present proposal, the problem of chattering, typical of sliding mode controllers, is made less critical since the derivative of the stator currents are used as discontinuous forcing actions, while the actual control signals are continuous, thus limiting the mechanical stress.
Estimating labels from label proportions
Authors: Novi Quadrianto, Alex J. Smola, Tiberio S. Caetano, Quoc V. Le
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Consider the following problem: given sets of unlabeled observations, each set with known label proportions, predict the labels of another set of observations, also with known label proportions. This problem appears in areas like e-commerce, spam filtering and improper content detection. We present consistent estimators which can reconstruct the correct labels with high probability in a uniform convergence sense. Experiments show that our method works well in practice.
Hierarchical Model to Develop Component-Based Systems
Authors: Abdelkrim Amirat, Mourad Oussalah
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Large and complex software systems require expressive notations for representing their software architecture. In this context Architecture Description Languages (ADLs) can be used for describing architectures of components-based software systems. Typical ADLs provide explicit support for specifying components, connectors, and configuration as well as for building hierarchical systems configurations. All of them allow structural dependencies among components to be specified to define static configurations. This may be sufficient for an initial system composition, but does not provide enough information for reasoning about the different kind of connections among elements. Physical and logical connections are defined in this paper. Four kinds of hierarchies are also presented. Each one is used to provide special-purpose view about the architecture.
Aggregated click-through data in a homogeneous user community
Authors: Mingfang Wu, Andrew Turpin, Justin Zobel
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

There are many proposed methods for using clickthrough data for common queries to improve the quality of search results returned for that query. In this study we examine the search behaviour of users in a close-knit community on such queries. We argue that the benefit of using aggregated clickthrough data varies from task to task: it may improve document rankings for navigational or specific informational queries, but is less likely to be of value to users issuing a broad informational query.
An Experimental Network Proxy for Power Managed End Nodes
Authors: Paul Werstein
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

End devices connected to the Internet consume a considerable amount of electricity. Studies show many of these computers have their power management features disabled in order to maintain their network presence and network connections. Past research proposes to use a low power proxy to 'stand in' for a computer, allowing it to go to sleep and thus save power while still maintaining its network presence. This paper describes an experimental platform that can be used to develop the requirements for such a proxy. With the platform, we propose to develop a language to be used by applications to provide the necessary code to the proxy to maintain network connections and presence for a sleeping computer.
Minimum-perimeter enclosures
Authors: Joseph S. B. Mitchell, Valentin Polishchuk
Venue: Information Processing Letters (2008)

We give the first polynomial-time algorithm for the problem of finding a minimum-perimeter k-gon that encloses a given n-gon. Our algorithm is based on a simple structural result, that an optimal k-gon has at least one ''flush'' edge with the n-gon. This allows one to reduce the problem to computing a shortest k-link path in a simple polygon. As a by-product we observe that the minimum-perimeter ''envelope''-a convex polygon with a specified sequence of interior angles-can also be found in polynomial time. Finally, we introduce the problem of finding optimal convex polygons restricted to lie in the region between two nested convex polygons. We give polynomial-time algorithms for the problems of finding the minimum restricted envelopes.
Topology control for delay sensitive applications in wireless sensor networks
Authors: Farshad Ahdi, Vikram Srinivasan, Kee-Chaing Chua
Venue: Mobile Networks and Applications (2007)

Wakeup scheduling in wireless sensor networks is known as the most effective way to conserve the limited amount of available energy for each sensor node. Such schedules are applicable to protocols of different network layers and often result in higher latency. Tolerance to latency varies greatly depending on the application so that it is low for a large class of delay sensitive applications. In this paper, we present a unified approach in the design of wakeup schedules in different network layers. A new distributed wakeup schedule is introduced in the context of topology control which aims to conserve more energy while not compromising on the delay performance of the system. The proposed protocol addresses the problem of increasing the network longevity for a given upper bound on the average end-to-end delay. In this scheme neither localization nor synchronization is required and only local information about the network topology is used. In addition to its simplicity of implementation, its energy overhead is negligible and it implicitly determines the routing paths. Our simulation results show that the performance of this protocol is close to the optimal schedule and significantly higher than SPAN, an existing topology control mechanism.
Methods and implementation of a central biosample and data management in a three-centre clinical study
Authors: Aniela Angelow, Matthias Schmidt, Kerstin Weitmann, Susanne Schwedler, Hannes Vogt, Christoph Havemann, Wolfgang Hoffmann
Venue: Computer Methods and Programs in Biomedicine (2008)

In our report we describe concept, strategies and implementation of a central biosample and data management (CSDM) system in the three-centre clinical study of the Transregional Collaborative Research Centre ''Inflammatory Cardiomyopathy - Molecular Pathogenesis and Therapy'' SFB/TR 19, Germany. Following the requirements of high system resource availability, data security, privacy protection and quality assurance, a web-based CSDM was developed based on Java 2 Enterprise Edition using an Oracle database. An efficient and reliable sample documentation system using bar code labelling, a partitioning storage algorithm and an online documentation software was implemented. An online electronic case report form is used to acquire patient-related data. Strict rules for access to the online applications and secure connections are used to account for privacy protection and data security. Challenges for the implementation of the CSDM resided at project, technical and organisational level as well as at staff level.
Low power current mode receiver with inductive input impedance
Authors: Marshnil Dave, Maryam Shojaei Baghini, Dinesh Sharma
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In this paper we show that current mode signaling system with receivers using inductive input impedance can provide a low power solution to high speed data transmission over long lines. We show that beta multiplier circuits can be designed such that they exhibit inductive input impedance and their use as current mode receivers provides significant enhancement in data rates. Simulation results show that it is possible to transmit data at eight times higher data rates than voltage mode with an one order of magnitude lower power consumption. Even compared to other current mode signaling systems, those using receiver with inductive input impedance show around 50% improvement in data rate at marginally lower power consumption.
Lyapunov function characteristics analysis of different design strategies
Authors: Alexander Zemliak
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

The design process for analog network design is formulated as a dynamic controllable system. A special control vector is defined to redistribute the compute expensive between a network analysis and a parametric optimization. This redistribution permits the minimization of a computer time. The problem of the minimal-time network design can be formulated in this case as a classical problem of the optimal control for some functional minimization. The conception of the Lyapunov function of dynamic controllable system is used to analyze the principal characteristics of the design process. The analysis of a special function that is a combination of the Lyapunov function and its time derivative gives a possibility to compare the different design strategies.
Innermost Termination of Rewrite Systems by Labeling
Authors: René Thiemann, Aart Middeldorp
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rules. A variant of semantic labeling is predictive labeling where the quasi-model condition is only required for the usable rules. In this paper we investigate how semantic and predictive labeling can be used to prove innermost termination. Moreover, we show how to reduce the set of usable rules for predictive labeling even further, both in the termination and the innermost termination case.