A Fundamental Problem

2001 ◽  
pp. 117-135
Author(s):  
Rand R. Wilcox
Keyword(s):  
Fundamental Problem

Synaptic organization of the gustatory NST

1994 ◽  
Vol 52 ◽  
pp. 150-151
Author(s):  
M. C. Whitehead
Keyword(s):  
Central Nervous System ◽  
Dendritic Spines ◽  
Fundamental Problem ◽  
Cell Types ◽  
Brain Regions ◽  
Excitatory Synapses ◽  
Solitary Tract ◽  
Synaptic Organization ◽  
Synaptic Junctions ◽  
Afferent Terminals

A fundamental problem in taste research is to determine how gustatory signals are processed and disseminated in the mammalian central nervous system. An important first step toward understanding information processing is the identification of cell types in the nucleus of the solitary tract (NST) and their synaptic relationships with oral primary afferent terminals. Facial and glossopharyngeal (LIX) terminals in the hamster were labelled with HRP, examined with EM, and characterized as containing moderate concentrations of medium-sized round vesicles, and engaging in asymmetrical synaptic junctions. Ultrastructurally the endings resemble excitatory synapses in other brain regions.Labelled facial afferent endings in the RC subdivision synapse almost exclusively with distal dendrites and dendritic spines of NST cells. Most synaptic relationships between the facial synapses and the dendrites are simple. However, 40% of facial endings engage in complex synaptic relationships within glomeruli containing unlabelled axon endings particularly ones termed "SP" endings. SP endings are densely packed with small, pleomorphic vesicles and synapse with both the facial endings and their postsynaptic dendrites by means of nearly symmetrical junctions.

Direct imaging of order-disorder and antiphase domain structures in Ti3Al intermetallic compound

1990 ◽  
Vol 48 (4) ◽  
pp. 480-481
Author(s):  
H. Q. Ye ◽  
T.S. Xie ◽  
D. Li
Keyword(s):  
Intermetallic Compound ◽  
Volume Fraction ◽  
Fundamental Problem ◽  
Antiphase Domain ◽  
Atomic Scale ◽  
Orientation Relationships ◽  
Domain Structures ◽  
Α Phase ◽  
Diffraction Patterns ◽  
Two Phases

The Ti3Al intermetallic compound has long been recognized as potentially useful structural materials. It offers attractive strength to weight and elastic modulus to weight ratios. Recent work has established that the addition of Nb to Ti3Al ductilized this compound. In this work the fundamental problem of this alloy, i.e. order-disorder and antiphase domain structures was investigated at the atomic scale.The Ti3Al+10at%Nb alloys used in this study were treated at 1060°C and then aged at 700°C for 2 hours. The specimens suitable for TEM were prepared by standard jet electrolytic-polishing technique. A JEM-200CX electron microscope with an interpretable resolution of about 0.25 nm was used for HREM.The [100] and [001] projections of the α2 phase were shown in Fig.l.The alloy obtained consist of at least two phases-α2(Ti3Al) and β0 structures. Moreover, a disorder α phase with small volume fraction was also observed. Fig.2 gives [100] and [001] diffraction patterns of the α2 phase. Since lattice parameters of the ordered α2 (a=0.579, c=0.466 nm) and disorder α phase (a0=0.294≈a/2, c0=0.468 nm) are almost the same, their diffraction patterns are difficult to be distinguished when they are overlapped with epitaxial orientation relationships.

Lighting of Engineering Structures and Industrial Facilities New Aspects of the Topic

2018 ◽  
pp. 29-36
Author(s):  
Nikolai I. Shepetkov ◽  
George N. Cherkasov ◽  
Vladimir A. Novikov
Keyword(s):  
Fundamental Problem ◽  
Lighting Design ◽  
Aesthetic Value ◽  
Engineering Structures ◽  
Industrial Facilities ◽  
Artificial Lighting ◽  
Industrial Structures ◽  
Design Solutions ◽  
Architectural Lighting ◽  
The Aesthetic

This paper considers the fundamental problem of artificial lighting in various types and scales of industrial facilities, focusing on exterior lighting design solutions. There is a lack of interest from investors, customers and society in high­quality lighting design for industrial facilities in Russia, which in many cities are very imaginative structures, practically unused in the evening. Architectural lighting of various types of installations is illustrated with photographs. The purpose of the article is to draw attention to the aesthetic value of industrial structures, provided not only by the architectural, but also by a welldesigned lighting solution.

Localization and Non-Localization Node Identification Using Dream in MANET

2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Identification Algorithm ◽  
Mobile Nodes ◽  
Position Information ◽  
Location Services ◽  
Wireless Router ◽  
Mobile Ad Hoc

 A Wireless Mobile Ad-hoc Network consists of variety of mobile nodes that temporally kind a dynamic infrastructure less network. To modify communication between nodes that don’t have direct radio contact, every node should operate as a wireless router and potential forward knowledge traffic of behalf of the opposite node. In MANET Localization is a fundamental problem. Current localization algorithm mainly focuses on checking the localizability of a network and/or how to localize as many nodes as possible. It could provide accurate position information foe kind of expanding application. Localization provide information about coverage, deployment, routing, location, services, target tracking and rescue If high mobility among the mobile nodes occurs path failure breaks. Hence the location information cannot be predicted. Here we have proposed a localization based algorithm which will help to provide information about the localized and non-localized nodes in a network. In the proposed approach DREAM protocol and AODV protocol are used to find the localizability of a node in a network. DREAM protocol is a location protocol which helps to find the location of a node in a network whereas AODV is a routing protocol it discover route as and when necessary it does not maintain route from every node to every other. To locate the mobile nodes in a n/w an node identification algorithm is used. With the help of this algorithm localized and non-localized node can be easily detected in respect of radio range. This method helps to improve the performance of a module and minimize the location error and achieves improved performance in the form of UDP packet loss, received packet and transmitted packets, throughput, routing overhead, packet delivery fraction. All the simulation done through the NS-2 module and tested the mobile ad-hoc network.

Privatizing Public Lands

1995 ◽  
Author(s):  
Scott Lehmann
Keyword(s):  
National Parks ◽  
Fundamental Problem ◽  
Free Market ◽  
Public Lands ◽  
The United States ◽  
Collective Ownership ◽  
Policy Analysts ◽  
Wildlife Refuges ◽  
Ownership Of Land ◽  
Privately Owned

In the United States, private ownership of land is not a new idea, yet the federal government retains title to roughly a quarter of the nation's land, including national parks, forests, and wildlife refuges. Managing these properties is expensive and contentious, and few management decisions escape criticism. Some observers, however, argue that such criticism is largely misdirected. The fundamental problem, in their view, is collective ownership and its solution is privatization. A free market, they claim, directs privately owned resources to their most productive uses, and privatizing public lands would create a free market in their services. This timely study critically examines these issues, arguing that there is no sense of "productivity" for which it is true that greater productivity is both desirable and a likely consequence of privatizing public lands or "marketizing" their management. Lehmann's discussion is self-contained, with background chapters on federal lands and management agencies, economics, and ethics, and will interest philosophers as well as public policy analysts.

On the Fundamental Problem of Mathematics

1972 ◽  
Vol 79 (2) ◽  
pp. 149 ◽  
Author(s):  
P. Erdos
Keyword(s):  
Fundamental Problem

Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint

2021 ◽  
Vol 5 (1) ◽  
pp. 1-31
Author(s):  
Kai Han ◽  
Shuang Cui ◽  
Tianshuai Zhu ◽  
Enpei Zhang ◽  
Benwei Wu ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Fundamental Problem ◽  
Randomized Algorithm ◽  
Deterministic Algorithm ◽  
Submodular Function ◽  
Approximation Ratio ◽  
Performance Bounds ◽  
Data Summarization ◽  
Submodular Optimization ◽  
Knapsack Constraint

Data summarization, i.e., selecting representative subsets of manageable size out of massive data, is often modeled as a submodular optimization problem. Although there exist extensive algorithms for submodular optimization, many of them incur large computational overheads and hence are not suitable for mining big data. In this work, we consider the fundamental problem of (non-monotone) submodular function maximization with a knapsack constraint, and propose simple yet effective and efficient algorithms for it. Specifically, we propose a deterministic algorithm with approximation ratio 6 and a randomized algorithm with approximation ratio 4, and show that both of them can be accelerated to achieve nearly linear running time at the cost of weakening the approximation ratio by an additive factor of ε. We then consider a more restrictive setting without full access to the whole dataset, and propose streaming algorithms with approximation ratios of 8+ε and 6+ε that make one pass and two passes over the data stream, respectively. As a by-product, we also propose a two-pass streaming algorithm with an approximation ratio of 2+ε when the considered submodular function is monotone. To the best of our knowledge, our algorithms achieve the best performance bounds compared to the state-of-the-art approximation algorithms with efficient implementation for the same problem. Finally, we evaluate our algorithms in two concrete submodular data summarization applications for revenue maximization in social networks and image summarization, and the empirical results show that our algorithms outperform the existing ones in terms of both effectiveness and efficiency.

A study on encoding-based oracle bone script recognition

2020 ◽  
Vol 4 (4) ◽  
pp. 281-290
Author(s):  
Tingzhu Chen ◽  
Yaoyao Qian ◽  
Jingyu Pei ◽  
Shaoteng Wu ◽  
Jiang Wu ◽  
...  
Keyword(s):  
General Public ◽  
Expert Knowledge ◽  
Recognition Accuracy ◽  
Fundamental Problem ◽  
High Accuracy ◽  
Time Range ◽  
Accuracy Rate ◽  
Script Recognition ◽  
Processing Techniques ◽  
Accuracy Speed

Oracle bone script recognition (OBSR) has been a fundamental problem in research on oracle bone scripts for decades. Despite being intensively studied, existing OBSR methods are still subject to limitations regarding recognition accuracy, speed and robustness. Furthermore, the dependency of these methods on expert knowledge hinders the adoption of OBSR systems by the general public and also discourages social outreach of research outputs. Addressing these issues, this study proposes an encoding-based OBSR system that applies image pre-processing techniques to encode oracle images into small matrices and recognize oracle characters in the encoding space. We tested our methods on a collection of oracle bones from the Yin Ruins in XiaoTun village, and achieved a high accuracy rate of 99% within a time range of milliseconds.

scholarly journals Analysis of the System of Controlling Paid Parking Zones

2021 ◽  
Vol 13 (8) ◽  
pp. 4211
Author(s):  
Maciej Kozłowski ◽  
Andrzej Czerepicki ◽  
Piotr Jaskowski ◽  
Kamil Aniszewski
Keyword(s):  
Control System ◽  
Smart City ◽  
Measurement Errors ◽  
Fundamental Problem ◽  
Urban Traffic ◽  
Statistical Dependence ◽  
Actual State ◽  
Event Time ◽  
Operational Data

Urban traffic can be curbed in various ways, for instance, by introducing paid unguarded parking zones (PUPZ). The operational functionality of this system depends on whether or not the various system features used to document parking cases function properly, including those which enable positioning of vehicles parked in the PUPZ, recognition of plate numbers, event time recording, and the correct anonymisation of persons and other vehicles. The most fundamental problem of this system is its reliability, understood as the conformity of control results with the actual state of matters. This characteristic can be studied empirically, and this article addresses the methodology proposed for such an examination, discussed against a case study. The authors have analysed the statistical dependence of the e-control system’s measurement errors based on operational data. The results of this analysis confirm the rationale behind the deployment of the e-control system under the implementation of the smart city concept in Warsaw.

scholarly journals Feature and Language Selection in Temporal Symbolic Regression for Interpretable Air Quality Modelling

Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 76
Author(s):  
Estrella Lucena-Sánchez ◽  
Guido Sciavicco ◽  
Ionel Eduard Stan
Keyword(s):  
Air Quality ◽  
Fundamental Problem ◽  
Multivariate Time Series ◽  
Quality Data ◽  
Data Sets ◽  
Air Quality Modelling ◽  
Regression Problem ◽  
Car Traffic ◽  
Pollutant Concentrations ◽  
Language Selection

Air quality modelling that relates meteorological, car traffic, and pollution data is a fundamental problem, approached in several different ways in the recent literature. In particular, a set of such data sampled at a specific location and during a specific period of time can be seen as a multivariate time series, and modelling the values of the pollutant concentrations can be seen as a multivariate temporal regression problem. In this paper, we propose a new method for symbolic multivariate temporal regression, and we apply it to several data sets that contain real air quality data from the city of Wrocław (Poland). Our experiments show that our approach is superior to classical, especially symbolic, ones, both in statistical performances and the interpretability of the results.

Sign in / Sign up

Export Citation Format

Share Document