Linear Chain Ferromagnetic Charge Transfer Compounds

Charge transfer complexes possessing a … DADA … structure with both the donor, D, and acceptor, A, being S = 1/2 radicals may exhibit cooperative magnetic phenomena. The complex [Fe(C₅Me₅)₂]⁺·[TCNQ]⁻· exhibits metamagnetic behavior. The similarly structured [TCNE]⁻· and [C₄(CN)₆]⁻· complexes are ferromagnets, whereas the [DDQ]⁻· salt is a paramagnet. The high temperature magnetic susceptibility obeys the Curie-Weiss expression with θ = + 30, + 30, and + 3 for the [TCNE]⁻·, [C₄(CN)₆]⁻·, and [TCNQ]⁻· salts, respectively. The ferromagnetic [TCNE]⁻· salt exhibits zero field Zeeman split ⁵⁷Fe Mossbauer spectra with an internal field of 425.6 kOe at 4.23 K. After reviewing the current papers discussing ferromagnetism in molecular (organic) compounds, a qualitative model consistent with the necessary bulk spin alignment required for a ferromagnet is presented.     

Design of simulator training: a comparative study of Swedish dynamic decision-making training facilities

Cognition, Technology & Work - Simulator training is becoming increasingly important for training of time-critical and dynamic situations. Hence, how simulator training in such domains is...     

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two (also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the task graph, the runtime estimates and scalability characteristics of the tasks, and the intertask data communication volumes. A locality-conscious scheduling strategy is used to improve intertask data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications and synthetic graphs shows that our algorithm consistently generates schedules with a lower makespan as compared to Critical Path Reduction (CPR) and Critical Path and Allocation (CPA), two previously proposed scheduling algorithms. Our algorithm also produces schedules that have a lower makespan than pure task- and data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.     

Mobile wireless network system simulation

This paper describes an advanced simulation environment which is used to examine, validate, and predict the performance of mobile wireless network systems. This simulation environment overcomes many of the limitations found with analytical models, experimentation, and other commercial network simulators available on the market today. We identify a set of components which make up mobile wireless systems and describe a set of flexible modules which can be used to model the various components and their integration. These models are developed using the Maisie simulation language. By modeling the various components and their integration, this simulation environment is able to accurately predict the performance bottlenecks of a multimedia wireless network system being developed at UCLA, determine the trade-off point between the various bottlenecks, and provide performance measurements and validation of algorithms which are not possible through experimentation and too complex for analysis.This work was supported in part by the Advanced Research Projects Agency, ARPA/CSTO, under Contract J-FBI-93-112 Computer Aided Design of High Performance Wireless Networked Systems, and by ARPA/CSTO under Contract DABT-63-94-C-0080 TransparentVirtual Mobile Environment.This paper was in part presented at the ACM Mobile Computing and Networking Conference (Mobicom '95), Berkeley, California, 14–15 November 1995.     

Exciton Formation Dynamics and Band-Like Free Charge-Carrier Transport in 2D Metal Halide Perovskite Semiconductors

Metal halide perovskite (MHP) semiconductors have driven a revolution in optoelectronic technologies over the last decade, in particular for high-efficiency photovoltaic applications. Low-dimensional MHPs presenting electronic confinement have promising additional prospects in light emission and quantum technologies. However, the optimisation of such applications requires a comprehensive understanding of the nature of charge carriers and their transport mechanisms. This study employs a combination of ultrafast optical and terahertz spectroscopy to investigate phonon energies, charge-carrier mobilities, and exciton formation in 2D (PEA)₂PbI₄ and (BA)₂PbI₄ (where PEA is phenylethylammonium and BA is butylammonium). Temperature-dependent measurements of free charge-carrier mobilities reveal band transport in these strongly confined semiconductors, with surprisingly high in-plane mobilities. Enhanced charge-phonon coupling is shown to reduce charge-carrier mobilities in (BA)₂PbI₄ with respect to (PEA)₂PbI₄. Exciton and free charge-carrier dynamics are disentangled by simultaneous monitoring of transient absorption and THz photoconductivity. A sustained free charge-carrier population is observed, surpassing the Saha equation predictions even at low temperature. These findings provide new insights into the temperature-dependent interplay of exciton and free-carrier populations in 2D MHPs. Furthermore, such sustained free charge-carrier population and high mobilities demonstrate the potential of these semiconductors for applications such as solar cells, transistors, and electrically driven light sources.     

Photoacoustic‐Guided Surgery with Indocyanine Green‐Coated Superparamagnetic Iron Oxide Nanoparticle Clusters

A common cause of local tumor recurrence in brain tumor surgery results from incomplete surgical resection. Adjunctive technologies meant to facilitate gross total resection have had limited efficacy to date. Contrast agents used to delineate tumors preoperatively cannot be easily or accurately used in the real‐time operative setting. Although multimodal imaging contrast agents are developed to help the surgeon discern tumor from normal tissue in the operating room, these contrast agents are not readily translatable. This study has developed a novel contrast agent comprised solely of two Food and Drug Administration approved components, indocyanine green (ICG) and superparamagnetic iron oxide (SPIO) nanoparticles—with no additional amphiphiles or carrier materials, to enable preoperative detection by magnetic resonance (MR) imaging and intraoperative photoacoustic (PA) imaging. The encapsulation efficiency of both ICG and SPIO within the formulated clusters is ≈100%, and the total ICG payload is 20–30% of the total weight (ICG + SPIO). The ICG–SPIO clusters are stable in physiologic conditions; can be taken up within tumors by enhanced permeability and retention; and are detectable by MR. In a preclinical surgical resection model in mice, following injection of ICG–SPIO clusters, animals undergoing PA‐guided surgery demonstrate increased progression‐free survival compared to animals undergoing microscopic surgery.     

The Consumer Reports mental health survey.

Provides an overview of the 1995 Consumer Reports survey of the effectiveness of psychotherapy. Specific issues addressed include the study's goals; the findings for mental health professionals, family doctors, and self-help groups; and methodological strengths and weaknesses related to external validity, sampling, controls, self-reports, and time frame. The data show that, free of the artificial constraints of controlled studies in the real world, a population of consumers can often benefit from psychological intervention services. Real relief can be found at the hands of professional mental health providers. M. Kotkin et al reaffirm their independence from M. E. P. Seligman (see record 1996-13324-001) regarding the interpretation of the data. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

我的七个建议

由于Joel Spolsky的双重身份（昔日耶鲁大学计算机系学长,今日Fog Creek软件公司的OEO）,所以听听他的建议,对于当今无数困扰于就业压力的中国高校计算机专业学子来说,是大有裨益的。你们会发现,大多数建议,都在强调“软实力”的价值。本文转载自《软件随想录》（作者：Joel Spolsky,译者：阮一峰,2009年12月出版）,感谢北京图灵文化发展有限公司的支持。     

Search Strategies for Multiple UAV Search and Destroy Missions

Multiple UAVs are deployed to carry out a search and destroy mission in a bounded region. The UAVs have limited sensor range and can carry limited resources which reduce with use. The UAVs perform a search task to detect targets. When a target is detected which requires different type and quantities of resources to completely destroy, then a team of UAVs called as a coalition is formed to attack the target. The coalition members have to modify their route to attack the target, in the process, the search task is affected, as search and destroy tasks are coupled. The performance of the mission is a function of the search and the task allocation strategies. Therefore, for a given task allocation strategy, we need to devise search strategies that are efficient. In this paper, we propose three different search strategies namely; random search strategy, lanes based search strategy and grid based search strategy and analyze their performance through Monte-Carlo simulations. The results show that the grid based search strategy performs the best but with high information overhead.     

Multiple UAV Coalitions for a Search and Prosecute Mission

Unmanned aerial vehicles (UAVs) have the potential to carry resources in support of search and prosecute operations. Often to completely prosecute a target, UAVs may have to simultaneously attack the target with various resources with different capacities. However, the UAVs are capable of carrying only limited resources in small quantities, hence, a group of UAVs (coalition) needs to be assigned that satisfies the target resource requirement. The assigned coalition must be such that it minimizes the target prosecution delay and the size of the coalition. The problem of forming coalitions is computationally intensive due to the combinatorial nature of the problem, but for real-time applications computationally cheap solutions are required. In this paper, we propose decentralized sub-optimal (polynomial time) and decentralized optimal coalition formation algorithms that generate coalitions for a single target with low computational complexity. We compare the performance of the proposed algorithms to that of a global optimal solution for which we need to solve a centralized combinatorial optimization problem. This problem is computationally intensive because the solution has to (a) provide a coalition for each target, (b) design a sequence in which targets need to be prosecuted, and (c) take into account reduction of UAV resources with usage. To solve this problem we use the Particle Swarm Optimization (PSO) technique. Through simulations, we study the performance of the proposed algorithms in terms of mission performance, complexity of the algorithms and the time taken to form the coalition. The simulation results show that the solution provided by the proposed algorithms is close to the global optimal solution and requires far less computational resources.