Miracle-dz/UniFAR-FTUs huggingface dataset:
80-MHz bandpass ΔΣ modulators for multimode digital IF receivers

Three fully differential bandpass (BP) /spl Delta//spl Sigma/ modulators are presented. Two double-delay resonators are implemented using only one operational amplifier. The prototype circuits operate at a sampling frequency of 80 MHz. The BP /spl Delta//spl Sigma/ modulators can be used in an intermediate-frequency (IF) receiver to combine frequency downconversion with analog-to-digital conversion by directly sampling an input signal from an IF of 60 MHz to a digital IF of 20 MHz. The measured peak signal-to-noise-plus-distortion ratios are 78 dB for 270 kHz (GSM), 75 dB for 1.25 MHz (IS-95), 69 dB for 1.762 MHz (DECT), and 48 dB for 3.84 MHz (WCDMA/CDMA2000) bandwidths. The circuits are implemented with a 0.35-/spl mu/m CMOS technology and consume 24-38 mW from a 3.0-V supply, depending on the architecture.
Approximate nearest neighbor problem in high dimensions

We investigate the problem of finding the approximate nearest neighbor when the data set points are the substrings of a given text T . The exact version of this problem is defined as follows. Given a text T of length n, we want to build a data structure that supports the following operation: given a pattern P , find the substring of T that is the closest to P . Since the exact version of this problem is surprisingly difficult, we address the approximate version, in which we are allowed to return a substring of T that is at most c times further than the actual closest substring of T . This problem occurs, for example, in computational biology [4, 5]. In particular, we study the case where the length of the pattern P , denoted by m, is not known in advance, which is the most natural scenario. We present a data structure that uses O(n) space and has O ( n +mn ) query time when the distance between two strings is the Hamming distance. These bounds essentially match the earlier bounds of [12], which assumed that the pattern length m is fixed in advance. Furthermore, our data structure can be constructed in O ( n + nM ) time, where M is an upper bound for m. This time essentially matches the preprocessing time of [12] as long as the term O(n) dominates the running time, which is the case when, for example, c < 3. We also extend our results to the case where the distances are measured according to the l1 distance. The query time and the space bound are essentially the same, while the preprocessing time becomes O ( n + nM )
Experimental Analysis of the Real-time Recurrent Learning Algorithm

Abstract The real-time recurrent learning algorithm is a gradient-following learning algorithm for completely recurrent networks running in continually sampled time. Here we use a series of simulation experiments to investigate the power and properties of this algorithm. In the recurrent networks studied here, any unit can be connected to any other, and any unit can receive external input. These networks run continually in the sense that they sample their inputs on every update cycle, and any unit can have a training target on any cycle. The storage required and computation time on each step are independent of time and are completely determined by the size of the network, so no prior knowledge of the temporal structure of the task being learned is required. The algorithm is nonlocal in the sense that each unit must have knowledge of the complete recurrent weight matrix and error vector. The algorithm is computationally intensive in sequential computers, requiring a storage capacity of the order of the thi.
How to Build a Quantum Computer

Quantum computer technology is progressing rapidly with dozens of qubits and hundreds of quantum logic gates now possible. Although current quantum computer technology is distant from being able to solve computational problems beyond the reach of non-quantum computers, experiments have progressed well beyond simply demonstrating the requisite components. We can now operate small quantum logic processors with connected networks of qubits and quantum logic gates, which is a great stride towards functioning quantum computers. This book aims to be accessible to a broad audience with basic knowledge of computers, electronics and physics. The goal is to convey key notions relevant to building quantum computers and to present state-of-the-art quantum-computer research in various media such as trapped ions, superconducting circuits, photonics and beyond.
Product hierarchy-based customer profiles for electronic commerce recommendation

Personalized service is becoming a key strategy in electronic commerce. Traditional personalization techniques such as collaborative filtering and rule-based method have many drawbacks, including lack of scalability, reliance on subjective user rating or static profiles, and the inability to capture a richer set of semantic relationships among objects. In this paper, we present a new approach by building customer profiles based on the product hierarchy for more effective personalization in electronic commerce. We divide each customer profile into three parts: the basic profile, preference profile, and rule profile. Based on the customer profiles, two kinds of recommendations can be generated: interest recommendation and association recommendation. We also propose a special data structure: a profile tree for effective searching and matching. By using our method, customer profiles can be constructed online, and real-time recommendations can be implemented. Finally, we conducted experiments to validate our methods using real data.
Cross-Cultural Influences on Global Electronic Commerce

This paper provides a framework for exploring cultural influences on consumer purchasing behavior in the special case of electronic commerce. The approach adopted in this paper borrows directly from at least two converging sources: the research in international consumer behavior, and the research in marketing issues in electronic commerce. By recognizing the cultural differences in global markets, the firm will be better positioned to satisfy the unique needs of international consumers. The globalization of the international marketplace, which will be facilitated by the emergence of electronic commerce as a new channel of transacting business will result in a move in the firm’s strategy away from niche marketing and towards more head to head competition. In order to survive in this competitive environment it will be essential for firms to have an in-depth understanding of international consumer behavior so that they can effectively cater to the unique tastes of the consumers of each individual culture and thereby gain a competitive advantage in the international marketplace. The managerial implications of this research are answers to questions such as how best can the firm exploit this new form of transacting business to maximize its leverage in the global marketplace and increase its market share? How should the firm position its products in the global electronic marketplace?
Parallel Programming Languages: Do They Meet the Needs of Scientists and Engineers?

Although computer scientists use parallel programming languages to model concurrency, scientists and engineers approach parallelism with a different objective. The physical world they model is inherently parallel, but scientific programmers have become accustomed to using sequential techniques for its study. It is the ability to handle massive amounts of data that motivates their conversion to parallelism. This report considers the current state of the art of parallel programming languages from the perspective of scientists and engineers. It reviews the problem-solving strategies commonly employed by scientific programmers and compares them with the conceptual models for parallelism supported by high-level programming languages available to the general user community. The fact that existing languages were designed and implemented by members of the computer science profession is reflected in the prevalence of features representing that community''s view of parallelism. Consequently, scientific programmers are unlikely to find language models that map cleanly to their problem-solving approaches.
Integration of navigational and cartographic data

The amount of cartographic data distributed on the Internet and to mobile devices is still increasing. Today, most of the data are raster data, but the emerging XML-standards will make it easier to distribute vector data. One of the main advantages with vector data is that it is easier to integrate data from different sources than it is with raster data. However, this requires a suitable technical environment to perform the data-integration and also algorithms for performing the integration.
Performance comparisons of pseudo-N-path SC cells in filters with real operational amplifiers

Four pseudo-N-path switched capacitor (SC) cells are compared with regard to finite op amp gain and gain-bandwidth ratio. The results show that a three-path RAM-type cell displays the best performance with respect to the other cells studied. Unfortunately, the RAM-type cell is affected by clock-feedthrough noise, which can limit drastically its field of application. Some improvement can be achieved using fully differential techniques. Clock-feedthrough-free operation is typical for circulating-delay-type designs, but they are much more affected by op amp nonidealities than RAM-type designs. Therefore, in applications where the signal-to-noise ratio is a critical filter requirement, the RAM-type cell based on the z to -z/sup N/ transformation can be used, since it is fully immune to clock-feedthrough noise and gives a sensitivity performance just slightly higher than that of the three-path RAM-type cell. <<ETX>>
Cluster analysis and dimensionality reduction in a hierarchical corpus model

The article presents a semantic model of the polish language based on the polish Wikipedia texts. The model is a part of an automatic speech recognition system and verifies sentences hypotheses. Methods of filtering and clustering of the documents, which aim to accelerate the computations, are presented. The authors emphasize the delegation of the processing tasks to the database engine, where it is possible to gain the performance.
Lookahead And Latent Learning In ZCS

Learning Classifier Systems use reinforcement learning, evolutionary computing and/or heuristics to develop adaptive systems. This paper extends the ZCS Learning Classifier System to improve its internal modelling capabilities. Initially, results are presented which show performance in a traditional reinforcement learning task incorporating lookahead within the rule structure. Then a mechanism for effective learning without external reward is examined which enables the simple learning system to build a full map of the task. That is, ZCS is shown to learn under a latent learning scenario using the lookahead scheme. Its ability to form maps in reinforcement learning tasks is then considered.
On the design of LPV controllers for the F-14 aircraft lateral-directional axis during powered approach

Presents the preliminary design and testing of a linear parameter-varying (LPV) controller for the F-14 aircraft lateral-directional axis. The controller is designed for the powered approach flight envelope, which consists of angle-of-attack/airspeed variations from 2 degrees/182 knots to 14 degrees/126 knots. The design is based on four linearized models at /spl alpha/=2, 6, 10.5, and 14 degrees angle-of-attack. The resulting LPV controller performs well when implemented in a Simulink nonlinear simulation of the F-14 aircraft, in the full order Fortran nonlinear simulation, and in pilot-in-the-loop simulations at the Naval Air Warfare Center at Patuxent River, Maryland.
Latent Dirichlet Allocation in R

Topic models are a new research field within the computer sciences information retrieval and text mining. They are generative probabilistic models of text corpora inferred by machine learning and they can be used for retrieval and text mining tasks. The most prominent topic model is latent Dirichlet allocation (LDA), which was introduced in 2003 by Blei et al. and has since then sparked off the development of other topic models for domain-specific purposes. This thesis focuses on LDA's practical application. Its main goal is the replication of the data analyses from the 2004 LDA paper ``Finding scientific topics'' by Thomas Griffiths and Mark Steyvers within the framework of the R statistical programming language and the R~package topicmodels by Bettina Grun and Kurt Hornik. The complete process, including extraction of a text corpus from the PNAS journal's website, data preprocessing, transformation into a document-term matrix, model selection, model estimation, as well as presentation of the results, is fully documented and commented. The outcome closely matches the analyses of the original paper, therefore the research by Griffiths/Steyvers can be reproduced. Furthermore, this thesis proves the suitability of the R environment for text mining with LDA. (author's abstract)
The GeoGraph 3D Computational Laboratory

Abstract : Human interactions of all kinds, both friendly and unfriendly, are increasingly structured by networks of transportation and communication spatial technologies. Yet our tools to model, understand, and predict dynamic human interactions and behavior on spatial networks and geographic landscapes have lagged far behind. Even recent progress in social network modeling has not yet offered us any capability to model dynamic processes among mobile agents who interact at all scales on small-world and scale-free geographic networks. Computational laboratory modeling of dynamic human interactions on richly structured landscapes is important for understanding the sometimes counter-intuitive dynamics of such loosely coupled systems of non-linear interactions. Deeper understanding is more important than ever not only because the stakes are so much higher, but because we now have greater strategic control over the structural design and therefore the effects of our networks of organizational and spatial technologies.
Time-optimal graph traversal for two agents: when is formation travel beneficial?

This paper addresses the question, "when and how should autonomous agents engage in formation travel? " Specifically, we formulate and solve an optimization problem for two agents traversing a graph, under joint velocity constraints. The results are applicable to the problem of constructing optimal trajectories for formation travel. The analysis is illustrated by two examples.
Cellular position location techniques a parameter detection approach

In the United States, the Federal Communications Commission (FCC) has adopted rules requiring wireless service providers to supply two-dimensional location information of mobile users who request the E-911 emergency service. Therefore, wireless providers will need to use an effective and accurate position location technology using the existing cellular infrastructure. We analyze the two-dimensional position estimation problem as a parameter detection approach using three radio frequency location techniques within the existing cellular infrastructure.
The Integrative Business Experience: Real Choices and Real Consequences Create Real Thinking

This article describes an innovation called the Integrative Business Experience (IBE) that links a set of required core business courses to an entrepreneurial practicum course in which two things occur. One is that students are concurrently enrolled in the required core business courses and a practicum course while they create a start-up business (based on an actual bank loan) and use the profits to finance a hands-on community service project. The other is that the core courses are taught using the Team-Based Learning (TBL) to shift the focus of class work from content delivery to content application, and promote the development of interpersonal and team skills. The wide acceptance of the value of active learning over the past 30 years has supported the foundation of Kolb's Experiential Learning Theory, i.e., learning is transformed through experience. IBE provides students with a transformative experience that can engage them in every learning style in Kolb's model. IBE combined with TBL fosters development of the teamwork, interpersonal, and communication skills necessary for effective problem-solving. This article uses Kolb's cycle of learning to describe how and why the real experience provided by IBE enables students to develop the ability to engage in analytical thinking through practical reasoning, reflective exploration of meaning, and multiple framing. Further, because students’ experiences in IBE are real, they are able to reflect on their personal identities and values as they make decisions in both their business and service activities, and experience the consequences of their choices.
Philosophy And The Computer

Part 1 Epistemology and metaphysics: the computer as a laboratory for epistemology, Herbert Simon philosophical challenges in distributed computing, Peter Barnett SNePS - a fully intensional propositional semantic network, Stuart C. Shapiro, William J. Rapaport the structure of extension, Christopher J. Thornton. Part 2 Philosophy of mind: representational genera, John Haugeland the wanton module and the frame problem, Eric Dietrick and Chris Fields why thinking isn't computing, Daryl Close the secret operations of the mind, Saul Trager. Part 3 Logic: searching for proofs (in sentimental logic), Wilfried Sieg and Richard Scheines some problems on the computational representation of inference, Tryg Ager selecting a contradiction in natural deduction theorem proving, Andrew McCafferty automated translation from English to logic and back, Herbert E. Hendry and Joseph F. Hanna. Part 4 Algorithmics: a new paradigm for mathematics, Newcomb Greenleaf. Part 5 Ethics: should computer programs be ownable? , David H. Carey moral responsibility and programming, Robert Zerwekh. Part 6 Computer-assisted instruction: learning ethnical decision-making, Pieter Mostert et al finite structures in SYMLOG, Frederic D. Portoraro an interface for deductive proof construction, Marvin J. Croy Socratic dialogue, Don Barker and Stephen Scott proof designer, Mark Bedau and James Moor.
End-system architecture for distributed networked multimedia applications: issues, trends and future directions

The emerging broadband computer networks (wired and wireless) are likely to have numerous multimedia applications, such as videoconferencing, interactive games, and collaborative computing standard features in desktop PCs and portables. In recent years there have been significant developments in the field of multimedia coding algorithms and their VLSI implementations along with the development of high speed networking technology (e.g., ATM, FDDI, fast Ethernet). But the end-system architecture (software and hardware) as a whole is lagging behind these advancements. Optimized hardware and software architectures are needed for end systems that will guarantee predictable performance of real-time multimedia applications according to user provided QoS. In this paper, we identify the major end-system hardware and software requirements for networked multimedia applications. Focusing mainly on hardware and operating system levels, we advocate an integrated end-system architecture rather than some ad-hoc solutions for real-time multimedia computing, in addition to general purpose computing in a distributed environment. A core-based system architecture is proposed. We observe that interfacing with high speed networks, inter-device level data transfer, power efficiency and in addition, system resource utilization are some of the issues that need serious consideration in an end-system architecture.
OSI Network‐layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path‐length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathe.
Language Documentation meets Language Technology

Thepaper describes work-in-progress by the Pite Saami, Kola Saami and Izhva Komi language documentation projects, all of which use similar data and technical frameworks and are carried out collaboratively in Uppsala, Tromso, Syktyvkar and Freiburg. Our projects record and annotate spoken language data in order to provide comprehensive speech corpora as databases for future research on and for these endangered – and under-described – Uralic speech communities. Applying language technology in language documentation helps us to create more systematically annotated corpora, rather than eclectic data collections. Ultimately, the multimodal corpora created by our projects will be useful for scientifically significant quantitative investigations on these languages in the future.
Time Synchronization of Underwater Wireless Sensor Networks

The recent development of communication and sensor technology results in the growth of a new attractive and challenging area â€“ wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodesâ€™ resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of networkâ€™s operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks.