27400 Hesperian Blvd, Hayward, CA 94545 (510)7844000 (Phone)
Languages:
English
Hospitals:
27400 Hesperian Blvd, Hayward, CA 94545
Dameron Hospital 525 West Acacia Street, Stockton, CA 95203
West Anaheim Medical Center 3033 West Orange Avenue, Anaheim, CA 92804
Education:
Medical School Vanderbilt University Medical School St Francis Hospital Graduated: 1990 Medical School University Calif Graduated: 1993 Medical School University New Mexico Graduated: 1996 Medical School University So Fla Graduated: 1994 Medical School Usc Graduated: 1995
Lakeside Pediatric/Adol MedcnLakeside Pediatric & Adolescent Medicine PLLC 980 W Ironwood Dr STE 302, Coeur d Alene, ID 83814 (208)2925437 (phone), (208)2925441 (fax)
Education:
Medical School Rush Medical College Graduated: 2005
Procedures:
Circumcision Destruction of Benign/Premalignant Skin Lesions Hearing Evaluation Lumbar Puncture Psychological and Neuropsychological Tests Pulmonary Function Tests Vaccine Administration
Dr. Park graduated from the Rush Medical College in 2005. He works in Coeur d'Alene, ID and specializes in Pediatrics and Adolescent Medicine. Dr. Park is affiliated with Kootenai Health.
Dr. Park graduated from the Loma Linda University School of Medicine in 1996. He works in Warsaw, IN and specializes in Family Medicine. Dr. Park is affiliated with Kosciusko Community Hospital.
IGT International Yorba Linda, CA Dec 2011 to Nov 2013 Staff Accountant/PayrollSRO (Non-Profit) Los Angeles, CA Jan 2010 to Oct 2011 Staff Accountant / PayrollPark DCS
Jun 2009 to Dec 2009 Staff AccountantJB Boys Wholesale Clothing
Mar 2005 to May 2009 AccountantVictory Packaging, Inc
Jul 1990 to Oct 2004 Payroll Manager/ Staff Accountant
Nov 2012 to 2000 Intern ArchitectCAL POLY Pomona, Architecture Department Pomona, CA Sep 2012 to Dec 2012 Teachers Assistant_ ARC504SBL Architecture Los Angeles, CA Aug 2011 to Dec 2012 Intern ArchitectTHE OMNI Design Office Seoul, KR May 2002 to Feb 2008 Design ManagerHyupsung University Design Department
Mar 2000 to Feb 2001 Teacher's Assistant
Education:
California State Polytechnic University 2010 to 2013 Master of Architecture in DesignHyupsung University 2000 to 2005 Master of Environmental Furniture DesignHyupsung University Mar 1994 to Feb 2000 Bachelor of Industrial Design
Military:
Rank: M60 Nov 1997 to Dec 1999 Branch: 26L.i.location.original
Skills:
SOFTWARE USED Adobe Photoshop, Adobe Illustrator, Auto Cad, Ecotect, Sketch Up, Microsoft Office, Revit, Rhino, Vasari
Sung Park - Irvine CA, US Daniel R. Cormier - Anaheim CA, US Tracy V. Cramer - Huntington Beach CA, US
Assignee:
Raytheon Company - Waltham MA
International Classification:
H04B 7/212 H04W 4/00 H04J 3/12
US Classification:
370230, 370337, 370338, 370347
Abstract:
A method to schedule network communications includes determining nodes within a network, forming a node list based on the nodes in the network, determining a network schedule of communications for the nodes based on the node list. Determining a network schedule includes determining a timeslot. Each node receives data during the timeslot.
Sung Park - Irvine CA, US Darryn A. Johnnie - Brea CA, US Michael A. Born - Los Alamitos CA, US Colleen M. Touchard - Corona CA, US Keith C. Buerger - Fullerton CA, US Tyler J. Ulinskas - San Diego CA, US
Assignee:
Raytheon Company - Waltham MA
International Classification:
G01R 31/08
US Classification:
370230, 370254, 370336
Abstract:
In one aspect, a method to schedule network communications includes transmitting a node identification associated with a first node joining a network over a first portion of control timeslots based on a first probability, detecting nodes in the network using a second portion of the control timeslots and receiving acknowledgments from at least one of the nodes in the network. The method also includes that if a ratio of a number of acknowledgments received to a number of the nodes in the network detected is greater than a predetermined percentage: transmitting control data over the first portion of the control timeslots based on a second probability associated with a number of the nodes detected and transmitting data over the second portion of the control timeslots based on a network schedule.
Multicasting In A Network Using Neighbor Information
Sung I. Park - Irvine CA, US Darryn A. Johnnie - Brea CA, US
Assignee:
Raytheon Company - Waltham MA
International Classification:
H04L 12/28
US Classification:
3703954, 370408
Abstract:
In one aspect, a method to multicast in a network includes determining using a processor a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling. The method may include designating a one-hop neighbor that exclusively accesses the two-hop neighbor of the source node as a relay node. The method may also include designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node.
Communication Scheduling Of Network Nodes Using A Cluster Coefficient
Denh T. Sy - Rosemead CA, US Sung I. Park - Irvine CA, US
Assignee:
Raytheon Company - Waltham MA
International Classification:
H04J 3/00
US Classification:
370345, 370350, 370322, 370324, 370238
Abstract:
In one aspect, a method includes scheduling network communications in a network comprising nodes connected by links, receiving at a first node updated bandwidth values from the other nodes, determining a cluster coefficient based on a number of one-hop neighbors of the first node and a number of neighbors N-hops and less of the first node, adjusting the cluster coefficient to form an adjusted cluster coefficient and determining a wait period based on the adjusted cluster coefficient. The method also includes implementing the updated bandwidth values received to determine updated node weight values of the other nodes after the wait period has expired.
Data Processing System And Method Of Grouping Computer Files
A method of operating multiple files includes creating a group of computer files using a single container, and opening multiple files of the group and associated application software by opening a single file corresponding to the group of computer files.
Determining Paths That Satisfy A Reliability Requirement
Sung I. Park - Irvine CA, US Denh T. Sy - Rosemead CA, US Erwin W. Bathrick - Yorba Linda CA, US
Assignee:
Raytheon Company - Waltham MA
International Classification:
H04L 1/00 H04W 40/00 G06F 15/173
US Classification:
370225, 455445, 709239
Abstract:
Methods for determining paths that satisfy a reliability requirement are generally described herein. The methods may include receiving path information. A reliability requirement is established, and paths that satisfy the reliability requirement are determined. Each path comprises nodes. Configuration of the nodes of the paths according to the reliability requirement is facilitated. A code rate may be determined that corresponds to the reliability requirement. The code rate may indicate network coding to be performed by least a subset of the nodes. The method may also include sending the code rate to the nodes of the paths.
Sung I. Park - Irvine CA, US Darryn A. Johnnie - Brea CA, US
International Classification:
H04L 12/56
US Classification:
370400
Abstract:
In one aspect, a method includes receiving a packet at a first node, the first node comprising a processor, determining, at the first node, whether a destination node of the packet is within a zone of the first node, using, at the first node, an on-demand routing protocol to route data from the first node to the destination node if the destination node is outside the zone of the first node and using a network topology, stored at the first node, to route the packet from the first node to the destination node if the destination node is within the zone of the first node.
Sung I. Park - Irvine CA, US Jiwon Hahn - Fullerton CA, US
Assignee:
Raytheon Company - Waltham MA
International Classification:
H03M 13/05 G06F 11/10
US Classification:
714776, 714E11032
Abstract:
In one aspect, a sub-packet error correction method includes receiving a data packet, segregating the data packet into sub-packets, and encoding the sub-packets using an erasure code for transmission over a network, and receiving the encoded sub-packets, decoding the sub-packets, and combining the decoded sub-packets to reconstruct the data packet. In some embodiments, the data packet is received at a first proxy server for transmission over a lossy network, the encoded sub-packets received at a second proxy server over the lossy network.