LIVIVO - Search results -

Search results

Result 1 - 10 of total 8743

Search options

Article ; Online: “Global” Entanglements of a “Local” Medical Historian

Chen Hao

Revue d’Histoire des Sciences Humaines, Vol 41, Pp 139-

2022 Volume 151

Abstract: This paper proposes to explore the formation of a discipline named Chinese medical history in the early half of 20th century through a case study of a medical historian, Chen Bangxian, and his writings. Chen gained knowledge about recent trends in world ... ...

Abstract	This paper proposes to explore the formation of a discipline named Chinese medical history in the early half of 20th century through a case study of a medical historian, Chen Bangxian, and his writings. Chen gained knowledge about recent trends in world medical history in his local world indirectly, when the thinking of historians in the German-speaking countries spread to other Western countries, to Japan, and finally to China. The article explores ways to understand the interaction between knowledge and historiography in the early half of 20th century in a global context, and reveals how a historiography which both embraced world trends and historians with limited transnational background at the same time created a new “modern” way to write medical history in Republican China.
Keywords	Chen Bangxian ; Fujikawa Yu ; medical history ; globality ; Republican China ; South ; Social Sciences ; H
Language	French
Publishing date	2022-12-01T00:00:00Z
Publisher	Éditions de la Sorbonne
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Quasi-Perfect and Distance-Optimal Codes in the Sum-Rank Metric

Chen, Hao

2024

Abstract: Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda|q^{sm}-1$ and $\lambda <\sqrt{\frac{(q^s-1)}{2(q-1)^2(1+\ ... ...

Abstract	Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions. In this paper, we give the following three results. 1) If $\lambda\|q^{sm}-1$ and $\lambda <\sqrt{\frac{(q^s-1)}{2(q-1)^2(1+\epsilon)}}$, an infinite family of distance-optimal $q$-ary cyclic sum-rank codes with the block length $t=\frac{q^{sm}-1}{\lambda}$, the matrix size $s \times s$, the cardinality $q^{s^2t-s(2m+3)}$ and the minimum sum-rank distance four is constructed. 2) Block length $q^4-1$ and the matrix size $2 \times 2$ distance-optimal sum-rank codes with the minimum sum-rank distance four and the Singleton defect four are constructed. These sum-rank codes are close to the sphere packing bound , the Singleton-like bound and have much larger block length $q^4-1>>q-1$. 3) For given positive integers $m$ satisfying $2 \leq m$, an infinite family of quasi-perfect sum-rank codes with the matrix size $2 \times m$, and the minimum sum-rank distance three is also constructed. Quasi-perfect binary sum-rank codes with the minimum sum-rank distance four are also given. We show that more distance-optimal binary sum-rank codes can be obtained from the Plotkin sum. Comment: 18 pages, only quasi-perfect sum codes constructed
Keywords	Computer Science - Information Theory
Subject code	003
Publishing date	2024-01-20
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: Managing a multi-panel clinic with heterogeneous patients.

Chen, Hao-Wei

Health care management science

2023 Volume 26, Issue 4, Page(s) 673–691

Abstract: Primary care providers (PCPs) are considered the first-line defenders in preventive care. Patients seeking service from the same PCP constitute that physician's panel, which determines the overall supply and demand of the physician. The process of ... ...

Abstract	Primary care providers (PCPs) are considered the first-line defenders in preventive care. Patients seeking service from the same PCP constitute that physician's panel, which determines the overall supply and demand of the physician. The process of allocating patients to physician panels is called panel design. This study quantifies patient overflow and builds a mathematical model to evaluate the effect of two implementable panel assignments. In specialized panel assignment, patients are assigned based on their medical needs or visit frequency. In equal panel assignment, patients are distributed uniformly to maintain a similar composition across panels. We utilize majorization theory and numerical examples to evaluate the performance of the two designs. The results show that specialized panel assignment outperforms when (1) patient demands and physician capacity are relatively balanced or (2) patients who require frequent visits incur a higher shortage penalty. In a simulation model with actual patient arrival patterns, we also illustrate the robustness of the results and demonstrate the effect of switching panel policy when the patient pool changes over time.
MeSH term(s)	Humans ; Physicians ; Models, Theoretical ; Computer Simulation ; Ambulatory Care Facilities ; Time Factors
Language	English
Publishing date	2023-11-06
Publishing country	Netherlands
Document type	Journal Article
ZDB-ID	1469148-6
ISSN	1572-9389 ; 1386-9620
ISSN (online)	1572-9389
ISSN	1386-9620
DOI	10.1007/s10729-023-09658-z
Database	MEDical Literature Analysis and Retrieval System OnLINE

Full text online

Accessible to users with ZB MED library card

In stock of ZB MED Cologne/Königswinter

Zs.A 5158: Show issues

Location:
Je nach Verfügbarkeit (siehe Angabe bei Bestand)
bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular
Jg. 1995 - 2021: Lesesall (2.OG)
ab Jg. 2022: Lesesaal (EG)

Order via subito

This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

Details ▾

Article ; Online: An Exploratory Research on Constructing a Model of Innovation and Entrepreneurship Education for College Students Based on Fuzzy Neural Network Algorithm

Chen Hao

Security and Communication Networks, Vol

2021 Volume 2021

Abstract: In order to improve the adaptive scheduling ability of the innovation and entrepreneurship education model for college students, a brain computing-based innovation and entrepreneurship education model for college students is proposed. Through career- ... ...

Abstract	In order to improve the adaptive scheduling ability of the innovation and entrepreneurship education model for college students, a brain computing-based innovation and entrepreneurship education model for college students is proposed. Through career-planning education, team training will gradually cultivate the leadership skills of entrepreneurs and improve the overall level of innovation and entrepreneurship of college students. The paper proposes to use the fuzzy neural network algorithm to analyze the control constraint parameters of the college students’ innovation and entrepreneurship education model and optimize the design of the control objective function of the university. The control of students’ innovation and entrepreneurship education model is carried out using quantitative optimization methods. The fuzzy neural network is used to identify the control rights of college students’ innovation and entrepreneurship education model through label recognition technology, and the control objective model of college students’ innovation and entrepreneurship education model is constructed. The adaptive load-balancing control method is adopted to control the innovation and entrepreneurship education model of college students. Research shows that this method has a good balance and adaptive control ability in the construction of college students’ innovation and entrepreneurship education model.
Keywords	Technology (General) ; T1-995 ; Science (General) ; Q1-390
Subject code	650
Language	English
Publishing date	2021-01-01T00:00:00Z
Publisher	Hindawi-Wiley
Document type	Article ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: Covering Codes, List-Decodable Codes and Strong Singleton-Like Bounds in the Sum-Rank Metric

Chen, Hao

2023

Abstract: Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in multishot network coding, space-time coding and distributed storage. Fundamental bounds, some explicit or probabilistic constructions of sum- ... ...

Abstract	Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in multishot network coding, space-time coding and distributed storage. Fundamental bounds, some explicit or probabilistic constructions of sum-rank codes and decoding algorithms have been developed in previous papers. In this paper, we construct covering codes in the sum-rank metric from covering codes in the Hamming metric. Then some upper bounds on sizes of covering codes in the sum-rank metric are presented. Block length functions of covering codes in the sum-rank metric are also introduced and studied. As an application of our upper bounds on covering codes in the sum-rank metric and block length functions, several strong Singleton-like bounds on sum-rank codes are proposed and proved. These strong Singleton-like bounds are much stronger than the Singleton-like bound for sum-rank codes, when block lengths are larger and minimum sum-rank distances are small. An upper bound on sizes of list-decodable codes in the sum-rank metric is also given, which leads to an asymptotic bound on list-decodability of sum-rank codes. We also give upper bounds on block lengths of general MSRD codes. Comment: 24 pages
Keywords	Computer Science - Information Theory
Subject code	003
Publishing date	2023-11-13
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: New Euclidean and Hermitian Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances

Chen, Hao

2023

Abstract: Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A family of binary ...

Abstract	Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A family of binary self-dual repeated-root cyclic codes with lengths $n_i$ and minimum distances $d_i \geq \frac{1}{2} \sqrt{n_i+2}$, $n_i$ goes to the infinity for $i=1,2, \ldots$, was constructed in a paper of IEEE Trans. Inf. Theory, 2009. In this paper, we construct families of Euclidean self-dual repeated-root cyclic codes over the field ${\bf F}_{2^s}$, $s \geq 2$, with lengths $n_i$ and minimum distances at least $\sqrt{2^{s-1}n}-2^s$, where lengths $n_i$ go to the infinity. We also construct families of Hermitian self-dual repeated-root cyclic codes over the field ${\bf F}_{2^{2s}}$, $s \geq 1$, with lengths $n_i$ and minimum distances at least $\sqrt{n_i/2}$, where lengths $n_i$ go to the infinity. Our results show that Euclidean and Hermitian self-dual codes with large automorphism groups and large minimum distances can always be constructed. Comment: 14 pages. arXiv admin note: substantial text overlap with arXiv:2306.11423
Keywords	Computer Science - Information Theory
Subject code	512
Publishing date	2023-06-25
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Book ; Online: New Binary Self-Dual Cyclic Codes with Square-Root-Like Minimum Distances

Chen, Hao

2023

Abstract: The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths $n_i$ and ... ...

Abstract	The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths $n_i$ and minimum distances $d_i \geq \frac{1}{2} \sqrt{n_i}$, $n_i$ goes to the infinity for $i=1,2, \ldots$, was constructed. In this paper, we construct a family of (repeated-root) binary self-dual cyclic codes with lengths $n$ and minimum distances at least $\sqrt{n}-2$. New families of lengths $n=q^m-1$, $m=3, 5, \ldots$, self-dual codes over ${\bf F}_q$, $q \equiv 1$ $mod$ $4$, with their minimum distances larger than or equal to $\sqrt{\frac{q}{2}}\sqrt{n}-q$ are also constructed. Comment: 12 pages
Keywords	Computer Science - Information Theory
Publishing date	2023-06-20
Publishing country	us
Document type	Book ; Online
Database	BASE - Bielefeld Academic Search Engine (life sciences selection)

Full text online

Full text

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article ; Online: All-optical high-order subharmonic mixer with a high signal-to-noise ratio and stable performance.

Chen, Hao / Chan, Erwin H W

Applied optics

2024 Volume 63, Issue 2, Page(s) 359–366

Abstract: A photonics-based high-order subharmonic mixer, which enables a low-frequency LO source to be used for high-frequency RF signal frequency downconversion, is presented. It is based on an optically injected semiconductor laser, which is oscillated in the ... ...

Abstract	A photonics-based high-order subharmonic mixer, which enables a low-frequency LO source to be used for high-frequency RF signal frequency downconversion, is presented. It is based on an optically injected semiconductor laser, which is oscillated in the period-one state, sandwiched between two optical phase modulators. It has the advantages of a simple and compact structure, wide bandwidth, absence of electrical components, reconfigurable subharmonic mixing operation, stable output IF signal performance, high signal-to-noise ratio, infinite LO-to-RF port isolation, and high LO-to-IF port isolation. Furthermore, it is suitable for use in remote antenna applications. We set up a proof-of-concept experiment that demonstrates a reconfigurable second-, fourth-, sixth-, and eighth-order subharmonic mixing operation for different input RF signal frequencies and powers. The experimental results also demonstrate that the proposed structure exhibits a stable output IF signal performance, which overcomes the IF signal phase stability problem in the reported high-order subharmonic mixers.
Language	English
Publishing date	2024-01-16
Publishing country	United States
Document type	Journal Article
ISSN	1539-4522
ISSN (online)	1539-4522
DOI	10.1364/AO.509845
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

Inter-library loan at ZB MED

Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

Article: A Precarious Path to Partnership? The Moderating Effects of Labour Market Regulations on the Relationship Between Unstable Employment and Union Formation in Europe.

Hsu, Chen-Hao / Engelhardt, Henriette

European journal of population = Revue europeenne de demographie

2024 Volume 40, Issue 1, Page(s) 12

Abstract: Rising employment uncertainty featured by higher risks of being temporarily employed or unemployed is often seen as the driving force behind delayed and declined partnering in Western countries. However, such an employment-partnering relationship is ... ...

Abstract	Rising employment uncertainty featured by higher risks of being temporarily employed or unemployed is often seen as the driving force behind delayed and declined partnering in Western countries. However, such an employment-partnering relationship is contextualized by labour market institutions and thus could diverge across countries over time. This paper aims to investigate how country-level variations in labour market regulations moderate individual-level effects of unstable employment on union formation, including the transitions into marriage or cohabitation unions. Using comparative panel data for 26 countries from the European Union Statistics on Income and Living Conditions (the years 2010-2019), our multilevel fixed effects models showed that temporary employment and unemployment negatively affected the probability of union formation for single women and men in Europe. Moreover, the negative relationship between unstable employment and union formation was reinforced when labour market reforms were stimulating insider-outsider segregations or decreasing welfare provisions. Specifically, stricter employment protection legislations and higher coverage rates of collective bargaining agreements could reinforce the negative effects of temporary employment and unemployment on union formation, while more generous provisions of unemployment benefits could buffer such negative effects.
Language	English
Publishing date	2024-03-29
Publishing country	Netherlands
Document type	Journal Article
ZDB-ID	2015429-X
ISSN	1572-9885 ; 0168-6577
ISSN (online)	1572-9885
ISSN	0168-6577
DOI	10.1007/s10680-024-09698-3
Database	MEDical Literature Analysis and Retrieval System OnLINE

Order via subito

Article ; Online: Efficient Supervised Pretraining of Swin-Transformer for Virtual Staining of Microscopy Images.

Ma, Jiabo / Chen, Hao

IEEE transactions on medical imaging

2024 Volume 43, Issue 4, Page(s) 1388–1399

Abstract: Fluorescence staining is an important technique in life science for labeling cellular constituents. However, it also suffers from being time-consuming, having difficulty in simultaneous labeling, etc. Thus, virtual staining, which does not rely on ... ...

Abstract	Fluorescence staining is an important technique in life science for labeling cellular constituents. However, it also suffers from being time-consuming, having difficulty in simultaneous labeling, etc. Thus, virtual staining, which does not rely on chemical labeling, has been introduced. Recently, deep learning models such as transformers have been applied to virtual staining tasks. However, their performance relies on large-scale pretraining, hindering their development in the field. To reduce the reliance on large amounts of computation and data, we construct a Swin-transformer model and propose an efficient supervised pretraining method based on the masked autoencoder (MAE). Specifically, we adopt downsampling and grid sampling to mask 75% of pixels and reduce the number of tokens. The pretraining time of our method is only 1/16 compared with the original MAE. We also design a supervised proxy task to predict stained images with multiple styles instead of masked pixels. Additionally, most virtual staining approaches are based on private datasets and evaluated by different metrics, making a fair comparison difficult. Therefore, we develop a standard benchmark based on three public datasets and build a baseline for the convenience of future researchers. We conduct extensive experiments on three benchmark datasets, and the experimental results show the proposed method achieves the best performance both quantitatively and qualitatively. In addition, ablation studies are conducted, and experimental results illustrate the effectiveness of the proposed pretraining method. The benchmark and code are available at https://github.com/birkhoffkiki/CAS-Transformer.
MeSH term(s)	Microscopy ; Staining and Labeling
Language	English
Publishing date	2024-04-03
Publishing country	United States
Document type	Journal Article
ZDB-ID	622531-7
ISSN	1558-254X ; 0278-0062
ISSN (online)	1558-254X
ISSN	0278-0062
DOI	10.1109/TMI.2023.3337253
Database	MEDical Literature Analysis and Retrieval System OnLINE

In stock of ZB MED Cologne/Königswinter

Zs.A 2546: Show issues

Location:
Je nach Verfügbarkeit (siehe Angabe bei Bestand)
bis Jg. 1994: Bestellungen von Artikeln über das Online-Bestellformular
Jg. 1995 - 2021: Lesesall (2.OG)
ab Jg. 2022: Lesesaal (EG)

Order via subito

Details ▾
- See ZB MED holdings
- Order with fees

To top

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

Full text online

More links

Kategorien

Inter-library loan at ZB MED

More links

Kategorien

Order via subito

Inter-library loan at ZB MED

More links

Kategorien

Order via subito

More links

Kategorien

In stock of ZB MED Cologne/Königswinter

Order via subito