Editorial

IF 1.6 4区计算机科学 Q4 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Networks Pub Date : 2022-08-31 DOI:10.1002/net.22126

B. Golden, D. Shier

引用次数: 0

Abstract

EDWIN BAKER GAGER Edwin Baker Gager graduated from Yale College in 1877. He was admitted to the bar in I881 and became a member of the firm of Wooster & Torrance in Derby. On the appointment of Judge Torrance to the Superior Court the name of the firm was changed to Wooster, Williams & Gager and on the death of the senior partner to Williams & Gager. Judge Gager was appointed to the Superior Court in i9oi, and after seventeen years of service as a trial judge he became in 1918 an associate justice of the Supreme Court of Errors. From 1892 to 19o3 he was an instructor in law aid jurisprudence in the Yale School of Law, and in 1903 was appointed Professor of General Jurisprudence. As a lawyer he soon gained the confidence of the large business interests located in the Naugatuck Valley, and in the later years of his practice his counsel and advocacy were claimed chiefly by street railway, gas, and electric companies. He brought to the office of trial judge the poise of a man of affairs, the experience of an extensive practice, the learning of a widely read

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

编辑

EDWIN BAKER GAGER EDWIN BAKER-GAGER于1877年毕业于耶鲁大学。他于1881年进入酒吧，并成为德比Wooster&Torrance律师事务所的成员。托伦斯法官被任命为高等法院法官后，公司名称改为Wooster，Williams&Gager，高级合伙人去世后，公司更名为Williams&Gage。Gager法官在i9oi被任命为高等法院法官，在担任审判法官17年后，他于1918年成为最高错误法院的助理法官。1892年至1903年，他在耶鲁大学法学院担任法律援助法学讲师，1903年被任命为普通法学教授。作为一名律师，他很快就获得了位于瑙加塔克山谷的大型商业利益集团的信任，在他执业的后期，他的律师和辩护主要由街头铁路、天然气和电力公司提出。他给审判法官的职位带来了一个有风度的人的风度，一个广泛实践的经验，一个博览群书的学问

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Networks 工程技术-计算机：硬件

CiteScore

4.40

自引率

9.50%

发文量

审稿时长

12 months

期刊介绍： Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context. The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics. Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally eﬃcient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without signiﬁcant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.