ppxscal/embedding_network huggingface dataset:
A novel definition of processing gain for the system level simulation in WCDMA
Authors: Chang-Young Kim, Hwa-Jin Cha, Chan-Byoung Chae
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The physical layer structure of WCDMA is different from synchronous CDMA system. Therefore, a novel integration scheme of link and system level simulation is needed. In this paper, we introduce a novel method for estimating required E/sub b//N/sub o/ of system level data using E/sub c//I/sub or/ of link level data. And we verify the accuracy of modified estimation scheme through the snapshot system level simulation. Also, we simulate the downlink capacity with estimated required E/sub b//N/sub o/. In result, the new method is very simple but very accurate.
Fast communication: Gabor feature-based face recognition using supervised locality preserving projection
Authors: Zhonglong Zheng, Fan Yang, Wenan Tan, Jiong Jia, Jie Yang
Venue: Signal Processing (2007)

This paper introduces a novel Gabor-based supervised locality preserving projection (GSLPP) method for face recognition. Locality preserving projection (LPP) is a recently proposed method for unsupervised linear dimensionality reduction. LPP seeks to preserve the local structure which is usually more significant than the global structure preserved by principal component analysis (PCA) and linear discriminant analysis (LDA). In this paper, we investigate its extension, called supervised locality preserving projection (SLPP), using class labels of data points to enhance its discriminant power in their mapping into a low-dimensional space. The GSLPP method, which is robust to variations of illumination and facial expression, applies the SLPP to an augmented Gabor feature vector derived from the Gabor wavelet representation of face images. We performed comparative experiments of various face recognition schemes, including the proposed GSLPP method, PCA method, LDA method, LPP method, the combination of Gabor and PCA method (GPCA) and the combination of Gabor and LDA method (GLDA). Experimental results on AR database and CMU PIE database show superior of the novel GSLPP method.
GPU Acceleration of Real-time Feature Based Algorithms
Authors: Jason M. Ready, Clark N. Taylor
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Feature tracking is one of the most fundamental tasks in computer vision, being used as a preliminary step to many high-level algorithms. In general, however, the number of features tracked (leading to more accurate high-level algorithms) must be balanced against the computational requirements of the feature tracking algorithm. To enable a large number of features to be tracked in real time without degrading the computational performance of high-level computer vision algorithms, we offload the feature tracking algorithm to the the video card (GPU) found in modern personal computers. Using the GPU allows for tracking an order of magnitude more features than a pure software-based algorithm, with minimal increase in CPU usage. We have demonstrated the computational benefits of GPU-based feature tracking within a real-time video stabilization application.
Information to control, knowledge to decide: a short account of a contemporary misunderstanding
Authors: Massimo Negrotti
Venue: AI Society (2007)

There is a great distance between two pairs of concepts that are consistent in their own fields; namely, information/control and knowledge/decision. Although contemporary techno-sciences and common sense tend to neglect this distance, its intrinsic implications sometimes make it difficult to understand what is going on in our cultural events and developments. In particular, the abuse of the concepts of knowledge and decision makes it impossible to discriminate between the various levels of systems, both natural and naturoid, which surround us. In fact, the majority of so-called intelligent systems are mere information and control processors, rather than systems that are capable of generating knowledge and decision. The diffusion of such a misunderstanding may cause, in turn, the reduction of man to a mere information system based on established and discoverable rules, thereby neglecting his ability, albeit rarely exercised, to override information and control in order to discover or to set up something new.
A Security-Centric Comparative Study of PLEASE with Existing GKM Protocols
Authors: Rhymend V. Uthariaraj, T. C. Rangarajan, S Srinivasan
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Since group communication is an upcoming technology, research on secure multicasting has been attracting wide attention. In this context, the already proven PLEASE, "p' LEAder SElection model has much to contribute to the security and key management of the multicast group communication. In this paper, the PLEASE model is mathematically compared with other well-known group key management protocols like GKMP, DEP, Iolus etc, in terms of security related parameters. The IGKMP has been implemented in NS-2 and compared with PLEASE model graphically.
Model Based Test Generation for Microprocessor Architecture Validation
Authors: Sreekumar V. Kodakara, Deepak A. Mathaikutty, Ajit Dingankar, Sandeep Shukla, David Lilja
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Functional validation of microprocessors is growing in complexity in current and future microprocessors. Traditionally, the different components (or validation collaterals) used in simulation based validation, like simulators and test generators, to validate the system, architecture, microcode, and RTL abstractions of the processor, were manually derived from the specification document. The incomplete informal specification document along with manual translation introduces inconsistency and bugs in the validation collaterals, resulting in increased cost and time to validate the processor. We envision a novel metamodeling based microprocessor modeling and validation environment (MMV) to address this problem. MMV provides a language independent modeling environment to describe the processor at various abstraction levels, a refinement flow to consistently move from one abstraction to the next lower abstraction and code generators to automatically generate the validation collaterals from the models. As a first step towards our vision, in this paper, we describe architectural modeling in MMV and automatic generation of random and coverage directed test suites from the models. We demonstrate the practicality of our approach for validating real world Instruction Set Architectures (ISA) by modeling and generating test cases for eight complex instructions from Intel 1rVirtualization Technology.
Risk Analysis in Critical Infrastructure Systems based on the Astrolabe Methodology
Authors: Ebrahim Bagheri, Ali A. Ghorbani
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Critical infrastructure systems are complex networks of adaptive socio-technical systems that provide the most fundamental requirements of the society. Their importance in the smooth conduct of the society has made their role more and more prominent. A failure in any of these important components of todays industrial society can well affect the lives of millions of people. For this reason it is required that proper risk analysis and management models be devised so that the vulnerabilities, threats, and risks of/to critical infrastructure systems are exhaustively understood and revealed. In this paper, we show how the Astrolabe risk analysis methodology can be exploited to perform a comprehensive risk analysis process on any critical infrastructure system. The strength of the Astrolabe risk analysis methodology is that it focuses on the deviation of a system from its original goals. It also incorporates information from multiple sources through the notion of perspectives.
The Best Deal in Town
Authors: David Alan Grier
Venue: Computer (2007)

At one time, supercomputing, a term that was synonymous with the Cray-1, was considered to be the best deal in town. However, bythe 1990s, manufacturers began to question the need to continue the development of high-speed computers, turning their attention insteadto the potential for developing a "high-capacity and high-speed national research and education computer network."
Performance evaluation of efficient multipath crossbars
Authors: N. F. Mir
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper presents a comprehensive analysis of high-performance crossbars where crossbars can be asymmetrical in size, buffered at all crosspoints, and capable of multipath routing. A crossbar, as a building block of switching networks, with the mentioned features in its structure can demonstrate fault-tolerant property. This property is a major factor for crossbars to play the role of high-performance entity in modern computer and communication systems. A generic condition of n /spl times/ k crossbar with n inputs (rows), k columns, and n outputs (rows) under which a crossbar becomes multipath is examined. In a multipath crossbar a packet can be routed through k different paths to an output. The multipath feature ensures the property of fault-tolerance and provides a faster congestion resolution especially under multicast traffic. The paper describes a two-dimensional Markov chain associated with the queueing model, and presents the performance evaluation of crossbars.
Bandwidth fairness of a single rate three color marker algorithm implementation
Authors: D. Mendes, K. Fonseca, C. M. Pedroso
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper presents and analyzes test results of the single rate Three Color Marker (srTCM) algorithm middleware implementation. The srTCM, defined at the RFC 2697, basically performs traffic shaping through two token buckets and packet marking according to their traffic parameters. The test environment evaluates a client-server application performance in terms of bandwidth usage and data throughput when all client requests to the server are intercepted and the server output traffic controlled by the srTCM. The test results allowed a fine-tuning of the stTCM parameter configuration aiming bandwidth allocation fairness and better throughput average to individual data streams.
OntoMove: A Knowledge Based Framework for Semantic Requirement Profiling and Resource Acquisition
Authors: Mehul Bhatt, Wenny Rahayu, Sury Prakash Soni, Carlo Wouters
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

The use of formal knowledge representation structures, or ontologies, has found immense applicability for the interoperability of software systems, e.g., alignment of software and business process models. Toward the management of such knowledge structures, an important foundational problem is that of ontology reuse - it is uncommon for new applications or for different components within one application to use an already available ontology in its entirety. Depending on component specific requirements, typical re-usages are restricted to refined versions of an existing ontology, with the refinement taking the form of a contraction of the knowledge contained therein. Furthermore, when the ontology is used to ascribe meaning to independently existing "resources' (e.g., documents collections, source code, software manuals, process template repositories) by way of meta-data, there exists a direct mapping between different views/re-uses of an ontology and their respective semantic scopes within an annotated resource repository thereby leading to the concept of view/reuse dependent resource retrieval. We implement a framework that supports ontology reuse by way of a requirement driven sub-ontology extraction methodology. Additionally, based on this concept of a sub-ontology, we implement the idea of a user/component "requirement profile' consisting of semantic descriptions of the user's interest within a "resource repository' that has been annotated with semantic types from the ontology under consideration. A generic framework that implements these ideas and its application in the domains of Medical Information Retrieval systems and Business Process Management Systems (BPMS) is presented.
Detecting the socioeconomic conditions of urban neighborhoods through wavelet analysis of remotely sensed imagery
Authors: Nina Lam
Venue:  (2006)

Wavelet analysis is an efficient approach to studying textural patterns at different scales. Artificial neural networks can learn very complex patterns in the data and could be an efficient classifier. However, whether wavelet analysis, in combination with artificial neural networks or other classifiers, can be used to detect the social-economic conditions of urban neighborhood is a key research question that needs further study. The hypotheses of this study were: (1) neural networks yielded higher classification accuracy than linear discriminant analysis and the minimum-distance classifier based on wavelet measures of urban land covers; (2) wavelet textural measures could be used to efficiently discriminate among urban neighborhoods of different social-economic conditions; (3) image resolution had great influences on the discrimination of urban neighborhoods; and (4) window size had great influences on the discrimination of urban neighborhoods. In addition, two technical problems related to the application of textural approach, including the edge effect and image segmentation problem, were examined. The results show that the new approach developed to reducing edge effects consistently achieved higher accuracy than the traditional moving-window approach. The post-segmentation integration scheme in the region-based splitting-and-merging segmentation procedures reflected all the segmented clusters identified by two or more textural measures and was helpful in identifying homogeneous regions in an image. Regarding the four hypotheses, (1) The minimum-distance classifier performed the worst. Neural networks were found to generally yield slightly better results than discriminant analysis but the difference was not statistically significant. The first hypothesis was shown to be invalid. (2) With a window size of 85m by 85m, an overall accuracy of 93.00% was achieved using band 2 and an overall accuracy of 96.83% was achieved using combination of band 2 and band 3. (3) The 1-foot resolution subsets were found to yield higher classification accuracy than the 0.9m resolution subsets and the 2.7m resolution subsets for band 2 and band 3 for the six neighborhoods in Baton Rouge, Louisiana. The differences were generally over 5%. (4) Window size was found to have great influences on the discrimination of urban neighborhoods. The larger the window size, the higher the classification accuracy.
Transforming Semi-Honest Protocols to Ensure Accountability
Authors: Wei Jiang, Chris Clifton
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Secure multi-party computation (SMC) balances the use and confidentiality of distributed data. This is especially important for privacy-preserving data mining (PPDM). Most secure multi-party computation protocols are only proven secure under the semi-honest model, providing insufficient security for many PPDM applications. SMC protocols under the malicious adversary model generally have impractically high complexities for PPDM. We propose an accountable computing (AC) framework that enables liability for privacy compromise to be assigned to the responsible party without the complexity and cost of an SMC-protocol under the malicious model. We show how to transform a circuitbased semi-honest two-party protocol into a simple and efficient protocol satisfying the AC-framework.
Epitaxial lateral overgrowth of InP/GaAs (100) heterostructures by metalorganic chemical vapor deposition
Authors: Deping Xiong, Xiaomin Ren, Qi Wang, Aiguang Ren, Jing Zhou, Jihe Lv, Shiwei Cai, Hui Huang, Yongqing Huang
Venue: Microelectronics Journal (2007)

Epitaxial lateral overgrowth (ELOG) was used to grow InP on GaAs(100) substrates by metalorganic chemical vapor deposition (MOCVD). The selectivity of InP by ELOG is excellent and the regrowth InP epilayers have good morphology without polycrystalline on SiO"2 mask. The [01@?1] directional mask stripes and high V/III ratio are benefit to InP lateral growth. Compared to conventional direct growth, ELOG is effective in reducing the dislocation density, relaxing compressing strain in epilayers. In addition, the full width at half maximum (FWHM) of X-ray diffraction (XRD) @w scans and room temperature (RT) photoluminescence (PL) for a 3@mm thick epilayer by ELOG are 198arcsec and 44meV, respectively.
Towards a curriculum for electronic textiles in the high school classroom
Authors: Leah Buechley, Mike Eisenberg, Nwanua Elumeze
Venue: ACM SIGCSE Bulletin (2007)

This paper proposes a curriculum for a high school e-textile course-a curriculum rooted in our experiences in developing an e-textile construction kit and in holding several courses and workshops with these materials. The paper briefly describes the e-textile kit and reports on our teaching experiences, reflecting on the relationship between the evolving tools and curriculum and our user experiences.
CLOD-Based Efficient Algorithm for Real-Time Terrain Walkthrough
Authors: Wei Wei, Yu Zhuang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The multi-resolution terrain technique is the most efficient tool for real-time rendering of a complex terrain. In this paper a bintree-based optimized algorithm for level of detail (LOD) terrain is applied based on the overall research of former algorithms. At the same time, the node evaluation function is given according to the influence of viewer's orientation and terrain's roughness and deviation, which gives an accurate explanation of the LOD node and increases the executive efficiency. Meanwhile the method of recovering cracks which Duchaineau used in his whitepaper is improved. Next, this paper presents an approach to maintain the frame coherence. Last, we use the improved algorithm to simulate the terrain and get a good effect.
Image reconstruction with two-dimensional piecewise polynomial convolution
Authors: S. E. Reichenbach
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper describes two-dimensional, non-separable, piecewise polynomial convolution for image reconstruction. We investigate a two-parameter kernel with support [-2,2]/spl times/[-2,2] and constrained for smooth reconstruction. The performance reconstructing a sampled random Markov field is superior to the traditional one-dimensional cubic convolution algorithm.
Probability of Error in Information-Hiding Protocols
Authors: Konstantinos Chatzikokolakis, Catuscia Palamidessi, Prakash Panangaden
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

Randomized protocols for hiding private information can fruitfully be regarded as noisy channels in the information-theoretic sense, and the inference of the concealed information can be regarded as a hypothesis-testing problem. We consider the Bayesian approach to the problem, and investigate the probability of error associated to the inference when the MAP (Maximum Aposteriori Probability) decision rule is adopted. Our main result is a constructive characterization of a convex base of the probability of error, which allows us to compute its maximum value (over all possible input distributions), and to identify upper bounds for it in terms of simple functions. As a side result, we are able to improve substantially the Hellman-Raviv and the Santhi-Vardy bounds expressed in terms of conditional entropy. We then discuss an application of our methodology to the Crowds protocol, and in particular we show how to compute the bounds on the probability that an adversary breaks anonymity.
A graphic MMI emulator project for PCs
Authors: D. Popovici
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The man machine interface (MMI) is a useful tool in the control process allowing access to and from the programmable logic controllers (PLCs). The project deals with an MMI emulator running on laptops and PCs and designed to be 100% compatible with a real MMI. The emulator application is written in LabView which allows excellent graphics and easy programming. The MMI emulator is a user-friendly tool for setting up control applications and service having all the Windows facilities and sharing the PC resources. 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
Secure videoconferencing
Authors: Peter Honeyman, Andy Adamson, Kevin Coffman, Janani Janakiraman, Rob Jerdonek, Jim Rees
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

At the Center for Information Technology Integration, we are experimenting with algorithms and protocols for building secure applications. In our security testbed, we have modified VIC, an off-the-shelf videoconferencing application, to support GSS, a generic security interface. We then layered these interfaces onto a smartcard-based key distribution algorithm and a fast cipher. Because these components are accompanied by rigorous mathematical proofs of security and are accessed through narrowly-defined interfaces, we have confidence in the strength of the system's security.
MIDEA: Management of Disposable E-Mail Addresses for Mobile Systems
Authors: Daisuke Ochi
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Spam e-mail is an enormous problem today. In Europe this problem is usually limited to fixed Internet as the Short Message Service (SMS) or Multimedia Message Service (MMS) is used for message exchange in mobile cellular networks. However, in Japan e-mail addresses are used also for mobile messaging. Thus practical solutions are needed to retain customer satisfaction. Beneath SPAM filters, which are often unpractical to use, one possible solution to avoid SPAM e-mail is to use Disposable e-mail addresses (DEA). However, DEA needs bothersome management such as the binding between DEAs and a user, and between DEAs and correspondent partners. In this paper, we describe the MIDEA (Management Information in Disposable E-mail Address) system as a new solution. MIDEA hides the user's original address from the correspondent party. Once a DEA is revealed to a spammer, the user can trace the correspondent party, and stop spam e-mails by disabling this DEA. In comparison to other approaches, with MIDEA, users and mail servers do not have to manage binding tables manually and MIDEA does not require modifications on the correspondent party side.