ppxscal/embedding_network huggingface dataset:
On user choice in graphical password schemes
Authors: Darren Davis, Fabian Monrose, Michael K. Reiter
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Graphical password schemes have been proposed as an alternative to text passwords in applications that support graphics and mouse or stylus entry. In this paper we detail what is, to our knowledge, the largest published empirical evaluation of the effects of user choice on the security of graphical password schemes. We show that permitting user selection of passwords in two graphical password schemes, one based directly on an existing commercial product, can yield passwords with entropy far below the theoretical optimum and, in some cases, that are highly correlated with the race or gender of the user. For one scheme, this effect is so dramatic so as to render the scheme insecure. A conclusion of our work is that graphical password schemes of the type we study may generally require a different posture toward password selection than text passwords, where selection by the user remains the norm today.
Mapping the physical layer of radio standards to multiprocessor architectures
Authors: Cyprian Grassmann, Mathias Richter, Mirko Sauermann
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We are concerned with the software implementation of baseband processing for the physical layer of radio standards ("<u>S</u>oftware <u>D</u>efined <u>R</u>adio - SDR"). Given the constraints for mobile terminals with respect to power consumption, chip area and performance, non-standard architectures without compiler support are the targets a SDR implementation has to face. For this domain we present a way to safely move from a functional model to the assembly level in order to come to a tested multithreaded optimized implementation in manageable time. We carried out this program for the standards WLAN IEEE 802.11b and 3GPP WCDMA exploiting various levels of parallelism: thread level parallelism ("MIMD"), data level parallelism ("SIMD") and instruction level parallelism ("VLIW"). We came up with a software implementation running in real time on Infineon's programmable Multiple SIMD Core (MuSIC) processor.
Comprehensive Urban Planning: A Framework for Group Decision
Authors: Jim Sheffield
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Previous research in Group Support Systems does not include a design theory for GSS-enabled meetings. As a consequence, problems are experienced in the design, implementation and evaluation of GSS-enabled meetings, particularly in difficult cases where the issues have a history of confusion, conflict and the exercise of power. This research proposes a design theory in the form of an inquiring system based on some aspects of the work of the late C. West Churchman and the German idealist philosopher Jürgen Habermas. The application of the design theory is explored via empirical data gathered in the premeeting, meeting, and post-meeting phases of a GSSenabled intervention in the domain of strategic urban planning. The focus question is "Do an inquiry-based design theory and electronic discourses reduce participant conflict and confusion about a comprehensive urban plan and preferences for three scenario options?"
Study and Enhancement of DCCP over DiffServ Assured Forwarding Class
Authors: Emmanuel Lochin, Guillaume Jourjon, Laurent Dairaine
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

The Datagram Congestion Control Protocol (DCCP) has been proposed as a transport protocol which supports real-time traffic. In this paper, we focus on the use of DCCP/CCID3 (Congestion Control ID 3) over a Diff- Serv/AF class. This class of service is used to build services that provide only a minimum throughput guarantee without any delay or jitter restrictions. This minimum throughput guarantee is called the target rate. In this context, the throughput obtained by DCCP/CCID3 mainly depends on RTT and loss probability. As a result, the application does not always get the negotiated target rate. To cope with this problem, we propose to evaluate a simple adaptation of the CCID3 congestion control mechanism, allowing the application to reach its target rate whatever the RTT value of the application's flow is. As this adaptation can be seen as an extension to the DCCP with CCID3 congestion control, we call it gDCCP for guaranteed DCCP. Results from simulations are presented to illustrate the improvements of the proposed modification in various situations. Finally, we investigate the deployment of this proposal in terms of security.
Type Approving the Signaling Systems
Authors: Hassan Moradi, Hassan Yeganeh, Maryam Fallahpour
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Coping with complex demands in time-effective manner, supervising a fast growing market and considering performance analysis are all essential steps in opening the national telecommunications market. Therefore, national governments are establishing a formal national Type Approval (TA) system as the basis and frame for accomplishing these goals. In this paper, by describing the importance of Type Approval necessities, we propose an effective test topology for a modular signaling type approval platform (STAP) to evaluate the quality of service degree in regard with the signaling section of switching systems. We want to show how the approving of a signaling system is possible in a simulated testbed. In what follows, it is tried to briefly highlight the functions and characteristics of the components located in the platform.
Online Conflict-Free Coloring for Intervals
Authors: Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jir&caron;i´ Matous&caron;ek, Elchanan Mossel, Ja´nos Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
Venue: SIAM Journal on Computing (2006)

We consider an online version of the conflict-free coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflict-free, in the sense that in every interval $I$ there is a color that appears exactly once in $I$. We present deterministic and randomized algorithms for achieving this goal, and analyze their performance, that is, the maximum number of colors that they need to use, as a function of the number $n$ of inserted points. We first show that a natural and simple (deterministic) approach may perform rather poorly, requiring $\Omega(\sqrt{n})$ colors in the worst case. We then derive two efficient variants of this simple algorithm. The first is deterministic and uses $O(\log^2 n)$ colors, and the second is randomized and uses $O(\log n)$ colors with high probability. We also show that the $O(\log^2 n)$ bound on the number of colors used by our deterministic algorithm is tight on the worst case. We also analyze the performance of the simplest proposed algorithm when the points are inserted in a random order and present an incomplete analysis that indicates that, with high probability, it uses only $O(\log n)$ colors. Finally, we show that in the extension of this problem to two dimensions, where the relevant ranges are disks, $n$ colors may be required in the worst case.
Improved fast algorithm for spatial signature estimation
Authors: J. Kang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We propose an improved fast algorithm for spatial signature estimation in array antenna systems. We provide an analysis for a fast estimation algorithm, which is not fully exploited in the previous work of Kim and Xu (see Proc. of IEEE Vehicular Technology Conference, 1997). Based on the analysis, we derive an improved algorithm which yields more accurate estimates with tolerable increment of computational complexity. The improvement is accomplished by compensation of noise power. Two different estimation methods for the noise power are presented. We investigate the performance of the proposed method via computer simulation.
2-D Bitmap for Summarizing Inter-Host Communication Patterns
Authors: Keisuke Ishibashi, Tatsuya Mori, Ryoichi Kawahara, Katsuyasu Toyama, Shunichi Osawa, Shoichiro Asano
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

We propose a tool for summarizing communication patterns between multiple hosts from traffic data with a small memory space, using a 2-D bitmap. Here, we focus on the communication pattern between pairs of source-destination hosts; these represents spatial communication patterns. By analyzing communication patterns using a bitmap, we can identify a super spreader, which is a host that sends packets to many destinations, or analyze the relationship between two source hosts. For the latter purpose, we present an application of the bitmap to calculate the similarity of hosts based on their peer-hosts patterns.
Assessing the Architectonics of Large, Software-Intensive Systems Using a Knowledge-Based Approach
Authors: Christian Del Rosso, Alessandro Maccari
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

This paper presents an assessment case study on the evolutionary capability of a large software system using a knowledge-based approach. The knowledge-based assessment is based on interviews with selected stake-holders of a software system. We have used this to assess the capability of the software architecture to evolve in one large Nokia software system. We have found that this approach proves to be effective in large organizations where development teams are distributed in different time-zones, with cultural differences and with limited person-to person communication. The lessons learned and the advantages of using this approach are presented.
Towards an Automated Approach to Dynamic Interpretation of Simulations
Authors: Catriona Kennedy, Georgios Theodoropoulos, Edward Ferrari, Peter Lee, Chris Skelcher
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Representation and interpretation of simulation semantic content is a challenging problem at the heart of issues such as simulation composability and symbiotic simulation. This paper introduces an automated approach to dynamic online interpretation of simulations using AI techniques. The approach is described in the context of agent-based social simulations.
Improved power-of-two sharpening filter design by genetic algorithm
Authors: P. Gentili
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

For high-speed low-complexity filter design, it is common practice to constrain the filters' coefficients to be a power-of-two or a sum of powers-of-two terms (P2), avoiding the full multiplication. Tapped interconnection of different sub-filters are sometimes used to enhance the ripple and stop-band attenuation performances. An extension of the simple cascade architectures, suitable for hardware implementation, is the polynomial sharpening technique. Firstly proposed by Kaiser-Hamming, it allows the use of identical sub-filters with a small hardware overhead. We propose a new approach to the design of P2 sharpening filters based on a specific genetic algorithm which optimizes both the FIR sub-filter and the sharpening polynomial coefficients expressed as P2 terms. This allows one to obtain better performances than the classical P2 design techniques when FIR filters with long impulse responses are involved.
A new Bayesian model averaging framework for wavelet-based signal processing
Authors: Y. Wan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper develops a new signal modeling framework using the Bayesian model averaging formulation and the redundant or translation-invariant wavelet transform. The aim of this framework is to provide a paradigm general enough to effectively treat fundamental problems arising in wavelet-based signal processing, segmentation, and modeling. Unlike many other attempts to mitigate the translation-dependent nature of wavelet analysis and processing, this framework is based on a well-defined statistical model averaging paradigm and improves over standard translation-invariant schemes for wavelet denoising. In addition to deriving new and more powerful signal modeling and denoising schemes, we demonstrate that certain existing methods are special suboptimal solutions of our proposed model averaging criterion. Experimental results demonstrate the promise of this framework.
Technological literacy counts: outcomes of a workshop to enhance technological literacy of K-12 students
Authors: C. Sechrist
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. This paper presents the outcomes of a Workshop titled 'Technological Literacy Counts': which was held October 9-10, 1998 in Baltimore, MD, USA. A goal of the Workshop was to establish a working and partnering relationship between engineers and precollege (K-12) educators. The Workshop was a two-day, highly participative and interactive event comprised of plenaries, panel sessions and breakouts. The paper reports on the issues raised, the resolutions proposed, future collaborations between the engineering and K-12 education communities, a plan for on-going workshops and conferences, and an action plan for both short-term and long-term activities.
Engineering trust with semantic guardians
Authors: Ilya Wagner, Valeria Bertacco
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The ability to guarantee the functional correctness of digital integrated circuits and, in particular, complex microprocessors, is a key task in the production of secure and trusted systems. Unfortunately, this goal remains today an unfulfilled challenge, as even the most straightforward practical designs are released with latent bugs. Patching techniques can repair some of these escaped bugs, however, they often incur a performance overhead, and most importantly, they can only be deployed after an escaped bug has been exposed at the customer site. In this paper we present a novel approach to guaranteeing correct system operation by deploying a semantic guardian component. The semantic guardian is an additional control logic block which is included in the design, and can switch the microprocessor's mode of operation from its normal, high-performance but error-prone mode, to a a secure, formally verified safe mode, guaranteing that the execution will be functionally correct. We explore several frameworks where a selective use of the safe mode can enhance the overall functional correctness of a processor. Additionally, we observe through experimentation that semantic guardians facilitate the trade-off between the design validation effort and the performance and area cost of the final secure product. The-experimental results show that the area cost and performance overheads of a semantic guardian can be as small as 3.5% and 5%, respectively.
Adaptive power controlled MAC protocol in mobile ad hoc networks
Authors: Y. Chen, W. C. Wong
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

We first propose two power controlled MAC protocols which constrain the transmission power of the current packet depending on the transmission and received powers of the preceding packet. We determine the optimal level of over-compensation for different operating scenarios. Then we propose a fully adaptive power control (APC) protocol which is shown to yield significant improvement in system performance.
Design and fabrication of the concentric circle light guiding plate for LED-backlight module by MEMS technique
Authors: Chao-Heng Chien, Zhi-Peng Chen
Venue: Microsystem Technologies (2007)

Generally, injection molding technique is applied to fabricate the traditional light guiding plate (LGP). MEMS and hot-embossing techniques applied to fabricate the concentric circle light guiding plate (CCLGP) in this research. The concentric circle v-groove structure and the micro-pyramid structure are constructed on the CCLGP. Therefore, the new backlight module could be simplified to use on only one integrated LGP with any optical components. The CCLGP can eliminate four optical components including the two diffusive sheets and two prism sheets in backlight module, so the space and the fabricated cost of the backlight unit are saved. From the test results, the CCLGP is demonstrated successfully of guide light function and the 82% of illuminative uniformity of the CCLGP is better than the other LGP.
Cluster-based evolutionary design of digital circuits using all improved multi-expression programming
Authors: Fatima Zohra Hadjam, Claudio Moraga, Mohamed Benmohamed
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Evolutionary Electronics (EE) is a research area which involves application of Evolutionary Computation in the domain of electronics. EE algorithms are generally able to find good solutions to rather small problems in a reasonable amount of time, but the need for solving more and more complex problems increases the time required to find adequate solutions. This is due to the large number of individuals to be evaluated and to the large number of generations required until the convergence process leads to the solution. As a consequence, there have been multiple efforts to make EE faster, and one of the most promising choices is to use distributed implementations. In this paper, we propose a cluster-based evolutionary design of digital circuits using a distributed improved multi expression programming method (DIMEP). DIMEP keeps, in parallel, several sub-populations that are processed by Impoved Multi-Expression Programming algorithms, with each one being independent from the others. A migration mechanism produces a chromosome exchange between the subpopulations using MPI (Message Passing Interface) on a dedicated cluster of workstations (Lido Cluster, Dortmund University). This paper presents the main ideas and shows preliminary experimental results.
Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
Authors: Aggelos Kiayias, Moti Yung
Venue: Designs, Codes and Cryptography (2007)

In Eurocrypt 2004 Augot and Finiasz presented a coding theoretic public key cryptosystem that suggests a new approach for designing such systems based on the Polynomial Reconstruction Problem (PR). Their cryptosystem is an instantiation of this approach under a specific choice of parameters which, given the state of the art of coding theory, we show in this work to be sub-optimal. Coron showed how to attack the Augot and Finiasz cryptosystem. A question left open is whether the general approach suggested by the cryptosystem works or not. In this work, we show that the general approach (rather than only the instantiation) is broken as well.
Mechanical Product Growth Design Based Product Genetic Engineering
Authors: Hong-wu Chen, Shi-ming Wang, Shou-qi Cao, Ke-zheng Huang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Similar relations between organism and product are proposed firstly so that Growth Design is introduced. Then Product Gene's new concept and corresponding data structure based on Function Surface in Growth Design are put forward. Product Gene can be defined as an integrated set of information specifying product's structures and functions and its mechanisms to "grow' automatically. Furthermore, the work flow of Product Genetic Engineering and the expression method are proposed. Finally, an example of vise fixture based on Product Genetic Engineering with the application of soft system is introduced. The conclusion can be drawn that Product Genetic Engineering is promising for new generation of CAD systems with both high efficiency and innovative ability.
A Management Platform for Tracking Cyber Predators in Peer-to-Peer Networks
Authors: Remi Badonnel, Radu State, Isabelle Chrisment, Olivier Festor
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Peer-to-peer (p2p) networks have become a privileged communication infrastructure for file sharing applications. However, it can also provide support for cybercriminality activities performed by organized criminal groups that can voluntarily propagate strongly undesirable contents. We propose in this paper a management platform capable of tracking and identifying such cyberpredators in peer-to-peer networks. We describe the architecture consisting of a set of configurable honeypot agents and detail how a honeypot is capable of advertising strongly undesirable contents and of detecting network users that attempt to acquire them. The distributed tracking solution is experimented through an implementation prototype in realistic scenarios.
Separation of a class of convolutive mixtures: a contrast function approach
Authors: C. Simon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper, we address the problem of the separation of convolutive mixtures in the case where the non-Gaussian source signals are not necessarily filtered versions of i.i.d. sequences. In this context, we show that the contrast functions, used in the linear process source case, still allow to separate the sources by a deflation approach. Some particular properties of higher order cumulants based contrast functions are also given.
Trellis-coded differential unitary space-time modulation: performance analysis and design criteria
Authors: Zhenyu Sun
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In this paper, we propose the trellis coded differential unitary space-time modulation (TC-DUSTM) and present the derivation of the formulae of the pairwise error-event probability (PEP) and the bit error probability (BEP) for this scheme. We found that in a multi-input multi-output (MIMO) system with M transmit and N receive antennas, apart from the diversity gain of MN, a coding gain of l/sub min/ is also obtained for the TC-DUSTM, where l/sub min/ is the length of the shortest error event. Additional coding gain comes from the product of the dissimilarities along the path of the shortest error event. These performance analyses suggest design criteria for the TC-DUSTM to obtain a best BEP performance. Through simulations we show that these analyses are accurate, especially at high signal-to-noise ratio (SNR). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player