ppxscal/embedding_network huggingface dataset:
Digital transmit and receive linear phase matched filters
Authors: Saleh Mneina, Saeid Belkasim
Venue: Signal Processing (2008)

The relationship between the causal real symmetric pulse and the linear phase characteristic is used for matched filter design. Real symmetric pulse transmission leads to a linear phase pulse shaping filter which is matched at both the receiver and the transmitter ends. This provides the potential for inexpensive system on a chip (SOC) design since the hardware implementation for transmit and receive filter is similar. The discrete time delayed raised-cosine pulse is considered for the causal real symmetric Nyquist pulse. A novel pulse shaping filter that retains a raised-cosine shape in the impulse response rather than the frequency response is considered in this paper. This design is completely different than the typical raised-cosine filter where the raised-cosine shape is maintained in the frequency response. The raised-cosine pulse used in our design has a finite number of transmission zero pairs; therefore, it can be perfectly reconstructed as the unit-sample response of the filter. Consequently, the transfer function of the shaping filter is exactly obtained from the z-transform of the pulse. This digital filter can be used at the receiver after the power amplification stage to achieve the desired amplification linearity in constant amplitude modulation systems. FIR filter design examples for various values of the delay parameter are described, and bit error rate simulation is also provided.
Stereo and Alternating-Pair Techniques for Display of Computer-Generated Images
Authors: Larry Hodges, David McAllister
Venue: IEEE Computer Graphics and Applications (1985)

Electro-optical stereo pair displays and alternating-pair displays are both viable methods for true 3-D representation of computer-generated images.
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
Authors: W. J. Hurd
Venue: IEEE Transactions on Computers (1974)

Some new algorithms are presented for efficiently generating pseudorandom noise both in hardware and software. In software, a new word of pseudorandom bits can be generated about every 12 machine cycles, and hardware implementations can generate pseudo Gaussian noise with bandwith of 20 MHz or more. The algorithms generate binary maximal-length linear recursive sequencies of high degree and with many nonzero terms. The ability to efficiently implement high-degree recursions is important because the number of consecutive bits which can be guaranteed to be both linearly and statistically independent is equal to the degree of the recursion. The implementations are by interconnection of several short shift registers in a linear manner in such a way that different widely spaced phase shifts of the same p-n sequence appear in the stages of the several registers. Some specific algorithms have been subjected to extensive statistical evaluation, with no evidence found to distinguish the sequences from purely random binary sequences.
A bi-objective reverse logistics network analysis for post-sale service
Authors: Feng Du, Gerald W. Evans
Venue: Computers and Operations Research (2008)

Reverse logistics, induced by various forms of return, has received growing attention throughout this decade. Reverse logistics network design is a major strategic issue. This paper addresses the analysis of reverse logistic networks that deal with the returns requiring repair service. A problem involving a manufacturer outsourcing to a third-party logistics (3PLs) provider for its post-sale services is proposed. First, a bi-objective optimization model is developed. Two objectives, minimization of the overall costs and minimization of the total tardiness of cycle time, are addressed. The facility capacity option at each potential location is treated as a discrete parameter. The purpose is to find a set of non-dominated solutions to the facility capacity arrangement among the potential facility locations, as well as the associated transportation flows between customer areas and service facilities. Then, a solution approach is designed for solving this bi-objective optimization model. The solution approach consists of a combination of three algorithms: scatter search, the dual simplex method and the constraint method. Finally, computational analyses are performed on trial examples. Numerical results present the trade-off relationship between the two objectives. The numerical results also show that the optimization for the first objective function leads to a centralized network structure; the optimization for the second objective function results in a decentralized network structure.
TRESSA: Teamed robots for exploration and science on steep areas: Field Reports
Authors: Terry Huntsberger, Ashley Stroupe, Hrand Aghazarian, Mike Garrett, Paulo Younse, Mark Powell
Venue: Journal of Field Robotics (2007)

Long-duration robotic missions on lunar and planetary surfaces (for example, the Mars Exploration Rovers have operated continuously on the Martian surface for close to 3 years) provide the opportunity to acquire scientifically interesting information from a diverse set of surface and subsurface sites and to explore multiple sites in greater detail. Exploring a wide range of terrain types, including plains, cliffs, sand dunes, and lava tubes, requires the development of robotic systems with mobility enhanced beyond that which is currently fielded. These systems include single as well as teams of robots. TRESSA (Teamed Robots for Exploration and Science on Steep Areas) is a closely coupled three-robot team developed at the Jet Propulsion Laboratory (JPL) that previously demonstrated the ability to drive on soil-covered slopes up to 70 deg. In this paper, we present results from field demonstrations of the TRESSA system in even more challenging terrain: rough rocky slopes of up to 85 deg. In addition, the integration of a robotic arm and instrument suite has allowed TRESSA to demonstrate semi-autonomous science investigation of the cliffs and science sample collection. TRESSA successfully traversed cliffs and collected samples at three Mars analog sites in Svalbard, Norway as part of a recent geological and astrobiological field investigation called AMASE: Arctic Mars Analog Svalbard Expedition under the NASA ASTEP (Astrobiology Science and Technology for Exploring Planets) program. &copy; 2007 Wiley Periodicals, Inc.
Software Processes Improvement and Specifications for Embedded Systems
Authors: Dong Jun, Lin Rui, He Yi-min
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

CMMI is virtual standard scaling software processes capability, but focuses on "What" and are too general to be suitable for different enterprises, especially for development process. Hence, a suit of "software processes improvement solution" referring CMMI level 2~3 for middle size enterprises is established. It is composed of: (1) The software processes specification, which is titled as "Simplified Parallel Processes"; (2) The software processes management tool "Future" based on SPP. SPP model has three layers and manage to answer "How": the top level is project management processes set, the middle layer is project development processes set, the down layer is project supply processes set respectively. Meanwhi le, concrete technical development specification for embedded systems is presented. It's frank and helpful for every process to obey in an orderly way. This specification and tool will be refined through practices.
Using Genetic Algorithms to Navigate Partial Enumerable Problem Space for Web Services Composition
Authors: Yuhong Yan, Yong Liang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Web services have received much interest to support business to business or enterprise application integration but how to combine these services optimally in a continually growing search space is always a challenge. This paper investigates composing business processes from individual services as a planning problem where a planner determines the execution order and other constraints among services in a process. When there are a large number of Web services available, it is not easy to find an execution path of Web services composition that can satisfy the given request, since the search space for such a composition problem is in general exponentially increasing. The planner has to work with a problem space that is not fully enumerable. This paper presents a method that combines Genetic Algorithms (GA) with planning to optimize composition results within an incompletely observed problem space. GA helps to navigate the search in the whole space. At each loop of GA, Web service data are queried and a new subspace is built. The planner works with the subspace and calculates a feasible solution. We test our method on a travel domain. The result is an optimized solution, though global optimization is not guaranteed.
Research on Inferring ELECTRE-III_s Parameters with Fuzzy Information and a Case on Naval Gun Weapon System Integration
Authors: Shiyan Sun, Hangyu Wang, Zhiming Qiu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Multiple attributes decision making (MADM) method is an important measure for system integration. Robustness analysis on MADM is a hotspot in these years which wins academe's great attention, and is supposed to be an effective way when countering imperfect information. Setting parameters in ELECTRE- is a vital and difficult step. In this paper, a method of inferring ELECTRE- 's parameters with fuzzy information based on robustness analysis is presented. First, ELECTRE- is transformed into a continuous smooth function of each parameter vector. Then, robustness analysis structure and a parameters inferring algorithm are provided by maximizing robustness margin based on mathematics programming. Moreover, how to resolve the programming problem is also discussed. At last, a illustrative example of Naval Gun Weapon System Integration is put forward. Key words Robustness analysis; Multiple attributes decision making; ELECTRE- ; naval gun weapon system
An Efficient Multimodal Language Processor for Parallel Input Strings in Multimodal Input Fusion
Authors: Yong Sun, Yu Shi, Fang Chen, Vera Chung
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Multimodal User Interaction technology aims at building more natural and intuitive interfaces allowing a user to interact with a computer in a way similar to human-to-human communication, for example, through speech and gesture. As a critical component in Multimodal User Interaction, Multimodal Input Fusion explores the ways to effectively interpret the combined semantic interpretation of user inputs through multiple modalities. This paper proposes a new efficient unification-based multimodal language processor which can handle parallel input strings for Multimodal Input Fusion. With a structure sharing technology, it has the potential to achieve a low polynomial computational complexity while parsing multimodal inputs in versatile styles. The applicability of the proposed processor has been validated through an experiment with multimodal commands collected from traffic incident management scenarios. The description of the proposed multimodal language processor and preliminary experiment results are presented.
A Strong RSA Signature Scheme and Its Application
Authors: Zhengjun Cao, Lihua Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

We present an efficient improvement of the strong RSA signature scheme [1], which is very similar to Fischlin signature [2]. Both two signatures are based on strong RSA assumption. In the original scheme, the signer has to choose a prime with prescribed length in signing phase. Except that, three generators of QR_n should be chosen in the setup phase. Our scheme removes or relaxes these restrictions. It only needs to choose two generators of QR_n and an odd. Our scheme saves about 1/2 computational cost of the original scheme. Moreover, we propose a blind signature scheme and a partially blind signature scheme based on the basic scheme. To the best of our knowledge, it's the first time to propose such a blind signature scheme and a partially blind signature scheme based on strong RSA assumption.
General Polynomial Time Decomposition Algorithms
Authors: Nikolas List, Hans Ulrich Simon
Venue: The Journal of Machine Learning Research (2007)

We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an optimal solution. The number of iterations required to be within ε of optimality grows linearly with 1/ε and quadratically with the number m of variables. The working set selection can be performed in polynomial time. If we restrict our considerations to instances of Convex Quadratic Optimization with at most k0 equality constraints for some fixed constant k0 plus some so-called box-constraints (conditions that hold for most variants of SVM-optimization), the working set is found in linear time. Our analysis builds on a generalization of the concept of rate certifying pairs that was introduced by Hush and Scovel. In order to extend their results to arbitrary instances of Convex Quadratic Optimization, we introduce the general notion of a rate certifying q-set. We improve on the results by Hush and Scovel (2003) in several ways. First our result holds for Convex Quadratic Optimization whereas the results by Hush and Scovel are specialized to SVM-optimization. Second, we achieve a higher rate of convergence even for the special case of SVM-optimization (despite the generality of our approach). Third, our analysis is technically simpler. We prove furthermore that the strategy for working set selection which is based on rate certifying sets coincides with a strategy which is based on a so-called "sparse witness of sub-optimality". Viewed from this perspective, our main result improves on convergence results by List and Simon (2004) and Simon (2004) by providing convergence rates (and by holding under more general conditions).
Certification and Revocation Schemes in Ad Hoc Networks Survey and Challenges
Authors: Marianne A. Azer, Sherif M. El-Kassas, Magdy S. El-Soudani
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Ad hoc networks have many features that make them attractive for the use in many applications. However, there are many unsolved problems in ad hoc networks; securing the network being one of the major concerns. The dynamic and cooperative nature of ad hoc networks present substantial challenges in securing these networks. In this paper, we focus on the role of Certification Authorities (CAs) in securing ad hoc networks communication. We introduce the concept of certification authorities and their selection, we survey and classify the certification schemes and give a brief overview on the revocation schemes. We conclude and end this paper by discussing some challenges and research issues in the certification and revocation in ad hoc networks.
Research and Implementation on Event Notification Service of ForCES Routers
Authors: Wengping Zhang, Weiming Wang, Ligang Dong
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper introduces the architecture of the ForCES routers. Furthermore, it specifies the research and implementation of the event notification service of ForCES routers. We can implement the event asynchronous notification of ForCES routers by using the doubly linked list. And we introduce two other features of ForCES routers, (1) the simplification of the events subscription and unsubscription, (2) the simplification and effectiveness of the filtering criteria. Finally, this paper has carried out the test about the port link status event. The experiment result testifies the feasibility of the event notification service of ForCES routers.
Transit-Stub Architecture for Peer-to-Peer SIP
Authors: Lichun Li, Juwei Shi, Wenjie Lin, Yao Wang, Yinong Liz, Yang Ji
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

A transit-stub P2PSIP architecture is proposed in this paper. In this architecture, heterogeneous P2PSIP overlays are interconnected in a decentralized approach provided by a transit overlay. A special SIP element, P2PSIP router, is designed to exchange SIP routing information and route SIP messages. Our architecture reacts to the change of route information quickly. Performance analysis indicates that session setup latency and register overhead are significantly reduced compared to those of the flat P2PSIP approach when applying the locality based grouping scheme. Finally, we describe deployment scenarios for the architecture and present our implementation.
Statistical analysis of RF circuits using combined circuit simulator-full wave field solver approach
Authors: Arun V Sathanur, Ritochit Chakraborty, Vikram Jandhyala
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

As technologies continue to shrink in size, modeling the effect of process variations on circuit performance is assuming profound significance. Process variations affect the on-chip performance of both active and passive components. This necessitates the inclusion of the effect of these variations on distributed interconnect structures in modeling overall circuit performance. In this work, first it is shown through field-solver simulations that larger process variations lead to non-Gaussian PDFs (Probability Density Functions) for the circuit equivalent parameters of distributed passives. Next, a method for accurate statistical analysis of coupled circuit-EM (Electromagnetic) systems without computing the equivalent circuit parameters of EM-modeled objects is demonstrated. This method also obviates the need to generate random variables representing the equivalent circuit parameters, from distributions which are correlated, non-Gaussian and non-closed-form. The proposed approach relies on application of the Response Surface (RS) methodology to the y-parameters of both the circuit and the distributed structures independently and expressing the eventual performance measures through a suitable combination of the y-parameters. The eventual performance measures are expressed through a hierarchical approach in terms of the underlying Gaussian random variables representing the process parameters. A rapid Response Surface Monte Carlo (RSMC) analysis on these derived response surfaces furnishes the PDFs and can also be used to predict the yield based on different qualifying criteria and objective functions.
Reduction of queue oscillation in the next generation Internet routers
Authors: Shan Suthaharan
Venue: Computer Communications (2007)

The Internet routers employing the random early detection (RED) algorithm for congestion control suffer from the problem of chaotic queue oscillation. It is well known that the slowly varying nature of the average queue size computed using an exponentially weighted moving average (EWMA) used in the RED scheme causes this chaotic behavior. This paper presents a new mathematical function to model the weighting parameter used in the EWMA. The proposed weighting function incorporates the knowledge of the dynamic changes in the congestion characteristics, traffic characteristics and queue normalization. Using this pragmatic information eliminates the slowly varying nature of the average queue size. It is evident from our simulations that the proposed approach not only reduces the chaotic queue oscillation significantly but also provides predictable low delay and low delay jitter with high throughput gain and reduced packet loss rate even under heavy load of traffic conditions.
A Workflow Model Supporting Dynamic BPR
Authors: Chen Lei, Liu Bin
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

BPR (Business Process Reengineering) theory puts its emphasis on gfundamental re-thinking and radically reengineering the enterprise business process"C but neglects the continuous improvement, which make a lot of BPR projects result in failure. This paper analyzes the traditional BPR model, finds out factors that result in high failure rate of traditional BPR project and proposes the dynamical BPR model and a micro-kernel structure for the adaptive workflow management system model. The most important concept of dynamical BPR is changing the business process dynamically in the execution stage. It is implemented with the supporting of this workflow management system.
Remote health-care monitoring using personal care connect
Authors: Marion Blount, Virinder M. Batra, Andrew N. Capella, Maria R. Ebling, William F. Jerome, Sherri M. Martin, Michael Nidd, Michael R. Niemi, Steven P. Wright
Venue: IBM Systems Journal (2007)

Caring for patients with chronic illnesses is costly-nearly $1.27 trillion today and predicted to grow much larger. To address this trend, we have designed and built a platform, called Personal Care Connect (PCC), to facilitate the remote monitoring of patients. By providing caregivers with timely access to a patient's health status, they can provide patients with appropriate preventive interventions, helping to avoid hospitalization and to improve the patient's quality of care and quality of life. PCC may reduce health-care costs by focusing on preventive measures and monitoring instead of emergency care and hospital admissions. Although PCC may have features in common with other remote monitoring systems, it differs from them in that it is a standards-based, open platform designed to integrate with devices from device vendors and applications from independent software vendors. One of the motivations for PCC is to create and propagate a working environment of medical devices and applications that results in innovative solutions. In this paper, we describe the PCC remote monitoring system, including our pilot tests of the system.
The Eventual Clusterer Oracle and Its Application to Consensus in MANETs
Authors: Weigang Wu, Jiannong Cao, Michel Raynal
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

This paper studies the design of hierarchical consensus protocols for mobile ad hoc networks. A two-layer hierarchy is imposed on the mobile hosts by grouping them into clusters, each with a clusterhead. The messages from and to the hosts in the same cluster are merged/unmerged by the clusterhead so as to reduce the message cost and improve the scalability. We adopt a modular method in the design, separating clustering from achieving consensus using the clusters. The clustering function, named eventual clusterer (denoted as .C), is designed to construct a clusterbased hierarchy over the mobile hosts in the network. Since .C provides the fault tolerant clustering function transparently, it can be used as a new oracle (i.e. an abstract tool to provide some kind of information about the state of the system) for the design of hierarchical consensus protocols. Based on .C, we design a new consensus protocol, which can significantly reduce the message cost of achieving consensu. We also propose an implementation of the .C oracle based on the failure detector .S.