ppxscal/embedding_network huggingface dataset:
Using Description Logic and Rules to Determine XML Access Control
Authors: Brian Shields, Owen Molloy
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The quantity of generated information we store and need to access is colossal. Security of this information is becoming an issue of greater importance as the techniques and granularity with which it can be accessed become more advanced. Availability of information is a key component of any security system, although the information must be protected, it must also be available to the people who need it as and when they request it. However, increasing the methods by which it is accessable automatically increases the chance it may be compromised. Security systems are now using advanced levels of encryption, digital signatures containing biometric data and highly complex access control policies. We are proposing an access control system which reduces the complexity involved in defining authorisation permissions, particularly in structured documents such as XML where the user may be granted restricted access. Our solution employs techniques usually reserved for intelligent systems and the semantic web.
Solving the Electrocardiography Inverse Problem by Using an Optimal Algorithm Based on the Total Least Squares Theory
Authors: Guofa Shou, Ling Xia, Mingfeng Jiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

The inverse problem of electrocardiography (ECG) is to estimate the activity of the heart from the measured body surface potentials (BSPs) using the numerical methods. Since it is ill-posed, it needs the dedicated numerical regularization process. The common regularization methods used in the ECG inverse problem, like Tikhonov regularization and Truncated Singular Decomposition (TSVD), are based on the linear least square, in which only the measurement noise in the right hand side BSP data is considered. In the paper, we attempt to investigate the ECG inverse problem with a full consideration of noises/errors appearing on both sides of the linear system equation Ax=b. Here, we solve the ECG inverse problem that reconstructs epicardial potentials (EPs) from BSPs by using an optimal algorithm based on the Total Least Squares (TLS) theory Regularized TLS (RTLS), which has not been investigated in the bioelectromagnetic inverse problems. The algorithm is tested by using a realistic shaped heart-lung-torso model with inhomogeneous conductivities. The performance of the RTLS is compared with other conventional approaches like Tikhonov and TSVD. In the numerical experiments, the EPs are reconstructed with a combination of measurement noise and/or geometry errors. The simulation results demonstrate that, in most cases, RTLS performs better than Tikhonov and TSVD. With proper physiological constraints, RTLS is able to robustly reconstruct EPs from BSPs, and therefore is a promising, feasible alternative for the ECG inverse problem.
Distributed Secure Information Sharing Model for E-Government in China
Authors: Xin Lu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

"E-government" refers to the process of using advanced information and communication technology (ICT) for automating both the internal operations of the government agents (G2G) and its external interactions with citizens (G2C) and businesses (G2B). In G2G type, addressing information sharing among government agencies is one of the most important issues for development of national e-government architecture. With efficient information sharing solutions, government agents can be able to predict the security risks and attacks, including terrorist attack similar as 911 attack on American soil. However, building secure information sharing mechanism among government agencies is not trivial because they worry about that their interests may be jeopardized when share their information with other agencies. In this paper, a distributed information sharing model is proposed and the technique standard support of the model is analyzed. With the secure e-government information sharing solutions, the cost of coping with government information exchange and agencies cooperation will be lowered and the capability and efficiency of agencies' collaboration will be increased.
The capability of the EDCA mechanism to support voice traffic in a mixed voice/data transmission over 802.11e WLANs - an experimental investigation
Authors: Miroslaw Narbutt, Mark Davis
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we experimentally evaluate the capability of the EDCA mechanism to support voice traffic in a mixed voice/data transmission over 802.11e WLANs. In particular we investigate how real-time voice transmission can be supported by tuning four EDCA parameters, namely AIFSN, CWmin , CWmax, and TXOP and how this impacts on background data transmission. The experimental set-up involves fifteen VoIP terminals sending bi-directional traffic between wired and wireless subnets and another station injecting various types of heavy background loads to the wireless subnet. End-to-end voice transmission quality is predicted from time-varying transmission impairments with the use of the latest Appendix to the ITU-T E-model. Our experimental results show that the AIFSN parameter more effectively protects voice calls against background data traffic than CWmin. We also demonstrate that tuning of the TXOP parameter does not improve the quality of voice transmission. To the best of our knowledge, this is the first experimental investigation regarding tuning of MAC layer EDCA parameters in a real 802.11e WLAN network from the perspective of end-to-end voice transmission quality and end user satisfaction.
A Formal Model for Security-Aware dynamic Web Services Composition
Authors: Dong-Hong Xua, Yong Qi, Di Hou, Ying Chen, Liang Liu
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Recently, there are imminent requirements to security policies in dynamic web services composition, so there appear many security specifications. The requirements of security characters are not always constant and the security specifications will need to modify according to the security requirements, however, there is no a uniform formal foundation to support numerous security specifications, it will block the application of these security policies, which have not been deeply investigated so far. To solve these problems, in this paper, we advocate to apply Spi calculus to describe and reason the security properties, for convenience describe and reason we separate security into security enhancing capability and security limiting constraint. Meanwhile we find the original Spi calculus can't completely to solve the properties in security-aware web service composition. In success, we extend the syntax and semantic of Spi calculus, named SpiWeb calculus, to adapt the security-aware dynamic web service composition. Finally as a case study, the online banking system, we apply the SpiWeb calculus to describe and analysis the security features of this system.
SARBAC07: A Scoped Administration Model for RBAC with Hybrid Hierarchy
Authors: Yue Zhang, James B. D. Joshi
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Recently, administration of RBAC systems using a role-based approach has become very appealing because of the benefits that such an approach typically brings. This approach uses RBAC itself to manage RBAC policies so that the administration functions can be decentralized and made more efficient. Existing RBAC administration models, however, fail to deal with RBAC systems with hybrid hierarchy, which has been shown to be necessary to specify fine-grained RBAC policies. In this paper, we propose a Scoped Administration model for RBAC with Hybrid Hierarchy (SARBAC07) by using the notion of an administrative scope that was earlier proposed in the SARBAC model. We show that our model keeps all the advantages of the original model and can deal with more complex situations where hybrid hierarchy is needed.
Vote manipulation in the presence of multiple sincere ballots
Authors: Ulle Endriss
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

A classical result in voting theory, the Gibbard-Satterthwaite Theorem, states that for any non-dictatorial voting rule for choosing between three or more candidates, there will be situations that give voters an incentive to manipulate by not reporting their true preferences. However, this theorem does not immediately apply to all voting rules that are used in practice. For instance, it makes the implicit assumption that there is a unique way of casting a sincere vote, for any given preference ordering over candidates. Approval voting is an important voting rule that does not satisfy this condition. In approval voting, a ballot consists of the names of any subset of the set of candidates standing; these are the candidates the voter approves of. The candidate receiving the most approvals wins. A ballot is considered sincere if the voter prefers any of the approved candidates over any of the disapproved candidates. In this paper, we explore to what extent the presence of multiple sincere ballots allows us to circumvent the Gibbard-Satterthwaite Theorem. Our results show that there are several interesting settings in which no voter will have an incentive not to vote by means of some sincere ballot.
Colour and Geometric based Model for Lip Localisation: Application for Lip-reading System
Authors: Salah Werda, Walid Mahdi, Abdelmajid Ben Hamadou
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Motivated by humans' ability to lipread, the visual component is considered to yield information in the speech recognition system. The lip-reading is the perception of the speech purely based on observing the talker lip movements. The major difficulty of the lipreading system is the extraction of the visual speech descriptors. In fact, to ensure this task it is necessary to carry out an automatic localization and tracking of the labial gestures. We present in this paper a new automatic approach for lip and point of interest localization on a speaker's face based both on the color information of mouth and a geometric model of lips. This hybrid solution makes our method more tolerant to noise and artifacts in the image. Experiments revealed that our lip POI localization approach for lip-reading purpose is promising. The presented Results show that our system recognizes 94.64 % of French visemes.
Synthesis Algorithms for 2-level MOS Networks
Authors: Tso-Kai Liu
Venue: IEEE Transactions on Computers (1975)

Due to the considerable progresses during the past few years, metal oxide semiconductor (MOS) has become one of the most important technologies for large-scale integration (LSI). Since a fairly complex function can be realized by a single MOS cell, most of the conventional algorithms which use NOR, NAND, AND, and OR gates as the basic building blocks are not suitable to synthesize MOS networks. This paper presents two simple efficient algorithms to synthesize 2-level MOS networks with a minimum number of cells.
Processing proximity queries in sensor networks
Authors: Yannis Kotidis
Venue: Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006 (2006)

Sensor networks are often used to perform monitoring tasks, such as in animal or vehicle tracking and in surveillance of enemy forces in military applications. In this paper we introduce the concept of proximity queries that allow us to report interesting events that are observed by nodes in the network that are within certain distance of each other. An event is triggered when a user-programmable predicate is satisfied on a sensor node. We study the problem of computing proximity queries in sensor networks using existing communication protocols and then propose an efficient algorithm that can process multiple proximity queries, involving several different event types. Our solution utilizes a distributed routing index, maintained by the nodes in the network that is dynamically updated as new observations are obtained by the nodes. We present an extensive experimental study to show the benefits of our techniques under different scenarios. Our results demonstrate that our algorithms scale better and require orders of magnitude fewer messages compared to a straightforward computation of the queries.
A Reconfigurable Broadcast Scan Compression Scheme Using Relaxation Based Test Vector Decompos
Authors: Aiman H. El-Maleh, Mustafa Imran Ali, Ahmad A. Al-Yamani
Venue: Proceedings of the 16th Asian Test Symposium (2007)

An effective reconfigurable broadcast scan compression scheme that employs test set partitioning and relaxationbased test vector decomposition is proposed. Given a constraint on the number of tester channels, the technique classifies the test set into acceptable and bottleneck vectors. The bottleneck vectors are then decomposed into a set of vectors that meet the given constraint. The acceptable and decomposed test vectors are partitioned into the smallest number of partitions while satisfying the tester channels constraint to reduce the decompressor area. Thus, the technique by construction satisfies a given tester channels constraint at the expense of increased test vector count and number of partitions, offering a tradeoff between test compression, test application time and test decompression circuitry area. Experimental results demonstrate that the proposed technique achieves better compression ratios compared to other test compression techniques.
A Bayesian Network Approach to Mode Detection for Interactive Maps
Authors: D. Willems, L. Vuurpijl
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

This paper describes a mode detection system for on- line pen input that employs a Bayesian network to com- bine classification results and context information. Previ- ous monolithic classifiers were not able to provide sufficient performance to be used in the domain of crisis manage- ment, where robust interaction is extremely important. To enhance mode detection for the intended target domain of crisis management, domain specific pen gesture data was used to train the four different classifiers and to calculate the conditional probabilities used in the Bayesian network. Mode detection, which is used to distinguish between differ- ent types of pen input such as deictic gestures, handwritten text, and iconic objects, clearly profited from this new ap- proach. The error rate dropped from 9.3% for a monolithic system to 4.0% for the new mode detection system.
A memetic algorithm for the job-shop with time-lags
Authors: Anthony Caumond, Philippe Lacomme, Nikolay Tchernev
Venue: Computers and Operations Research (2008)

The job-shop with time-lags (JS|t) is defined as a job-shop problem with minimal and maximal delays between starting times of operations. In this article, time-lags between successive operations of the same job (JS|t"i","s"""i) are studied. This problem is a generalization of the job-shop problem (null minimal time-lags and infinite maximal time-lags) and the no-wait job-shop problem (null minimal and maximal time-lags). This article introduced a framework based on a disjunctive graph to modelize the problem and on a memetic algorithm for job sequence generation on machines. Our aim is to provide also a framework to cover both job-shop and flow-shop problem and to encompass both no-wait and classical instances. A benchmark has been carried out on medium scale instances proving that high quality solutions can be obtained in short computational time. The framework we introduce competes with some methods dedicated to the no-wait job-shop instances and flow-shop instances in terms of quality of results.
R-MAC: Reservation Medium Access Control Protocol for Wireless Sensor Networks
Authors: Samira Yessad, Farid Nait-Abdesselam, Tarik Taleb, Brahim Bensaou
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Energy consumption is a critical issue in wireless sensor networks as the battery of a sensor node, in most cases, cannot be recharged or replaced after deployment. In order to detect an event, a sensor node spends most of the time in monitoring its environment, during which a significant amount of energy can be saved by placing the radio in the low power sleep mode when no reception and/or transmission of data is involved. In this paper, we discuss the design of a new MAC protocol for wireless sensor networks, which mainly avoids overhearing, collisions, and frequent commutation between sleep and active modes. These issues are generally considered to be the most important reasons behind energy waste in heavy loaded conditions of wireless sensor networks. The proposed protocol, called Reservation-MAC (R-MAC), uses two separate periods during the communication process. In the first period, nodes compete for time slots reservation for their future transmissions, and in the second period, each node transmits its data or receive data from a corresponding sender. Once a node is aware of its transmission and/or reception time slot, it stays active only for these time slots and goes back to the sleep mode during the remaining time of the transmission period. In our experiments, the performance of the R-MAC protocol is studied in saturated conditions and compared with the well known S-MAC and TMAC protocols. Depending on the traffic load, the proposed MAC protocol significantly improves the energy consumption compared to S-MAC and T-MAC.
Firewall Policy Reconstruction by Active Probing: An Attacker's View
Authors: Taghrid Samak, Adel El-Atawy, Ehab Al-Shaer, Hong Li
Venue: Proceedings of the 2006 2nd IEEE Workshop on Secure Network Protocols (2006)

Having a firewall policy that is correct and complete is crucial to the safety of the computer network. An adversary will benefit a lot from knowing the policy or its semantics. In this paper we show how an attacker can reconstruct a firewall's policy by probing the firewall by sending tailored packets into a network and forming an idea of what the policy looks like. We present two approaches of compiling this information into a policy that can be arbitrary close to the original one used in the deployed firewall. The first approach is based on region growing from single firewall response to sample packets. The other approach uses split-and-merge in order to divide the space of the firewall's rules and analyzes each independently. Both techniques merge the results obtained into a more compact version of the policies reconstructed.
Design Without Borders
Authors: Jan M. Rabaey
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Electrical engineers have learned how to build amazingly complex systems by assembling transistors, wires, and passive components into intricate networks. While solidly founded in semiconductor physics, pure engineering has made possible the design of multi-billion transistor chips in a repetitive, reliable and cost-effective way. A comprehensive "design methodology" was developed based on modularization, hierarchy and abstraction.
Research on the Knowledge-based Decision Support System for the Safety of Rockets
Authors: Wei Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In the traditional system, for some indigenous error in the measurement and trajectory track, the precision of trajectory parameters is not enough high so that it often results in some false alarms for the safety of rockets. After analyzing some main characteristics and disadvantages of existing systems for the safety rockets, a new idea and technology based on the intelligent decision and reasoning on more accurate, extensible and flexible safety knowledge are adopted. In the process of achieving this system , a function based on the immune theory is discussed and used in dealing, acquiring and optimizing safety knowledge needed, and a design idea, a system framework and a method applied for the realization of this knowledge-based intelligent decision making system are also proposed to improve the certainty and authenticity of a safety decision.
Violent computer games, empathy, and cosmopolitanism
Authors: Mark Coeckelbergh
Venue: Ethics and Information Technology (2007)

Many philosophical and public discussions of the ethical aspects of violent computer games typically centre on the relation between playing violent videogames and its supposed direct consequences on violent behaviour. But such an approach rests on a controversial empirical claim, is often one-sided in the range of moral theories used, and remains on a general level with its focus on content alone. In response to these problems, I pick up Matt McCormick's thesis that potential harm from playing computer games is best construed as harm to one's character, and propose to redirect our attention to the question how violent computer games influence the moral character of players. Inspired by the work of Martha Nussbaum, I sketch a positive account of how computer games can stimulate an empathetic and cosmopolitan moral development. Moreover, rather than making a general argument applicable to a wide spectrum of media, my concern is with specific features of violent computer games that make them especially morally problematic in terms of empathy and cosmopolitanism, features that have to do with the connections between content and medium, and between virtuality and reality. I also discuss some remaining problems. In this way I hope contribute to a less polarised discussion about computer games that does justice to the complexity of their moral dimension, and to offer an account that is helpful to designers, parents, and other stakeholders.
A Forest Fire Algorithm for Predicting the Percolation Threshold of ITZs In Concrete
Authors: Xinzhu Zhou, Jianjun Zheng, Caian Xia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Interfacial transition zone (ITZ) in concrete is characterized typically by its high porosity and therefore has a significant influence, particularly, on the transport properties of concrete. To study the transport mechanism of ions and fluids in concrete, it is essential to determine the percolation threshold of ITZs in concrete and to evaluate the effects of attributing factors on it. This paper presents a forest fire algorithm for the prediction of the percolation threshold of ITZs in concrete. Based on the simulated mesostructure of concrete with periodic boundary conditions, the ITZ percolation probability is determined numerically. The effect of the element size on the ITZ percolation probability is then discussed. Finally, the proposed numerical algorithm is verified with experimental results obtained from the research literature.
Computer Science and Engineering Curricula: The Bridge from Theory to Applications
Authors: P. P. Fasang
Venue: Computer (1980)

A failure of human knowledge, not of hardware, is most likely to impede the computer applications of the 80's. One company's efforts exemplify the solution to this knowledge crisis.