Search

When extremely low-energy processing is required, the choice of data representation makes a tremendous difference. Each representation (e.g., frequency domain, residue coded, and log-scale) embodies a different set of tradeoffs based on the algebraic operations that are either easy or hard to perform in that domain. We demonstrate the potential of a novel form of encoding, race logic, in which information is represented as the delay in the arrival of a signal. Under this encoding, the ways in which signal delays interact and interfere with one another define the operation of the system. Observations of the relative delays (for example, the outcome of races between signals) define the output of the computation. Interestingly, completely standard hardware logic elements can be repurposed to this end and the resulting embedded systems have the potential to be extremely energy efficient. To realize this potential in a practical design, we demonstrate two different approaches to the creation of programmable tree-based ensemble classifiers in an extended set of race logic primitives; we explore the trade-offs inherent to their operation across sensor, hardware architecture, and algorithm; and we compare the resulting designs against traditional state-of-the-art hardware techniques. [ABSTRACT FROM AUTHOR]

Sharp PC-E200 series (19881994) The year after Tandy exited the market, Sharp delivered the vastly improved PC-E200. After Tandy However, as the 1980s computer market shifted away from home computers to PCs, pocket computer sales declined and the Sharp PC-1246 became the last Tandy pocket computer, the PC-8, in 1987. The PC-E200 featured 32KB of RAM and a new Z80-compatible processor designed using CMOS technology - that meant it could deliver decent processing speed and yet be powered by four AA batteries. Sure, pocket computers weren't about to replace the PC obsession we had during the 1990s, but they didn't need to - as an educational computer, particularly for computer and electrical engineering, these things would have been brilliant. [Extracted from the article]

The article discusses the role of context in machine learning and the need to distinguish between imagination and reality. It also addresses the importance of logic and reasoning in fields such as science, philosophy, and the humanities, and cautions against overlooking these aspects in favor of fiction and imagination. The article highlights the material and social implications of artificial intelligence, including the environmental impact and labor conditions associated with AI systems. It also explores the potential for artificial poetry, generative paintings, and synthetic music, while questioning the ability of entities without emotions to evoke genuine emotional responses. The article concludes by critiquing the economic system that prioritizes quantitative metrics over creative quality and raises concerns about the impact of automation on employment and workload. [Extracted from the article]

The article discusses pragmatic and theoretical aspects of graph isomorphism (GI). It discusses topics including algorithmic group theory, quantum computing, and logic. It examines the development of GI, autophormisms and canonical forms, combinatorial algorithms, and group theoretic algorithms. The article also discusses practical graph isomorphism.

The article offers information on digital twins and their various implementations. Digital twins are realistic digital representations of physical assets that can be used to monitor and predict performance, leading to better interventions and value creation. Article discusses main shapes of digital twins, which are model-centric and non-model-centric.

The author discusses the programming language Alloy. He mentions its use in designing software systems, previous software development tools including theorem provers and model checkers, and how Alloy uses relational logic, small scope analysis, and translation to a satisfiability solver to function.

This article discusses recent upgrades to the sound systems in two churches, Westover Hills Church in San Antonio, TX, and Sun Valley Community Church in Gilbert, AZ. Westover Hills Church installed DAS Audio's ARA Series line arrays, providing clear sound in their 2,200-seat Worship Center. Sun Valley Community Church upgraded with Meyer Sound's Panther line arrays and low-frequency control elements, creating an immersive worship experience in their 1,200-seat main campus. The article also mentions audio system installations at Church Unlimited in Salem, OR, Rose Hill Church in Baton Rouge, LA, and Salem Heights Church in Salem, OR, which have all improved the audio and visual experiences for their congregations. [Extracted from the article]

Most lawyers who are familiar with document assembly software will recognize the truth of the above statement but will be skeptical of their ability to build a document automation app in a week. The new low-code, cloud-based document automation solution can make it possible for more attorneys than ever to access the power and efficiency of document assembly. If all your templates are Microsoft Word documents, you can merge them into a single Word document and output them to Word or PDF. [Extracted from the article]

RADuxtion LLC has been issued a patent for a medical imaging system that aims to reduce harmful radiation exposure during imaging procedures. The system limits radiation exposure to patients, clinical personnel, and staff by adjusting operating settings based on physical characteristics of the subject and specific imaging procedures. By deactivating certain automatic exposure control features, the system aims to produce medically usable images while minimizing radiation exposure. This innovation addresses concerns about prolonged radiation exposure and aims to improve imaging safety and quality. [Extracted from the article]

The article discusses the successful collaboration between Robert Plant and Alison Krauss, who, despite their different musical backgrounds, joined forces in the Americana genre, resulting in the acclaimed albums "Raising Sand" and "Raise the Roof." Topics include the unexpected yet harmonious pairing of Robert Plant and Alison Krauss in the Americana genre, challenges faced by the production team during the live tour, and the captivating performances that delighted audiences.

A charge amplifier incorporates digital circuits as an alternative to the classic analog amplifier to achieve a high open-loop gain to maintain a consistent closed-loop gain over input capacitance variations. The digital-assisted charge amplifier employs a comparator, digital control logic, differential charge pump, current sources, common-mode feedback, and clock generator. A detailed analysis studies the amplifier stability and trade-off between ripple voltage and settling speed. A novel two-step reset scheme and tri-state charge pump minimize the output offset due to ripple residues. Fabricated in a 180-nm CMOS process, the digital-assisted amplifier achieves an open-loop gain of 101 dB, closed-loop gain of $15.0~\mu \text{V}$ /e-, input-referred noise of 221 $\text{e}^{-}$ rms, and output swing of 3 V while consuming 2.19 mW. The amplifier also demonstrates the ability to amplify a dynamic input current using a custom opto-electronic test setup. The amplifier maintains a consistent closed-loop gain across parasitic input capacitance from 6 pF to 94 pF. [ABSTRACT FROM AUTHOR]

Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical. Here, we survey recent results on how simple hashing schemes based on tabulation provide unexpectedly strong guarantees. Simple tabulation hashing dates back to Zobrist (A new hashing method with application for game playing. Technical Report 88, Computer Sciences Department, University of Wisconsin). Keys are viewed as consisting of c characters and we have precomputed character tables h1, . . ., hc mapping characters to random hash values. A key x = (x1, . . ., xc) is hashed to h1[x1] ⊕ h2[x2]. . . . . ⊕ hc[xc]. This schemes is very fast with character tables in cache. Although simple tabulation is not even four-independent, it does provide many of the guarantees that are normally obtained via higher independence, for example, linear probing and Cuckoo hashing. Next, we consider twisted tabulation where one input character is "twisted" in a simple way. The resulting hash function has powerful distributional properties: Chernoffstyle tail bounds and a very small bias for minwise hashing. This is also yields an extremely fast pseudorandom number generator that is provably good for many classic randomized algorithms and data-structures. Finally, we consider double tabulation where we compose two simple tabulation functions, applying one to the output of the other, and show that this yields very high independence in the classic framework of Wegman and Carter.26 In fact, w.h.p., for a given set of size proportional to that of the space consumed, double tabulation gives fully random hashing. We also mention some more elaborate tabulation schemes getting near-optimal independence for given time and space. Although these tabulation schemes are all easy to implement and use, their analysis is not. [ABSTRACT FROM AUTHOR]

A recent report from the University of Torino in Italy presents findings on the design of an efficient theorem prover for Conditional Logics with selection function semantics. Conditional Logics have gained attention for their applications in knowledge representation and artificial intelligence. The researchers introduce labelled sequent calculi for these logics and present an implementation in SWI Prolog, along with standard heuristics and refinements. The performance of the theorem prover is shown to be promising and significantly better than its predecessor. This research has been peer-reviewed and published in the Journal of Logic and Computation. [Extracted from the article]

The article discusses secret of Germany's magnetic amplifiers: metal alloys that niade devices compact, efficient, and reliable. It mentions devices compact, efficient, and reliable. It mentions magnetic amplifiers is built around a metallic core of material that can easily be saturated; and also mentions use of magnetic amplifiers by the US. space program.

This article discusses the concept of the "imitation game" proposed by Alan Turing in 1950, which tests whether a machine can think by comparing its responses to those of a human. It explores the challenges and potential problems that arise when computers are able to produce responses that are indistinguishable from humans, such as bias and hallucinations. The article emphasizes the need for legal and moral frameworks to ensure responsible use of AI technology, and highlights the work of the ABA's Presidential Task Force on the Law and Artificial Intelligence. It also mentions the potential benefits of AI in legal education and access to justice, but cautions against the unintended consequences and risks that may arise. The article concludes by referencing Albert Einstein's perspective on the responsible use of scientific discoveries and emphasizes the importance of considering the moral implications of AI. [Extracted from the article]

A patent has been issued to Analog Devices Inc. for a system and method to maintain timing precision in different operating modes of a device. The invention addresses the issue of clock drift in wireless nodes that operate in low-power mode to conserve battery life. The timing circuit in the device switches between high and low frequency clock signals, which are synchronized to maintain frequency stability and accuracy. This technology can be used in devices that rely on coordinated or synchronized communication protocols. [Extracted from the article]

An introduction to an article published in the journal is presented about what is identified as a post-Moore's Law computing approach known as race logic.

In this article, a digitally controlled voltage-mode buck converter with embedded transient improvement using delay line-based control techniques is presented. Two voltage-controlled delay lines (VCDL’s) are used to convert the difference between the feedback and reference voltages to a delay time difference. The delay difference is then fed to the multiple-outputs bang-bang phase detector (MOBBPD), which converts the input delay difference to multiple-bits digital codes in a simple nonlinear way. The MOBBPD scheme leads to high resolution for small output ripple and improved response when large load transient happens in a low-cost way. A digital loop filter (DLF) accumulates the MOBBPD output codes to control the duty cycle through a novel digital pulse width modulator (DPWM) to regulate the output voltage. By designing the coefficients of the DLF, a type-II compensator can be achieved through the integral and proportional paths to make the loop stable. The proposed DPWM, which consists of a divide-by-8 frequency divider, two delay lines and a few simple digital logics, achieves a wide tunable range of duty cycle under various process corners and supply voltages. A proof-of-concept design of the proposed buck converter was fabricated in a standard $0.18~\mu \text{m}$ CMOS technology. The measured results show that it achieves a very wide output voltage range from 0.1 V to 3.5 V for a input supply range from 2.4 V to 3.6 V. With a 400 mA step in the load current, the overshoot/undershoot is less than 87 mV and the 1% settling time is less than $16~\mu \text{s}$. The peak efficiency is 95.2% with 250 mA load current at 2.4 V output voltage with 3.3 V input voltage. [ABSTRACT FROM AUTHOR]

A fully integrated 802.15.4a-LRP-UWB-PHY- and ETSI-compliant impulse-radio ultra-wide-band (IR-UWB) transmitter (TX) front-end, powered by an RF-energy-harvester in 180 nm CMOS technology, is presented. The TX is working in the 7 GHz band transmitting with −42 dBm at 5.12 kbps data rate, consuming 1.89 μ W. Two circuit implementations of RF-energy-harvesters are presented and, based on measurements, a combined and optimized structure is proposed which is capable of generating 5 μ W dc-power at −13.3 dBm RF input power at a frequency of 868MHz. According to the overall SoC power budget, this amount of harvested energy is sufficient to power the IR-UWB-TX front-end, an ADC with pre-amplifier and the digital core logic for a wireless bio-sensing chip. Furthermore, improvements of the presented IR-UWB TX circuitry are discussed. [ABSTRACT FROM AUTHOR]

The first switch to find its way onto a motorcycle was the ignition system's mechanical contact breaker. Place a cam on the engine's crankshaft or camshaft, arranged so that the cam bumps open a pair of switch contacts just before the piston reaches top dead center. In 1969, the Spanish Femsa transistor-switched self-generating CDI ignition appeared, to replace the 1940s magnetos and mechanical contact-breaker switches (or "points") on Japanese racing motorcycles. [Extracted from the article]

The article discusses methods for testing whether a computer program will terminate or not. This involves methods of coping with a mathematical problem that was proved to be formally undecidable by the pioneering computer scientist Alan Turing. It is known as the halting problem, or program termination problem. Although a yes or no answer cannot always be supplied, the article presents a method, based on Ramsey theory, which provides yes or no answers often enough to be useful. The method can be scaled up to large programs by constructing modular termination arguments.

The article discusses the status of research papers published by computer science (CS) conferences, as compared with those published in CS journals. Debate has occurred in relation to the proper way in which to qualify the research presented in a paper. Problems exist in determining the quality of research in various journals due to the wide array of publication opportunities available. A scale that has been created to measure the quality of conference papers in a variety of ways, such as citations and rejection rates, is discussed.

The article presents a discussion of improvements in computing which can be obtained by combining performance evaluation methods with model checking techniques. The idea of jointly working on quantitative verification and performance is described as a useful way of combining complementary functions. An overview of the history of the mathematical concepts involved is presented, from the first half of the 20th century to the early 21st century. Rules of correctness proofs, queuing and temporal logic are discussed.

Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as nondeterministic choices made by the program's execution environment, it is still possible to glean very useful information about how such statically unknown values may or must influence computation. We give a method for integrating such nondeterministic choices with an expressive static analysis. Interestingly, we cannot solve the resulting recursive constraints directly, but we give an exact method for answering all may and must queries. We show experimentally that the resulting solved forms are concise in practice, enabling us to apply the technique to very large programs, including an entire operating system. [ABSTRACT FROM AUTHOR]

The article presents information on a study which investigated the teaching of concurrency in computer science. Two groups of computer science students were asked to come up with solutions to concurrency problems involving the sale of concert tickets. One group was composed of relatively advanced students, the other of neophytes. Although concurrency problems are typically considered an advanced topic, they have become particularly pertinent in the field, and the results of this study indicate that both neophytes and more advanced students tend to offer the same common-sense observations, and make similar types of common mistakes. This is said to indicate that concurrency can be usefully studied at the introductory level.

We report on the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. We assume correctness of compiler, assembly code, hardware, and boot code. seL4 is a third-generation microkernel of L4 provenance, comprising 8700 lines of C and 600 lines of assembler. Its performance is comparable to other high-performance L4 kernels. We prove that the implementation always strictly follows our high-level abstract specification of kernel behavior. This encompasses traditional design and implementation safety properties such as that the kernel will never crash, and it will never perform an unsafe operation. It also implies much more: we can predict precisely how the kernel will behave in every possible situation. [ABSTRACT FROM AUTHOR]

Information integration is a key challenge faced by all major organizations, business and governmental ones alike. Two research facets of this challenge that have received considerable attention in recent years are data exchange and data integration. The study of data exchange and data integration has been facilitated by the systematic use of schema mappings, which are high-level specifications that describe the relationship between two database schemas. Schema mappings are typically expressed in declarative languages based on logical formalisms and are chosen with two criteria in mind: (a) expressive power sufficient to specify interesting data interoperability tasks and (b) desirable structural properties, such as query rewritability and existence of universal solutions, that, in turn, imply good algorithmic behavior. Here, we examine these and other fundamental structural properties of schema mappings from a new perspective by asking: How widely applicable are these properties? Which schema mappings possess these properties and which do not? We settle these questions by establishing structural characterizations to the effect that a schema mapping possesses certain structural properties if and only if it can be specified in a particular schema-mapping language. More concretely, we obtain structural characterizations of schema-mapping languages such as globalas- view (GAV) dependencies and local-as-view (LAV) dependencies. These results delineate the tools available in the study of schema mappings and pinpoint the properties of schema mappings that one stands to gain or lose by switching from one schema-mapping language to another. [ABSTRACT FROM AUTHOR]

The problem of writing software for multicore processors is greatly simplified if we could automatically parallelize sequential programs. Although auto-parallelization has been studied for many decades, it has succeeded only in a few application areas such as dense matrix computations. In particular, auto-parallelization of irregular programs, which are organized around large, pointer-based data structures like graphs, has seemed intractable. The Galois project is taking a fresh look at auto-parallelization. Rather than attempt to parallelize all programs no matter how obscurely they are written, we are designing programming abstractions that permit programmers to highlight opportunities for exploiting parallelism in sequential programs, and building a runtime system that uses these hints to execute the program in parallel. In this paper, we describe the design and implementation of a system based on these ideas. Experimental results for two real-world irregular applications, a Delaunay mesh refinement application and a graphics application that performs agglomerative clustering, demonstrate that this approach is promising. [ABSTRACT FROM AUTHOR]

The article discusses Object-Process Methodology, which combines graphics and text representations of complex systems to make it easier to understand technical ideas in computer programming. The author argues on behalf of the Object-Process Methodology approach in addressing assumptions about the dual channel and active processing. Bimodality and complexity management via hierarchical decomposition is demonstrated, and the author details ways to employ some of the ideas in the article in the Systems Modeling Language.

A patent has been issued for a digital PCR chip with an on-chip micro-slot array based on impedance detection and its manufacturing method. The chip is designed to simplify the PCR system and make it more portable and cost-effective. It uses electrochemical impedance spectroscopy technology to measure impedance and determine if the PCR reaction is completed. The chip includes a micro-slot array, power management unit, clock generation module, digital control logic module, driver module, analog-to-digital converter (ADC), backscatter module, and power-on reset module. The micro-slot array acts as a container for PCR reactants, and the chip is powered through a wireless power supply method. The manufacturing method involves fabricating the micro-slot array using magnetron sputtering, photoetching, and plasma treatment. [Extracted from the article]

Marvell has introduced a new 5nm Multi-Gigabit PHY platform that delivers up to 10 Gbps of bandwidth for Wi-Fi 7 while reducing power consumption. The platform will be used to develop additional standalone PHYs, integrated SoCs, and custom ASICs for specific markets and applications. Marvell also launched the COLORZ 800 family of pluggable modules for data center interconnects, which can provide up to 800 Gbps of bandwidth for DCI links up to 500km. These modules are expected to lower the capital cost of DCI by up to 75% compared to traditional rack-based DCI boxes. [Extracted from the article]

The court noted that outside the arbitration context, courts routinely enforce appellate waivers in plea agreements, "where the stakes, namely years of lost liberty, are far higher than the monetary award at issue here." Based on the agreement's severability clause, the court found that the appeal waiver was still valid because it did not concern "the essence of the contract." December 16, 2021 Dr. Rami Abumasmah executed an employment agreement with Beckley Oncology Associates (BOA). [Extracted from the article]

December 16, 2021 Since Guidotti v. Legal Helpers Debt Resolution, LL.C, 716 F.3d 764 (3d Cir. 2013), trial judges in the Third Circuit have followed a fairly consistent pattern when faced with a motion by a defendant to compel arbitration: If the complaint contains sufficient information on which to decide the motion under a Federal Rule of Civil Procedure 12 (b)(6) standard, then the court will proceed to decide the motion based on the arbitration agreement and other facts alleged (or documents referenced or attached). On the renewed motion, the court would determine If section 1 applied and, if so, whether the State law applicable to the arbitration agreement would require arbitration. On appeal, Amazon argued that discovery was not required and that the district court's initial inquiry should have been what law applied to the arbitration agreement assuming that the section 1 exemption applied to the plaintiff. [Extracted from the article]

Unless the keyboard shortcut Control(Ctrl)+Shift is pressed before clicking, the Windows version of Chrome will open any links in the same tab. A In simple terms, Quality Updates are generally repairs while Feature Updates are functionality upgrades. When it comes to the reliable operation of Windows, fixes are clearly more important than upgrades to features - so Quality Updates are more frequent. For example, the most recent Feature Update - known as the May Update - introduced the option to set a "light" theme across Windows, and flexibility to pause updates. [Extracted from the article]

This article introduces adaptive object-oriented programming as an extension to conventional object-oriented programming. Adaptive object-oriented programming facilitates expressing the elements. Adaptive object-oriented programs specify essential classes and methods by constraining the configuration of a class structure that attempts to customize the adaptive program, without spelling out all the details of such a class structure. An adaptive program is specified using a collection of propagation patters. Adaptive programs specified in the propagation pattern notation exist at a higher level of abstraction than conventional object-oriented programs, much in the same way parameterized classes exist at a different level than nonparameterized. Class dictionary graphs represent class structures at a programming language-independent level, using vertices to represent classes and edges to represent relationships between classes. There are three kinds of vertices in a class dictionary graph: construction, alternation and repitition vertices.

Describes how the text of a large part of the British Nationality Act 1981 was translated into a simple form of logic. Possible applications of the translation; Use of logic based on programming language Prolog; Arbitrary logical consequences of legislation expressed in logical form.

Presents a system to transform sentence narrative into semantic case structures. Application of a thirteen-sentence narrative about a V-2 rocket; Construction of the symmetric translation grammars; Importance of semantic structures for simplifying summaries.

A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. The basic concepts include intervals and their partitions, functional restriction, images, pointwise extension of relations, ordering, single-point variation of functions, various equivalence relations for array values, and concatenation. The effectiveness of these ideas is illustrated by informal descriptions of algorithms for binary search and merging, and by a short formal proof. [ABSTRACT FROM AUTHOR]

An extended form of semantic network is defined, which can be regarded as a syntactic variant of the clausal form of logic. By virtue of its relationship with logic, the extended semantic network is provided with a precise semantics, inference rules, and a procedural interpretation. On the other hand, by regarding semantic networks as an abstract data structure for the representation of clauses, we provide a theorem-prover with a potentially useful indexing scheme and path-following strategy for guiding the search for a proof. [ABSTRACT FROM AUTHOR]

Because of the large number of strategies and inference rules presently under consideration in automated theorem proving, there is a need for developing a language especially oriented toward automated theorem proving. This paper discusses some of the features and instructions of this language. The use of this language permits easy extension of automated theorem-proving programs to include new strategies and/or new inference rules. Such extendability will permit general experimentation with the various alternative systems. [ABSTRACT FROM AUTHOR]

The article presents information on microelectronics and computer science. Computer science is based on mathematical reasoning. The design of computing machines and the intellectual framework were both affected by the integrated circuit technology. A typical computer's architecture includes a single logical processing element that communicates with a random-access memory. Parallel processors are those which make a large number of logic elements operate simultaneously.

The article discusses the Massachusetts Institute of Technology (MIT), Microsoft Research and the Israel Institute of Technology's study which showed that lock-free algorithms performed as effectively as wait-free algorithms. Topics discussed include the importance of parallel computing in chip manufacturing and the two types of algorithms as part of class of techniques used in shared-memory systems, the evolution of parallel computation, the use of lock-free algorithms by programmers and the transactional memory as a lock-free control method.

Defines a class of context-free grammars called the simple LR(k) or SLR(k) grammars. Inclusion of weak precedence and simple precedence grammars as proper subsets in SLR(k) grammars; Construction and implementations of parsers for the SLR(k) grammars; Superiority over precedence techniques in terms of the speed of parser construction and in size and speed of resulting parsers.

In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which con be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics. [ABSTRACT FROM AUTHOR]

A technique for simulating the detailed logic networks of large and active digital systems is described. Essential objectives sought ore improved ease and economy in model generation, economy in execution time and space, and a facility for handling simultaneous activities. The main results obtained are a clear and useful separation of structural and behavioral model description, a reduction of manual tasks in converting Boolean logic into a structural model, the elimination of manual processes in achieving exclusive simulation of activity, an event-scheduling technique which does not deteriorate in economy as the event queue grows in length, and a simulation procedure which deals effectively with any mixture of serial and simultaneous activities. The passage of time is simulated in a precise, quantitative fashion, and systems to be simulated may be combinations of synchronous and asynchronous logic. Certain aspects of the techniques described may be used for the simulation of network structures other than digital networks. [ABSTRACT FROM AUTHOR]